Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Computer-Aided Civil and Infrastructure Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
