Abstract
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.
Similar content being viewed by others
References
Barbarosoglu, G. and Ozgur D. (1999). A tabu search algorithm for the vehicle routing problem. Computers and Operations Research vol. 26(3), 255–270.
Campos, V. and Mota, E. (2000). Heuristic procedures for the capacitated vehicle routing problem. Computational Optimization and Applications vol. 16(3), 265–277.
Christofides, N. Mingozzi, A. and Toth, P. (1979). The vehicle routing problem, in: Combinatorial Optimization, (Christofides, N., Mingozzi, A., Toth P. and Sandi C, ed.). Wiley, Chichester, 315–338.
Dueck, G. and Scheuer, T. (1990). Threshold accepting. A general purpose optimization algorithm appearing superior to simulated annealing, Journal of Computational Physics vol. 90(1), 161–175.
Erkut, E. and Verter, V. (1998). Modeling of transport risk for hazardous materials. Operations Research vol. 46(5), 625–642
Erkut, E. and Ingolfsson, A. (2000). Catastrophe avoidance models for hazardous materials route planning. Transportation Science vol. 34(2), 165–179.
Frank, W.C., Thill, J.-C. and Batta, R. (2000). Spatial decision support system for hazardous material truck routing. Transportation Research Part C: Emerging Technologies vol. 8, 337–359
Ichoua S., Gendreau M. and Potvin J-Y. (2000) Diversion Issues in Real Time Vehicle Dispatching. Transportation Science vol. 34(4), 426–438.
Karkazis J. and Boffey, T.B. (1995). Optimal location of routes for vehicles transporting hazardous materials. European Journal of Operational Research vol. 86(2), 201–215
Kelly, J.P and Xu, J. (1999). A set-partitioning-based heuristic for the vehicle routing problem. Journal on Computing vol. 1(1), 161–172.
Kirkpatrick S., Gelatt CD. and Vecchi M.P. (1983). Optimization by simulated annealing. Science vol. 220, 671–680.
Laporte G., Gendreau, M., Potvin J-Y and Semet F. (2000). Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research vol.7, 285–300.
List, G.F, Mirchandani, P.B., Turnquist, M.A. and Zografos, K.G. (1991). Modeling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing, Scheduling and Facility Location. Transportation Science vol.25, 100–114.
Leonelli, P., Bonvicini, S. and Spadoni, G. (2000). Hazardous materials transportation: a risk-analysis-based routing methodology. Journal of Hazardous Materials vol. 71, 283–300.
Osman, I.H. (1993). Metastrategy simulated annealing and tabu search algorithms for combinatorial optimisation problems. Annals of Operations Research vol. 41, 421–451.
Rego, C. (2001). Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Parallel Computing vol.27, 201–222.
Rochat, Y. and Taillard, E.D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics vol. 1, 147–167.
Taillard, E. (1993). Parallel iterative search methods for vehicle routing problems. Networks vol. 23, 661–672.
Tarantilis, C.D. and Kiranoudis, C.T. (2001) Using a spatial decision support system for solving the vehicle routing problem. Information and Management (accepted).
Tarantilis, C.D. and Kiranoudis, C.T. (2001) A list based threshold accepting algorithm for the capacitated vehicle routing problem. International Journal of Computer Mathematics (accepted)
Van Breedam, A. (2001). Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers and Operations Research vol. 28(4), 289–315
Verter, V. and Erkut, E. (1997). Incorporating insurance costs in hazardous materials routing models. Transportation Science vol. 31(3), 227–236
Waters, C.D.J. (1987). A solution procedure for the vehicle scheduling problem based on iterative route improvement. Journal of the Operational Research Society 38, 833–839.
Zhang, J. Hodgson, J. and Erkut E. (2000). Using GIS to assess the risks of hazardous materials transport in networks. European Journal of Operational Research vol. 121(2), 316–329.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tarantilis, C., Kiranoudis, C.T. Using the vehicle routing problem for the transportation of hazardous materials. Oper Res Int J 1, 67–78 (2001). https://doi.org/10.1007/BF02936400
Issue Date:
DOI: https://doi.org/10.1007/BF02936400