Adaptive large neighborhood search algorithm for the rural postman problem with time windows | Zendy

MonroyLicht Marcela | Zendy; Amaya Ciro Alberto | Zendy; Langevin André | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Adaptive large neighborhood search algorithm for the rural postman problem with time windows

Author(s) -

MonroyLicht Marcela,

Amaya Ciro Alberto,

Langevin André

Publication year - 2017

Publication title -

networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.977

H-Index - 64

eISSN - 1097-0037

pISSN - 0028-3045

DOI - 10.1002/net.21747

Subject(s) - computer science , set (abstract data type) , mathematical optimization , algorithm , running time , vehicle routing problem , mathematics , routing (electronic design automation) , computer network , programming language

The rural postman problem with time windows is the problem of serving some required edges with one vehicle; the vehicle must visit these edges during established time windows. This article presents a competitive adaptive large neighborhood search algorithm to solve the problem. Computational experiments are performed on a large set of instances with up to 104 required edges. The results show that this approach is efficient, significantly reducing the computational time on large instances and achieving good solutions: the algorithm is able to solve to optimality 224 of 232 instances. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(1), 44–59 2017

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research