Dynamic Transportation Networks in Vehicle Routing and Scheduling

Jens Lysgaard
Additional contact information
Jens Lysgaard: Aarhus School of Business Administration, Department of Operations Research, Fuglesangsallé 4, DK-8210 Aarhus V, Denmark

Interfaces, 1992, vol. 22, issue 3, 45-55

Abstract: In the classical vehicle-routing problem (VRP), the underlying geographic model typically represents a road network. When this network is represented as a directed graph, driving any arc in the graph is always physically possible. In areas where customers are located on various islands, ferries must be used to transport trucks. In a graphical representation of such a transportation network, some of the arcs are present only at discrete times. I considered aspects of dynamic arcs in relation to the use of existing insertion heuristics for vehicle routing and scheduling problems with time window constraints (VRSPTW) and designed a specific algorithm for this special type of problem.

Keywords: transportation: road; networks/graph: applications (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/inte.22.3.45 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:22:y:1992:i:3:p:45-55

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().