A Multiple-Starting-Path Approach to the Resource-Constrained kth Elementary Shortest Path Problem
SCIE
SCOPUS
- Title
- A Multiple-Starting-Path Approach to the Resource-Constrained kth Elementary Shortest Path Problem
- Authors
- Tae, H; Kim, BI
- Date Issued
- 2015-01
- Publisher
- HINDAWI PUBLISHING CORPORATION
- 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 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.
- Keywords
- VEHICLE-ROUTING PROBLEM; EXACT ALGORITHM; COLUMN GENERATION; TIME WINDOWS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/13200
- DOI
- 10.1155/2015/803135
- ISSN
- 1024-123X
- Article Type
- Article
- Citation
- MATHEMATICAL PROBLEMS IN ENGINEERING, vol. 2015, 2015-01
- Files in This Item:
-
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.