Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5110532 | Transportation Research Part E: Logistics and Transportation Review | 2017 | 17 Pages |
Abstract
In this study, we propose an exact method for finding all the Pareto-optimal paths for a multi-criteria constrained shortest path problem. We show that solving the special bi-criteria problem is equivalent to generating at most |P| constrained shortest paths with successive tightened constraints, where |P| is the total number of all Pareto-optimal paths. For the general multi-criteria case, we propose a decomposition procedure and theoretically prove that this method can identify all the Pareto-optimal paths from at most (u-1)!|P| candidate paths, where u is the number of criteria. Numerical studies demonstrate that our algorithm is highly efficient and robust.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Business and International Management
Authors
Ning Shi, Shaorui Zhou, Fan Wang, Yi Tao, Liming Liu,