Fernández de Córdoba, Pedro; García-Raffi, L. M.; Sanchís Llopis, José María(Elsevier, 1998)
[EN] The Rural Postman Problem (RPP) consists of finding a minimum cost traversal of a specified are subset of a graph. Given that the RPP is a NP-hard problem, heuristic algorithms are interesting both to handle large ...
Micó Ruiz, Juan Carlos; Soler Fernández, David(Elsevier, 2011)
In this paper we present the capacitated general windy routing problem with turn penalties. This new problem subsumes many important and well-known arc and node routing problems, and it takes into account turn penalties ...
In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing problems, and it takes into account turn penalties and forbidden ...