IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v24y2016i1p29-48.html
   My bibliography  Save this article

Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP

Author

Listed:
  • Gerald Senarclens de Grancy
  • Marc Reimann

Abstract

This paper systematically compares an ant colony optimization (ACO) and a greedy randomized adaptive search procedure (GRASP) metaheuristic. Both are used to solve the vehicle routing problem with time windows and multiple service workers. In order to keep the results comparable, the same route construction heuristic and local search procedures are used. It is shown that ACO clearly outperforms GRASP in the problem under study. Additionally, new globally best results for the used benchmark problems are presented. Copyright Springer-Verlag Berlin Heidelberg 2016

Suggested Citation

  • Gerald Senarclens de Grancy & Marc Reimann, 2016. "Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 24(1), pages 29-48, March.
    • Handle: RePEc:spr:cejnor:v:24:y:2016:i:1:p:29-48
    DOI: 10.1007/s10100-014-0341-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-014-0341-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-014-0341-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Paul M. Thompson & Harilaos N. Psaraftis, 1993. "Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems," Operations Research, INFORMS, vol. 41(5), pages 935-946, October.
    2. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    3. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    4. Charles Fleurent & Fred Glover, 1999. "Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 198-204, May.
    5. Patrícia Belfiore & Luiz Fávero, 2007. "Scatter search for the fleet size and mix vehicle routing problem with time windows," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 15(4), pages 351-368, November.
    6. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Lorenzo Ros-McDonnell & Norina Szander & María Victoria de-la-Fuente-Aragón & Robert Vodopivec, 2019. "Scheduling Sustainable Homecare with Urban Transport and Different Skilled Nurses Using an Approximate Algorithm," Sustainability, MDPI, vol. 11(22), pages 1-14, November.
    2. Antonio Martinez-Sykora & Fraser McLeod & Carlos Lamas-Fernandez & Tolga Bektaş & Tom Cherrett & Julian Allen, 2020. "Optimised solutions to the last-mile delivery problem in London using a combination of walking and driving," Annals of Operations Research, Springer, vol. 295(2), pages 645-693, December.
    3. Jonathan De La Vega & Pedro Munari & Reinaldo Morabito, 2019. "Robust optimization for the vehicle routing problem with multiple deliverymen," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(4), pages 905-936, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    2. Hideki Hashimoto & Mutsunori Yagiura & Shinji Imahori & Toshihide Ibaraki, 2013. "Recent progress of local search in handling the time window constraints of the vehicle routing problem," Annals of Operations Research, Springer, vol. 204(1), pages 171-187, April.
    3. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    4. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    5. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    6. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, December.
    7. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    8. Van Breedam, Alex, 2002. "A parametric analysis of heuristics for the vehicle routing problem with side-constraints," European Journal of Operational Research, Elsevier, vol. 137(2), pages 348-370, March.
    9. Brandstätter, Christian & Reimann, Marc, 2018. "The Line-haul Feeder Vehicle Routing Problem: Mathematical model formulation and heuristic approaches," European Journal of Operational Research, Elsevier, vol. 270(1), pages 157-170.
    10. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    11. Shahparvari, Shahrooz & Abbasi, Babak & Chhetri, Prem, 2017. "Possibilistic scheduling routing for short-notice bushfire emergency evacuation under uncertainties: An Australian case study," Omega, Elsevier, vol. 72(C), pages 96-117.
    12. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    13. Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.
    14. Mohamed Cissé & Semih Yalçindag & Yannick Kergosien & Evren Sahin & Christophe Lenté & Andrea Matta, 2017. "OR problems related to Home Health Care: A review of relevant routing and scheduling problems," Post-Print hal-01736714, HAL.
    15. Sungwon Lee & Taesung Hwang, 2018. "Estimating Emissions from Regional Freight Delivery under Different Urban Development Scenarios," Sustainability, MDPI, vol. 10(4), pages 1-14, April.
    16. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2022. "A Multi-Depot Dynamic Vehicle Routing Problem with Stochastic Road Capacity: An MDP Model and Dynamic Policy for Post-Decision State Rollout Algorithm in Reinforcement Learning," Mathematics, MDPI, vol. 10(15), pages 1-70, July.
    17. Gerald Senarclens de Grancy & Marc Reimann, 2015. "Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(2), pages 479-500, June.
    18. Goos Kant & Michael Jacks & Corné Aantjes, 2008. "Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery," Interfaces, INFORMS, vol. 38(1), pages 40-50, February.
    19. Lagos, Felipe & Pereira, Jordi, 2024. "Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 70-91.
    20. Uchoa, Eduardo & Pecin, Diego & Pessoa, Artur & Poggi, Marcus & Vidal, Thibaut & Subramanian, Anand, 2017. "New benchmark instances for the Capacitated Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 257(3), pages 845-858.

    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:cejnor:v:24:y:2016:i:1:p:29-48. 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.

    If CitEc recognized a bibliographic 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.

    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.