The University of Southampton
University of Southampton Institutional Repository

Exploring variants of 2-opt and 3-opt for the general routing problem

Exploring variants of 2-opt and 3-opt for the general routing problem
Exploring variants of 2-opt and 3-opt for the general routing problem
The general routing problem (GRP) is the problem of finding a minimum length tour, visiting a number of specified vertices and edges in an undirected graph. In this paper, we describe how the well-known 2-opt and 3-opt local search procedures for node routing problems can be adapted to solve arc and general routing problems successfully. Two forms of the 2-opt and 3-opt approaches are applied to the GRP. The first version is similar to the conventional approach for the traveling salesman problem; the second version includes a dynamic programming procedure and explores a larger neighborhood at the expense of higher running times. Extensive computational tests, including ones on larger instances than previously reported in the arc routing literature, are performed with variants of both algorithms. In combination with the guided local search metaheuristic and the mechanisms of marking and neighbor lists, the procedures system
0030-364X
Muyldermans, Luc
9faf029c-25ed-4121-8334-b50297d0ea98
Beullens, Patrick
893ad2e2-0617-47d6-910b-3d5f81964a9c
Cattrysse, Dirk
76177bbb-7ba1-416e-91d5-7ced36882178
Van Oudheusden, Dirk
82e8ce7e-b076-42d0-b2fc-3d4ffe1fce40
Muyldermans, Luc
9faf029c-25ed-4121-8334-b50297d0ea98
Beullens, Patrick
893ad2e2-0617-47d6-910b-3d5f81964a9c
Cattrysse, Dirk
76177bbb-7ba1-416e-91d5-7ced36882178
Van Oudheusden, Dirk
82e8ce7e-b076-42d0-b2fc-3d4ffe1fce40

Muyldermans, Luc, Beullens, Patrick, Cattrysse, Dirk and Van Oudheusden, Dirk (2005) Exploring variants of 2-opt and 3-opt for the general routing problem. Operations Research, 53 (6). (doi:10.1287/opre.1040.0205).

Record type: Article

Abstract

The general routing problem (GRP) is the problem of finding a minimum length tour, visiting a number of specified vertices and edges in an undirected graph. In this paper, we describe how the well-known 2-opt and 3-opt local search procedures for node routing problems can be adapted to solve arc and general routing problems successfully. Two forms of the 2-opt and 3-opt approaches are applied to the GRP. The first version is similar to the conventional approach for the traveling salesman problem; the second version includes a dynamic programming procedure and explores a larger neighborhood at the expense of higher running times. Extensive computational tests, including ones on larger instances than previously reported in the arc routing literature, are performed with variants of both algorithms. In combination with the guided local search metaheuristic and the mechanisms of marking and neighbor lists, the procedures system

This record has no associated files available for download.

More information

Published date: 2005
Organisations: Operational Research

Identifiers

Local EPrints ID: 205839
URI: http://eprints.soton.ac.uk/id/eprint/205839
ISSN: 0030-364X
PURE UUID: 3b0a56cb-0727-4403-b4f2-243dbfc0cf99
ORCID for Patrick Beullens: ORCID iD orcid.org/0000-0001-6156-3550

Catalogue record

Date deposited: 14 Dec 2011 10:27
Last modified: 15 Mar 2024 03:32

Export record

Altmetrics

Contributors

Author: Luc Muyldermans
Author: Dirk Cattrysse
Author: Dirk Van Oudheusden

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 http://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.

×