IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v348y2025i2d10.1007_s10479-024-06442-2.html
   My bibliography  Save this article

Sustainable vehicle route planning under uncertainty for modular integrated construction: multi-trip time-dependent VRP with time windows and data analytics

Author

Listed:
  • Abdelrahman E. E. Eltoukhy

    (Khalifa University)

  • Hashim A. Hashim

    (Carleton University)

  • Mohamed Hussein

    (Assiut University)

  • Waqar Ahmed Khan

    (University of Sharjah,)

  • Tarek Zayed

    (The Hong Kong Polytechnic University)

Abstract

Modular integrated construction (MiC) is an innovative construction technology that boosts automation in the construction industry by shifting most of the on-site activities to controlled production facilities. However, transporting heavy, bulky, and tailor-made MiC modules to the construction site poses economic, environmental, and social challenges. Effective transportation planning is crucial to mitigate these challenges. The vehicle routing problem (VRP) is of central importance to logistics companies in determining the optimal routes for MiC module transportation. Existing literature lacks comprehensive studies on VRP that thoroughly consider the unique aspects of MiC transportation, including the need for multi-trips of trucks between the factory and the construction site, traffic conditions, and other environmental and social impacts (e.g., carbon emissions, noise, accidents, and congestion). Neglecting these factors jeopardizes the efficiency of MiC module transportation, potentially leading to project delays and undermining the sustainability benefits of MiC. Therefore, the main objective of this study is to develop a VRP model that adequately accounts for most MiC characteristics, facilitating efficient MiC module transportation. This can be achieved by proposing a new variant for the VRP model, called a multi-trip time-dependent vehicle routing problem with time windows, uncertain unloading time, and environmental and social considerations (MT-TVRPTW-UES). The MT-TVRPTW-UES is modeled as a mixed integer linear programming model. A neural network-based algorithm is utilized to predict uncertain unloading times. Additionally, we develop an ant colony optimization (ACO)-based algorithm to solve the MT-TVRPTW-UES model, specifically designed to tackle large test instances that cannot be handled by CPLEX software. To demonstrate the viability and superiority of the MT-TVRPTW-UES model, we present two case studies based on real-world data from a large logistics company located in Hong Kong. The results show that the MT-TVRPTW-UES model significantly improves the MiC module demand satisfaction, environmental protection, and people’s social life.

Suggested Citation

  • Abdelrahman E. E. Eltoukhy & Hashim A. Hashim & Mohamed Hussein & Waqar Ahmed Khan & Tarek Zayed, 2025. "Sustainable vehicle route planning under uncertainty for modular integrated construction: multi-trip time-dependent VRP with time windows and data analytics," Annals of Operations Research, Springer, vol. 348(2), pages 863-898, May.
    • Handle: RePEc:spr:annopr:v:348:y:2025:i:2:d:10.1007_s10479-024-06442-2
    DOI: 10.1007/s10479-024-06442-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-06442-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-024-06442-2?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. Abdelrahman E. E. Eltoukhy & Z. X. Wang & I. A. Shaban & Felix T. S. Chan, 2022. "Coordinating aircraft maintenance routing and integrated maintenance staffing and rostering: a Stackelberg game theoretical model," International Journal of Production Research, Taylor & Francis Journals, vol. 60(24), pages 7450-7474, December.
    2. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    3. Sai Ho Chung & Hoi Lam Ma & Hing Kai Chan, 2017. "Cascading Delay Risk of Airline Workforce Deployments with Crew Pairing and Schedule Optimization," Risk Analysis, John Wiley & Sons, vol. 37(8), pages 1443-1458, August.
    4. Potvin, Jean-Yves & Rousseau, Jean-Marc, 1993. "A parallel route building algorithm for the vehicle routing and scheduling problem with time windows," European Journal of Operational Research, Elsevier, vol. 66(3), pages 331-340, May.
    5. Ahmed Wa Hammad & Hanna Grzybowska & Monty Sutrisna & Ali Akbarnezhad & Assed Haddad, 2020. "A novel mathematical optimisation model for the scheduling of activities in modular construction factories," Construction Management and Economics, Taylor & Francis Journals, vol. 38(6), pages 534-551, June.
    6. Chryssi Malandraki & Mark S. Daskin, 1992. "Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms," Transportation Science, INFORMS, vol. 26(3), pages 185-200, August.
    7. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    8. Abdelrahman E. E. Eltoukhy & Ibrahim Abdelfadeel Shaban & Felix T. S. Chan & Mohammad A. M. Abdel-Aal, 2020. "Data Analytics for Predicting COVID-19 Cases in Top Affected Countries: Observations and Recommendations," IJERPH, MDPI, vol. 17(19), pages 1-25, September.
    9. 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.
    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. Sai-Ho Chung & Stein W. Wallace & Xin Wen, 2025. "Data driven operational risk management," Annals of Operations Research, Springer, vol. 348(2), pages 777-781, May.

    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. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    2. Liu, Yiming & Yu, Yang & Baldacci, Roberto & Tang, Jiafu & Sun, Wei, 2025. "Optimizing carbon emissions in green logistics for time-dependent routing," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    3. Andrew Lim & Xingwen Zhang, 2007. "A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 443-457, August.
    4. Andres Figliozzi, Miguel, 2012. "The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 616-636.
    5. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    6. 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.
    7. Alcaraz, Juan J. & Caballero-Arnaldos, Luis & Vales-Alonso, Javier, 2019. "Rich vehicle routing problem with last-mile outsourcing decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 263-286.
    8. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    9. Yu, Mingzhu & Qi, Xiangtong, 2014. "A vehicle routing problem with multiple overlapped batches," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 40-55.
    10. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    11. Zhenzhen Zhang & Zhixing Luo & Hu Qin & Andrew Lim, 2019. "Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction," Transportation Science, INFORMS, vol. 53(2), pages 427-441, March.
    12. Ehmke, Jan Fabian & Campbell, Ann Melissa & Urban, Timothy L., 2015. "Ensuring service levels in routing problems with time windows and stochastic travel times," European Journal of Operational Research, Elsevier, vol. 240(2), pages 539-550.
    13. Jean-Yves Potvin, 2009. "State-of-the Art Review ---Evolutionary Algorithms for Vehicle Routing," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 518-548, November.
    14. Said Dabia & Stefan Ropke & Tom van Woensel & Ton De Kok, 2013. "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 47(3), pages 380-396, August.
    15. Fontaine, Pirmin, 2022. "The vehicle routing problem with load-dependent travel times for cargo bicycles," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1005-1016.
    16. W Maden & R Eglese & D Black, 2010. "Vehicle routing and scheduling with time-varying data: A case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(3), pages 515-522, March.
    17. Wang, Yong & Wei, Zikai & Luo, Siyu & Zhou, Jingxin & Zhen, Lu, 2024. "Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    18. 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.
    19. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    20. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.

    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:annopr:v:348:y:2025:i:2:d:10.1007_s10479-024-06442-2. 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.