Skip to main content
SpringerLink
Log in

Heuristics for Several Routing Problems

  • Conference paper
Operations Research ’91

  • 188 Accesses

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Altinkemer and B. Gavish, Heuristics for equal weight delivery problems with constant error guarantees, Report Graduate School of Management, University of Rochester, 1985.

    Google Scholar 

  2. K. Altinkemer and B. Gavish, Heuristics for unequal weight delivery problems with a fixed error guarantee, Operations Research Letters, 6 (1987) 149–158.

    Article  Google Scholar 

  3. J.E. Beasley, Route first- cluster second methods for vehicle routing, Omega 11 (1983) 403–408.

    Article  Google Scholar 

  4. 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).

    Google Scholar 

  5. M. Haimovich and A.H.G. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Mathematics of Operations Research, 10 (1985) 527–542.

    Article  Google Scholar 

  6. 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.

    Google Scholar 

  7. K. Jansen, Bounds for the general capacitated routing problem, to appear.

    Google Scholar 

  8. 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.

    Article  Google Scholar 

  9. R.H. Mole, D.G. Johnson and K. Wells, Combinatorial analysis for route first- cluster second vehicle routing, Omega 11 (1983) 507–512.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Trier, Postbox 38 25, W-5500, Trier, Germany

    Klaus Jansen

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. FB IV, Mathematik, Universität Trier, Postfach 38 25, D-5500, Trier, Germany

    Peter Gritzmann , Rainer Hettich , Reiner Horst  & Ekkehard Sachs , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Physica-Verlag Heidelberg

About this paper

Cite this paper

Jansen, K. (1992). Heuristics for Several Routing Problems. In: Gritzmann, P., Hettich, R., Horst, R., Sachs, E. (eds) Operations Research ’91. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-48417-9_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-48417-9_45

  • Publisher Name: Physica-Verlag HD

  • Print ISBN: 978-3-7908-0608-3

  • Online ISBN: 978-3-642-48417-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation