The multi-criteria constrained shortest path problem

被引：24
|
作者：
Shi, Ning [1 ]
Zhou, Shaorui [1 ]
Wang, Fan [1 ]
Tao, Yi [2 ]
Liu, Liming [3 ]
机构：
[1] Sun Yat Sen Univ, Sch Business, Guangzhou, Guangdong, Peoples R China
[2] Guangdong Univ Technol, Sch Business, Guangzhou, Guangdong, Peoples R China
[3] Lingnan Univ Hongkong, Sch Business, Tuen Mun, Hong Kong, Peoples R China
来源：
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2017年 / 101卷
基金：
中国国家自然科学基金;
关键词：
Routing; Constrained shortest path; Multi-criteria; Pareto-optimal paths; BI-OBJECTIVE OPTIMIZATION; INTERMODAL TRANSPORTATION; HAZARDOUS MATERIALS; ROUTING PROBLEM; NETWORK DESIGN; ALGORITHM; MODEL; ENUMERATION; SOLVE;
D O I：
10.1016/j.tre.2017.02.002
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
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. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码：13 / 29
页数：17
相关论文
共 50 条
  • [41] Acceleration strategies for the weight constrained shortest path problem with replenishment
    Bolivar, Manuel A.
    Lozano, Leonardo
    Medaglia, Andres L.
    OPTIMIZATION LETTERS, 2014, 8 (08) : 2155 - 2172
  • [42] Models and methods for the constrained shortest path problem and its variants
    Pugliese, Luigi Di Puglia
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (04): : 395 - 396
  • [43] Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem
    Pan, Yiyong
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2019, 2019
  • [44] A penalty function heuristic for the resource constrained shortest path problem
    Avella, P
    Boccia, M
    Sforza, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 142 (02) : 221 - 230
  • [45] The Constrained Shortest Path Problem: Algorithmic Approaches and an Algebraic Study with
    Xiao, Ying
    Thulasiraman, Krishnaiyan
    Xue, Guoliang
    Juettner, Alpar
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2005, 2 (02) : 63 - 86
  • [46] Joint chance constrained shortest path problem with Copula theory
    Nodeh, Zohreh Hosseini
    Azar, Ali Babapour
    Shiraz, Rashed Khanjani
    Khodayifar, Salman
    Pardalos, Panos M.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (01) : 110 - 140
  • [47] NETWORK REDUCTION FOR THE ACYCLIC CONSTRAINED SHORTEST-PATH PROBLEM
    HASSAN, MMD
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 63 (01) : 124 - 132
  • [48] Technology and Business Practice Adoption as a Constrained Shortest Path Problem
    Formaneck, Steven D.
    Cozzarin, Brian P.
    PROCEEDINGS OF PICMET 09 - TECHNOLOGY MANAGEMENT IN THE AGE OF FUNDAMENTAL CHANGE, VOLS 1-5, 2009, : 1512 - +
  • [49] SFC Constrained Privacy-Preserved Shortest Path Problem
    You C.-Q.
    Li L.-M.
    Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2020, 49 (04): : 537 - 541
  • [50] A rollout algorithm for the resource constrained elementary shortest path problem
    Guerriero, Francesca
    Pugliese, Luigi Di Puglia
    Macrina, Giusy
    OPTIMIZATION METHODS & SOFTWARE, 2019, 34 (05): : 1056 - 1074
12345