Using the vehicle routing problem for the transportation of hazardous materials

Transportation of hazardous materials (hazmats) is a decision problem that has been attracted much attention due to the risk factor involved. A considerable amount of models have been developed that employ single or multiple objective shortest path algorithms minimising the risks for a given origin-destination pair. However in many real life applications (i.e. transportation of gas cylinders), transportation of hazmats calls for the determination of a set of routes used by a fleet of trucks to serve a set of customers, rather than determination of a single optimal route as shortest path algorithms produce. In this paper, we focus on population exposure risk mitigation via production of truck-routes by solving a variant of the Vehicle Routing Problem. For this purpose we employ a single parameter metaheuristic algorithm. A case study of this approach is also demonstrated.

[1]  Christos D. Tarantilis,et al.  A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem , 2002, Int. J. Comput. Math..

[2]  Gülay Barbarosoglu,et al.  A tabu search algorithm for the vehicle routing problem , 1999, Comput. Oper. Res..

[3]  Erhan Erkut,et al.  Catastrophe Avoidance Models for Hazardous Materials Route Planning , 2000, Transp. Sci..

[4]  Vedat Verter,et al.  Incorporating Insurance Costs in Hazardous Materials Routing Models , 1997, Transp. Sci..

[5]  C. D. J. Waters.  A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement , 1987 .

[6]  James P. Kelly,et al.  A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem , 1999, INFORMS J. Comput..

[7]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[10]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[11]  Enrique Mota,et al.  Heuristic Procedures for the Capacitated Vehicle Routing Problem , 2000, Comput. Optim. Appl..

[12]  Jianjun Zhang,et al.  Using GIS to assess the risks of hazardous materials transport in networks , 2000, Eur. J. Oper. Res..

[13]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[14]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[15]  César Rego,et al.  Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms , 2001, Parallel Comput..

[16]  Jean-Claude Thill,et al.  Spatial decision support system for hazardous material truck routing , 2000 .

[17]  Vedat Verter,et al.  Modeling of Transport Risk for Hazardous Materials , 1998, Oper. Res..

[18]  Alex Van Breedam,et al.  Comparing descent heuristics and metaheuristics for the vehicle routing problem , 2001, Comput. Oper. Res..

[19]  T. B. Boffey,et al.  Optimal location of routes for vehicles transporting hazardous materials , 1995 .

[20]  Mark A. Turnquist,et al.  Modeling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing/Scheduling and Facility Location , 1991, Transp. Sci..

[21]  Christos D. Tarantilis,et al.  Using a spatial decision support system for solving the vehicle routing problem , 2002, Inf. Manag..

[22]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[23]  S Bonvicini,et al.  Hazardous materials transportation: a risk-analysis-based routing methodology. , 2000, Journal of hazardous materials.

[24]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.