|
|||||
|
|
Accelerated label setting algorithms for the elementary resource constrained shortest path problem |
|
| Authors: | Natashia Boland Irina Dumitrescu |
| Affiliation: | a Department of Mathematics and Statistics, The University of Melbourne, Australia b Canada Research Chair in Distribution Management, HEC Montréal, CRT, C.P. 6128, Succursale Centre-ville, Canada H3C 3J7 |
| Abstract: | A label setting algorithm for solving the Elementary Resource Constrained Shortest Path Problem, using node resources to forbid repetition of nodes on the path, is implemented. A state-space augmenting approach for accelerating run times is considered. Several augmentation strategies are suggested and compared numerically. |
| Keywords: | Shortest paths Networks Dynamic programming Column generation |
| 本文献已被 ScienceDirect 等数据库收录！ | |