Saâdia Khoukhi
ABSTRACT
This paper addresses the multi-trip vehicle routing problem with time windows and simultaneous pick and delivery, in which a set of hospitals have to be visited by a fleet of homogeneous vehicles. The objective is to minimize the total cost that includes the traveling cost and the fixed cost of using vehicles, without violating temporal and capacity constraints. As for the solving approach, a genetic algorithm based on route-first cluster-second approach and splitting procedure is introduced. Then crossover and mutation operations are deployed to ensure the exploration and the diversity of the population. The proposed approach is tested on a set of instances from the literature.
- Falkenauer, E. 1996. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2, 5--30.Google Scholar
Cross Ref
- Wolsey, L. A. 1998. Integer programming. New York: John Wiley & Sons.Google Scholar
- Beasley, J.E., 1983. Route-first cluster-second methods for vehicle routing. Imperial College of Science and Technology, London, UK Volume 11, Issue 4, Pages 403--408.Google Scholar
- Prins, C. and Bouchenoua, A. 2004. A memetic algorithm solving the VRP, the CARP, and more general problems with nodes, edges and arcs. Recent Advances in Memetic Algorithms and Related Search Technologies, pp.65--85, Springer, Berlin.Google Scholar
- Dantzig, G. B. and Ramser, J. H. 1959. The Truck Dispatching Problem. Management Science, Vol. 6, No. 1, pp. 80--91. Google ScholarDigital Library
- Dell'Amico, M., Righini, G., Salani, M., 2006. A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transp. Sci. 40(2), 235--247. Google ScholarDigital Library
- Phannikul, T. and Sindhuchao, S. 2010. A customized tabu search for vehicle routing problem with simultaneous pickup and delivery. International Journal of Science and Technology, 15(2), 70--82.Google Scholar
- Zachariadis, E. E., Tarantilis, C. D., and Kiranoudis, C. T. 2010. An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. European Journal of Operational Research, 202(2), 401--411.Google ScholarCross Ref
- Montané, F. A. T., and Galvao, R. D. 2006. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research, 33(3), 595--619.Google ScholarDigital Library
- Kalayci, C. B., and Kaya, C. 2016. An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications, 66, 163--175. Google ScholarDigital Library
- Tasan, A. S., and Gen, M. 2012. A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering, 62(3), 755--761. Google ScholarDigital Library
- Angelelli, E., and Mansini, R. 2002. The vehicle routing problem with time windows and simultaneous pick-up and delivery," in Quantitative Approaches to Distribution Logistics and Supply Chain Management, A. Klose, M. Speranza, and L. V. Wassenhove, Eds. Berlin, Germany: Springer, pp. 249--267.Google Scholar
- Boubahri, L., Addouche, S.A., and Mhamedi, A. E. 2011. Multi-ant colonies algorithms for the VRPSPDTW, in Proc. Int. Conf. Commun. Comput. Control Appl., Hammamet, Tunisia, pp. 1--6.Google Scholar
- Wang, H.-F. and Chen, Y.Y. 2012. A genetic algorithm for the simultaneous delivery and pickup problems with time window, Comput. Ind. Eng., vol. 62, no. 1, pp. 84--95, Feb. Google ScholarDigital Library
- Wang, C., Zhao, F., Mu, D. and Sutherland, J.W. 2013. Simulated annealing for a vehicle routing problem with simultaneous pickup-delivery and time windows, in Advances in Production Management Systems. Sustainable Production and Service Supply Chains. Berlin, Germany: Springer, pp. 170--177.Google Scholar
- Kassem, S. and Chen, M. 2013. Solving reverse logistics vehicle routing problems with time windows. Int. J. Adv. Manuf. Technol., vol. 68, nos. 1--4, pp. 57--68, 2013.Google ScholarCross Ref
- Liu, R., Xie, X., Augusto, V., and Rodriguez, C. 2013 "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. Eur. J. Oper. Res., vol. 230, no. 3, pp. 475--486, Nov.Google ScholarCross Ref
- Wang, C., Mu, D., Zhao, F., Sutherland, J.W. 2015. A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows. Computers \& Industrial Engineering., Vol. 83, pp. 111--122, Google ScholarDigital Library
- Fleischmann, B. 1990. The vehicle routing problem with multiple use of vehicles. Technical report, Fachbereich Wirtschaftswissenschaften, Universität Hamburg.Google Scholar
- Hernandez, F., Feillet, D., Giroudeau, R., and Naud, O. 2016. Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows. Eur. J. Oper. Res., vol. 249, no. 2, pp. 551--559, Mar.Google ScholarCross Ref
- Olivera, A., and Viera, O. 2007. Adaptive memory programming for the vehicle routing problem with multiple trips. Computers and Operations Research, 34(1), 28--47.Google ScholarCross Ref
- Tirkolaee, E.B., Alinaghian, A., Hosseinabadi, A.A.R., Sasi, M.B. and Sangaiah, A.K., 2018. An improved ant colony optimization for the multitrip Capacitated Arc Routing Problem. Comput Electr Eng. ISSN 0045--7906.Google Scholar
- Cattaruzza, D., Absi, N., Feillet, D., and Vidal, T. 2014. A memetic algorithm for the Multi Trip Vehicle Routing Problem. European Journal of Operational Research, 236(3), 833--848.Google ScholarCross Ref
- Holland, J. 1975. Adaptation in natural and artificial systems. University of Michigan Press.Google ScholarDigital Library
Index Terms
- A genetic algorithm for solving a multi-trip vehicle routing problem with time windows and simultaneous pick-up and delivery in a hospital complex
Recommendations
Improvement of Genetic Algorithm for Vehicle Routing Problems with Time Windows
ISDEA '13: Proceedings of the 2013 Third International Conference on Intelligent System Design and Engineering ApplicationsVehicle routing problem with time windows (VRPTW) is of crucial importance in today's industries, especially in logistics distribution. Improvement of genetic algorithm (GA) using an optimized crossover operator is proposed by a complete undirected ...
A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows
A vehicle routing problem with simultaneous pickup-delivery and time windows is considered.A parallel simulated annealing algorithm with local search techniques is proposed.The effectiveness of the proposed algorithm is verified by test and comparison. ...
A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
This paper presents a hybrid evolutionary algorithm (HEA) to solve heterogeneous fleet vehicle routing problems with time windows. There are two main types of such problems, namely the fleet size and mix vehicle routing problem with time windows (F) and ...
Comments