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

Robust convoy movement problem under travel time uncertainty

Author

Listed:
  • Ju, Byung Jun
  • Chung, Byung Do

Abstract

A convoy represents a collection of vehicles traveling with a spacing of 50–100 m between them for tactical purposes. The convoy movement problem is a variant of the vehicle routing problem, an NP-hard problem aimed at determining the paths and schedules of convoys. Given the uncertainties in travel times during wartime, attributable to various factors such as road conditions and enemy threats, it is essential to consider uncertain travel times when determining convoy paths and schedules. Therefore, this study introduces a robust convoy movement problem under travel time uncertainty. A polyhedral set for uncertain travel times is used to derive a robust counterpart for the problem. To solve the proposed problem, we establish an exact algorithm that determines optimal solutions by iteratively generating and integrating multiple paths of convoys. This algorithm involves four steps: generation of k-th robust shortest paths, construction of path combinations, adjustment of departure times, and conduction of optimality check. These steps are iterated sequentially until the optimal solution is obtained. In computational experiments, the exact algorithm demonstrates superior performance and reduced computation time compared with the commercial solver CPLEX on both real instances and randomly generated instances. In addition, we conduct a sensitivity analysis for several parameters related to the problem, providing valuable managerial insights for decision-makers.

Suggested Citation

  • Ju, Byung Jun & Chung, Byung Do, 2024. "Robust convoy movement problem under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 190(C).
  • Handle: RePEc:eee:transb:v:190:y:2024:i:c:s0191261524002157
    DOI: 10.1016/j.trb.2024.103091
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.trb.2024.103091?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. P. Chardaire & G. P. McKeown & S. A. Verity-Harrison & S. B. Richardson, 2005. "Solving a Time-Space Network Formulation for the Convoy Movement Problem," Operations Research, INFORMS, vol. 53(2), pages 219-230, April.
    2. P N Ram Kumar & T T Narendran, 2011. "On the usage of Lagrangean Relaxation for the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 722-728, April.
    3. Pedro Munari & Alfredo Moreno & Jonathan De La Vega & Douglas Alem & Jacek Gondzio & Reinaldo Morabito, 2019. "The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method," Transportation Science, INFORMS, vol. 53(4), pages 1043-1066, July.
    4. Shi, Yong & Boudouh, Toufik & Grunder, Olivier, 2019. "A robust optimization for a home health care routing and scheduling problem with consideration of uncertain travel and service times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 52-95.
    5. P. N. Ram Kumar & T. T. Narendran, 2009. "A Mathematical Approach for Variable Speed Convoy Movement Problem(CMP)," Defense & Security Analysis, Taylor & Francis Journals, vol. 25(2), pages 137-155, June.
    6. Neda Rezaei & Sadoullah Ebrahimnejad & Amirhossein Moosavi & Adel Nikfarjam, 2019. "A green vehicle routing problem with time windows considering the heterogeneous fleet of vehicles: two metaheuristic algorithms," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 13(4), pages 507-535.
    7. Nader Ghaffari-Nasab & Mehdi Ghazanfari & Ali Saboury & Mehdi Fathollah, 2015. "The single allocation hub location problem: a robust optimisation approach," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 9(2), pages 147-170.
    8. R Gopalan & N S Narayanaswamy, 2009. "Analysis of algorithms for an online version of the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1230-1236, September.
    9. A L Tuson & S A Harrison, 2005. "Problem difficulty of real instances of convoy planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(7), pages 763-775, July.
    10. Azar Sadeghnejad-Barkousaraie & Rajan Batta & Moises Sudit, 2017. "Convoy movement problem: a civilian perspective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 14-33, January.
    11. 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.
    12. Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    13. Balcik, Burcu & Yanıkoğlu, İhsan, 2020. "A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty," European Journal of Operational Research, Elsevier, vol. 282(1), pages 40-57.
    14. Yin, Yunqiang & Yang, Yongjian & Yu, Yugang & Wang, Dujuan & Cheng, T.C.E., 2023. "Robust vehicle routing with drones under uncertain demands and truck travel times in humanitarian logistics," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    15. Börjesson, Maria & Eliasson, Jonas & Franklin, Joel, 2012. "Valuations of travel time variability in scheduling versus mean-variance models," Working papers in Transport Economics 2012:2, CTS - Centre for Transport Studies Stockholm (KTH and VTI).
    16. Iakovos Toumazis & Changhyun Kwon & Rajan Batta, 2013. "Value-at-Risk and Conditional Value-at-Risk Minimization for Hazardous Materials Routing," International Series in Operations Research & Management Science, in: Rajan Batta & Changhyun Kwon (ed.), Handbook of OR/MS Models in Hazardous Materials Transportation, edition 127, pages 127-154, Springer.
    17. Zhang, Li & Liu, Zhongshan & Yu, Lan & Fang, Ke & Yao, Baozhen & Yu, Bin, 2022. "Routing optimization of shared autonomous electric vehicles under uncertain travel time and uncertain service time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    18. Deborah Sanders, 2023. "Ukraine’s third wave of military reform 2016–2022 – building a military able to defend Ukraine against the Russian invasion," Defense & Security Analysis, Taylor & Francis Journals, vol. 39(3), pages 312-328, July.
    19. Ram Gopalan, 2015. "Computational complexity of convoy movement planning problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 31-60, August.
    20. Mokhtar, Hamid & Krishnamoorthy, Mohan & Dayama, Niraj Ramesh & Kumar, P.N. Ram, 2020. "New approaches for solving the convoy movement problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    21. Chen, Bi Yu & Li, Qingquan & Lam, William H.K., 2016. "Finding the k reliable shortest paths under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 189-203.
    Full references (including those not matched with items on IDEAS)

    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. Mokhtar, Hamid & Krishnamoorthy, Mohan & Dayama, Niraj Ramesh & Kumar, P.N. Ram, 2020. "New approaches for solving the convoy movement problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    2. Azar Sadeghnejad-Barkousaraie & Rajan Batta & Moises Sudit, 2017. "Convoy movement problem: a civilian perspective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 14-33, January.
    3. Alan J. Maniamkot & P. N. Ram Kumar & Mohan Krishnamoorthy & Hamid Mokhtar & Sridharan Rajagopalan, 2022. "Hybridised ant colony optimisation for convoy movement problem," Annals of Operations Research, Springer, vol. 315(2), pages 847-866, August.
    4. Ram Gopalan, 2015. "Computational complexity of convoy movement planning problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 31-60, August.
    5. Yin, Yunqiang & Yang, Yongjian & Yu, Yugang & Wang, Dujuan & Cheng, T.C.E., 2023. "Robust vehicle routing with drones under uncertain demands and truck travel times in humanitarian logistics," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    6. Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
    7. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    8. Florio, Alexandre M. & Gendreau, Michel & Hartl, Richard F. & Minner, Stefan & Vidal, Thibaut, 2023. "Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1081-1093.
    9. Garside, Annisa Kesy & Ahmad, Robiah & Muhtazaruddin, Mohd Nabil Bin, 2024. "A recent review of solution approaches for green vehicle routing problem and its variants," Operations Research Perspectives, Elsevier, vol. 12(C).
    10. Tsang, Man Yiu & Shehadeh, Karmel S., 2023. "Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times," European Journal of Operational Research, Elsevier, vol. 307(1), pages 48-63.
    11. Yang, Yu & Yan, Chiwei & Cao, Yufeng & Roberti, Roberto, 2023. "Planning robust drone-truck delivery routes under road traffic uncertainty," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1145-1160.
    12. Qinxiao Yu & Chun Cheng & Ning Zhu, 2022. "Robust Team Orienteering Problem with Decreasing Profits," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3215-3233, November.
    13. Bouscasse, Hélène & de Lapparent, Matthieu, 2019. "Perceived comfort and values of travel time savings in the Rhône-Alpes Region," Transportation Research Part A: Policy and Practice, Elsevier, vol. 124(C), pages 370-387.
    14. Yichen Lu & Chao Yang & Jun Yang, 2022. "A multi-objective humanitarian pickup and delivery vehicle routing problem with drones," Annals of Operations Research, Springer, vol. 319(1), pages 291-353, December.
    15. Sumitkumar, Rathor & Al-Sumaiti, Ameena Saad, 2024. "Shared autonomous electric vehicle: Towards social economy of energy and mobility from power-transportation nexus perspective," Renewable and Sustainable Energy Reviews, Elsevier, vol. 197(C).
    16. Xiao, Yu & Fukuda, Daisuke, 2015. "On the cost of misperceived travel time variability," Transportation Research Part A: Policy and Practice, Elsevier, vol. 75(C), pages 96-112.
    17. Man Yiu Tsang & Tony Sit & Hoi Ying Wong, 2022. "Adaptive Robust Online Portfolio Selection," Papers 2206.01064, arXiv.org.
    18. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    19. Jihane El Ouadi & Hanae Errousso & Nicolas Malhene & Siham Benhadou & Hicham Medromi, 2022. "A machine-learning based hybrid algorithm for strategic location of urban bundling hubs to support shared public transport," Quality & Quantity: International Journal of Methodology, Springer, vol. 56(5), pages 3215-3258, October.
    20. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.

    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:transb:v:190:y:2024:i:c:s0191261524002157. 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/548/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.