IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-28697-6_67.html
   My bibliography  Save this book chapter

Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows

In: Operations Research Proceedings 2014

Author

Listed:
  • Matteo Salani

    (Università della Svizzera italiana (USI))

  • Maria Battarra

    (University of Southampton)

  • Luca Maria Gambardella

    (Università della Svizzera italiana (USI))

Abstract

This paper studiesGambardella, Luca Maria a variantSalani, Matteo of the VehicleBattarra, Maria Routing Problem with Soft Time Windows (VRPSTW) inspired by real world distribution problems. Soft time windows constraints are very common in the distribution industry, but quantifying the trade-off between routing cost and customer inconvenience is a hard task for practitioners. In our model, practitioners impose a minimum routing cost saving (to be achieved with respect to the hard time windows solutions) and ask for the minimization of the customer inconvenience only. We propose two exact algorithms. The first algorithm is based on standard branch-and-cut-and-price. The second algorithm uses concepts of bi-objective optimization and is based on the bisection method.

Suggested Citation

  • Matteo Salani & Maria Battarra & Luca Maria Gambardella, 2016. "Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows," Operations Research Proceedings, in: Marco Lübbecke & Arie Koster & Peter Letmathe & Reinhard Madlener & Britta Peis & Grit Walther (ed.), Operations Research Proceedings 2014, edition 1, pages 481-486, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-28697-6_67
    DOI: 10.1007/978-3-319-28697-6_67
    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. Md. Anisul Islam & Yuvraj Gajpal, 2021. "Optimization of Conventional and Green Vehicles Composition under Carbon Emission Cap," Sustainability, MDPI, vol. 13(12), pages 1-20, June.
    2. Chen-Yang Cheng & Kuo-Ching Ying & Chung-Cheng Lu & Chumpol Yuangyai & Wan-Chen Chiang, 2021. "An Auction Bidding Approach to Balance Performance Bonuses in Vehicle Routing Problems with Time Windows," Sustainability, MDPI, vol. 13(16), pages 1-16, August.

    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:oprchp:978-3-319-28697-6_67. 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.