Results 1  10
of
41
Variable Neighborhood Search
, 1997
"... Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications a ..."
Abstract

Cited by 242 (24 self)
 Add to MetaCart
Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications are briefly summarized. They comprise heuristic solution of a variety of optimization problems, ways to accelerate exact algorithms and to analyze heuristic solution processes, as well as computerassisted discovery of conjectures in graph theory.
On the Solution of Traveling Salesman Problems
 DOC. MATH. J. DMV
, 1998
"... Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TS ..."
Abstract

Cited by 176 (7 self)
 Add to MetaCart
Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TSP instances with more than several hundred cities; over the years, it has evolved further through the work of M. Grötschel , S. Hong , M. Jünger , P. Miliotis , D. Naddef , M. Padberg
Variable neighborhood search: Principles and applications
, 2001
"... Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS). We present a basic scheme for this purpose, which can easily be implemented using an ..."
Abstract

Cited by 119 (15 self)
 Add to MetaCart
Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS). We present a basic scheme for this purpose, which can easily be implemented using any local search algorithm as a subroutine. Its effectiveness is illustrated by solving several classical combinatorial or global optimization problems. Moreover, several extensions are proposed for solving large problem instances: using VNS within the successive approximation method yields a twolevel VNS, called variable neighborhood decomposition search (VNDS); modifying the basic scheme to explore easily valleys far from the incumbent solution yields an efficient skewed VNS (SVNS) heuristic. Finally, we show how to stabilize column generation algorithms with help of VNS and discuss various ways to use VNS in graph theory, i.e., to suggest, disprove or give hints on how to prove conjectures, an area where metaheuristics do not appear
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
 Artificial Intelligence Review
, 1999
"... This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Alg ..."
Abstract

Cited by 67 (2 self)
 Add to MetaCart
This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with dierent representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with dierent standard examples using combination of crossover and mutation operators in relation with path representation. Keywords: Travelling Salesman Problem; Genetic Algorithms; Binary representation; Path representation; Adjacency representation; Ordinal representation; Matrix representation; Hybridation. 1 1 Introduction In nature, there exist many processes which seek a stable state. These processes can be seen as natural optimization processes. Over the last...
Chained LinKernighan for large traveling salesman problems
, 2000
"... We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained LinKernighan heuristic for largescale traveling salesman problems. Computational results are presented for TSPLIB instances ranging in size from 11,849 cities up to 85,900 cities; for each of t ..."
Abstract

Cited by 52 (1 self)
 Add to MetaCart
We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained LinKernighan heuristic for largescale traveling salesman problems. Computational results are presented for TSPLIB instances ranging in size from 11,849 cities up to 85,900 cities; for each of these instances, solutions within 1% of the optimal value can be found in under 1 CPU minute on a 300 Mhz Pentium II workstation, and solutions within 0.5% of optimal can be found in under 10 CPU minutes. We also demonstrate the scalability of the heuristic, presenting results for randomly generated Euclidean instances having up to 25,000,000 cities. For the largest of these random instances, a tour within 1% of an estimate of the optimal value can be obtained in under 1 CPU day on a 64bit IBM RS6000 workstation.
JMeans: A New Local Search Heuristic for Minimum SumofSquares Clustering
"... A new local search heuristic, called JMeans, is proposed for solving the minimum sumofsquares clustering problem. The neighborhood of the current solution is defined by all possible centroidtoentity relocations followed by corresponding changes of assignments. Moves are made in such neighborhoo ..."
Abstract

Cited by 38 (10 self)
 Add to MetaCart
A new local search heuristic, called JMeans, is proposed for solving the minimum sumofsquares clustering problem. The neighborhood of the current solution is defined by all possible centroidtoentity relocations followed by corresponding changes of assignments. Moves are made in such neighborhoods until a local optimum is reached. The new heuristic is compared with two other wellknown local search heuristics, KMeans and HMeans as well as with HMeans+, an improved version of the latter in which degeneracy is removed. Moreover, another heuristic, which fits into the Variable Neighborhood Search metaheuristic framework and uses JMeans in its local search step, is proposed too. Results on standard test problems from the literature are reported. It appears that JMeans outperforms the other local search methods, quite substantially when many entities and clusters are considered. 1 Introduction Consider a set X = fx 1 ; : : : ; xN g, x j = (x 1j ; : : : ; x qj ) 2 R q of N entiti...
Finding Tours in the TSP
 INSTITUTE FOR DISCRETE MATHEMATICS, UNIVERSITAT BONN
, 1999
"... The traveling salesman problem, or TSP for short, is easy to state: given a finite number of "cities" along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point. The travel costs are symmetric in the sense ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
The traveling salesman problem, or TSP for short, is easy to state: given a finite number of "cities" along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point. The travel costs are symmetric in the sense that traveling from city X to city Y costs just as much as traveling from Y to X; the "way of visiting all the cities" is simply the order in which the cities are visited. In this report we consider the relaxed version of the TSP where we ask only for a tour of low cost. This is a preliminary version of a chapter of planned monograph on the TSP.
Branch and Tree Decomposition Techniques for Discrete Optimization
, 2005
"... This chapter gives a general overview of two emerging techniques for discrete optimization that have footholds in mathematics, computer science, and operations research: branch decompositions and tree decompositions. Branch decompositions and tree decompositions along with their respective connecti ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
This chapter gives a general overview of two emerging techniques for discrete optimization that have footholds in mathematics, computer science, and operations research: branch decompositions and tree decompositions. Branch decompositions and tree decompositions along with their respective connectivity invariants, branchwidth and treewidth, were first introduced to aid in proving the Graph Minors Theorem, a wellknown conjecture (Wagner’s conjecture) in graph theory. The algorithmic importance of branch decompositions and tree decompositions for solving NPhard problems modelled on graphs was first realized by computer scientists in relation to formulating graph problems in monadic second order logic. The dynamic programming techniques utilizing branch decompositions and tree decompositions, called branch decomposition and tree decomposition based algorithms, fall into a class of algorithms known as fixedparameter tractable algorithms and have been shown to be effective in a practical setting for NPhard problems such as minimum domination, the travelling salesman problem, general minor containment, and frequency assignment problems.