ROUTING WITH STOCHASTIC DEMANDS AND SPLIT DELIVERIES

This paper describes a heuristic algorithm for vehicle routing problems combining stochastic demands and split deliveries. The algorithm is tested on problems containing up to 130 demand points. For some demand parameters, allowing split deliveries in a stochastic context can yield substantial savings.(A)

• Corporate Authors:

  Universite de Montreal

  Centre de Recherche sur Les Transports
  C.P. 6128 Succursale Centre-ville
  Montreal H3C 3J7, Quebec  Canada 
• Authors:
  • Dror, M
  • Laporte, G
  • Bouzaiene-Ayari, B
• Publication Date: 1990-9

Language

• English

Media Info

• Features: References;
• Pagination: 10 p.
• Serial:
  • CENTRE DE RECHERCHE SUR LES TRANSPORTS PUBLICATION
  • Issue Number: 719
  • Publisher: Universite de Montreal

Subject/Index Terms

• TRT Terms: Alignment; Delivery service; Itinerary; Mathematical models; Stochastic processes; Vehicles
• Uncontrolled Terms: Selection
• ITRD Terms: 2894: Alignment; 284: Delivery; 699: Itinerary; 6473: Mathematical model; 9072: Selection; 6574: Stochastic process; 1255: Vehicle
• Subject Areas: Data and Information Technology; Vehicles and Equipment;

Filing Info

• Accession Number: 00756999
• Record Type: Publication
• Source Agency: Transportation Association of Canada (TAC)
• Files: ITRD
• Created Date: Dec 17 1998 12:00AM