Results 1  10
of
122
LargeStep Markov Chains for the Traveling Salesman Problem
 Complex Systems
, 1991
"... We introduce a new class of Markov chain Monte Carlo search procedures, leading to more powerful optimization methods than simulated annealing. The main idea is to embed deterministic local search techniques into stochastic algorithms. The Monte Carlo explores only local optima, and it is able to ma ..."
Abstract

Cited by 92 (6 self)
 Add to MetaCart
We introduce a new class of Markov chain Monte Carlo search procedures, leading to more powerful optimization methods than simulated annealing. The main idea is to embed deterministic local search techniques into stochastic algorithms. The Monte Carlo explores only local optima, and it is able to make large, global changes, even at low temperatures, thus overcoming large barriers in configuration space. We test these procedures in the case of the Traveling Salesman Problem. The embedded local searches we use are 3opt and LinKernighan. The large change or step consists of a special kind of 4change followed by localopt minimization. We test this algorithm on a number of instances. The power of the method is illustrated by solving to optimality some large problems such as the LIN318, the AT&T532, and the RAT783 problems. For even larger instances with randomly distributed cities, the Markov chain procedure improves 3opt by over 1.6%, and LinKernighan by 1.3%, leading to a new best h...
Algorithms for the Set Covering Problem
 Annals of Operations Research
, 1998
"... The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and masstransit companies. ..."
Abstract

Cited by 69 (3 self)
 Add to MetaCart
The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and masstransit companies.
A note on the prize collecting traveling salesman problem
, 1993
"... We study the version of the prize collecting traveling salesman problem, where the objective is to find a tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. We present an approximation alg ..."
Abstract

Cited by 63 (5 self)
 Add to MetaCart
We study the version of the prize collecting traveling salesman problem, where the objective is to find a tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. We present an approximation algorithm with constant bound. The algorithm is based on Christofides' algorithm for the traveling salesman problem as well as a method to round fractional solutions of a linear programming relaxation to integers, feasible for the original problem.
A Heuristic Method for the Set Covering Problem
 OPERATIONS RESEARCH
, 1995
"... We present a Lagrangianbased heuristic for the wellknown Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows and 1,000,000 columns, arising from crew scheduling in the Italian Railway Company, Ferrovie dello St ..."
Abstract

Cited by 62 (8 self)
 Add to MetaCart
We present a Lagrangianbased heuristic for the wellknown Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows and 1,000,000 columns, arising from crew scheduling in the Italian Railway Company, Ferrovie dello Stato SpA. In 1994 Ferrovie dello Stato SpA, jointly with the Italian Operational Research Society, organized a competition, called FASTER, intended to promote the development of algorithms capable of producing good solutions for these instances, since the classical approaches meet with considerable difficulties in tackling them. The main characteristics of the algorithm we propose are (1) a dynamic pricing scheme for the variables, akin to that used for solving largescale LP's, to be coupled with subgradient optimization and greedy algorithms, and (2) the systematic use of column fixing to obtain improved solutions. Moreover, we propose a number of improvements on the standard way o...
Approximating Geometrical Graphs Via Spanners and Banyans
, 1998
"... The main result of this paper is an improvement of Arora's method to find (1+ ffl) approximations for geometric NPhard problems including the Euclidean Traveling Salesman Problem and the Euclidean Steiner Minimum Tree problems. For fixed dimension d and ffl, our algorithms run in O(N log N) time. ..."
Abstract

Cited by 61 (0 self)
 Add to MetaCart
