This application is very interesting when the routes are planned on horizon of several periods. Title: Hybrid metaheuristics for the periodic open arc routing problemĪddresses: Department of Computer Science, Lebanese University, Beirut, Lebanon ' Department of Computer Science, Lebanese University, Beirut, LebanonĪbstract: This work considers the periodic open arc routing problem (POCARP) that models the meter reader application. International Journal of Metaheuristics.Inderscience Publishers - linking academia, business and industry through research Computational experiments are conducted on a set of generated benchmark instances and indicate that the proposed metaheuristics dominate the good insertion heuristic. We compared our approaches with one of the most important insertion heuristics adapted to this problem. We extended the optimal splitting procedure to generate and evaluate solutions. The objective of the problem is to find a combination of service periods for each task as well as the feasible routes of each period by using a predefined number of available vehicles that minimise the total travelling distance over the multi-period horizon. The two proposed algorithms are hybridised with a local search procedure that exploits several moves (relocate, swap, 2-opt and change combination). We develop two approaches to solve the problem under study: the first one is based on hybrid genetic algorithm with a specific crossover and the second one on hybrid ant colony method combined with an insertion heuristic. Article: Hybrid metaheuristics for the periodic open arc routing problem Journal: International Journal of Metaheuristics (IJMHEUR) 2022 Vol.8 No.1 pp.27 - 50 Abstract: This work considers the periodic open arc routing problem (POCARP) that models the meter reader application.
0 Comments
Leave a Reply. |