IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v152y2021ics1366554521001587.html
   My bibliography  Save this article

A column generation based heuristic for the generalized vehicle routing problem with time windows

Author

Listed:
  • Yuan, Yuan
  • Cattaruzza, Diego
  • Ogier, Maxime
  • Semet, Frédéric
  • Vigo, Daniele

Abstract

The generalized vehicle routing problem with time windows (GVRPTW) is defined on a directed graph G=(V,A) where the vertex set V is partitioned into clusters. One cluster contains only the depot, where is located a homogeneous fleet of vehicles, each with a limited capacity. The other clusters represent customers. A demand is associated with each cluster. Inside a cluster, the vertices represent the possible locations of the customer. A time window is associated with each vertex, during which the visit must take place if the vertex is visited. The objective is to find a set of routes such that the total traveling cost is minimized, exactly one vertex per cluster is visited, and all the capacity and time constraints are respected. This paper presents a set covering formulation for the GVRPTW which is used to provide a column generation based heuristic to solve it. The proposed solving method combines several components including a construction heuristic, a route optimization procedure, local search operators and the generation of negative reduced cost routes. Experimental results on benchmark instances show that the proposed algorithm is efficient and high-quality solutions for instances with up to 120 clusters are obtained within short computation times.

Suggested Citation

  • Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Vigo, Daniele, 2021. "A column generation based heuristic for the generalized vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
  • Handle: RePEc:eee:transe:v:152:y:2021:i:c:s1366554521001587
    DOI: 10.1016/j.tre.2021.102391
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554521001587
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2021.102391?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. R Baldacci & E Bartolini & G Laporte, 2010. "Some applications of the generalized vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1072-1077, July.
    2. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    3. L Moccia & J-F Cordeau & G Laporte, 2012. "An incremental tabu search heuristic for the generalized vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(2), pages 232-244, February.
    4. Ozbaygin, Gizem & Ekin Karasan, Oya & Savelsbergh, Martin & Yaman, Hande, 2017. "A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 115-137.
    5. Ghiani, Gianpaolo & Improta, Gennaro, 2000. "An efficient transformation of the generalized vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 11-17, April.
    6. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    7. Salhi, Said & Wassan, Niaz & Hajarat, Mutaz, 2013. "The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulation and Set Partitioning-based Heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 56(C), pages 22-35.
    8. Mohammad Reihaneh & Ahmed Ghoniem, 2018. "A branch-cut-and-price algorithm for the generalized vehicle routing problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(2), pages 307-318, February.
    9. Archetti, Claudia & Savelsbergh, Martin W.P. & Grazia Speranza, M., 2008. "To split or not to split: That is the question," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(1), pages 114-123, January.
    10. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    11. Tolga Bektaş & Güneş Erdoğan & Stefan Røpke, 2011. "Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 299-316, August.
    12. Francesco Carrabs & Carmine Cerrone & Raffaele Cerulli & Bruce Golden, 2020. "An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1030-1048, October.
    13. Furini, Fabio & Malaguti, Enrico & Medina Durán, Rosa & Persiani, Alfredo & Toth, Paolo, 2012. "A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size," European Journal of Operational Research, Elsevier, vol. 218(1), pages 251-260.
    14. Janjevic, Milena & Winkenbach, Matthias & Merchán, Daniel, 2019. "Integrating collection-and-delivery points in the strategic design of urban last-mile e-commerce distribution networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 131(C), pages 37-67.
    15. Zhou, Lin & Baldacci, Roberto & Vigo, Daniele & Wang, Xu, 2018. "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution," European Journal of Operational Research, Elsevier, vol. 265(2), pages 765-778.
    16. Batoul Mahvash & Anjali Awasthi & Satyaveer Chauhan, 2017. "A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1730-1747, March.
    17. Mourgaya, M. & Vanderbeck, F., 2007. "Column generation based heuristic for tactical planning in multi-period vehicle routing," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1028-1041, December.
    18. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric, 2020. "A branch-and-cut algorithm for the generalized traveling salesman problem with time windows," European Journal of Operational Research, Elsevier, vol. 286(3), pages 849-866.
    19. Lin, Yun Hui & Wang, Yuan & He, Dongdong & Lee, Loo Hay, 2020. "Last-mile delivery: Optimal locker location under multinomial logit choice model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    20. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    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. Han, Jialin & Zhang, Jiaxiang & Guo, Haoyue & Zhang, Ning, 2024. "Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm," European Journal of Operational Research, Elsevier, vol. 316(3), pages 958-975.

    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. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    2. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    3. Ozbaygin, Gizem & Ekin Karasan, Oya & Savelsbergh, Martin & Yaman, Hande, 2017. "A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 115-137.
    4. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric, 2020. "A branch-and-cut algorithm for the generalized traveling salesman problem with time windows," European Journal of Operational Research, Elsevier, vol. 286(3), pages 849-866.
    5. Tolga Bektaş & Güneş Erdoğan & Stefan Røpke, 2011. "Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 299-316, August.
    6. Christian Tilk & Katharina Olkis & Stefan Irnich, 2021. "The last-mile vehicle routing problem with delivery options," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 877-904, December.
    7. Zang, Xiaoning & Jiang, Li & Liang, Changyong & Fang, Xiang, 2023. "Coordinated home and locker deliveries: An exact approach for the urban delivery problem with conflicting time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    8. Christian Tilk & Katharina Olkis & Stefan Irnich, 2020. "The Last-mile Vehicle Routing Problem with Delivery Options," Working Papers 2017, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    9. Alexander Jungwirth & Guy Desaulniers & Markus Frey & Rainer Kolisch, 2022. "Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1157-1175, March.
    10. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    11. Amira Saker & Amr Eltawil & Islam Ali, 2023. "Adaptive Large Neighborhood Search Metaheuristic for the Capacitated Vehicle Routing Problem with Parcel Lockers," Logistics, MDPI, vol. 7(4), pages 1-27, October.
    12. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    13. dos Santos, André Gustavo & Viana, Ana & Pedroso, João Pedro, 2022. "2-echelon lastmile delivery with lockers and occasional couriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(C).
    14. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    15. Balcik, Burcu, 2017. "Site selection and vehicle routing for post-disaster rapid needs assessment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 30-58.
    16. Yu, Vincent F. & Jodiawan, Panca & Redi, A.A.N. Perwira, 2022. "Crowd-shipping problem with time windows, transshipment nodes, and delivery options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    17. Archetti, C. & Carrabs, F. & Cerulli, R. & Laureana, F., 2024. "A new formulation and a branch-and-cut algorithm for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 314(2), pages 446-465.
    18. Hintsch, Timo & Irnich, Stefan, 2018. "Large multiple neighborhood search for the clustered vehicle-routing problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 118-131.
    19. Baniasadi, Pouya & Foumani, Mehdi & Smith-Miles, Kate & Ejov, Vladimir, 2020. "A transformation technique for the clustered generalized traveling salesman problem with applications to logistics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 444-457.
    20. Wang, Mengtong & Zhang, Canrong & Bell, Michael G.H. & Miao, Lixin, 2022. "A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1258-1276.

    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:eee:transe:v:152:y:2021:i:c:s1366554521001587. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.