The Subtour Centre Problem

Research output: Working paperDiscussion paper

Abstract

The subtour centre problem is the problem of finding a closed trail S of bounded length on a connected simple graph G that minimises the maximum distance from S to any vertex ofG. It is a central location problem related to the cycle centre and cycle median problems (Foulds et al., 2004; Labbé et al., 2005) and the covering tour problem (Current and Schilling, 1989). Two related heuristics and an integer linear programme are formulated for it. These are compared numerically using a range of problems derived from tsplib (Reinelt, 1995). The heuristics usually perform substantially better then the integer linear programme and there is some evidence that the simpler heuristics perform better on the less dense graphs that may be more typical of applications.
Original languageEnglish
PublisherUniversity of Aberdeen Business School
Number of pages21
Publication statusPublished - Mar 2007

Publication series

NameUniversity of Aberdeen Business School Working Paper Series
No.19
Volume2007
ISSN (Print)0143-4543

Fingerprint

Center Problem
Integer Program
Heuristics
Linear Program
Cycle
Covering Problem
Location Problem
Simple Graph
Connected graph
Minimise
Closed
Graph in graph theory
Vertex of a graph
Range of data

Cite this

Lamb, J. D. (2007). The Subtour Centre Problem. (University of Aberdeen Business School Working Paper Series; Vol. 2007, No. 19). University of Aberdeen Business School.

The Subtour Centre Problem. / Lamb, John Douglas.

University of Aberdeen Business School, 2007. (University of Aberdeen Business School Working Paper Series; Vol. 2007, No. 19).

Research output: Working paperDiscussion paper

Lamb, JD 2007 'The Subtour Centre Problem' University of Aberdeen Business School Working Paper Series, no. 19, vol. 2007, University of Aberdeen Business School.
Lamb JD. The Subtour Centre Problem. University of Aberdeen Business School. 2007 Mar. (University of Aberdeen Business School Working Paper Series; 19).
Lamb, John Douglas. / The Subtour Centre Problem. University of Aberdeen Business School, 2007. (University of Aberdeen Business School Working Paper Series; 19).
@techreport{5d7db5cd501e45aaa737994baa5c9c11,
title = "The Subtour Centre Problem",
abstract = "The subtour centre problem is the problem of finding a closed trail S of bounded length on a connected simple graph G that minimises the maximum distance from S to any vertex ofG. It is a central location problem related to the cycle centre and cycle median problems (Foulds et al., 2004; Labb{\'e} et al., 2005) and the covering tour problem (Current and Schilling, 1989). Two related heuristics and an integer linear programme are formulated for it. These are compared numerically using a range of problems derived from tsplib (Reinelt, 1995). The heuristics usually perform substantially better then the integer linear programme and there is some evidence that the simpler heuristics perform better on the less dense graphs that may be more typical of applications.",
author = "Lamb, {John Douglas}",
year = "2007",
month = "3",
language = "English",
series = "University of Aberdeen Business School Working Paper Series",
publisher = "University of Aberdeen Business School",
number = "19",
type = "WorkingPaper",
institution = "University of Aberdeen Business School",

}

TY - UNPB

T1 - The Subtour Centre Problem

AU - Lamb, John Douglas

PY - 2007/3

Y1 - 2007/3

N2 - The subtour centre problem is the problem of finding a closed trail S of bounded length on a connected simple graph G that minimises the maximum distance from S to any vertex ofG. It is a central location problem related to the cycle centre and cycle median problems (Foulds et al., 2004; Labbé et al., 2005) and the covering tour problem (Current and Schilling, 1989). Two related heuristics and an integer linear programme are formulated for it. These are compared numerically using a range of problems derived from tsplib (Reinelt, 1995). The heuristics usually perform substantially better then the integer linear programme and there is some evidence that the simpler heuristics perform better on the less dense graphs that may be more typical of applications.

AB - The subtour centre problem is the problem of finding a closed trail S of bounded length on a connected simple graph G that minimises the maximum distance from S to any vertex ofG. It is a central location problem related to the cycle centre and cycle median problems (Foulds et al., 2004; Labbé et al., 2005) and the covering tour problem (Current and Schilling, 1989). Two related heuristics and an integer linear programme are formulated for it. These are compared numerically using a range of problems derived from tsplib (Reinelt, 1995). The heuristics usually perform substantially better then the integer linear programme and there is some evidence that the simpler heuristics perform better on the less dense graphs that may be more typical of applications.

M3 - Discussion paper

T3 - University of Aberdeen Business School Working Paper Series

BT - The Subtour Centre Problem

PB - University of Aberdeen Business School

ER -