A Multiple-Starting-Path Approach to the Resource-Constrained th Elementary Shortest Path Problem

Hyunchul Tae and Byung-In Kim

Mathematical Problems in Engineering, 2015, vol. 2015, 1-7

Abstract:

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 k th elementary shortest path problem (RCKESPP) is a generalization of the RCESPP that aims to determine the k th shortest path when a set of 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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/803135.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/803135.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:803135

DOI: 10.1155/2015/803135

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().