IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-642-00939-6_9.html
   My bibliography  Save this book chapter

A Hybrid Algorithm for Vehicle Routing of Less-Than-Truckload Carriers

In: Metaheuristics in the Service Industry

Author

Listed:
  • Julia Rieck

    (Clausthal University of Technology)

  • Jürgen Zimmermann

    (Clausthal University of Technology)

Abstract

In this paper we address a variant of the vehicle routing problem faced by less-than-truckload carriers in Europe. As a consequence of globalization and increasing customer expectations, medium-sized less-than truckload carriers operate together in cooperations. Each cooperative member faces a multitude of requirements when constructing a low-cost, feasible set of routes. Among other aspects heterogeneous vehicles, time windows, simultaneous delivery and pick-up at customer locations, and multiple use of vehicles have to be considered. After the determination of an adequate set of routes, the vehicles must be assigned to loading bays at the depot at which the loading and unloading activities can occur.We present a vehicle routing model which integrates the real-life vehicle routing problem and the assignment problem of vehicles to loading bays at the depot. The proposed solution heuristic combines a multi-start and a local search procedure. Using a set of suitable benchmark instances, we assess the performance of the proposed method.

Suggested Citation

  • Julia Rieck & Jürgen Zimmermann, 2009. "A Hybrid Algorithm for Vehicle Routing of Less-Than-Truckload Carriers," Lecture Notes in Economics and Mathematical Systems, in: Kenneth Sörensen & Marc Sevaux & Walter Habenicht & Martin Josef Geiger (ed.), Metaheuristics in the Service Industry, chapter 9, pages 155-171, Springer.
    • Handle: RePEc:spr:lnechp:978-3-642-00939-6_9
    DOI: 10.1007/978-3-642-00939-6_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Julia Rieck & Jürgen Zimmermann, 2010. "A new mixed integer linear model for a rich vehicle routing problem with docking constraints," Annals of Operations Research, Springer, vol. 181(1), pages 337-358, December.

    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:spr:lnechp:978-3-642-00939-6_9. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.