Title

The multi-criteria constrained shortest path problem

Document Type

Journal article

Source Publication

Transportation Research. Part E: Logistics and Transportation Review

Publication Date

5-2017

Volume

101

First Page

13

Last Page

29

Publisher

Pergamon Press

Keywords

Routing, Constrained shortest path, Multi-criteria, Pareto-optimal paths

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.

DOI

10.1016/j.tre.2017.02.002

Print ISSN

13665545

E-ISSN

18785794

Funding Information

This research was supported by the National Natural Science Foundation of China (Nos. 71431007, 71225004, and 71601054). {71601054, 71225004, 71431007}

Publisher Statement

Copyright © 2017 Elsevier Ltd. All rights reserved. Access to external full text or publisher's version may require subscription.

Full-text Version

Publisher’s Version

Language

English

Recommended Citation

Shi, N., Zhou, S., Wang, F., Tao, Y., & Liu, L. (2017). The multi-criteria constrained shortest path problem. Transportation Research. Part E: Logistics and Transportation Review, 101, 13-29. doi: 10.1016/j.tre.2017.02.002

Share

COinS