Location of Repository

A central cycle problem requires a cycle that is\ud reasonably short and keeps a the maximum distance\ud from any node not on the cycle to its nearest\ud node on the cycle reasonably low. The objective\ud may be to minimise maximumdistance or cycle\ud length and the solution may have further constraints.\ud Most classes of central cycle problems\ud are NP-hard. This paper investigates insertion\ud heuristics for central cycle problems, drawing on\ud insertion heuristics for p-centres [7] and travelling\ud salesman tours [21]. It shows that a modified\ud farthest insertion heuristic has reasonable worstcase\ud bounds for a particular class of problem.\ud It then compares the performance of two farthest\ud insertion heuristics against each other and\ud against bounds (where available) obtained by integer\ud programming on a range of problems from\ud TSPLIB [20]. It shows that a simple farthest insertion\ud heuristic is fast, performs well in practice\ud and so is likely to be useful for a general problems\ud or as the basis for more complex heuristics\ud for specific problems

Topics:
tour, cycle, centre, eccentricity, cyclelength

Year: 2006

OAI identifier:
oai:aura.abdn.ac.uk:2164/96

Provided by:
Aberdeen University Research Archive

Downloaded from
http://hdl.handle.net/2164/96

- (1996). A review of extensive facility location in networks,
- (1985). A simple heuristic for the p-centre problem
- (1977). An analysis of several heuristics for the traveling salesman problem,
- An analysis of several heuristics for the travelingsalesmanproblem,
- (2006). An exact algorithm for the capacitated vertex p-center problem,
- (1998). An O(log ∗ n) approximation algorithm for the asymmetric p-centre problem,
- (1998). An O(log∗ n) approximation algorithm for the asymmetric p-centre problem,
- (1998). Combinatorial optimization,
- (2003). Dominant, an algorithm for the p-center problem,
- (1979). Easy and hard bottleneck location problems,
- (1997). Generalized p-center problems: complexity results and approximation algorithms,
- (2005). k-center problems with minimum coverage,
- (2004). Large-scale local search heuristics for the capacitated vertex p-center problem,
- (2003). Lexicographic local search and the p-center problem,
- (1982). Locating central paths in a graph,
- (2005). Locating median cycles in networks,
- (2004). Modelling and solving central cycle problems with integer programming,
- (1964). Optimum location of switching centers and the absolute centers and medians of a graph,
- (2003). Solving the p-center problem with tabu search and variable neighbourhood search,
- The boost graph library,
- (1994). The median tour and maximal covering tour problems: formulations and heuristics,
- (1984). The p-centre problem—heuristic and optimal algorithms,
- (1985). The traveling salesman problem,
- (1976). Worst-case analysis of a new heuristic for the travelling salesman problem,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.