Abstract
This paper presents heuristics which are based on a tour splitting of a general routing tour for solving the general capacitated routing problem (GCRP). This problem is a generalization of the vehicle routing problem (VRP) and the capacitated arc routing problem (CARP).
Zusammenfassung
In dieser Arbeit werden Heuristiken zur Lösung des allgemeinen kapazitätsbeschränkten Routing Problems vorgestellt. Dieses Problem ist eine Verallgemeinerung des Fahrzeug Routing Problems und des kapazitären Kanten Routing Problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Altinkemer and B. Gavish, Heuristics for equal weight delivery problems with constant error guarantees, Report Graduate School of Management, University of Rochester, 1985.
K. Altinkemer and B. Gavish, Heuristics for unequal weight delivery problems with a fixed error guarantee, Operations Research Letters, 6 (1987) 149–158.
J.E. Beasley, Route first- cluster second methods for vehicle routing, Omega 11 (1983) 403–408.
N. Christofides, Worst case analysis of a new heuristic for the traveling salesman problem, Management science research report 388, Carnegie-Mellon University, Pittsburgh, PA, (1976).
M. Haimovich and A.H.G. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Mathematics of Operations Research, 10 (1985) 527–542.
M. Haimovich, A.H.G. Rinnooy Kan and L. Stougie, Analysis of heuristics for vehicle routing problems, in: B.L. Golden and A.A. Assad, ed., Vehicle Routing: Methods and Studies (North Holland, Amsterdam, 1988) 47–61.
K. Jansen, Bounds for the general capacitated routing problem, to appear.
C-L. Li and D. Simchi-Levi, Worst case analysis of heuristics for multidepot capacitated vehicle routing problems, ORSA J. on Computing 2 (1990) 64–73.
R.H. Mole, D.G. Johnson and K. Wells, Combinatorial analysis for route first- cluster second vehicle routing, Omega 11 (1983) 507–512.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, K. (1992). Analysis of Heuristics for the General Capacitated Routing Problem. In: Gaul, W., Bachem, A., Habenicht, W., Runge, W., Stahl, W.W. (eds) Operations Research Proceedings 1991. Operations Research Proceedings 1991, vol 1991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46773-8_106
Download citation
DOI: https://doi.org/10.1007/978-3-642-46773-8_106
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55410-3
Online ISBN: 978-3-642-46773-8
eBook Packages: Springer Book Archive