Results 1  10
of
1,991
On the complexity of local search
 Proc. of 22nd ACM Symp. on Theory of Computing (STOC
, 1990
"... We investigate the complexity of finding locally optimal solutions to NPhard combinatorial optimization problems. Local optimality arises in the context of local search algorithms, which try to find improved solutions by considering perturbations of the current solution (“neighbors ” of that solut ..."
Abstract

Cited by 229 (9 self)
 Add to MetaCart
” of that solution). If no neighboring solution is better than the current solution, it is locally optimal. Finding locally optimal solutions is presumably easier than finding optimal solutions. Nevertheless, many popular local search algorithms are based on neighborhood structures for which locally optimal
Approximating the nondominated front using the Pareto Archived Evolution Strategy
 EVOLUTIONARY COMPUTATION
, 2000
"... We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its ..."
Abstract

Cited by 321 (19 self)
 Add to MetaCart
We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its
Scatter Search and Path Relinking
, 1999
"... The evolutionary approach called scatter search, and its generalized form called path relinking, originated from strategies for creating composite decision rules and surrogate constraints. Recent studies demonstrate the practical advantages of these approaches for solving a diverse array of optimiza ..."
Abstract

Cited by 169 (33 self)
 Add to MetaCart
of optimization problems from both classical and real world settings. Scatter search and path relinking contrast with other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions (in both Euclidean and neighborhood spaces
Very LargeScale Neighborhood Search for the Quadratic Assignment Problem
 DISCRETE APPLIED MATHEMATICS
, 2002
"... The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NPhard, and can be solved to optimality only for fairly small size instances ..."
Abstract

Cited by 150 (13 self)
 Add to MetaCart
facilities and thus has size O(n²). Previous efforts to explore larger size neighborhoods (such as 3exchange or 4exchange neighborhoods) were not very successful, as it took too long to evaluate the larger set of neighbors. In this paper, we propose very largescale neighborhood (VLSN) search algorithms
Search through systematic set enumeration
 In Proc. of the Internation Conference on Principles of Knowledge Representation and Reasoning
, 1992
"... In many problem domains, solutions take the form of unordered sets. We present the SetEnumerations (SE)tree a vehicle for representing sets and/or enumerating them in a bestfirst fashion. We demonstrate its usefulness as the basis for a unifying searchbased framework for domains where minimal ( ..."
Abstract

Cited by 136 (5 self)
 Add to MetaCart
In many problem domains, solutions take the form of unordered sets. We present the SetEnumerations (SE)tree a vehicle for representing sets and/or enumerating them in a bestfirst fashion. We demonstrate its usefulness as the basis for a unifying searchbased framework for domains where minimal
Fundamentals of scatter search and path relinking
 CONTROL AND CYBERNETICS
, 2000
"... The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems from both classical and real world settings. Scatter Search and Path Relinking differ from other evolutionary procedur ..."
Abstract

Cited by 139 (14 self)
 Add to MetaCart
procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions (in both Euclidean and neighborhood spaces) and by utilizing strategic designs where other approaches resort to randomization. Scatter Search and Path Relinking are also
Parallel Large Neighborhood Search
, 2003
"... Industrial optimization applications must be robust: they must provide good solutions to problem instances of different size and numerical characteristics, and must continue to work well when side constraints are added. A good testbed for constructing such a robust solver is a set of network design ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
robustness we parallelize our search in a variety of ways. Most interesting is a method based on a portfolio of algorithms which is shown to outperform all previously known CPbased methods for this problem set. 1
Variable Neighborhood Search Based Algorithms for
"... This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC 2011), which released many instances from educational institutions ..."
Abstract
 Add to MetaCart
This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC 2011), which released many instances from educational
Automatic Algorithm Configuration based on Local Search
 IN AAAI ’07: PROC. OF THE TWENTYSECOND CONFERENCE ON ARTIFICAL INTELLIGENCE
, 2007
"... The determination of appropriate values for free algorithm parameters is a challenging and tedious task in the design of effective algorithms for hard problems. Such parameters include categorical choices (e.g., neighborhood structure in local search or variable/value ordering heuristics in tree sea ..."
Abstract

Cited by 76 (31 self)
 Add to MetaCart
The determination of appropriate values for free algorithm parameters is a challenging and tedious task in the design of effective algorithms for hard problems. Such parameters include categorical choices (e.g., neighborhood structure in local search or variable/value ordering heuristics in tree
Performance Analysis of Neighborhood Search Algorithms
"... The performance of neighborhood search is generally dicult to analyze due to the complexity of search spaces and algorithm parameter settings. This paper presents a Markovchain based framework for probabilistic analysis of such algorithms. Statistics of the lowest cost observed are obtained and use ..."
Abstract
 Add to MetaCart
The performance of neighborhood search is generally dicult to analyze due to the complexity of search spaces and algorithm parameter settings. This paper presents a Markovchain based framework for probabilistic analysis of such algorithms. Statistics of the lowest cost observed are obtained
Results 1  10
of
1,991