The University of Southampton
University of Southampton Institutional Repository

A guided local search heuristic for the capacitated arc routing problem

A guided local search heuristic for the capacitated arc routing problem
A guided local search heuristic for the capacitated arc routing problem
This paper presents a new local search algorithm for the capacitated arc routing problem (CARP). The procedure uses single vehicle moves and moves that operate on two routes, both derived from a node routing context but properly adapted to work well for arc routing problems. We combine the algorithm with the meta-heuristic guided local search and further use the mechanisms of neighbor lists and edge marking to improve the solution quality and to save computation time. Experiments on standard benchmark problems from the literature show that our algorithm outperforms the existing heuristics for the CARP. On a set of new test problems, the local search approach consistently produces high quality solutions and often detects an optimal solution within limited computation time
routing, capacitated arc routing problem, local search
0377-2217
629-643
Beullens, Patrick
893ad2e2-0617-47d6-910b-3d5f81964a9c
Muyldermans, Luc
9faf029c-25ed-4121-8334-b50297d0ea98
Cattrysse, Dirk
76177bbb-7ba1-416e-91d5-7ced36882178
Van Oudheusden, Dirk
82e8ce7e-b076-42d0-b2fc-3d4ffe1fce40
Beullens, Patrick
893ad2e2-0617-47d6-910b-3d5f81964a9c
Muyldermans, Luc
9faf029c-25ed-4121-8334-b50297d0ea98
Cattrysse, Dirk
76177bbb-7ba1-416e-91d5-7ced36882178
Van Oudheusden, Dirk
82e8ce7e-b076-42d0-b2fc-3d4ffe1fce40

Beullens, Patrick, Muyldermans, Luc, Cattrysse, Dirk and Van Oudheusden, Dirk (2003) A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research, 147 (3), 629-643. (doi:10.1016/S0377-2217(02)00334-X).

Record type: Article

Abstract

This paper presents a new local search algorithm for the capacitated arc routing problem (CARP). The procedure uses single vehicle moves and moves that operate on two routes, both derived from a node routing context but properly adapted to work well for arc routing problems. We combine the algorithm with the meta-heuristic guided local search and further use the mechanisms of neighbor lists and edge marking to improve the solution quality and to save computation time. Experiments on standard benchmark problems from the literature show that our algorithm outperforms the existing heuristics for the CARP. On a set of new test problems, the local search approach consistently produces high quality solutions and often detects an optimal solution within limited computation time

Full text not available from this repository.

More information

e-pub ahead of print date: 28 May 2002
Published date: 16 June 2003
Keywords: routing, capacitated arc routing problem, local search
Organisations: Operational Research

Identifiers

Local EPrints ID: 205863
URI: https://eprints.soton.ac.uk/id/eprint/205863
ISSN: 0377-2217
PURE UUID: 7b51f091-5a41-4a87-9a07-5de32df38573

Catalogue record

Date deposited: 14 Dec 2011 14:47
Last modified: 16 Jul 2019 23:16

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×