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

A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows

Author

Listed:
  • Liu, Shixin
  • Qin, Shujin
  • Zhang, Ruiyou

Abstract

This study introduces the multi-trip multi-repairman problem with time windows where an integrated traveling cost involving distance-dependent and time-dependent costs needs to be minimized. The problem is formulated as two mixed integer programming models. A branch-and-price algorithm is proposed, in which two route-generating approaches are devised to handle the pricing sub-problem. A large number of instances are randomly generated based on an actual service network of China. The proposed algorithm is validated based on these instances and compared to the direct solving method using Cplex. The comparison to the single-trip mode indicates the advantages of the multi-trip mode.

Suggested Citation

  • Liu, Shixin & Qin, Shujin & Zhang, Ruiyou, 2018. "A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 25-41.
    • Handle: RePEc:eee:transe:v:116:y:2018:i:c:p:25-41
    DOI: 10.1016/j.tre.2018.05.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554517312723
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2018.05.009?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. Zhang, Ruiyou & Yun, Won Young & Moon, Ilkyeong, 2009. "A reactive tabu search algorithm for the multi-depot container truck transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 904-914, November.
    2. 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.
    3. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    4. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates," Transportation Science, INFORMS, vol. 50(2), pages 676-693, May.
    5. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    6. Emilie Danna & Claude Pape, 2005. "Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 99-129, Springer.
    7. Shafiee, Mahmood & Chukova, Stefanka, 2013. "Maintenance models in warranty: A literature review," European Journal of Operational Research, Elsevier, vol. 229(3), pages 561-572.
    8. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2010. "An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles," European Journal of Operational Research, Elsevier, vol. 202(3), pages 756-763, May.
    9. J. T. Linderoth & M. W. P. Savelsbergh, 1999. "A Computational Study of Search Strategies for Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 173-187, May.
    10. Bock, Stefan, 2015. "Solving the traveling repairman problem on a line with general processing times and deadlines," European Journal of Operational Research, Elsevier, vol. 244(3), pages 690-703.
    11. Tang, Jiafu & Yu, Yang & Li, Jia, 2015. "An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 114-132.
    12. Gendreau, Michel & Manerba, Daniele & Mansini, Renata, 2016. "The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 248(1), pages 59-71.
    13. Zhang, Ruiyou & Lu, Jye-Chyi & Wang, Dingwei, 2014. "Container drayage problem with flexible orders and its near real-time solution strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 235-251.
    14. Aristide Mingozzi & Roberto Roberti & Paolo Toth, 2013. "An Exact Algorithm for the Multitrip Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 193-207, May.
    15. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm," Transportation Science, INFORMS, vol. 39(4), pages 539-552, November.
    16. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    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. Afsar, Hasan Murat & Afsar, Sezin & Palacios, Juan José, 2021. "Vehicle routing problem with zone-based pricing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    2. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    3. A. Mor & M. G. Speranza, 2022. "Vehicle routing problems over time: a survey," Annals of Operations Research, Springer, vol. 314(1), pages 255-275, July.
    4. Huang, Nan & Li, Jiliu & Zhu, Wenbin & Qin, Hu, 2021. "The multi-trip vehicle routing problem with time windows and unloading queue at depot," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    5. Jie Zhang & Yifan Zhu & Xiaobo Li & Mengjun Ming & Weiping Wang & Tao Wang, 2022. "Multi-Trip Time-Dependent Vehicle Routing Problem with Split Delivery," Mathematics, MDPI, vol. 10(19), pages 1-24, September.
    6. Yang, Weibo & Ke, Liangjun & Wang, David Z.W. & Lam, Jasmine Siu Lee, 2021. "A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    7. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.
    8. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).

    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. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    2. Huang, Nan & Li, Jiliu & Zhu, Wenbin & Qin, Hu, 2021. "The multi-trip vehicle routing problem with time windows and unloading queue at depot," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    3. Cheng, Chun & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2020. "Drone routing with energy function: Formulation and exact algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 364-387.
    4. He, Dongdong & Ceder, Avishai (Avi) & Zhang, Wenyi & Guan, Wei & Qi, Geqi, 2023. "Optimization of a rural bus service integrated with e-commerce deliveries guided by a new sustainable policy in China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
    5. Wang, Zheng, 2018. "Delivering meals for multiple suppliers: Exclusive or sharing logistics service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 496-512.
    6. J. Molina & A. D. López-Sánchez & A. G. Hernández-Díaz & I. Martínez-Salazar, 2018. "A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems," Journal of Heuristics, Springer, vol. 24(2), pages 111-133, April.
    7. You, Jintao & Wang, Yuan & Xue, Zhaojie, 2023. "An exact algorithm for the multi-trip container drayage problem with truck platooning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    8. Martin Wölck & Stephan Meisel, 2022. "Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2192-2211, July.
    9. Fazi, Stefano & Choudhary, Sourabh Kumar & Dong, Jing-Xin, 2023. "The multi-trip container drayage problem with synchronization for efficient empty containers re-usage," European Journal of Operational Research, Elsevier, vol. 310(1), pages 343-359.
    10. Zhen, Lu & Ma, Chengle & Wang, Kai & Xiao, Liyang & Zhang, Wei, 2020. "Multi-depot multi-trip vehicle routing problem with time windows and release dates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 135(C).
    11. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    12. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    13. 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.
    14. Theodore Athanasopoulos & Ioannis Minis, 2013. "Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework," Annals of Operations Research, Springer, vol. 206(1), pages 1-22, July.
    15. Guy Desaulniers & François Lessard & Ahmed Hadjar, 2008. "Tabu Search, Partial Elementarity, and Generalized k -Path Inequalities for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 387-404, August.
    16. Heungjo An & Young-Ji Byon & Chung-Suk Cho, 2018. "Economic and Environmental Evaluation of a Brick Delivery System Based on Multi-Trip Vehicle Loader Routing Problem for Small Construction Sites," Sustainability, MDPI, vol. 10(5), pages 1-14, May.
    17. Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    18. Ozgur Kabadurmus & Mehmet S. Erdogan, 2023. "A green vehicle routing problem with multi-depot, multi-tour, heterogeneous fleet and split deliveries: a mathematical model and heuristic approach," Journal of Combinatorial Optimization, Springer, vol. 45(3), pages 1-29, April.
    19. Gu, Wenjuan & Archetti, Claudia & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Speranza, M. Grazia, 2024. "Vehicle routing problems with multiple commodities: A survey," European Journal of Operational Research, Elsevier, vol. 317(1), pages 1-15.
    20. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.

    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:116:y:2018:i:c:p:25-41. 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.