VEHICLE ROUTING WITH SITE DEPENDENCIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16

Given a vehicle routing problem with a heterogeneous fleet, suppose that each site can be serviced by some, but not necessarily all, vehicle types. Customers with high demands may require large vehicles. Others in congested areas may require small or medium vehicles. In this paper, we analyze several heuristics for solving this variant of the vehicle routing problem where the incompatibility of customer sites with certain vehicle types acts as a complicating constraint. (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:
  • NAG, B
  • GOLDEN, B L
  • Assad, A
• Publication Date: 1988

Media Info

• Features: References;
• Pagination: p. 149-159
• Serial:
  • Publication of: Dalctraf
  • Publisher: Dalctraf

Subject/Index Terms

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

Filing Info

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