Planning and Scheduling Transportation Vehicle Fleet in a Congested Traffic Environment
Transportation is a main component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assigning and scheduling vehicle routing is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic nature of travel times in this problem. In this paper, a vehicle routing problem with time windows and stochastic travel times due to potential traffic congestion is considered. The approach developed introduces mainly the traffic congestion component based on queueing theory. This is an innovative modeling scheme to capture the stochastic behavior of travel times. A case study is used both to illustrate the appropriateness of the approach as well as to show that time-independent solutions are often unrealistic within a congested traffic environment which is often the case on the european road networks
|Date of creation:||01 Dec 2004|
|Contact details of provider:|| Postal: HEC Paris, 78351 Jouy-en-Josas cedex, France|
Web page: http://www.hec.fr/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- VAN WOENSEL, Tom & CRETEN, Ruth & VANDAELE, Nico J., "undated". "Managing the environmental externalities of traffic logistics: The issue of emissions," Working Papers 2000022, University of Antwerp, Faculty of Applied Economics.
- Malandraki, Chryssi & Dial, Robert B., 1996. "A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 90(1), pages 45-55, April.
- Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
When requesting a correction, please mention this item's handle: RePEc:ebg:heccah:0803. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sandra Dupouy)
If references are entirely missing, you can add them using this form.