Journal of the ACM (JACM)
Modeling of Transport Risk for Hazardous Materials
Operations Research
Routing and scheduling of hazardous materials shipments: algorithmic approaches to managing spent nuclear fuel transport (multiobjective, shortest path, curfews)
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Multicriteria Optimization
A new approach to multiobjective A* search
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Multiobjective A* search with consistent heuristics
Journal of the ACM (JACM)
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Accurate calculation of hazardous materials transport risks
Operations Research Letters
Transport risk models for hazardous materials: revisited
Operations Research Letters
Cooperative particle swarm optimization for multiobjective transportation planning
Applied Intelligence
Hi-index | 0.00 |
This paper describes the application of multiobjective heuristic search algorithms to the problem of hazardous material (hazmat) transportation. The selection of optimal routes inherently involves the consideration of multiple conflicting objectives. These include the minimization of risk (e.g. the exposure of the population to hazardous substances in case of accident), transportation cost, time, or distance. Multiobjective analysis is an important tool in hazmat transportation decision making. This paper evaluates the application of multiobjective heuristic search techniques to hazmat route planning. The efficiency of existing algorithms is known to depend on factors like the number of objectives and their correlations. The use of an informed multiobjective heuristic function is shown to significantly improve efficiency in problems with two and three objectives. Test problems are defined over random graphs and over a real road map.