IDEAS home Printed from https://ideas.repec.org/p/ebg/heccah/0803.html
   My bibliography  Save this paper

Planning and Scheduling Transportation Vehicle Fleet in a Congested Traffic Environment

Author

Listed:
  • KERBACHE, Laoucine
  • VAN WOENSEL, Tom

    (Eindhoven University of Technology)

Abstract

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

Suggested Citation

  • KERBACHE, Laoucine & VAN WOENSEL, Tom, 2004. "Planning and Scheduling Transportation Vehicle Fleet in a Congested Traffic Environment," Les Cahiers de Recherche 803, HEC Paris.
  • Handle: RePEc:ebg:heccah:0803
    as

    Download full text from publisher

    File URL: http://www.hec.fr/var/fre/storage/original/application/fca1dcb8f5385a37babc984380d4cb38.pdf
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    transportation; vehicle fleet; planning; scheduling; congested traffic;

    JEL classification:

    • R41 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Transportation Economics - - - Transportation: Demand, Supply, and Congestion; Travel Time; Safety and Accidents; Transportation Noise

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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: (Antoine Haldemann). General contact details of provider: http://edirc.repec.org/data/hecpafr.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.