A deterministic tabu search algorithm for the capacitated arc routing problem |
| |
| Authors: | José Brandão Richard Eglese |
| |
| Affiliation: | 1. Dep. de Gestão, Escola de Economia e Gestão, Universidade do Minho, Largo do Paço, 4704 -553 Braga, Portugal;2. Department of Management Science, Lancaster University Management School, Lancaster LA1 4YX, UK |
| |
| Abstract: | The capacitated arc routing problem (CARP) is a difficult optimisation problem in vehicle routing with applications where a service must be provided by a set of vehicles on specified roads. A heuristic algorithm based on tabu search is proposed and tested on various sets of benchmark instances. The computational results show that the proposed algorithm produces high quality results within a reasonable computing time. Some new best solutions are reported for a set of test problems used in the literature. |
| |
| Keywords: | Heuristics Arc routing Tabu search |
| 本文献已被 ScienceDirect 等数据库收录！ |
