Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 803135, 7 pages
Research Article

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

Department of Industrial and Management Engineering, Pohang University of Science and Technology (POSTECH), Pohang 790-784, Republic of Korea

Received 12 September 2014; Accepted 9 March 2015

Academic Editor: Dong Ngoduy

Copyright © 2015 Hyunchul Tae and Byung-In Kim. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 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.