IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i19p3018-d1487410.html
   My bibliography  Save this article

Construction Waste Transportation Planning under Uncertainty: Mathematical Models and Numerical Experiments

Author

Listed:
  • Wen Yi

    (Department of Building and Real Estate, Faculty of Construction and Environment, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong 999077, China)

  • Ying Terk Lim

    (Department of Building and Real Estate, Faculty of Construction and Environment, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong 999077, China)

  • Huiwen Wang

    (Department of Building and Real Estate, Faculty of Construction and Environment, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong 999077, China)

  • Lu Zhen

    (School of Management, Shanghai University, Shanghai 200444, China)

  • Xin Zhou

    (Department of Building and Real Estate, Faculty of Construction and Environment, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong 999077, China)

Abstract

Annually, over 10 billion tons of construction and demolition waste is transported globally from sites to reception facilities. Optimal and effective planning of waste transportation holds the potential to mitigate cost and carbon emissions, and alleviate road congestion. A major challenge for developing an effective transportation plan is the uncertainty of the precise volume of waste at each site during the planning stage. However, the existing studies have assumed known demand in planning models but the assumption does not reflect real-world volatility. Taking advantage of the problem structure, this study adopts the stochastic programming methodology to approach the construction waste planning problem. An integer programming model is developed that adeptly addresses the uncertainty of the amount of waste in an elegant manner. The proposed stochastic programming model can efficiently handle practical scale problems. Our numerical experiments amass a comprehensive dataset comprising nearly 4300 records of the actual amount of construction waste generated in Hong Kong. The results demonstrate that incorporating demand uncertainty can reduce the transportation cost by 1% correlating with an increase in profit of 14% compared to those that do not consider the demand uncertainty.

Suggested Citation

  • Wen Yi & Ying Terk Lim & Huiwen Wang & Lu Zhen & Xin Zhou, 2024. "Construction Waste Transportation Planning under Uncertainty: Mathematical Models and Numerical Experiments," Mathematics, MDPI, vol. 12(19), pages 1-17, September.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:19:p:3018-:d:1487410
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/19/3018/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/19/3018/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Dror, Moshe, 1993. "Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution," European Journal of Operational Research, Elsevier, vol. 64(3), pages 432-441, February.
    2. Huiwen Wang & Liang Liao & Wen Yi & Lu Zhen, 2024. "Transportation scheduling for modules used in modular integrated construction," International Journal of Production Research, Taylor & Francis Journals, vol. 62(11), pages 3918-3931, June.
    3. Dimitris J. Bertsimas, 1992. "A Vehicle Routing Problem with Stochastic Demand," Operations Research, INFORMS, vol. 40(3), pages 574-585, June.
    4. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    5. Peng, Xiaoshuai & Zhang, Lele & Thompson, Russell G. & Wang, Kangzhou, 2023. "A three-phase heuristic for last-mile delivery with spatial-temporal consolidation and delivery options," International Journal of Production Economics, Elsevier, vol. 266(C).
    6. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    7. Teddy Nurcahyadi & Christian Blum, 2021. "Adding Negative Learning to Ant Colony Optimization: A Comprehensive Study," Mathematics, MDPI, vol. 9(4), pages 1-23, February.
    8. Song, Malin & Cui, Xin & Wang, Shuhong, 2019. "Simulation of land green supply chain based on system dynamics and policy optimization," International Journal of Production Economics, Elsevier, vol. 217(C), pages 317-327.
    9. Allahviranloo, Mahdieh & Chow, Joseph Y.J. & Recker, Will W., 2014. "Selective vehicle routing problems under uncertainty without recourse," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 68-88.
    10. Bachmann, Rachel & Langevin, André, 2009. "A vehicle routing cost evaluation algorithm for the strategic analysis of radial distribution networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 50-60, January.
    11. Lu Zhen & Ziheng Xu & Chengle Ma & Liyang Xiao, 2020. "Hybrid electric vehicle routing problem with mode selection," International Journal of Production Research, Taylor & Francis Journals, vol. 58(2), pages 562-576, January.
    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. Wen-Huei Yang & Kamlesh Mathur & Ronald H. Ballou, 2000. "Stochastic Vehicle Routing Problem with Restocking," Transportation Science, INFORMS, vol. 34(1), pages 99-112, February.
    2. Nicola Secomandi, 2001. "A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 49(5), pages 796-802, October.
    3. Novoa, Clara & Storer, Robert, 2009. "An approximate dynamic programming approach for the vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 196(2), pages 509-515, July.
    4. Prasanna Balaprakash & Mauro Birattari & Thomas Stützle & Marco Dorigo, 2015. "Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers," Computational Optimization and Applications, Springer, vol. 61(2), pages 463-487, June.
    5. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    6. Liang Sun, 2022. "Modeling and evolutionary algorithm for solving a multi-depot mixed vehicle routing problem with uncertain travel times," Journal of Heuristics, Springer, vol. 28(5), pages 619-651, December.
    7. Gendreau, Michel & Laporte, Gilbert & Seguin, Rene, 1996. "Stochastic vehicle routing," European Journal of Operational Research, Elsevier, vol. 88(1), pages 3-12, January.
    8. Hongsheng Zhong & Randolph W. Hall & Maged Dessouky, 2007. "Territory Planning and Vehicle Dispatching with Driver Learning," Transportation Science, INFORMS, vol. 41(1), pages 74-89, February.
    9. Tatarakis, A. & Minis, I., 2009. "Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns," European Journal of Operational Research, Elsevier, vol. 197(2), pages 557-571, September.
    10. Astrid S. Kenyon & David P. Morton, 2003. "Stochastic Vehicle Routing with Random Travel Times," Transportation Science, INFORMS, vol. 37(1), pages 69-82, February.
    11. Hao Zhang & Yan Cui & Hepu Deng & Shuxian Cui & Huijia Mu, 2021. "An Improved Genetic Algorithm for the Optimal Distribution of Fresh Products under Uncertain Demand," Mathematics, MDPI, vol. 9(18), pages 1-18, September.
    12. Xu, Jiuping & Yan, Fang & Li, Steven, 2011. "Vehicle routing optimization with soft time windows in a fuzzy random environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1075-1091.
    13. Gilbert Laporte & FranÇois V. Louveaux & Luc van Hamme, 2002. "An Integer L -Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 50(3), pages 415-423, June.
    14. Luo, Zhixing & Qin, Hu & Zhang, Dezhi & Lim, Andrew, 2016. "Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 69-89.
    15. Bertazzi, Luca & Secomandi, Nicola, 2018. "Faster rollout search for the vehicle routing problem with stochastic demands and restocking," European Journal of Operational Research, Elsevier, vol. 270(2), pages 487-497.
    16. Seyedmehdi Mirmohammadsadeghi & Shamsuddin Ahmed, 2015. "Memetic Heuristic Approach for Solving Truck and Trailer Routing Problems with Stochastic Demands and Time Windows," Networks and Spatial Economics, Springer, vol. 15(4), pages 1093-1115, December.
    17. Nicola Secomandi & François Margot, 2009. "Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 57(1), pages 214-230, February.
    18. Papadakos, Nikolaos & Tzallas-Regas, George & Rustem, Berç & Thoms, Joanne, 2011. "Risky traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 212(1), pages 69-73, July.
    19. Haughton, Michael A., 1998. "The performance of route modification and demand stabilization strategies in stochastic vehicle routing," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 551-566, November.
    20. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.

    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:gam:jmathe:v:12:y:2024:i:19:p:3018-:d:1487410. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.