Skip to main content
SpringerLink
Log in

Typology and literature review for dial-a-ride problems

  • Original Paper
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Dial-a-ride problems consist of designing vehicle routes and time schedules in a system of demand-dependent, collective people transportation. In the standard problem, operational costs are minimized, subject to full demand satisfaction and service level requirements. However, to enhance the practical applicability of solution methods, authors increasingly focus on problem variants that adopt additional real-life characteristics. First, this work introduces an up-to-date classification that distinguishes multiple categories of real-life characteristics. Second, the wide range of solution methods proposed in the literature is reviewed in a structured manner. Although the existing literature is reviewed exhaustively, specific attention is devoted to recent developments. Third, an extensive overview table provides full details on all problem characteristics and solution methods applied in each paper discussed. Fourth, lacunae in research conducted to date and opportunities for future work are identified.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aldaihani, M., & Dessouky, M. M. (2003). Hybrid scheduling methods for paratransit operations. Computers & Industrial Engineering, 45(1), 75–96.

    Article  Google Scholar 

  • Archetti, C., & Speranza, M. G. (2014). A survey on matheuristics for routing problems. EURO Journal on Computational Optimization, 2(4), 223–246.

    Article  Google Scholar 

  • Ascheuer, N., Krumke, S. O., & Rambau, J. (2000). Online dial-a-ride problems: Minimizing the completion time. Lecture Notes in Computer Science, 1770, 639–650.

    Article  Google Scholar 

  • Atahran, A., Lenté, C., & T’kindt, V. (2014). A multicriteria dial-a-ride problem with an ecological measure and heterogeneous vehicles. Journal of Multi-Criteria Decision Analysis, 21(5–6), 279–298.

    Article  Google Scholar 

  • Attanasio, A., Cordeau, J.-F., Ghiani, G., & Laporte, G. (2004). Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing, 30(3), 377–387.

    Article  Google Scholar 

  • Baugh, J. W., Kakivaya, G. K. R., & Stone, J. R. (1998). Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Engineering Optimization, 30(2), 91–123.

    Article  Google Scholar 

  • Beaudry, A., Laporte, G., Melo, T., & Nickel, S. (2010). Dynamic transportation of patients in hospitals. OR Spectrum, 32(1), 77–107.

    Article  Google Scholar 

  • Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010). Dynamic pickup and delivery problems. European Journal of Operational Research, 202(1), 8–15.

    Article  Google Scholar 

  • Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2012). A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS Journal on Computing, 24(3), 343–355.

    Article  Google Scholar 

  • Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2011). Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science, 45(3), 399–412.

    Article  Google Scholar 

  • Borndörfer, R., Grötschel, M., Klostermeier, F., & Küttner, C. (1999). Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Lecture Notes in Economics and Mathematical Systems, 471, 391–422.

    Article  Google Scholar 

  • Braekers, K., Caris, A., & Janssens, G. K. (2014). Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological, 67, 166–186.

    Article  Google Scholar 

  • Braekers, K., & Kovacs, A. (2016). A multi-period dial-a-ride problem with driver consistency. Transportation Research Part B: Methodological, 94, 355–377.

    Article  Google Scholar 

  • Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2014). Rich vehicle routing problem: Survey. ACM Computing Surveys (CSUR), 47(2), 32.

    Article  Google Scholar 

  • Chassaing, M., Duhamel, C., & Lacomme, P. (2016). An ELS-based approach with dynamic probabilities management in local search for the dial-a-ride problem. Engineering Applications of Artificial Intelligence, 48, 119–133.

    Article  Google Scholar 

  • Chevrier, R., Liefooghe, A., Jourdan, L., & Dhaenens, C. (2012). Solving a dial-a-ride problem with a hybrid evolutionary multi-objective approach: Application to demand responsive transport. Applied Soft Computing, 12(4), 1247–1258.

    Article  Google Scholar 

  • Clímaco, J. C. N., Craveirinha, J. M. F., & Pascoal, M. M. B. (2006). An automated reference point-like approach for multicriteria shortest path problems. Journal of Systems Science and Systems Engineering, 15(3), 314–329.

    Article  Google Scholar 

  • Coppi, A., Detti, P., & Raffaelli, J. (2013). A planning and routing model for patient transportation in health care. Electronic Notes in Discrete Mathematics, 41, 125–132.

    Article  Google Scholar 

  • Cordeau, J.-F. (2006). A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3), 573–586.

    Article  Google Scholar 

  • Cordeau, J.-F., & Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6), 579–594.

    Article  Google Scholar 

  • Cordeau, J.-F., & Laporte, G. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153(1), 29–46.

    Article  Google Scholar 

  • Cortés, C. E., Matamala, M., & Contardo, C. (2010). The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. European Journal of Operational Research, 200(3), 711–724.

    Article  Google Scholar 

  • Coslovich, L., Pesenti, R., & Ukovich, W. (2006). A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. European Journal of Operational Research, 175(3), 1605–1615.

    Article  Google Scholar 

  • Crawford, B., Castro, C., & Monfroy, E. (2007a). Solving dial-a-ride problems with a low-level hybridization of ants and constraint programming. Lecture Notes in Computer Science, 4528, 317–327.

    Article  Google Scholar 

  • Crawford, B., Castro, C., Monfroy, E., & Cubillos, C. (2007b). Decomposition approach to solve dial-a-ride problems using ant computing and constraint programming. Lecture Notes in Computer Science, 4729, 448–457.

    Article  Google Scholar 

  • Cremers, M. L. A. G., Klein Haneveld, W. K., & van der Vlerk, M. H. (2009). A two-stage model for a day-ahead paratransit planning problem. Mathematical Methods of Operations Research, 69(2), 323–341.

    Article  Google Scholar 

  • Cubillos, C., Rodríguez, N., & Crawford, B. (2007). A study on genetic algorithms for the DARP problem. Lecture Notes in Computer Science, 4527, 498–507.

    Article  Google Scholar 

  • Cubillos, C., Urra, E., & Rodríguez, N. (2009). Application of genetic algorithms for the DARPTW problem. International Journal of Computers Communications & Control, 4(2), 127–136.

    Article  Google Scholar 

  • Deflorio, F. P., Dalla Chiara, B., Murro, A., (2002). Simulation and performance of DRTS in a realistic environment. In Proceedings of the 9th meeting EWGT on intermodality, sustainability and intelligent transportation systems and 13th mini EURO conference on handling uncertainty in the analysis of traffic and transportation system, Bari, Italy.

  • Desrosiers, J., Dumas, Y., & Soumis, F. (1986). A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. American Journal of Mathematical and Management Sciences, 6(3–4), 301–325.

    Article  Google Scholar 

  • Dessouky, M., Rahimi, M., & Weidner, M. (2003). Jointly optimizing cost, service, and environmental performance in demand-responsive transit scheduling. Transportation Research Part D: Transport and Environment, 8(6), 433–465.

    Article  Google Scholar 

  • Detti, P., Papalini, F., de Lara, G. Z. M., (2016). A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare. Omega (forthcoming).

  • Diana, M., & Dessouky, M. M. (2004). A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B: Methodological, 38(6), 539–557.

    Article  Google Scholar 

  • Diana, M., Dessouky, M. M., & Xia, N. (2006). A model for the fleet sizing of demand responsive transportation services with time windows. Transportation Research Part B: Methodological, 40(8), 651–666.

    Article  Google Scholar 

  • Doerner, K. F., Salazar-González, J.-J., (2014). Pickup-and-delivery problems for people transportation. In Toth, P., Vigo, D. (Eds.), Vehicle routing: Problems, methods, and applications. pp. 193–212.

  • Donoso, M., Sandoval, D., & Cubillos, C. (2009). SIM-MADARP: An agent-based tool for dial-a-ride simulation. Lecture Notes in Artificial Intelligence, 5925, 191–199.

    Google Scholar 

  • Espinoza, D., Garcia, R., Goycoolea, M., Nemhauser, G. L., & Savelsbergh, M. W. (2008a). Per-seat, on-demand air transportation part i: Problem description and an integer multicommodity flow model. Transportation Science, 42(3), 263–278.

    Article  Google Scholar 

  • Espinoza, D., Garcia, R., Goycoolea, M., Nemhauser, G. L., & Savelsbergh, M. W. (2008b). Per-seat, on-demand air transportation part ii: Parallel local search. Transportation Science, 42(3), 279–291.

    Article  Google Scholar 

  • Feuerstein, E., & Stougie, L. (2001). On-line single-server dial-a-ride problems. Theoretical Computer Science, 268(1), 91–105.

    Article  Google Scholar 

  • Firat, M., & Woeginger, G. J. (2011). Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh. Operations Research Letters, 39(1), 32–35.

    Article  Google Scholar 

  • Fu, L. (2002a). Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transportation Research Part B: Methodological, 36(6), 485–506.

    Article  Google Scholar 

  • Fu, L. (2002b). A simulation model for evaluating advanced dial-a-ride paratransit systems. Transportation Research Part A: Policy and Practice, 36(4), 291–307.

    Article  Google Scholar 

  • Fu, L., & Teply, S. (1999). On-line and off-line routing and scheduling of dial-a-ride paratransit vehicles. Computer-Aided Civil and Infrastructure Engineering, 14(5), 309–319.

    Article  Google Scholar 

  • Garaix, T., Artigues, C., Feillet, D., & Josselin, D. (2010). Vehicle routing problems with alternative paths: An application to on-demand transportation. European Journal of Operational Research, 204(1), 62–75.

    Article  Google Scholar 

  • Garaix, T., Artigues, C., Feillet, D., & Josselin, D. (2011). Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation. Computers & Operations Research, 38(10), 1435–1442.

    Article  Google Scholar 

  • Gschwind, T. (2015). Route feasibility testing and forward time slack for the synchronized pickup and delivery problem. Technical report.

  • Gschwind, T., & Irnich, S. (2014). Effective handling of dynamic time windows and its application to solving the dial-a-ride problem. Transportation Science, 49(2), 335–354.

    Article  Google Scholar 

  • Guerriero, F., Bruni, M. E., & Greco, F. (2013). A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem. Asia-Pacific Journal of Operational Research, 30(1), 1–17.

    Article  Google Scholar 

  • Häll, C. H., Andersson, H., Lundgren, J. T., & Värbrand, P. (2009). The integrated dial-a-ride problem. Public. Transport, 1(1), 39–54.

    Google Scholar 

  • Häll, C. H., Högberg, M., & Lundgren, J. T. (2012). A modeling system for simulation of dial-a-ride services. Public Transport, 4(1), 17–37.

    Article  Google Scholar 

  • Häll, C. H., & Peterson, A. (2013). Improving paratransit scheduling using ruin and recreate methods. Transportation Planning and Technology, 36(4), 377–393.

    Article  Google Scholar 

  • Häme, L. (2011). An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows. European Journal of Operational Research, 209(1), 11–22.

    Article  Google Scholar 

  • Häme, L., & Hakula, H. (2013). Routing by ranking: A link analysis method for the constrained dial-a-ride problem. Operations Research Letters, 41(6), 664–669.

    Article  Google Scholar 

  • Häme, L., & Hakula, H. (2014). A maximum cluster algorithm for checking the feasibility of dial-a-ride instances. Transportation Science, 49(2), 295–310.

    Article  Google Scholar 

  • Hanne, T., Melo, T., & Nickel, S. (2009). Bringing robustness to patient flow management through optimized patient transports in hospitals. Interfaces, 39(3), 241–255.

    Article  Google Scholar 

  • Haugland, D., & Ho, S. C. (2010). Feasibility testing for dial-a-ride problems. Lecture Notes in Computer Science, 6124, 170–179.

    Article  Google Scholar 

  • Healy, P., & Moll, R. (1995). A new extension of local search applied to the dial-a-ride problem. European Journal of Operational Research, 83(1), 83–104.

    Article  Google Scholar 

  • Heilporn, G., Cordeau, J.-F., & Laporte, G. (2011). An integer L-shaped algorithm for the dial-a-ride problem with stochastic customer delays. Discrete Applied Mathematics, 159(9), 883–895.

    Article  Google Scholar 

  • Hickman, M. D., Blume, K. L., (2001). An investigation of integrated transit service. Technical report.

  • Ho, S. C., & Haugland, D. (2011). Local search heuristics for the probabilistic dial-a-ride problem. OR Spectrum, 33(4), 961–988.

    Article  Google Scholar 

  • Hu, T.-Y., & Chang, C.-P. (2015). A revised branch-and-price algorithm for dial-a-ride problems with the consideration of time-dependent travel cost. Journal of Advanced Transportation, 49(6), 700–723.

    Article  Google Scholar 

  • Hunsaker, B., & Savelsbergh, M. (2002). Efficient feasibility testing for dial-a-ride problems. Operations Research Letters, 30(3), 169–173.

    Article  Google Scholar 

  • Hyytiä, E., Penttinen, A., & Sulonen, R. (2010). Congestive collapse and its avoidance in a dynamic dial-a-ride system with time windows. Lecture Notes in Computer Science, 6148, 397–408.

    Article  Google Scholar 

  • Hyytiä, E., Penttinen, A., & Sulonen, R. (2012). Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives. Computers & Operations Research, 39(12), 3021–3030.

    Article  Google Scholar 

  • Ioachim, I., Desrosiers, J., Dumas, Y., Solomon, M. M., & Villeneuve, D. (1995). A request clustering algorithm for door-to-door handicapped transportation. Transportation Science, 29(1), 63–78.

    Article  Google Scholar 

  • Jain, S., & Van Hentenryck, P. (2011). Large neighborhood search for dial-a-ride problems. Lecture Notes in Computer Science, 6876, 400–413.

    Article  Google Scholar 

  • Jaw, J.-J., Odoni, A. R., Psaraftis, H. N., & Wilson, N. H. M. (1986). A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Transportation Research Part B: Methodological, 20, 243–257.

    Article  Google Scholar 

  • Jørgensen, R. M., Larsen, J., & Bergvinsdottir, K. B. (2007). Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society, 58(10), 1321–1331.

    Article  Google Scholar 

  • Karabuk, S. (2009). A nested decomposition approach for solving the paratransit vehicle scheduling problem. Transportation Research Part B: Methodological, 43(4), 448–465.

    Article  Google Scholar 

  • Kirchler, D., & Wolfler Calvo, R. (2013). A granular tabu search algorithm for the dial-a-ride problem. Transportation Research Part B: Methodological, 56, 120–135.

    Article  Google Scholar 

  • Krumke, S. O., de Paepe, W. E., Poensgen, D., Lipmann, M., Marchetti-Spaccamela, A., & Stougie, L. (2006). On minimizing the maximum flow time in the online dial-a-ride problem. Lecture Notes in Computer Science, 3879, 258–259.

    Article  Google Scholar 

  • Lehuédé, F., Masson, R., Parragh, S. N., Péton, O., & Tricoire, F. (2013). A multi-criteria large neighbourhood search for the transportation of disabled people. Journal of the Operational Research Society, 65(7), 983–1000.

    Article  Google Scholar 

  • Li, B., Krushinsky, D., Van Woensel, T., & Reijers, H. A. (2016). An adaptive large neighborhood search heuristic for the share-a-ride problem. Computers & Operations Research, 66, 170–180.

    Article  Google Scholar 

  • Lin, S., & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21(2), 498–516.

    Article  Google Scholar 

  • Lipmann, M., Lu, X., de Paepe, W. E., Sitters, R. A., & Stougie, L. (2004). On-line dial-a-ride problems under a restricted information model. Algorithmica, 40(4), 319–329.

    Article  Google Scholar 

  • Liu, M., Luo, Z., & Lim, A. (2015). A branch-and-cut algorithm for a realistic dial-a-ride problem. Transportation Research Part B: Methodological, 81(1), 267–288.

    Article  Google Scholar 

  • Lois, A., Ziliaskopoulos, A., Aifantopoulou, G., (2007). A very large scale neighborhood heuristic algorithm for the multivehicle dial a ride with time windows. In Proceedings of 87th transportation research board annual meeting, Washington DC, USA.

  • Luo, Y., & Schonfeld, P. (2007). A rejected-reinsertion heuristic for the static dial-a-ride problem. Transportation Research Part B: Methodological, 41(7), 736–755.

    Article  Google Scholar 

  • Luo, Y., & Schonfeld, P. (2011). Online rejected-reinsertion heuristics for dynamic multivehicle dial-a-ride problem. Transportation Research Record: Journal of the Transportation Research Board, 2218(1), 59–67.

    Article  Google Scholar 

  • Masmoudi, M. A., Braekers, K., Masmoudi, M., & Dammak, A. (2017). A hybrid genetic algorithm for the heterogeneous dial-a-ride problem. Computers & Operations Research, 81, 1–13.

    Article  Google Scholar 

  • Masmoudi, M. A., Hosny, M., Braekers, K., & Dammak, A. (2016). Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem. Transportation Research Part E: Logistics and Transportation Review, 96, 60–80.

    Article  Google Scholar 

  • Masson, R., Lehuédé, F., & Péton, O. (2012). Simple temporal problems in route scheduling for the dial-a-ride problem with transfers. Lecture Notes in Computer Science, 7298, 275–291.

    Article  Google Scholar 

  • Masson, R., Lehuédé, F., & Péton, O. (2014). The dial-a-ride problem with transfers. Computers & Operations Research, 41, 12–23.

    Article  Google Scholar 

  • Mauri, G., Lorena, L., (2006). A multiobjective model and simulated annealing approach for a dial-a-ride problem. In Workshop dos Cursos de Computação.

  • Melachrinoudis, E., Ilhan, A. B., & Min, H. (2007). A dial-a-ride problem for client transportation in a health-care organization. Computers & Operations Research, 34(3), 742–759.

    Article  Google Scholar 

  • Molenbruch, Y., Braekers, K., & Caris, A. (2017a). Operational effects of service level variations for the dial-a-ride problem. Central European Journal of Operations Research, 25(1), 71–90.

    Article  Google Scholar 

  • Molenbruch, Y., Braekers, K., Caris, A., & Vanden Berghe, G. (2017b). Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. Computers & Operations Research, 77, 58–71.

    Article  Google Scholar 

  • Muelas, S., LaTorre, A., & Peña, J.-M. (2013). A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city. Expert Systems with Applications, 40(14), 5516–5531.

    Article  Google Scholar 

  • Muelas, S., LaTorre, A., & Peña, J.-M. (2015). A distributed vns algorithm for optimizing dial-a-ride problems in large-scale scenarios. Transportation Research Part C: Emerging Technologies, 54, 110–130.

    Article  Google Scholar 

  • Neven, A., Braekers, K., Declercq, K., Bellemans, T., Janssens, D., Wets, G., (2014). Methodology to optimize resource requirements of a demand-responsive transport system for persons with disabilities: a case study in Flanders. In TRB 2014: 93th annual meeting of the transportation research board, Washington D.C.

  • Nowak, M., Ergun, Ö., & White, C. C. (2008). Pickup and delivery with split loads. Transportation Science, 42(1), 32–43.

    Article  Google Scholar 

  • Oberscheider, M., & Hirsch, P. (2016). Analysis of the impact of different service levels on the workload of an ambulance service provider. BMC Health Services Research, 16(1), 487.

    Article  Google Scholar 

  • Paquette, J., Bellavance, F., Cordeau, J.-F., & Laporte, G. (2012). Measuring quality of service in dial-a-ride operations: the case of a Canadian city. Transportation, 39(3), 539–564.

    Article  Google Scholar 

  • Paquette, J., Cordeau, J.-F., & Laporte, G. (2009). Quality of service in dial-a-ride operations. Computers & Industrial Engineering, 56(4), 1721–1734.

    Article  Google Scholar 

  • Paquette, J., Cordeau, J.-F., Laporte, G., & Pascoal, M. M. B. (2013). Combining multicriteria analysis and tabu search for dial-a-ride problems. Transportation Research Part B: Methodological, 52, 1–16.

    Article  Google Scholar 

  • Parragh, S. N. (2011). Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transportation Research Part C: Emerging Technologies, 19(5), 912–930.

    Article  Google Scholar 

  • Parragh, S. N., Cordeau, J.-F., Doerner, K. F., & Hartl, R. F. (2012). Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectrum, 34(3), 593633.

    Article  Google Scholar 

  • Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008). A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft, 58(2), 81–117.

    Article  Google Scholar 

  • Parragh, S. N., Doerner, K. F., Hartl, R. F., (2010a). Demand responsive transportation. Wiley Encyclopedia of Operations Research and Management Science, pp. 1–9.

  • Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2010b). Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research, 37(6), 1129–1138.

    Article  Google Scholar 

  • Parragh, S. N., Doerner, K. F., Hartl, R. F., & Gandibleux, X. (2009). A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks, 54(4), 227–242.

    Article  Google Scholar 

  • Parragh, S. N., Pinho de Sousa, J., & Almada-Lobo, B. (2014). The dial-a-ride problem with split requests and profits. Transportation Science, 49(2), 311–334.

    Article  Google Scholar 

  • Parragh, S. N., & Schmid, V. (2013). Hybrid column generation and large neighborhood search for the dial-a-ride problem. Computers & Operations Research, 40(1), 490–497.

    Article  Google Scholar 

  • Psaraftis, H. N. (1980). A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science, 14(2), 130–154.

    Article  Google Scholar 

  • Psaraftis, H. N. (1983). An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science, 17(3), 351–357.

    Article  Google Scholar 

  • Qu, Y., & Bard, J. F. (2013). The heterogeneous pickup and delivery problem with configurable vehicle capacity. Transportation Research Part C: Emerging Technologies, 32, 1–20.

    Article  Google Scholar 

  • Qu, Y., & Bard, J. F. (2014). A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity. Transportation Science, 49(2), 254–270.

    Article  Google Scholar 

  • Quadrifoglio, L., Dessouky, M. M., & Ordóñez, F. (2008). A simulation study of demand responsive transit system design. Transportation Research Part A: Policy and Practice, 42(4), 718–737.

    Google Scholar 

  • Reinhardt, L. B., Clausen, T., & Pisinger, D. (2013). Synchronized dial-a-ride transportation of disabled passengers at airports. European Journal of Operational Research, 225(1), 106–117.

    Article  Google Scholar 

  • Rekiek, B., Delchambre, A., & Saleh, H. A. (2006). Handicapped person transportation: An application of the grouping genetic algorithm. Engineering Applications of Artificial Intelligence, 19(5), 511–520.

    Article  Google Scholar 

  • Ritzinger, U., Puchinger, J., & Hartl, R. F. (2016). Dynamic programming based metaheuristics for the dial-a-ride problem. Annals of Operations Research, 236(2), 341–358.

    Article  Google Scholar 

  • Ronald, N., Thompson, R., & Winter, S. (2015). Simulating demand-responsive transportation: A review of agent-based approaches. Transport Reviews, 35(4), 404–421.

    Article  Google Scholar 

  • Røpke, S., & Cordeau, J.-F. (2009). Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transportation Science, 43(3), 267–286.

    Article  Google Scholar 

  • Røpke, S., Cordeau, J.-F., & Laporte, G. (2007). Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49(4), 258–272.

    Article  Google Scholar 

  • Røpke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455–472.

    Article  Google Scholar 

  • Rubinstein, Z. B., Smith, S. F., Barbulescu, L. (2012). Incremental management of oversubscribed vehicle schedules in dynamic dial-a-ride problems. In Proceedings of the 26th AAAI conference on artificial intelligence. pp. 1809–1815.

  • Santos, D. O., & Xavier, E. C. (2015). Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Systems with Applications, 42(19), 6728–6737.

    Article  Google Scholar 

  • Savelsbergh, M. W. (1992). The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing, 4(2), 146–154.

    Article  Google Scholar 

  • Schilde, M., Doerner, K. F., & Hartl, R. F. (2011). Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers & Operations Research, 38(12), 1719–1730.

    Article  Google Scholar 

  • Schilde, M., Doerner, K. F., & Hartl, R. F. (2014). Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem. European Journal of Operational Research, 238(1), 18–30.

    Article  Google Scholar 

  • Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000). Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159(2), 139–171.

    Article  Google Scholar 

  • Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. Lecture Notes in Computer Science, 1520, 417–431.

    Article  Google Scholar 

  • Shen, C.-W., & Quadrifoglio, L. (2012). Evaluation of zoning design with transfers for paratransit services. Transportation Research Record: Journal of the Transportation Research Board, 2277(1), 82–89.

    Article  Google Scholar 

  • Shen, C.-W., & Quadrifoglio, L. (2013). Evaluating centralized versus decentralized zoning strategies for metropolitan ADA paratransit services. Journal of Transportation Engineering, 139, 524–532.

    Article  Google Scholar 

  • Tang, J., Kong, Y., Lau, H., & Ip, A. W. H. (2010). A note on “Efficient feasibility testing for dial-a-ride problems”. Operations Research Letters, 38(5), 405–407.

    Article  Google Scholar 

  • Teodorovic, D., & Radivojevic, G. (2000). A fuzzy logic approach to dynamic dial-a-ride problem. Fuzzy Sets and Systems, 116(1), 23–33.

    Article  Google Scholar 

  • Toth, P., & Vigo, D. (1997). Heuristic algorithms for the handicapped persons transportation problem. Transportation Science, 31(1), 60–71.

    Article  Google Scholar 

  • Wolfler Calvo, R., & Touati-Moungla, N. (2011). A matheuristic for the dial-a-ride problem. Lecture Notes in Computer Science, 6101, 450–463.

    Article  Google Scholar 

  • Wong, K. I., & Bell, M. G. H. (2006). Solution of the dial-a-ride problem with multi-dimensional capacity constraints. International Transactions in Operational Research, 13(3), 195–208.

    Article  Google Scholar 

  • Xiang, Z., Chu, C., & Chen, H. (2006). A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. European Journal of Operational Research, 174(2), 1117–1139.

    Article  Google Scholar 

  • Xiang, Z., Chu, C., & Chen, H. (2008). The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments. European Journal of Operational Research, 185(2), 534–551.

    Article  Google Scholar 

  • Yi, F., & Tian, L. (2005). On the online dial-a-ride problem with time-windows. Lecture Notes in Computer Science, 3521, 85–94.

    Article  Google Scholar 

  • Yi, F., Xu, Y., & Xin, C. (2006). Online dial-a-ride problem with time-windows under a restricted information model. Lecture Notes in Computer Science, 4041, 22–31.

    Article  Google Scholar 

  • Zhang, Z., Liu, M., & Lim, A. (2015). A memetic algorithm for the patient transportation problem. Omega, 54, 60–71.

    Article  Google Scholar 

  • Ziliaskopoulos, A., Kozanidis, G. (2006). Dynamic programming strategies for the dial a ride problem with time window constraints. In TRB 2006: 85th annual meeting of the transportation research board, Washington D.C.

  • Zitzler, E., & Thiele, L. (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4), 257–271.

    Article  Google Scholar 

  • Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & Grunert da Fonseca, V. (2003). Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation, 7(2), 117–132.

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by the Interuniversity Attraction Poles Programme, initiated by the Belgian Science Policy Office. (Research Project COMEX - Combinatorial Optimization: Metaheuristics & Exact Methods)

Author information

Authors and Affiliations

  1. Hasselt University, Agoralaan Gebouw D, 3590, Diepenbeek, Belgium

    Yves Molenbruch, Kris Braekers & An Caris

  2. Research Foundation Flanders (FWO), Egmontstraat 5, 1000, Brussels, Belgium

    Yves Molenbruch & Kris Braekers

Authors
  1. Yves Molenbruch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kris Braekers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. An Caris
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yves Molenbruch.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (pdf 60 KB)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Molenbruch, Y., Braekers, K. & Caris, A. Typology and literature review for dial-a-ride problems. Ann Oper Res 259, 295–325 (2017). https://doi.org/10.1007/s10479-017-2525-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-017-2525-0

Keywords

Search

Navigation