Lancaster EPrints

A deterministic tabu search algorithm for the capacitated arc routing problem

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

[img]
Preview
PDF (A deterministic tabu search algorithm for the capacitated arc routing problem) - Draft Version
Download (164Kb) | Preview

    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.

    Item Type: Article
    Journal or Publication Title: Computers and Operations Research
    Subjects:
    Departments: Lancaster University Management School > Management Science
    ID Code: 45077
    Deposited By: ep_importer_pure
    Deposited On: 11 Jul 2011 19:26
    Refereed?: Yes
    Published?: Published
    Last Modified: 09 Apr 2014 22:28
    Identification Number:
    URI: http://eprints.lancs.ac.uk/id/eprint/45077

    Actions (login required)

    View Item