| Article ID: | iaor20172394 |
| Volume: | 70 |
| Issue: | 1 |
| Start Page Number: | 44 |
| End Page Number: | 59 |
| Publication Date: | Aug 2017 |
| Journal: | Networks |
| Authors: | Langevin Andr, Amaya Ciro Alberto, Monroy-Licht Marcela |
| Keywords: | programming: travelling salesman, combinatorial optimization, heuristics |
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.