Results 1 - 10
of
123
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract
-
Cited by 647 (82 self)
- Add to MetaCart
GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phase. The best overall solution is kept as the result. In this chapter, we first describe the basic components of GRASP. Successful implementation techniques and parameter tuning strategies are discussed and illustrated by numerical results obtained for different applications. Enhanced or alternative solution construction mechanisms and techniques to speed up the search are also described: Reactive GRASP, cost perturbations, bias functions, memory and learning, local search on partially constructed solutions, hashing, and filtering. We also discuss in detail implementation strategies of memory-based intensification and post-optimization techniques using path-relinking. Hybridizations with other metaheuristics, parallelization strategies, and applications are also reviewed.
Ant colonies for the travelling salesman problem
, 1997
"... We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer si ..."
Abstract
-
Cited by 286 (5 self)
- Add to MetaCart
We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to both symmetric and asymmetric instances of the TSP. The method is an example, like simulated annealing, neural networks and evolutionary computation, of the successful use of a natural metaphor to design an optimization algorithm.
QAPLIB–A Quadratic Assignment Problem Library
- European Journal of Operational Research
, 1991
"... ..."
Coordinated Target Assignment and Intercept for Unmanned Air Vehicles
, 2002
"... This paper presents an end-to-end solution to the battlefield scenario where M unmanned air vehicles are assigned to strike N known targets, in the presence of dynamic threats. The problem is decomposed into the subproblems of (1) cooperative target assignment, (2) coordinated UAV intercept, (3) pat ..."
Abstract
-
Cited by 155 (16 self)
- Add to MetaCart
(Show Context)
This paper presents an end-to-end solution to the battlefield scenario where M unmanned air vehicles are assigned to strike N known targets, in the presence of dynamic threats. The problem is decomposed into the subproblems of (1) cooperative target assignment, (2) coordinated UAV intercept, (3) path planning, and (4) feasible trajectory generation. The design technique is based on a hierarchical approach to coordinated control. Detailed simulation results are presented.
Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem
, 1999
"... In this paper, a fitness landscape analysis for several instances of the quadratic assignment problem (QAP) is performed and the results are used to classify problem instances according to their hardness for local search heuristics and meta-heuristics based on local search. The local properties of t ..."
Abstract
-
Cited by 86 (9 self)
- Add to MetaCart
In this paper, a fitness landscape analysis for several instances of the quadratic assignment problem (QAP) is performed and the results are used to classify problem instances according to their hardness for local search heuristics and meta-heuristics based on local search. The local properties of the tness landscape are studied by performing an autocorrelation analysis, while the global structure is investigated by employing a fitness distance correlation analysis. It is shown that epistasis, as expressed by the dominance of the flow and distance matrices of a QAP instance, the landscape ruggedness in terms of the correlation length of a landscape, and the correlation between fitness and distance of local optima in the landscape together are useful for predicting the performance of memetic algorithms - evolutionary algorithms incorporating local search - to a certain extent. Thus, based on these properties a favorable choice of recombination and/or mutation operators can be found.
Exact And Approximate Nondeterministic Tree-Search Procedures For The Quadratic Assignment Problem
, 1998
"... This paper introduces two new techniques for solving the Quadratic Assignment Problem. The first is a heuristic technique, defined in accordance to the Ant System metaphor, and includes as a distinctive feature the use of a new lower bound at each constructive step. The second is a branch and bound ..."
Abstract
-
Cited by 62 (5 self)
- Add to MetaCart
This paper introduces two new techniques for solving the Quadratic Assignment Problem. The first is a heuristic technique, defined in accordance to the Ant System metaphor, and includes as a distinctive feature the use of a new lower bound at each constructive step. The second is a branch and bound exact approach, containing some elements introduced in the Ant algorithm. Computational results prove the effectiveness of both approaches.
Iterated Local Search for the Quadratic Assignment Problem
- FG INTELLEKTIK, FB INFORMATIK
, 1999
"... Iterated local search (ILS) is a surprisingly simple but at the same time powerful metaheuristic for finding high quality approximate solutions for combinatorial optimization problems. ILS is based on the repeated application of a local search algorithm to initial solution which are obtained by m ..."
Abstract
-
Cited by 61 (10 self)
- Add to MetaCart
Iterated local search (ILS) is a surprisingly simple but at the same time powerful metaheuristic for finding high quality approximate solutions for combinatorial optimization problems. ILS is based on the repeated application of a local search algorithm to initial solution which are obtained by mutations of previously found local optima --- in most ILS algorithms these mutations are applied to the best found solution since the start of the search. In this article we present and analyze the application of ILS to the quadratic assignment problem (QAP). We first justify the potential usefulness of an ILS approach to this problem by an analysis of the QAP search space. An investigation of the run-time behavior of the ILS algorithm reveals a stagnation behavior of the algorithm --- it may get stuck for many iterations in local optima. To avoid such stagnation situations we propose enhancements of the ILS algorithm based on extended acceptance criteria as well as population-based...
A greedy genetic algorithm for the quadratic assignment problem
- COMPUTERS & OPERATIONS RESEARCH
, 2000
"... ..."
Probability distribution of solution time in GRASP: An experimental investigation
- J HEURISTIC
, 2000
"... A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a sub-optimal target value in five GRASPs that have appeared in the literature and for which source code is available. The ..."
Abstract
-
Cited by 60 (29 self)
- Add to MetaCart
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a sub-optimal target value in five GRASPs that have appeared in the literature and for which source code is available. The distributions are estimated by running 12,000 independent runs of the heuristic. Standard methodology for graphical analysis is used to compare the empirical and theoretical distributions and estimate the parameters of the distributions. We conclude that the solution time to a sub-optimal target value fits a two-parameter exponential distribution. Hence, it is possible to approximately achieve linear speed-up by implementing GRASP in parallel.
Feedback set problems
- HANDBOOK OF COMBINATORIAL OPTIMIZATION
, 1999
"... ABSTRACT. This paper is a short survey of feedback set problems. It will be published in ..."
Abstract
-
Cited by 56 (1 self)
- Add to MetaCart
(Show Context)
ABSTRACT. This paper is a short survey of feedback set problems. It will be published in