The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46:316–329Link, Google Scholar
• Beasley J. E., Christofides N. An algorithm for the resource constrained shortest path problem. Networks (1989) 19:379–394Crossref, Google Scholar
• Bentley J. L. Multidimensional divide-and-conquer. Comm. ACM (1980) 23:214–229Crossref, Google Scholar
• Chiang W.-C., Russell R. A. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J. Comput. (1997) 9:417–430Link, Google Scholar
• Cordeau J.-F., Desaulniers G., Desrosiers J., Solomon M. M., Soumis F., Toth P., Vigo D. VRP with time windows. The Vehicle Routing Problem (2002) (SIAM, Philadelphia, PA) 155–194Crossref, Google Scholar
• CPLEX Using the CPLEX Callable Library, Version 5.0. (1997) . Technical report, CPLEX, Division of ILOG, Incline Village, NVGoogle Scholar
• Desaulniers G., Desrosiers J., Ioachim I., Solomon M. M., Soumis F., Villeneuve D., Crainic T., Laporte G. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Fleet Management and Logistics (1998) (Kluwer Academic Publisher, Boston, MA) 57–93Crossref, Google Scholar
• Desrochers M., Soumis F. A generalized permanent labelling algorithm for the shortest path problem with time windows. Inform. Systems Oper. Res. (1988) 26:191–212Crossref, Google Scholar
• Desrochers M., Desrosiers J., Solomon M. M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40:342–354Link, Google Scholar
• Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. (1994) 42:977–978Link, Google Scholar
• Dumas Y., Desrosiers J., Soumis F. The pick-up and delivery problem with time windows. Eur. J. Oper. Res. (1991) 54:7–22Crossref, Google Scholar
• Gamache M., Soumis F., Marquis G. A column generation approach for large-scale aircrew rostering problems. Oper. Res. (1999) 47:247–263Link, Google Scholar
• Gambardella L. M., Taillard É. D., Agazzi G., Corne D., Dorigo M., Glover F. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. New Ideas in Optimization (1999) (McGraw-Hill, London) 63–76Google Scholar
• Guéguen C., Dejax P. J., Dror M., Gendreau M. An exact algorithm for the elementary shortest path problem with resource constraints. (1998) . Technical report G98-04-A, Laboratoire Productique Logistique, École Centrale, Paris, FranceGoogle Scholar
• Houck D. J., Picard J. C., Queyranne M., Vemuganti R. R. The travelling salesman problem as a constrained shortest path problem: Theory and computational experience. Opsearch (1980) 17:93–109Google Scholar
• Kallehauge B., Larsen J., Madsen O. B. G. Lagrangean duality applied on vehicle routing with time windows—Experimental results. (2001) . Technical report IMM-TR-2001-9, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, DenmarkGoogle Scholar
• Kohl N. Exact methods for time constrained routing and related scheduling problems. (1995) . Ph.D. thesis, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, DenmarkGoogle Scholar
• Kohl N., Desrosiers J., Madsen O. B. G., Solomon M. M., Soumis F. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. (1999) 33:101–116Link, Google Scholar
• Kolen A. W. J., Rinnooy-Kan A. H. G., Trienekens H. W. J. M. Vehicle routing with time windows. Oper. Res. (1987) 35:266–274Link, Google Scholar
• Kung H. T., Luccio F., Preparata F. P. On finding maxima of a set of vectors. J. ACM (1975) 22:469–476Crossref, Google Scholar
• Larsen J. Parallelization of the vehicle routing problem with time windows. (1999) . Ph.D. thesis, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, DenmarkGoogle Scholar
• Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Res. (1989) 23:377–386Crossref, Google Scholar
• Powell W. B., Chen Z.-L., Pardalos P., Du D. A generalized threshold algorithm for the shortest path problem with time windows. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1998) Vol. 40(American Mathematical Society, Providence, RI) 303–318Crossref, Google Scholar
• Rich J. A computational study of vehicle routing applications. (1999) . Ph.D. thesis, Department of Computational and Applied Mathematics, Rice University, Houston, TexasGoogle Scholar
• Rochat Y., Taillard É. D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1:147–167Crossref, Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Taillard É. D., Gambardella L. M., Gendreau M., Potvin J. Y. Adaptive memory programming: A unified view of metaheuristics. Eur. J. Oper. Res. (2001) 135:1–16Crossref, Google Scholar