A platform for research: civil engineering, architecture and urbanism
Optimal Routing with Multiple Objectives: Efficient Algorithm and Application to the Hazardous Materials Transportation Problem
Abstract: This article presents an efficient parametric optimization method for the biobjective optimal routing problem. The core process is a bounded greedy single‐objective shortest path approximation algorithm. This method avoids the computationally intensive dominance check with labeling methods and overcomes the deficiency with existing parametric methods that can only find extreme nondominated paths. Moreover, we propose a decomposition scheme to convert a multiobjective routing problem into a number of biobjective problems. We then compare its computational performance against the classic label‐correcting method over a set of synthetically generated random networks and illustrate its algorithmic advances and solution behaviors by an example application of routing hazardous materials in a U.S. northeastern highway network.
Optimal Routing with Multiple Objectives: Efficient Algorithm and Application to the Hazardous Materials Transportation Problem
Abstract: This article presents an efficient parametric optimization method for the biobjective optimal routing problem. The core process is a bounded greedy single‐objective shortest path approximation algorithm. This method avoids the computationally intensive dominance check with labeling methods and overcomes the deficiency with existing parametric methods that can only find extreme nondominated paths. Moreover, we propose a decomposition scheme to convert a multiobjective routing problem into a number of biobjective problems. We then compare its computational performance against the classic label‐correcting method over a set of synthetically generated random networks and illustrate its algorithmic advances and solution behaviors by an example application of routing hazardous materials in a U.S. northeastern highway network.
Optimal Routing with Multiple Objectives: Efficient Algorithm and Application to the Hazardous Materials Transportation Problem
Xie, Chi (author) / Waller, S. Travis (author)
Computer‐Aided Civil and Infrastructure Engineering ; 27 ; 77-94
2012-02-01
18 pages
Article (Journal)
Electronic Resource
English
Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation Networks
British Library Online Contents | 1998
|Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation Networks
British Library Conference Proceedings | 1998
|Half Open Multi-Depot Heterogeneous Vehicle Routing Problem for Hazardous Materials Transportation
DOAJ | 2021
|A Path Based Algorithm for Solve the Hazardous Materials Transportation Bilevel Problem
British Library Conference Proceedings | 2013
|