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

A Novel Optimization Method and Its Application for Hazardous Materials Vehicle Routing Problem Under Different Road Conditions

Author

Listed:
  • Fangwei Zhang

    (College of International Business, Shandong Jiaotong University, Weihai 264210, China)

  • Lu Ding

    (College of Navigation and Shipping, Shandong Jiaotong University, Weihai 264210, China)

  • Jun Jiang

    (College of Navigation and Shipping, Shandong Jiaotong University, Weihai 264210, China)

  • Fanyi Kong

    (College of Navigation and Shipping, Shandong Jiaotong University, Weihai 264210, China)

  • Xiaoyu Liu

    (College of Navigation and Shipping, Shandong Jiaotong University, Weihai 264210, China)

Abstract

With the increasing demand for hazardous materials (hazmat) from enterprises, port chemical industrial parks face growing risks in hazardous material transportation. By using internal road network information of parks, this study investigates the hazmat vehicle routing problem (HVRP) under different road conditions, with a bi-objective of minimizing total transportation risk and cost. The two main innovations are as follows. First, according to the grid-like road conditions in parks, the research scope of transportation segments of hazmat vehicles is divided into straight segments and curved segments. Second, the potential affected area of an accident is defined as a type of geometric shape associated with a series of factors refined from transportation situations. Finally, the effectiveness of the proposed two-stage ant colony optimization (TSACO) algorithm is verified through one instance using field data from a real port chemical industry park, and twelve instances from the classical capacitated vehicle routing problem (CVRP) resource.

Suggested Citation

  • Fangwei Zhang & Lu Ding & Jun Jiang & Fanyi Kong & Xiaoyu Liu, 2025. "A Novel Optimization Method and Its Application for Hazardous Materials Vehicle Routing Problem Under Different Road Conditions," Mathematics, MDPI, vol. 13(16), pages 1-22, August.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:16:p:2690-:d:1729320
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/16/2690/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/16/2690/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Chiou, Suh-Wen, 2024. "A learning optimization for resilience enhancement of risk-informed traffic control system with hazardous materials transportation under uncertainty," Reliability Engineering and System Safety, Elsevier, vol. 252(C).
    2. Zandieh, Fatemeh & Ghannadpour, Seyed Farid, 2023. "A comprehensive risk assessment view on interval type-2 fuzzy controller for a time-dependent HazMat routing problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 685-707.
    3. Tingting Li & Shejun Deng & Caoye Lu & Yong Wang & Huajun Liao, 2023. "Optimization of Green Vehicle Paths Considering the Impact of Carbon Emissions: A Case Study of Municipal Solid Waste Collection and Transportation," Sustainability, MDPI, vol. 15(22), pages 1-16, November.
    4. Xuelian Zheng & Lijuan Yu & Yuanyuan Ren & Xiansheng Li & Biao Liang & Jianfeng Xi, 2025. "Modeling of Tank Vehicle Rollover Risk Assessment on Curved–Slope Combination Sections for Sustainable Transportation Safety," Sustainability, MDPI, vol. 17(3), pages 1-19, January.
    5. 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)

    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. 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).
    2. Yi-Kuei Lin & Cheng-Fu Huang & Yi-Chieh Liao, 2019. "Reliability of a stochastic intermodal logistics network under spoilage and time considerations," Annals of Operations Research, Springer, vol. 277(1), pages 95-118, June.
    3. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
    4. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    5. Baihui Jin & Wei Li, 2025. "Spatial Effects and Driving Factors of Consumption Upgrades on Municipal Solid Waste Eco-Efficiency, Considering Emission Outputs," Sustainability, MDPI, vol. 17(6), pages 1-30, March.
    6. 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.
    7. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    8. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    9. Yiling Li & Zhiwen Yang & Si Zhang & Wenting Liu, 2024. "A Study of the Capacitated Vehicle Routing Problem with Time-Window and Three-Dimensional Loading Constraints in Land–Sea Transport," Sustainability, MDPI, vol. 16(23), pages 1-26, November.
    10. Sébastien Mouthuy & Florence Massen & Yves Deville & Pascal Van Hentenryck, 2015. "A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 49(2), pages 223-238, May.
    11. Tingxin Wen & Haoting Meng, 2025. "Time-Dependent Multi-Center Semi-Open Heterogeneous Fleet Path Optimization and Charging Strategy," Mathematics, MDPI, vol. 13(7), pages 1-27, March.
    12. 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.
    13. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    14. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    15. Luigi Di Puglia Pugliese & Francesca Guerriero & Maria Grazia Scutellá, 2021. "The Last-Mile Delivery Process with Trucks and Drones Under Uncertain Energy Consumption," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 31-67, October.
    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.
    17. Sanjeeb Dash & Oktay Günlük & Andrea Lodi & Andrea Tramontani, 2012. "A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 132-147, February.
    18. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    19. Ehmke, Jan Fabian & Campbell, Ann M. & Thomas, Barrett W., 2018. "Optimizing for total costs in vehicle routing in urban areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 242-265.
    20. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:13:y:2025:i:16:p:2690-:d:1729320. 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.