VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS: EFFICIENT IMPLEMENTATIONS OF SOLUTION IMPROVEMENT PROCEDURES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16

A number of heuristic algorithms have been proposed for the vehicle routing and scheduling problem with time window constraints. These algorithms include both route construction and route improvement procedures. This paper extends branch exchange solution improvement procedures, well known from the standard vehicle routing literature, to vehicle routing and scheduling problems with time window constraints. We focus on efficient implementations of these procedures and present extensive computational results. The methods presented are completely robust in that significant reductions in running time are achieved without any degradation in the quality of the solution. (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:
  • Solomon, M M
  • BAKER, E K
  • Schaffer, J R
• Publication Date: 1988

Media Info

• Features: References;
• Pagination: p. 85-105
• Serial:
  • Publication of: Dalctraf
  • Publisher: Dalctraf

Subject/Index Terms

• TRT Terms: Calculation; Delivery service; Itinerary; Mathematical analysis; Mathematical models; Methodology; Operations research; Planning; Routing; Timetables; Vehicles
• ITRD Terms: 6471: Analysis (math); 6464: Calculation; 284: Delivery; 699: Itinerary; 6473: Mathematical model; 9102: Method; 9055: Operational research; 143: Planning; 1186: Timetable; 1255: Vehicle
• Subject Areas: Highways; Planning and Forecasting; Vehicles and Equipment;

Filing Info

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