IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-00142-0_49.html
   My bibliography  Save this book chapter

A Branch-and-Cut Approach to the Vehicle Routing Problem with Simultaneous Delivery and Pick-up

In: Operations Research Proceedings 2008

Author

Listed:
  • Julia Rieck

    (Clausthal University of Technology, Institute of Management and Economics, Operations Research Group)

  • Jürgen Zimmermann

    (Clausthal University of Technology, Institute of Management and Economics, Operations Research Group)

Abstract

Summary The vehicle routing problem with simultaneous delivery and pickup (VRPSDP) is an extension of the capacitated vehicle routing problem in which products have to be transported from the depot to customer locations and other products have to be trucked from customer locations to the depot. Each customer requires a simultaneous delivery and pick-up of goods by the same vehicle. The VRPSDP is a basic problem in reverse logistics: In addition to the distribution process to the customers, re-usable goods have to be transported in the reverse direction. We implement a branch-and-cut approach and study how it can be applied to the solution of the VRPSDP. The computational tests have been performed on known benchmark instances. Some benchmark problems are solved to optimality for the first time

Suggested Citation

  • Julia Rieck & Jürgen Zimmermann, 2009. "A Branch-and-Cut Approach to the Vehicle Routing Problem with Simultaneous Delivery and Pick-up," Springer Books, in: Bernhard Fleischmann & Karl-Heinz Borgwardt & Robert Klein & Axel Tuma (ed.), Operations Research Proceedings 2008, chapter 49, pages 301-306, Springer.
  • Handle: RePEc:spr:sprchp:978-3-642-00142-0_49
    DOI: 10.1007/978-3-642-00142-0_49
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-3-642-00142-0_49. 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.