AURA Takes you to the home page
 

Aberdeen University Research Archive >
6 - All research >
All research >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2164/133

This item has been viewed 11 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
ISSN 0143-07-19.pdf852.48 kBAdobe PDFView/Open
Title: The Subtour Centre Problem
Authors: Lamb, John Douglas
University of Aberdeen, Business School, Management Studies
Keywords: Location, Combinatorial optimization, Heuristics, Linear Programming
Issue Date: 20-Mar-2007
Series/Report no.: University of Aberdeen Business School Working Paper Series
Discussion Paper 2007-19
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.
URI: http://hdl.handle.net/2164/133
ISSN: 0143-4543
Appears in Collections:Management Studies research
All research

SFX Query

Items in AURA are protected by copyright, with all rights reserved, unless otherwise indicated.

 


The University of Aberdeen
King's College
Aberdeen
AB24 3FX
Tel: +44 (0)1224-272000