Adaptive Labeling Algorithms for the Dynamic Assignment Problem

References

• Atkinson J. B. A Greedy Look-Ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows. J. Opns. Res. (1994) 45:673–684Google Scholar
• Ball M., Golden B., Assad A., Bodin L. Planning for Truck Fleet Size in the Presence of a Common Carrier Option. Decision Sci. (1981) 14:103–120Crossref, Google Scholar
• Bartholdi J. J., Platzman L. K. Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space. Management Sci. (1988) 34:291–305Link, Google Scholar
• Bertsekas D. P. The Auction Algorithm: A Distributed Relaxation Method for the Assignment Problem. Ann. Opns. Res. (1988) 14:105–123Crossref, Google Scholar
• Bodin L., Golden B., Assad A., Ball M. Routing and Scheduling of Vehicles and Crews. Comp. Opns. Res. (1983) 63–211Google Scholar
• Desrosiers J., Solomon M., Soumis F., Monma C., Magnanti T., Ball M. Time Constrained Routing and Scheduling. Handbook in Operations Research and Management Science (1995) (North Holland, Amsterdam). Volume on NetworksGoogle Scholar
• Desrosiers J., Soumis F., Desrochers M. Routing with Time Windows by Column Generation. Networks (1984) 14:545–565Crossref, Google Scholar
• Gendreau M., Hertz A., Laporte G. A Tabu Search Heuristic for the Vehicle Routing Problem. Management Sci. (1994) 40:1276–1290Link, Google Scholar
• Glover F. Tabu Search. Part I. ORSA J. Comp. (1989) 1:190–206Link, Google Scholar
• Glover F. Tabu Search. Part II. ORSA J. Comp. (1990) 2:4–32Link, Google Scholar
• Golden B., Assad A. Vehicle Routing with Time Window Constraints. Amer. J. Math. Management Sci. (1986) 6:251–260Crossref, Google Scholar
• Marsten R. E., Shepardson F. Exact Solution of Crew Scheduling Problems Using the Set Partitioning Model: Recent Successful Applications. Networks (1981) 11:167–177Crossref, Google Scholar
• Psaraftis H., Golden B. L., Assad A. A. Dynamic Vehicle Routing Problems. Vehicle Routing: Methods and Studies (1988) (North Holland, Amsterdam)223–248Google Scholar
• Savelsbergh M. W. P. Local Search in Routing Problem with Time Windows. Ann. Opns. Res. (1985) 4:285–305Crossref, Google Scholar
• Solomon M. Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Opns. Res. (1987) 35:254–265Link, Google Scholar
• Solomon M., Baker E., Schaffer J., Golden B. L., Assad A. A. Vehicle Routing and Scheduling Problems with Time Window Constraints: Efficient Implementation of Solution Improvement Procedures. Vehicle Routing: Methods and Studies (1988) 16(North Holland, Amsterdam)85–106Google Scholar