Skip to main content
SpringerLink
Log in

Customer-Oriented Dial-A-Ride Problems: A Survey on Relevant Variants, Solution Approaches and Applications

  • Conference paper
  • First Online:
Emerging Trends in ICT for Sustainable Development

Part of the book series: Advances in Science, Technology & Innovation ((ASTI))

Abstract

The interest of on demand transport systems is constantly growing. This trend is accompanied by increased customer’s expectations in the quality of the service provided. In this regard, the quality of service must meet the needs for more customer-oriented features. This article summarizes recent developments in Dial-A-Ride Problems which integrate customer service quality. We provide a classification of the variants examined, as well as the available resolution methodologies and references on the instances used. A discussion on the sate of the art is given with perspectives for future researches.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295–303 (2012)

    Article  MATH  Google Scholar 

  • Aggoune-Mtalaa, W., Aggoune, R.: An optimization algorithm to schedule care for the elderly at home. Int. J. Inform. Sci. Intell. Syst. 3(3), 41–50 (2014)

    Google Scholar 

  • Amroun, K., Habbas, Z., Aggoune-Mtalaa, W.: A compressed generalized hypertree decomposition-based solving technique for non-binary constraint satisfaction problems. AI Commun. 29(2), 371–392 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  • Armstrong, G.R., Garfinkel, R.S.: Dynamic programming solution of the single and multiple vehicle pickup and delivery problem with application to dial-a-ride. Working paper 162, University of Tennessee (1982)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  • Bennekrouf, M., Aggoune-Mtalaa, W., Sari, Z.: A generic model for network design including remanufacturing activities. Supply Chain Forum 14(2), 4–17 (2013)

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Cappart, Q., Thomas, C., Schaus, P., Rousseau, L.M.: A constraint programming approach for solving patient transportation problems. In: International Conference on Principles and Practice of Constraint Programming, pp. 490–506. Springer, Cham (2018)

    Google Scholar 

  • Carotenuto, P., Martis, F.: A double dynamic fast algorithm to solve multi-vehicle dial-a-ride problem. Transp. Res. Proced. 27, 632–639 (2017)

    Article  Google Scholar 

  • Çetin, T.: The rise of ride sharing in urban transport: threat or opportunity? In: Urban Transport Systems, vol. 191 (2017)

    Google Scholar 

  • Chassaing, M., Duhamel, C., Lacomme, P.: An ELS-based approach with dynamic probabilities management in local search for the dial-a-ride problem. Eng. Appl. Artif. Intell. 48, 119–133 (2016)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Cordeau, J.F., Laporte, G.: The dial-a-ride problem (DARP) variants, modeling issues and algorithms. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 89–101, (2003a)

    Google Scholar 

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

    Article  Google Scholar 

  • Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29–46 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  • Cordeau, J.F., Laporte, G., Potvin, J.Y., Savelsbergh, M.W.: Transportation on demand. Handbooks in Operations Research and Management Science 14, 429–466 (2007)

    Article  Google Scholar 

  • Detti, P., Papalini, F., de Lara, G.Z.M.: A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare. Omega 70, 1–14 (2017)

    Article  Google Scholar 

  • Diana, M.: Innovative systems for the transportation disadvantaged: toward more efficient and operationally usable planning tools. Transp. Plann. Technol. 27, 315–331 (2004)

    Article  Google Scholar 

  • Enrique Fernindez, L.J., de Cea Ch, J., Malbran, R.H.: Demand responsive urban public transport system design: methodology and application. Transp. Res. Part A: Policy Pract. 42(7), 951–972 (2008)

    Google Scholar 

  • Faria, A., Yamashita, M., Tozi, L.A., Souza, V.J., Brito Jr, I.: Dial-a-ride routing system: the study of mathematical approaches used in public transport of people with physical disabilities. In: Proceedings of 12th World Conference on Transport Research Society (2010)

    Google Scholar 

  • Healy, P., Moll, R.: A new extension of local search applied to the dial-a-ride problem. Eur. J. Oper. Res. 83, 83–104 (1995)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Hll, C.H., Andersson, H., Lundgren, J.T., Vrbrand, P.: The integrated dial-a-ride problem. Public Transp. 1(1), 39–54 (2009)

    Google Scholar 

  • Ho, S., Nagavarapu, S.C., Pandi, R.R., Dauwels, J.: An improved tabu search heuristic for static dial-a-ride problem (2018a)

    Google Scholar 

  • Ho, S.C., Szeto, W.Y., Kuo, Y.H., Leung, J.M., Petering, M., Tou, T.W.: A survey of dial-a-ride problems: literature review and recent developments. Transp. Res. Part B: Methodol. 111, 395–421 (2018b)

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Instance of Cordeau (2003). http://neumann.hec.ca/chairedistributique/data/darp/

  • Instances of Cordeau (2006). http://neumann.hec.ca/chairedistributique/data/darp/. Last accessed 2020

  • Instances of Chassaing (2016). http://fc.isima.fr/~lacomme/Maxime/. Last Accessed 2020

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

    Article  Google Scholar 

  • Jlassi, J., Euchi, J., Chabchoub, H.: Dial-a-ride and emergency transportation problems in ambulance services. Comput. Sci. Eng. 2(3), 17–23 (2012)

    Article  Google Scholar 

  • Jorgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the dial-a-ride problem using genetic algorithms. J. Oper. Soc. 58, 1321–1331 (2007)

    Article  MATH  Google Scholar 

  • Lehu, F., Masson, R., Parragh, S.N., Pton, O., Tricoire, F.: A multi-criteria large neighbourhood search for the transportation of disabled people. J. Oper. Res. Soc. 65(7), 983–1000 (2014)

    Article  Google Scholar 

  • Li, D., Antoniou, C., Jiang, H., Xie, Q., Shen, W., Han, W.: The value of prepositioning in smartphone-based vanpool services under stochastic requests and time-dependent travel times. Transp. Res. Rec. 2673(2), 26–37 (2019)

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Ma, T.Y., Rasulkhani, S., Chow, J.Y., Klein, S.: A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers. Transp. Res. Part E: Logist. Transp. Rev. 128, 417–442 (2019)

    Google Scholar 

  • Markovi, N., Nair, R., Schonfeld, P., Miller-Hooks, E., Mohebbi, M.: Optimizing dial-a-ride services in Maryland: benefits of computerized routing and scheduling. Transp. Res. Part C: Emerg. Technol. 55, 156–165 (2015)

    Article  Google Scholar 

  • Masson, R., Lehu, F., Pton, O.: The dial-a-ride problem with transfers. Comput. Oper. Res. 41, 12–23 (2014)

    Article  MathSciNet  Google Scholar 

  • Melachrinoudis, E., Min, H.: A tabu search heuristic for solving the multi-depot, multi-vehicle, double request dial-a-ride problem faced by a healthcare organisation. Int. J. Oper. Res. 10(2), 214–239 (2011)

    Article  MathSciNet  Google Scholar 

  • Melachrinoudis, E., Ilhan, A.B., Min, H.: A dial-a-ride problem for client transportation in a health-care organization. Comput. Oper. Res. 34, 742–759 (2007)

    Article  MATH  Google Scholar 

  • Molenbruch, Y., Braekers, K., Caris, A.: Typology and literature review for dial-a-ride problems. Ann. Oper. Res. 259(1–2), 295–325 (2017a)

    Article  MathSciNet  MATH  Google Scholar 

  • Molenbruch, Y., Braekers, K., Caris, A.: Benefits of horizontal cooperation in dial-a-ride services. Transp. Res. Part E: Logist. Transp. Rev. 107, 97–119 (2017b)

    Google Scholar 

  • Molenbruch, Y., Braekers, K., Caris, A.: Operational effects of service level variations for the dial-a-ride problem. CEJOR 25(1), 71–90 (2017c)

    Article  MATH  Google Scholar 

  • Mulley, C., Nelson, J.D.: Flexible transport services: a new market opportunity for public transport. Res. Transp. Econ. 25(1), 39–45 (2009)

    Article  Google Scholar 

  • Nasri, S., Bouziri, H.: Improving total transit time in dial-a-ride problem with customers-dependent criteria. In: 14th International Conference on Computer Systems and Applications (AICCSA), pp. 1141–1148. IEEE, Tunisia (2017)

    Google Scholar 

  • Pagano, A.M., McKnight, C.E.: Quality of service in special service paratransit: the users perspective. Transp. Res. Rec. 934, 14–23 (1983)

    Google Scholar 

  • Paquette, J., Cordeau, J.-F., Laporte, G.: Une tude comparative de divers modles pour le problme de transport la demande. INFOR 45, 95–110 (2007)

    Google Scholar 

  • Paquette, J., Cordeau, J.-F., Laporte, G.: Quality of service in dial-a-ride operations. Comput. Ind. Eng. 56, 1721–1734 (2009)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Parragh, S.N.: Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transp. Res. Part C 19, 912930 (2011)

    Article  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  • Parragh, S.N. Jorge Pinho, S., Bernardo, A.: The dial-a-ride problem with split requests and profits. Transp. Sci. 49(2), 311–334 (2015)

    Google Scholar 

  • Posada, M., Andersson, H., Hll, C.H.: The integrated dial-a-ride problem with timetabled fixed route service. Public Transp. 9(1–2), 217–241 (2017)

    Article  Google Scholar 

  • Qu, Y., Bard, J.F.: A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity. Transp. Sci. 49(2), 254–270 (2015)

    Article  Google Scholar 

  • Rekiek, B., Delchambre, A., Saleh, H.A.: Handicapped person transportation: an application of the grouping genetic algorithm. Eng. Appl. Artif. Intell. 19, 511–520 (2006)

    Article  Google Scholar 

  • Rezgui, D., Chaouachi-Siala, J., Aggoune-Mtalaa, W., Bouziri, H.: Application of a memetic algorithm to the fleet size and mix vehicle routing problem with electric modular vehicles. In: GECCO 2017—Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 301–302 (2017)

    Google Scholar 

  • Rezgui, D., Siala, J.C., Aggoune-Mtalaa, W., Bouziri, H.: Towards Smart Urban Freight Distribution Using Fleets of Modular Electric Vehicles. Lecture Notes in Networks and Systems 37, 602–612 (2018)

    Google Scholar 

  • Serrano, C., Aggoune-Mtalaa, W., Sauer, N.: Dynamic models for green logistic networks design. IFAC Proc. Vol. (IFAC-Papers Online) 46(9), 736–741 (2013)

    Google Scholar 

  • Tlili, T., Abidi, S., Krichen, S.: A mathematical model for efficient emergency transportation in a disaster situation. Am. J. Emerg. Med. 36(9), 1585–1590 (2018)

    Article  Google Scholar 

  • Wilson, N.H.M., Weissberg, R.W., Hauser, J.: Advanced dial-a-ride algorithms research project: final report. Working paper R-76-20 (1976)

    Google Scholar 

  • Wolfler Calvo, R., Colorni, A.: An effective and fast heuristic for the dial-a-ride problem. Q. J. Oper. Res. (4OR) 5, 61–73 (2007)

    Google Scholar 

  • Wong, K.I., Han, A.F., Yuen, C.W.: On dynamic demand responsive transport services with degree of dynamism. Transp. A Transp. Sci. 10(1), 55–73 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Higher Business School of Tunis, Manouba University, Manouba, Tunisia

    Sonia Nasri

  2. Higher School of Economic and Commercial Sciences Tunis, Tunis University, Tunis, Tunisia

    Hend Bouziri

  3. Luxembourg Institute of Science and Technology, L-4362, Esch-sur-Alzette, Luxembourg

    Wassila Aggoune-Mtalaa

