ANALYSIS OF HEURISTICS FOR VEHICLE ROUTING PROBLEMS. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16

Almost all vehicle routing and scheduling problems are np-hard, and most of the algorithms designed for their solution are of a heuristic nature. Due to complications present in most vehicle routing problems eg time-windows, conflicting objectives, precedence constraints, these heuristics are often equipped with problem specific features that turn the theoretical analysis of their performance quality into a far from trivial task. Consequently, the number of results in this direction is still very limited. We present examples from the recent literature, in which mathematical analysis has led to rigorous statements on the performance of vehicle routing heuristics. We shall describe more or less extensively examples of worst-case and probabilistic analysis of heuristics for capacitated vehicle routing problems. Notes on selected reference have been added. (Author/TRRL)

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/0444704078
• Corporate Authors:

  Elsevier

  Radarweg 29
  Amsterdam,   Netherlands  1043 NX
• Authors:
  • HAIMOVICH, M
  • RINNOOY KAN, AHG
  • Stougie, L
• Publication Date: 1988

Media Info

• Features: References;
• Pagination: p. 47-61
• Serial:
  • Publication of: Dalctraf
  • Publisher: Dalctraf

Subject/Index Terms

• TRT Terms: Calculation; Itinerary; Mathematical analysis; Mathematical models; Methodology; Planning; Routing; Vehicles
• ITRD Terms: 6471: Analysis (math); 6464: Calculation; 699: Itinerary; 6473: Mathematical model; 9102: Method; 143: Planning; 1255: Vehicle
• Subject Areas: Highways; Planning and Forecasting; Vehicles and Equipment;

Filing Info

• Accession Number: 00491685
• Record Type: Publication
• Source Agency: Transport Research Laboratory
• ISBN: 0-444-70407-8
• Files: ITRD, TRIS
• Created Date: Mar 31 1990 12:00AM