An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

@article{Feillet2004AnEA,
title={An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems},
author={Dominique Feillet and Pierre Dejax and Michel Gendreau and Cyrille Gueguen},
journal={Networks},
year={2004},
volume={44},
pages={216-229}
}

In this paper, 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â€¦Â CONTINUE READING