![](/images/graphics-bg.png)
A Multiple-Starting-Path Approach to the Resource-Constrained kth Elementary Shortest Path Problem
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-03-22
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
The resource-constrained elementary shortest path problem (RCESPP) aims to determine the shortest elementary path from the origin to the sink that satisfies the resource constraints.
The resource-constrained kth elementary shortest path problem (RCKESPP) is a generalization of the RCESPP that aims to determine the kth shortest path when a set of k-1 shortest paths is given.
To the best of our knowledge, the RCKESPP has been solved most efficiently by using Lawler’s algorithm.
This paper proposes a new approach named multiple-starting-path (MSP) to the RCKESPP.
The computational results indicate that the MSP approach outperforms Lawler’s algorithm.
American Psychological Association (APA)
Tae, Hyunchul& Kim, Byung-In. 2015. A Multiple-Starting-Path Approach to the Resource-Constrained kth Elementary Shortest Path Problem. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-7.
https://search.emarefa.net/detail/BIM-1074759
Modern Language Association (MLA)
Tae, Hyunchul& Kim, Byung-In. A Multiple-Starting-Path Approach to the Resource-Constrained kth Elementary Shortest Path Problem. Mathematical Problems in Engineering No. 2015 (2015), pp.1-7.
https://search.emarefa.net/detail/BIM-1074759
American Medical Association (AMA)
Tae, Hyunchul& Kim, Byung-In. A Multiple-Starting-Path Approach to the Resource-Constrained kth Elementary Shortest Path Problem. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-7.
https://search.emarefa.net/detail/BIM-1074759
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1074759