The multi-criteria constrained shortest path problem

Shi, Ning; Zhou, Shaorui; Wang, Fan; Tao, Yi; Liu, Liming

doi:10.1016/j.tre.2017.02.002

Cited by 25 publications

(12 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Motivation. The constrained shortest path problem corresponds to the extension of the shortest path problem, and this is intended to obtain a shortest path that meets several constraints [1,2]. The deficiency of classical constrained shortest path problems is that they assume the weights of each link as deterministic and not stochastic [3].…”

Section: Introductionmentioning

confidence: 99%

Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Pan

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The study focuses on a multiple constrained reliable path problem in which travel time reliability and resource constraints are collectively considered. Nonlinear optimization model is developed to model constrained robust shortest path problem. The dual nature of the proposed problem is deduced based on the Lagrangian duality theory. An efficient algorithm based on Lagrangian dual relaxation is designed to solve constrained robust shortest path problem. An extension problem that considers multiple constraints is discussed. Numerical studies indicate that the proposed algorithm is efficient in terms of obtaining the close-to-optimal solutions within reasonable computational times.

show abstract

Section: Introductionmentioning

confidence: 99%

Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Pan

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Generally speaking, the proposed pathfinding algorithm belongs to the class of multicriteria shortest path problems initiated by Hansen, 1980 , Martins, 1984 . Most existing studies use either a weighting function to convert multiple criteria into a single criterion ( Modesti and Sciomachen, 1998 , Horváth and Kis, 2018 ) or find the set of non-dominated Pareto paths ( Martins, 1984 , Guerriero and Musmanno, 2001 , Disser et al, 2008 , Androutsopoulos and Zografos, 2009 , Reinhardt and Pisinger, 2011 , Chen et al, 2013 ; Delling et al, 2014 , Ambrosino and Sciomachen, 2014 , Shi et al, 2017 ). In comparison with previously developed methods in the literature, the novelty of our method is to consider human perception as an important element in evaluating different options.…”

Section: Introductionmentioning

confidence: 99%

Route guidance ranking procedures with human perception consideration for personalized public transport service

Ceder

Jiang

2020

Transportation Research Part C: Emerging Technologies

View full text Add to dashboard Cite

Highlights Establish an adjusted design framework for optimal paths for public transport users considering their preferences at the requested time of travel. Devise a novel lexicographical comparison methodology with a just noticeable difference (JND) consideration that captures human perception elements combined with preferences over different PT attributes. Establish the theorem for the comparison method to satisfy the axiom of transitivity and develop a sorting algorithm and prove its correctness. Case study using simulation on the Copenhagen PT network and the results of the case study imply a favorable potential for real-life applications.

show abstract

“…The problem of finding the shortest path for a single pair comprising origin and destination has been recognized as a fundamental network problem that has been widely adopted and used in various research and applications, where shortest path is that incurring the least cost as measured by travel distance, time, or ticket price. The mathematical formulation of the classical shortest path problems has been extended based on the applications that include a variety of objective functions and constraints to reflect the specific context to be applied (for recent research, readers may refer to works by [11,[15][16][17][18][19][20][21]). The types of shortest path problems are the (1) single-source shortest path problem, (2) all-pairs shortest path problem, and (3) multi-shortest path problem [22][23][24][25][26][27][28][29][30][31].…”

Section: Introductionmentioning

confidence: 99%

Partial Node Failure in Shortest Path Network Problems

Kim

2019

Sustainability

View full text Add to dashboard Cite

This paper investigates the impact of partial node failure from the perspective of shortest path network problems. We propose a network model that we call shortest path network problems for partial node failure, designed to examine the influence of partial node failures in a flow-based network using a set of indicators. The concept of partial node failure was applied to a special type of hub station, a mandatory transfer in subway or railway systems where multiple lines are arranged for the transfer of passengers. Numerical experiments were carried out on the Washington Metropolitan Area Transit Authority network (WMATA). The results or analysis detail how changes in flow distribution in the network were measured when a station partially failed, as well as ways of identifying heavily impacted stations with respect to different indicators. Various partial node failure scenarios were simulated for origin–destination (OD) flows by days, providing comprehensive information with which to evaluate plans for partial node failures, such as those related to scheduling maintenance, along with insights with which to make contingent plans for potential closure of stations. A major finding emphasizes that the rankings of station criticality are highly sensitive to the different OD flows by days when partial node failures are assumed in network modeling.

show abstract

The multi-criteria constrained shortest path problem

Cited by 25 publications

References 41 publications

Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Route guidance ranking procedures with human perception consideration for personalized public transport service

Partial Node Failure in Shortest Path Network Problems

Contact Info

Product

Resources

About