A Location Based Heuristic for General Routing Problems

We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the capacitated concentrator location problem. We apply this framework to two classical routing problems: the capacitated vehicle routing problem and the inventory routing...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research Vol. 43; no. 4; pp. 649 - 660
Main Authors:	Bramel, Julien, Simchi-Levi, David
Format:	Journal Article
Language:	English
Published:	Linthicum, MD INFORMS 01.07.1995 Operations Research Society of America Institute for Operations Research and the Management Sciences
Subjects:	Algorithms analysis of algorithms Applied sciences Cost efficiency Customers Exact sciences and technology Fixed costs Heuristic Heuristics integer Integer programming Logistics Operational research and scientific management Operational research. Management science Operations research Optimal solutions programming relaxation Retail stores Routing Seed set Studies subgradient suboptimal algorithms transportation Transportation costs Vehicle capacity vehicle routing Vehicles Operating cost Routing Capacity of traffic Algorithm Modeling Location problem Integer programming Road transportation Relaxation Transportation problem Heuristic method Numerical simulation Distribution system Inventory Method study Logistics
ISSN:	0030-364X, 1526-5463
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!