IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-69215-9_4.html
   My bibliography  Save this book chapter

Constructive Algorithms for the Cumulative Vehicle Routing Problem with Limited Duration

In: Sustainable Logistics and Transportation

Author

Listed:
  • Didem Cinar

    (Istanbul Technical University)

  • Beyzanur Cayir Ervural

    (Istanbul Technical University)

  • Konstantinos Gakis

    (University of Florida)

  • Panos M. Pardalos

    (University of Florida)

Abstract

In this chapter, several constructive algorithms developed for the cumulative vehicle routing problem with limited duration are used as an initial solution generator algorithm for various metaheuristics. Their performance on the solution quality obtained by solution-based and population-based metaheuristics is investigated. Data sets from the literature are used for the computational tests. The computational experiments show that the performance of simulated annealing is significantly affected by the initial solution generator. Although initial solution generators do not affect the performance of genetic algorithms as much as simulated annealing, choosing the best initial solution generator is still an important issue to obtain high-quality solutions in a proper computational time.

Suggested Citation

  • Didem Cinar & Beyzanur Cayir Ervural & Konstantinos Gakis & Panos M. Pardalos, 2017. "Constructive Algorithms for the Cumulative Vehicle Routing Problem with Limited Duration," Springer Optimization and Its Applications, in: Didem Cinar & Konstantinos Gakis & Panos M. Pardalos (ed.), Sustainable Logistics and Transportation, pages 57-86, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-69215-9_4
    DOI: 10.1007/978-3-319-69215-9_4
    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. Caio Marinho Damião & João Marcos Pereira Silva & Eduardo Uchoa, 2023. "A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem," 4OR, Springer, vol. 21(1), pages 47-71, March.

    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:spochp:978-3-319-69215-9_4. 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.