The main result of this paper is an improvement of Arora's method to find (1+ ffl) approximations for geometric NPhard problems including the Euclidean Traveling Salesman Problem and the Euclidean Steiner Minimum Tree problems. For fixed dimension d and ffl, our algorithms run in O(N log N) time. An interesting byproduct of our work is the definition and construction of banyans, a generalization of graph spanners. A (1 + ffl)banyan for a set of points A is a set of points A 0 and line segments S with endpoints in A [ A 0 such that a 1 + ffl optimal Steiner Minimum Tree for any subset of A is contained in S. We give a construction for banyans such that the total length of the line segments in S is within a constant factor of the length of the minimum spanning tree of A, and jA 0 j = O(jAj), when ffl and d are fixed. In this abbreviated paper, we only provide proofs of these results in two dimensions. The full paper on WDS's web page (http://www.neci.nj.nec.com/homepages/wds, c...
A Discrete LagrangianBased GlobalSearch Method for Solving Satisfiability Problems
 Journal of Global Optimization
, 1998
"... Satisfiability is a class of NPcomplete problems that model a wide range of realworld applications. These problems are difficult to solve because they have many local minima in their search space, often trapping greedy search methods that utilize some form of descent. In this paper, we propose a n ..."
Abstract

Cited by 59 (7 self)
 Add to MetaCart
Satisfiability is a class of NPcomplete problems that model a wide range of realworld applications. These problems are difficult to solve because they have many local minima in their search space, often trapping greedy search methods that utilize some form of descent. In this paper, we propose a new discrete Lagrangemultiplierbased globalsearch method for solving satisfiability problems. We derive new approaches for applying Lagrangian methods in discrete space, show that equilibrium is reached when a feasible assignment to the original problem is found, and present heuristic algorithms to look for equilibrium points. Instead of restarting from a new starting point when a search reaches a local trap, the Lagrange multipliers in our method provide a force to lead the search out of a local minimum and move it in the direction provided by the Lagrange multipliers. One of the major advantages of our method is that it has very few algorithmic parameters to be tuned by users, and the se...
A BranchandCut Algorithm for the Symmetric Generalized Travelling Salesman Problem
, 1995
"... We consider a variant of the classical symmetric Travelling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This NPhard problem is known in the literature as the symmetric Generalized Travelling Salesman Problem (GT ..."
Abstract

Cited by 59 (4 self)
 Add to MetaCart
We consider a variant of the classical symmetric Travelling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This NPhard problem is known in the literature as the symmetric Generalized Travelling Salesman Problem (GTSP), and finds practical applications in routing, scheduling and locationrouting. In a companion paper [5] we modeled GTSP as an integer linear program, and studied the facial structure of two polytopes associated with the problem. Here we propose exact and heuristic separation procedures for some classes of facetdefining inequalities, which are used within a branchandcut algorithm for the exact solution of GTSP. Heuristic procedures are also described. Extensive computational results for instances taken from the literature and involving up to 442 nodes are reported.
Experimental Analysis of Heuristics for the STSP
 Local Search in Combinatorial Optimization
, 2001
"... In this and the following chapter, we consider what approaches one should take when one is confronted with a realworld application of the TSP. What algorithms should be used under which circumstances? We ..."
Abstract

Cited by 53 (1 self)
 Add to MetaCart
In this and the following chapter, we consider what approaches one should take when one is confronted with a realworld application of the TSP. What algorithms should be used under which circumstances? We
Anomalies in Parallel BranchandBound Algorithms
, 1984
"... We consider the effects of parallelizing branchandbound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branchandbound algorithm using n 2 processors to take more time than one using n 1 processors even though n 1 < n 2 . Furthermor ..."
Abstract

Cited by 49 (3 self)
 Add to MetaCart
We consider the effects of parallelizing branchandbound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branchandbound algorithm using n 2 processors to take more time than one using n 1 processors even though n 1 < n 2 . Furthermore, it is also possible to achieve speedups that are in excess of the ratio n 2 /n 1 . Experimental results with the 0/1Knapsack and Traveling Salesperson problems are also presented.
Survivable networks, linear programming relaxations and the parsimonious property
, 1993
"... We consider the survivable network design problem the problem of designing, at minimum cost, a network with edgeconnectivity requirements. As special cases, this problem encompasses the Steiner tree problem, the traveling salesman problem and the kedgeconnected network design problem. We establ ..."
Abstract

Cited by 44 (12 self)
 Add to MetaCart
We consider the survivable network design problem the problem of designing, at minimum cost, a network with edgeconnectivity requirements. As special cases, this problem encompasses the Steiner tree problem, the traveling salesman problem and the kedgeconnected network design problem. We establish a property, referred to as the parsimonious property, of the linear programming (LP) relaxation of a classical formulation for the problem. The parsimonious property has numerous consequences. For example, we derive various structural properties of these LP relaxations, we present some algorithmic improvements and we perform tight worstcase analyses of two heuristics for the survivable network design problem.