Authors
  1. Sonia Nasri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hend Bouziri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wassila Aggoune-Mtalaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sonia Nasri .

Editor information

Editors and Affiliations

  1. Computer Engineering Department, Faculty of Sciences and Techniques of Tangier, Abdelmalek Essaadi University, Tangier, Morocco

    Mohamed Ben Ahmed

  2. Systèmes d’Information Organisationnels, Université Laval, Québec, QC, Canada

    Sehl Mellouli

  3. Civil Engineering Department, School of Engineering, University of Minho, Minho, Portugal

    Luis Braganca

  4. Computer Engineering, Faculty of Sciences and Techniques of Tangier, Abdelmalek Essaadi University, Tangier, Morocco

    Boudhir Anouar Abdelhakim

  5. Department of Computer Application, School of Computer Information and Mathematics, Abdur Rahman Crescent Institute of Science & Technology, Chennai, India

    Kwintiana Ane Bernadetta

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nasri, S., Bouziri, H., Aggoune-Mtalaa, W. (2021). Customer-Oriented Dial-A-Ride Problems: A Survey on Relevant Variants, Solution Approaches and Applications. In: Ben Ahmed, M., Mellouli, S., Braganca, L., Anouar Abdelhakim, B., Bernadetta, K.A. (eds) Emerging Trends in ICT for Sustainable Development. Advances in Science, Technology & Innovation. Springer, Cham. https://doi.org/10.1007/978-3-030-53440-0_13

Download citation

Publish with us

Policies and ethics

Search

Navigation