Abstract
In this paper, we propose a simple heuristic algorithm based on the Variable Neighborhood Search (VNS), which combines with the Set Covering strategy in order to solve the Dial-a-Ride Problem (DARP). In this problem, customers must be served by a heterogeneous fleet of vehicles. Each customer has a pickup and a delivery location, where each one of them has time windows that must be obeyed. All vehicles have a duration time and have to start and end their routes in a single depot, and each customer has a maximum time ride. We have tested our algorithm on the benchmark instances of literature. Experiments showed that although the algorithm is simple, it can obtain the optimal solutions for some instances and achieve solutions near the optima for the others.
Supported by CAPES.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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. 30, 231–236 (2004)
Beaudry, A., Laporte, G., Melo, T., Nickel, S.: Dynamic transportation of patients in hospitals. OR Spectr. 32, 77–107 (2010). https://doi.org/10.1007/s00291-008-0135-6
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)
Cordeau, J.F., Laporte, G.: A Tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B Methodol. 37, 579–594 (2003)
Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54, 573–586 (2006)
Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153, 29–46 (2007). https://doi.org/10.1007/s10479-007-0170-8
Dongarra, J.J.: Performance of various computers using standard linear equations software. ACM SIGARCH Comput. Arch. News 20, 22–44 (2014)
Hanne, T., Melo, T., Nickel, S., Melo, T., Nickel, S.: Bringing robustness to patient flow management through optimized patient transportation in hospitals. Interfaces 39, 241–255 (2018)
Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449467 (2001)
Ho, S.C., Szeto, W.Y., Kuo, Y.H., Leung, J.M.Y., Petering, M., Tou, T.W.H.: A survey of dial-a-ride problems: literature review and recent developments. Transp. Res. Part B Methodol. 111, 395–421 (2018)
Jaw, J.-J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.M.: A heuristic algorithm for the multi- vehicle advance request dial-a-ride problem with time windows. Transp. Res. 20B, 243–257 (1986)
Jorgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the dial-a-ride problem using genetic algorithms. J. Oper. Res. Soc. 58, 1321–1331 (2007)
López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)
Lutz, W., Sanderson, W., Scherbov, S.: The coming acceleration of global population ageing. Nature 451, 716–719 (2008)
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. 60, 193–208 (1995). https://doi.org/10.1007/BF02031946
Masmoudi, M.A., Braekers, K., Masmoudi, M., Dammak, A.: A hybrid genetic algorithm for the heterogeneous dial-a-ride problem. Comput. Oper. Res. 81, 1–13 (2017)
Mauri, G.R., Antonio, L., Lorena, N.: Customers’ satisfaction in a dial-a-ride problem. IEEE Intell. Transp. Syst. Mag. 3, 6–14 (2009)
Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 37, 1129–1138 (2010)
Parragh, S.N.: Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transp. Res. Part C Emerg. Technol. 19, 912–930 (2011)
Parragh, S.N., Schmid, V.: Hybrid column generation and large neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 40, 490–497 (2013)
Schilde, M., Doerner, K.F., Hartl, R.F.: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Comput. Oper. Res. 12, 1719–1730 (2011)
Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematic and Applications, Philadelphia (2002)
Acknowledgments
The authors thank Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES), Fundação de Amparo à Pesquisa do Estado de Minas Gerais (FAPEMIG), Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), Universidade Federal de Ouro Preto (UFOP) and Universidade Federal de Viçosa (UFV) for supporting this research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Souza, A.L.S., Chagas, J.B.C., Penna, P.H.V., Souza, M.J.F. (2020). A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem. In: Benmansour, R., Sifaleras, A., Mladenović, N. (eds) Variable Neighborhood Search. ICVNS 2019. Lecture Notes in Computer Science(), vol 12010. Springer, Cham. https://doi.org/10.1007/978-3-030-44932-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-44932-2_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-44931-5
Online ISBN: 978-3-030-44932-2
eBook Packages: Computer ScienceComputer Science (R0)