| Article ID: | iaor20091071 |
| Country: | United Kingdom |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 1112 |
| End Page Number: | 1126 |
| Publication Date: | Apr 2008 |
| Journal: | Computers and Operations Research |
| Authors: | Brando Jos, Eglese Richard |
| Keywords: | heuristics: tabu search |
The capacitated arc routing problem 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.