A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances

References

• Berbeglia G (2009) Complexity analyses and algorithms for pickup and delivery problems. Ph.D. thesis, HEC Montreal, Montreal.Google Scholar
• Berbeglia G, Pesant G, Rousseau L-M (2011) Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Sci. 45:399–412.Link, Google Scholar
• Bianco L, Mingozzi A, Ricciardelli S, Spadoni M (1994) Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming. INFOR 32:19–31.Google Scholar
• Bodin LD, Sexton T (1986) The multi-vehicle subscriber dial-a-ride problem. TIMS Stud. Management Sci. 26:73–86.Google Scholar
• Borndörfer R, Grötschel M, Klostermeier F, Küttner C (1997) Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin.Google Scholar
• Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54:573–586.Link, Google Scholar
• Cordeau J-F, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Res. Part B 37:579–594.Crossref, Google Scholar
• Cordeau J-F, Laporte G, Potvin J-Y, Savelsbergh MWP (2007) Transportation on demand. Barnhart C, Laporte G, eds. Transportation (North-Holland, Amsterdam), 429–466.Crossref, Google Scholar
• Desrosiers J, Dumas Y, Soumis F (1986) A dynamic programming solution of the large-scale single vehicle dial-a-ride problem with time windows. Amer. J. Math. Management Sci. 6:301–325.Crossref, Google Scholar
• Desrosiers J, Dumas Y, Soumis F, Taillefer S, Villeneuve D (1991) An Algorithm for Mini-Clustering in Handicapped Transport, Les Cahiers du GERAD, G-91-02 (HEC Montreal, Montreal).Google Scholar
• Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54:7–22.Crossref, Google Scholar
• Häme LE (2011) An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows. Eur. J. Oper. Res. 209:11–22.Crossref, Google Scholar
• Hernández-Pérez H, Salazar-González J-J (2009) The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 196:987–995.Crossref, Google Scholar
• Jaw JJ, Odoni AR, Psaraftis HN, Wilson NHM (1986) A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Transportation Res. Part B 20:243–257.Crossref, Google Scholar
• Jokinen J-P, Sihvola T, Hyytiä E, Sulonen R (2011) Why urban mass demand responsive transport? IEEE Forum on Integrated and Sustainable Transportation Systems (FISTS), Vienna.Crossref, Google Scholar
• Psaraftis HN (1980) A dynamic programming solution to the single vehicle, many-to-many immediate request dial-a-ride problem. Transportation Sci. 14:130–154.Link, Google Scholar
• Psaraftis HN (1983) An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Sci. 17:351–357.Link, Google Scholar
• Ropke S, Cordeau J-F, Laporte G (2007) Models and branch-and-cut algorithm for pickup and delivery problems with time windows. Networks 49:258–272.Crossref, Google Scholar
• Sexton T (1979) The single vehicle many-to-many routing and scheduling problem. Ph.D. dissertation, SUNY at Stony Brook, Stony Brook, NY.Google Scholar
• Sexton TR, Bodin LD (1985a) Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. Transportation Sci. 19:378–410.Link, Google Scholar
• Sexton TR, Bodin LD (1985b) Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing. Transportation Sci. 19:411–435.Link, Google Scholar
• Toth P, Vigo D (1996) Fast local search algorithms for the handicapped persons transportation problem. Osman IH, Kelly JP, eds. Meta-Heuristics: Theory and Applications (Kluwer Academic Publishers, Norwell, MA), 23–33.Crossref, Google Scholar
• Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transportation Sci. 31:60–71.Link, Google Scholar
• Wood DR (1997) An algorithm for finding a maximum clique in a graph. Oper. Res. Lett. 21(5):211–217.Crossref, Google Scholar