Annarita De Maio , Gilbert Laporte , Roberto Musmanno , Francesca Vocaturo
{"title":"Sustainable risk mitigation in hazardous material transportation","authors":"Annarita De Maio , Gilbert Laporte , Roberto Musmanno , Francesca Vocaturo","doi":"10.1016/j.cor.2025.107228","DOIUrl":null,"url":null,"abstract":"<div><div>The transportation of hazardous material involves the movement of freight representing a high risk to health, safety, and the environment. Due to its nature, hazardous material transportation is regulated by strict laws and must be treated separately from classical transportation. This study addresses road transportation of hazardous materials as a variant of the hazmat vehicle routing and scheduling problem with time windows. The model incorporates a multi-criteria risk measure, balancing factors such as accident probability, population density, distance from fire stations, and traffic conditions, while considering time-dependent travel times divided into distinct time zones. The problem is formulated as a three-objective optimization model to minimize total risk, arrival time, and vehicle cost. A late acceptance hill-climbing heuristic is introduced to obtain feasible solutions. Computational experiments on test instances demonstrate the heuristic’s efficiency and its ability to generate high-quality solutions in reduced execution times. Subsequently, the heuristic is applied to a case study on a Northern Italy road network involving the transportation of compressed oxygen by a logistics operator, providing actionable managerial insights.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107228"},"PeriodicalIF":4.3000,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825002576","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
The transportation of hazardous material involves the movement of freight representing a high risk to health, safety, and the environment. Due to its nature, hazardous material transportation is regulated by strict laws and must be treated separately from classical transportation. This study addresses road transportation of hazardous materials as a variant of the hazmat vehicle routing and scheduling problem with time windows. The model incorporates a multi-criteria risk measure, balancing factors such as accident probability, population density, distance from fire stations, and traffic conditions, while considering time-dependent travel times divided into distinct time zones. The problem is formulated as a three-objective optimization model to minimize total risk, arrival time, and vehicle cost. A late acceptance hill-climbing heuristic is introduced to obtain feasible solutions. Computational experiments on test instances demonstrate the heuristic’s efficiency and its ability to generate high-quality solutions in reduced execution times. Subsequently, the heuristic is applied to a case study on a Northern Italy road network involving the transportation of compressed oxygen by a logistics operator, providing actionable managerial insights.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.