Hybrid metaheuristics for the periodic open arc routing problem
by Ali Kansou; Bilal Kanso
International Journal of Metaheuristics (IJMHEUR), Vol. 8, No. 1, 2022

Abstract: This work considers the periodic open arc routing problem (POCARP) that models the meter reader application. This application is very interesting when the routes are planned on horizon of several periods. 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. The two proposed algorithms are hybridised with a local search procedure that exploits several moves (relocate, swap, 2-opt and change combination). 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. We extended the optimal splitting procedure to generate and evaluate solutions. We compared our approaches with one of the most important insertion heuristics adapted to this problem. Computational experiments are conducted on a set of generated benchmark instances and indicate that the proposed metaheuristics dominate the good insertion heuristic.

Online publication date: Mon, 19-Dec-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com