In this article, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A relaxed version of this problem in which the path does not have to be elementary has been the backbone of a number of solution procedures based on column generation for several important problems, such as vehicle routing and crew pairing. In many cases relaxing the restriction of an elementary path resulted in optimal solutions in a reasonable computation time. However, for a number of other problems, the elementary path restriction has too much impact on the solution to be relaxed or might even be necessary. We propose an exact solution procedure for the ESPPRC, which extends the classical label correcting algorithm originally developed for the relaxed (nonelementary) path version of this problem. We present computational experiments of this algorithm for our specific problem and embedded in a column generation scheme for the classical Vehicle Routing Problem with Time Windows. © 2004 Wiley Periodicals, Inc.
https://doi.org/10.1002/net.20033Cite as:
@article{Feillet_2004,
doi = {10.1002/net.20033},
url = {https://doi.org/10.1002%2Fnet.20033},
year = 2004,
publisher = {Wiley},
volume = {44},
number = {3},
pages = {216--229},
author = {Dominique Feillet and Pierre Dejax and Michel Gendreau and Cyrille Gueguen},
title = {An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems},
journal = {Networks}
}