A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem

References

• Attanasio A., Cordeau J.-F., Ghiani G., Laporte G. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. (2004) 30(3):377–387Crossref, Google Scholar
• Beaudry A., Laporte G., Melo T., Nickel S. Dynamic transportation of patients in hospitals. OR Spectrum (2010) 32(1):77–107Crossref, Google Scholar
• Berbeglia G., Cordeau J.-F., Laporte G. Dynamic pickup and delivery problems. Eur. J. Oper. Res. (2010a) 202(1):8–15Crossref, Google Scholar
• Berbeglia G., Pesant G., Rousseau L.-M. Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Sci. (2010b) . ePub ahead of print September 24, http://dx.doi.org/10.1287/trsc.1100.0336Google Scholar
• Borndörfer R., Klostermeier F., Grötschel M., Küttner C. Telebus Berlin: Vehicle scheduling in a dial-a-ride system. (1997) . Technical Report SC 97–23, Konrad-Zuse-Zentrum fur Informationstechnik, BerlinGoogle Scholar
• Cordeau J.-F. A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. (2006) 54(3):573–586Link, Google Scholar
• Cordeau J.-F., Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Res. Part B (2003) 37(6):579–594Crossref, Google Scholar
• Cordeau J.-F., Laporte G. The dial-a-ride problem: Models and algorithms. Ann. Oper. Res. (2007) 153(1):29–46Crossref, Google Scholar
• Cordeau J.-F., Laporte G., Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. (2001) 52(8):928–936Crossref, Google Scholar
• Coslovich L., Pesenti R., Ukovich W. A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. Eur. J. Oper. Res. (2006) 175(3):1605–1615Crossref, Google Scholar
• Desrosiers J., Dumas Y., Soumis F. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Amer. J. Math. Management Sci. (1986) 6(3–4):301–325Crossref, Google Scholar
• Focacci F., Lodi A., Milano M. A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. (2002) 14(4):403–417Link, Google Scholar
• Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Sci. (1994) 40(10):1276–1290Link, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Hoogeveen J. A., Vestjens A. P. A., Cunningham W. H., McCormick S. T., Queyranne M. Optimal on-line algorithms for single-machine scheduling. Conf. Integer Programming Combin. Optim., Vol. 1084 (1996) (Springer-Verlag, Berlin) 404–414Lecture Notes in Computer ScienceCrossref, Google Scholar
• Horn M. E. T. Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Res. Part C (2002) 10(1):35–63Crossref, Google Scholar
• Madsen O. B. G., Ravn H. F., Rygaard J. M. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. (1995) 60(1):193–208Crossref, Google Scholar
• Mitrović-Minić S., Laporte G. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38(7):635–655Crossref, Google Scholar
• Psaraftis H. N. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Sci. (1980) 14(2):130–154Link, Google Scholar
• Rekiek B., Delchambre A., Saleh H. A. Handicapped person transportation: An application of the grouping genetic algorithm. Engrg. Appl. Artificial Intelligence (2006) 19(5):511–520Crossref, Google Scholar
• Ropke S., Cordeau J.-F., Laporte G. Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks (2007) 49(4):258–272Crossref, Google Scholar
• Spivey M. Z., Powell W. B. The dynamic assignment problem. Transportation Sci. (2004) 38(4):399–419Link, Google Scholar
• Toth P., Vigo D., Osman I. H., Kelly J. P. Fast local search algorithms for the handicapped persons transportation problem. Meta-Heuristics Theory and Applications (1996) (Kluwer Academic Publishers, Boston) 677–690Crossref, Google Scholar
• Van Hentenryck P.Constraint Satisfaction in Logic Programming (1989) (MIT Press, Cambridge, MA) Google Scholar
• van Hoeve W.-J., Katriel I., Rossi F., Van Beek P., Walsh T. Global constraints. Handbook of Constraint Programming (2006) (Elsevier, Amsterdam) 169–208Crossref, Google Scholar
• Xiang Z., Chu C., Chen H. The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments. Eur. J. Oper. Res. (2008) 185(4):534–551Crossref, Google Scholar
• Yuen C. W., Wong K. I., Han A. F. Waiting strategies for the dynamic dial-a-ride problem. Internat. J. Environment Sustainable Dev. (2009) 8(3–4):314–329Crossref, Google Scholar