Brandao, J and Eglese, R W (2008) A deterministic tabu search algorithm for the capacitated arc routing problem. Computers and Operations Research, 35 (4). pp. 1112-1126. ISSN 0305-0548
|PDF (A deterministic tabu search algorithm for the capacitated arc routing problem) - Draft Version |
Download (164Kb) | Preview
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.
Actions (login required)