A tabu search algorithm for the safe transportation of hazardous materials

Authors:
L. Zhang;S. Guo;Y. Zhu;A. Lim
Affiliations:
Zhongshan University, Guangzhou, P.R.China;Zhongshan University, Guangzhou, P.R.China;Univ of California, San Diego, La Jolla, CA, The United States;Hong Kong Univ of Sci & Tech, Clear Water Bay, Kowloon, Hong Kong
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 5
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Tabu Search

Tabu Search
Modeling of Transport Risk for Hazardous Materials

Operations Research
Catastrophe Avoidance Models for Hazardous Materials Route Planning

Transportation Science
Designing a Road Network for Hazardous Materials Transportation

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we study the problem of the safe transportation of hazardous materials, which is an important operational problem and has been studied extensively in the literature. We outline previous work and propose a new model that is a variant of the vehicle routing problem with time windows (VRPTW). The objective is to find a schedule to guarantee the safety of all vehicles. We propose a tabu search (TS) heuristic with a dynamic penalty mechanism to obtain good solutions. A realistic data generation mechanism is also presented and the elaborate computational results show the strengths of our algorithms.