Abstract
The mixed fleet heterogeneous dial-a-ride problem (MF-HDARP) consists of designing vehicle routes for a set of users by using a mixed fleet including both heterogeneous conventional and alternative fuel vehicles. In addition, a vehicle is allowed to refuel from a fuel station to eliminate the risk of running out of fuel during its service. We propose an efficient hybrid adaptive large neighborhood search (hybrid ALNS) algorithm for the MF-HDARP. The computational experiments show that the algorithm produces high quality solutions on our generated instances and on HDARP benchmarks instances. Computational experiments also highlight that the newest components added to the standard ALNS algorithm enhance intensification and diversification during the search process.
Similar content being viewed by others
References
Adler, J.D., Mirchandani, P.B.: The vehicle scheduling problem for fleets with alternative-fuel vehicles. Transp. Sci. 51(2), 441–456 (2016)
Alinaghian, M., Shokouhi, N.: Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search. Omega 76, 85–99 (2018)
Amirgholy, M., Gonzales, E.J.: Demand responsive transit systems with time-dependent demand: user equilibrium, system optimum, and management strategy. Transp. Res. B Methodol. 92, 234–252 (2016)
Andelmin, J., Bartolini, E.: An Exact algorithm for the green vehicle routing problem. Transp. Sci. 51(4), 1288–1303 (2017)
Androutsopoulos, K.N., Zografos, K.G.: An integrated modelling approach for the bicriterion vehicle routing and scheduling problem with environmental considerations. Transp. Res. C Emerg. Technol. 82, 180–209 (2017)
Barth, M., Boriboonsomsin, K.: Energy and emissions impacts of a freeway-based dynamic eco-driving system. Transp. Res. D Transp. Environ. 14(6), 400–410 (2009)
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. B Methodol. 67, 166–186 (2014)
Braekers, K., Kovacs, A.: A multi-period dial-a-ride problem with driver consistency. A multi-period dial-a-ride problem with driver consistency. Transp. Res. B Methodol. 94, 355–377 (2016)
Cordeau, J.-F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. B 37(6), 579–594 (2003)
Cordeau, J.-F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573–586 (2006)
Demir, E., Bektas, T., Laporte, G.: An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur. J. Oper. Res. 223(2), 346–359 (2012)
Demir, E., Bektas, T., Laporte, G.: A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237, 775–793 (2014)
Demir, E.: Value creation through green vehicle routing. In: Zeimpekis, V., et al. (eds.) Sustainable Freight Transport: Theory, Models, and Case Studies. Operations Research/Computer Science Interfaces Series Springer (2018)
Delaware Valley Regional Planning Commission (DVRPC): Overview of challenges and opportunities for alternative fuel vehicles in the Delaware Valley. https://www.dvrpc.org/reports/10055B.pdf (2011). Accessed 2 Aug 2019
Erdoğan, S., Miller-Hooks, E.: A green vehicle routing problem. Transp. Res. E Logist. Transp. Rev. 48(1), 100–114 (2012)
Franceschetti, A., Demir, E., Honhon, D., Van Woensel, T., Laporte, G., Stobbe, M.: A metaheuristic for the time-dependent pollution-routing problem. Eur. J. Oper. Res. 259(3), 972–991 (2017)
Goeke, D., Schneider, M.: Routing a mixed fleet of electric and conventional vehicles. Eur. J. Oper. Res. 245(1), 81–99 (2015)
Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3(2), 95–99 (1988)
Hiermann, G., Hartl, R.F., Puchinger, J., Vidal, T.: Routing a mix of conventional, plug-in hybrid, and electric vehicles. Eur. J. Oper. Res. 272(1), 235–248 (2019)
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. B Methodol. 111, 395–421 (2018)
Koç, Ç., Karaoglan, I.: The green vehicle routing problem: a heuristic based exact solution approach. Appl. Soft Comput. 39, 154–164 (2016)
Leung, S.C., Zhang, Z., Zhang, D., Hua, X., Lim, M.K.: A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. Eur. J. Oper. Res. 225(2), 199–210 (2013)
Lim, A., Zhang, Z., Qin, H.: Pickup and delivery service with manpower planning in Hong Kong public hospitals. Transp. Sci. 51(2), 688–705 (2016)
Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)
Liu, M., Luo, Z., Lim, A.: A branch-and-cut algorithm for a realistic dial-a-ride problem. Transp. Res. B Methodol. 81, 267–288 (2015)
Masmoudi, M.A., Hosny, M., Braekers, K., Dammak, A.: Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem. Transp. Res. E Logist. Transp. Rev. 96, 60–80 (2016)
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)
Masmoudi, M.A., Hosny, M., Demir, E., Cheikhrouhou, N.: A study on the heterogeneous fleet of alternative fuel vehicles: reducing CO2 emissions by means of biodiesel fuel. Transp. Res. D Transp. Environ. 63, 137–155 (2018a)
Masmoudi, M.A., Hosny, M., Demir, E., Genikomsakis, K.N., Cheikhrouhou, N.: The dial-a-ride problem with electric vehicles and battery swapping stations. Transp. Res. E Logist. Transp. Rev. 118, 392–420 (2018b)
Molenbruch, Y., Braekers, K., Caris, A.: Typology and literature review for dial-a-ride problems. Ann. Oper. Res. 259(1–2), 295–325 (2017)
Muelas, S., LaTorre, A., Peña, J.M.: A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city. Expert Syst. Appl. 40(14), 5516–5531 (2013)
NAEI: Emission factors. Technical Report, National Atmospheric Emissions Inventory, United Kingdom. http://naei.defra.gov.uk/data/emission-factors (2012). Accessed 5 July 2019
Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 37(6), 1129–1138 (2010)
Parragh, S.N.: Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transp. Res. C Emerg. Technol. 19(5), 912–930 (2011)
Parragh, S.N., Cordeau, J.F., Doerner, K.F., Hartl, R.F.: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectr. 34(3), 593–633 (2012)
Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)
Potvin, J.Y., Rousseau, J.M.: An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc. 46(12), 1433–1446 (1995)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985–2002 (2004)
Réseau de Transport de la Capitale (RTC). http://ocpm.qc.ca/sites/ocpm.qc.ca/files/document_consultation/3.1_anglais_ocpm_fossil_fuels_en_1.pdf. Accessed 7 Sep 2019
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 4, 455–472 (2006a)
Ropke, S., Pisinger, D.: A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3), 750–775 (2006b)
Salehi, M., Jalalian, M., Siar, M.M.V.: Green transportation scheduling with speed control: trade-off between total transportation cost and carbon emission. Comput. Ind. Eng. 113, 392–404 (2017)
Sassi, O., Cherif-Khettaf, W.R., Oulamara, A.: Vehicle routing problem with mixed fleet of conventional and heterogenous electric vehicles and time dependent charging costs. World Acad. Sci. Eng. Tech: Int. J. Math. Comput. Phys. Electr. Comput. Eng. 9(3), 163–173 (2014)
Savelsbergh, M.W.: The vehicle routing problem with time windows: minimizing route duration. ORSA J. Comput. 4(2), 146–154 (1992)
Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48(4), 500–520 (2014)
Sevaux, M., Dauzère-Pérès, S.: Genetic algorithms to minimize the weighted number of late jobs on a single machine. Eur. J. Oper. Res. 151(2), 296–306 (2003)
Société de transport de Montréal (STM): http://www.stm.info/en/press/press-releases/2012/the-stm-announces-the-purchase-of-regular-biodiesel-electric-buses. Accessed 7 Sep 2019
Thériault, M.: La gestion du transport de personnes à mobilité réduite. Doctoral dissertation, Université Laval (2005)
Toro, E.M., Franco, J.F., Echeverri, M.G., Guimarães, F.G.: A multi-objective model for the green capacitated location-routing problem considering environmental impact. Comput. Ind. Eng. 110, 114–125 (2017)
Transport Adapté du Québec Métro Inc. (TAQM). https://www.accesstotravel.gc.ca/1.aspx?lang=fr
US DOE, Department of Energy: Alternative fuels and advanced vehicles. Available on https://www.afdc.energy.gov/fuels/ (2018). Accessed 2 May 2019
U.S. EIA.: Alternative Vehicle Fuels. Available on https://www.epa.gov/greenvehicles/alternative-vehicle-fuels (2013). Accessed 2 May 2019
Verma, P., Sharma, M.P.: Review of process parameters for biodiesel production from different feedstocks. Renew. Sustain. Energy Rev. 62, 1063–1071 (2016)
Wong, K.I., Bell, M.G.H.: Solution of the dial-a-ride problem with multi-dimensional capacity constraints. Int. Trans. Oper. Res. 13(3), 195–208 (2006)
Xiang, Z., Chu, C., Chen, H.: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur. J. Oper. Res. 174(2), 1117–1139 (2006)
Xiao, Y., Konak, A.: A genetic algorithm with exact dynamic programming for the green vehicle routing & scheduling problem. J. Clean. Prod. 167, 1450–1463 (2017)
Yavuz, M.: An iterated beam search algorithm for the green vehicle routing problem. Networks 69(3), 317–328 (2017)
Zhang, Z., Liu, M., Lim, A.: A memetic algorithm for the patient transportation problem. Omega 54, 60–71 (2015)
Žulj, I., Kramer, S., Schneider, M.: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur. J. Oper. Res. 264(2), 653–664 (2018)
Acknowledgements
Thanks are due to two anonymous reviewers for their useful comments and for raising interesting points for discussion.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Masmoudi, M.A., Hosny, M., Demir, E. et al. Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem. J Heuristics 26, 83–118 (2020). https://doi.org/10.1007/s10732-019-09424-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-019-09424-x