Lancaster EPrints

A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP)

Brandao, J and Eglese, R W (2005) A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP). Working Paper. The Department of Management Science, Lancaster University.

[img]
Preview
PDF (Document.pdf)
Download (453Kb) | 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: Monograph (Working Paper)
    Uncontrolled Keywords: Heuristics ; Arc Routing ; Tabu Search
    Subjects: UNSPECIFIED
    Departments: Lancaster University Management School > Management Science
    ID Code: 48773
    Deposited By: ep_importer_pure
    Deposited On: 11 Jul 2011 22:11
    Refereed?: No
    Published?: Published
    Last Modified: 27 Jul 2012 01:14
    Identification Number:
    URI: http://eprints.lancs.ac.uk/id/eprint/48773

    Actions (login required)

    View Item