Abstract
In this work we present a new parallel implementations on GPU of an heuristic based on Clarke and Wright algorithm for solving the Vehicle Routing Problem (VRP) with single and multi depots. To our knowledge, this is the first GPU implementation of such class of heuristics that solve the VRP. Indeed, our solution computes in parallel an initial solution (tours) in one step and then iteratively it improves the costs of all pairs of neighbor tours in one step. Obtained experimental results under CUDA show that the proposed implementations exploit efficiently the parallelism of the GPU.
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
Solom, M.: Algorithm for the vehicle routing and Scheduling problems with time Window Constraints. Oper. Res. 35(2) (1987)
Faulin, J., Juan, A.: On the use of monte carlo simulation, cache and splitting techniques to improve the Clarke and wright saving heuristics. J. Oper. Res. Soc. 62, 1085–1097 (2011)
Laport, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 345–358 (1992)
Sassi, O., Oulmara, A.: Joint scheduling and optimal charging of electric vehicles problem. ICCSA 2014, Part II, LNCS 8580, pp. 76–91 (2014)
Talbi, E.G., Hasle, G.: Metaheuristics on GPUs. J. Par. Dist. Comput. 73(1), 1–3 (2013)
Fosin, J., Davidovic, D., Caric, T.: A GPU implementation of local serach operators for symmetric travelling salesman problem. Traffic Trans. 25(3), 225–234 (2013)
Arbelaez, A., Codogne, P.: A GPU implementation of parallel constraint-based local search. In: Proceedings of the PDP’2014, 22nd Euromicro International Conference, pp. 648–655
Park, N., Okano, H., Imai, H.: A path-exchange-type local search algorithm for vehicle routing and its efficient search strategy. J. Oper. R. Soc. Jpn. 43(1),197–208 (2000)
Cardon, S., Dommers, S., Eksin, C., Sitters, R., Stougie, A., Stougie, L.: L.A PTAS for the multiple depot vehicle routing problem. TUE—SPOR, 2008–03, TR (2008)
Tansini, L., Urquhart, M., Viera, O.: Comparing assignment algorithms for the multi-depot VRP. Technical Report, University of Montevideo, Uruquay (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Benaini, A., Berrajaa, A., Daoudi, E.M. (2016). Solving the Vehicle Routing Problem on GPU. In: El Oualkadi, A., Choubani, F., El Moussati, A. (eds) Proceedings of the Mediterranean Conference on Information & Communication Technologies 2015. Lecture Notes in Electrical Engineering, vol 381. Springer, Cham. https://doi.org/10.1007/978-3-319-30298-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-30298-0_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30296-6
Online ISBN: 978-3-319-30298-0
eBook Packages: EngineeringEngineering (R0)