Greedy randomized adaptive search procedures (2003)

by M G C Resende, C C Ribeiro
Venue:in Handbook of Metaheuristics
Add To MetaCart
Results 1 - 10 of 647

TABU SEARCH

by Fred Glover, Rafael Marti
"... Tabu Search is a metaheuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. One of the main components of tabu search is its use of adaptive memory, which creates a more flexible search behavior. Memory based strategies are therefore the hallm ..."
Abstract - Cited by 822 (48 self) - Add to MetaCart
Tabu Search is a metaheuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. One of the main components of tabu search is its use of adaptive memory, which creates a more flexible search behavior. Memory based strategies are therefore the hallmark of tabu search approaches, founded on a quest for "integrating principles, " by which alternative forms of memory are appropriately combined with effective strategies for exploiting them. In this chapter we address the problem of training multilayer feed-forward neural networks. These networks have been widely used for both prediction and classification in many different areas. Although the most popular method for training these networks is backpropagation, other optimization methods such as tabu search have been applied to solve this problem. This chapter describes two training algorithms based on the tabu search. The experimentation shows that the procedures provide high quality solutions to the training problem, and in addition consume a reasonable computational effort.

Metaheuristics in combinatorial optimization: Overview and conceptual comparison

by Christian Blum, Andrea Roli - ACM COMPUTING SURVEYS , 2003
"... The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important meta ..."
Abstract - Cited by 314 (17 self) - Add to MetaCart
The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important metaheuristics from a conceptual point of view. We outline the different components and concepts that are used in the different metaheuristics in order to analyze their similarities and differences. Two very important concepts in metaheuristics are intensification and diversification. These are the two forces that largely determine the behaviour of a metaheuristic. They are in some way contrary but also complementary to each other. We introduce a framework, that we call the I&D frame, in order to put different intensification and diversification components into relation with each other. Outlining the advantages and disadvantages of different metaheuristic approaches we conclude by pointing out the importance of hybridization of metaheuristics as well as the integration of metaheuristics and other methods for optimization.

Iterated local search

by Helena R. Lourenço, Olivier C. Martin, Thomas Stützle - Handbook of Metaheuristics, volume 57 of International Series in Operations Research and Management Science , 2002
"... Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions th ..."
Abstract - Cited by 172 (15 self) - Add to MetaCart
Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions that are locally optimal for a given optimization engine. The success of Iterated Local Search lies in the biased sampling of this set of local optima. How effective this approach turns out to be depends mainly on the choice of the local search, the perturbations, and the acceptance criterion. So far, in spite of its conceptual simplicity, it has lead to a number of state-of-the-art results without the use of too much problem-specific knowledge. But with further work so that the different modules are well adapted to the problem at hand, Iterated Local Search can often become a competitive or even state of the art algorithm. The purpose of this review is both to give a detailed description of this metaheuristic and to show where it stands in terms of performance. O.M. acknowledges support from the Institut Universitaire de France. This work was partially supported by the “Metaheuristics Network”, a Research Training Network funded by the Improving Human Potential programme of the CEC, grant HPRN-CT-1999-00106. The information provided is the sole responsibility of the authors and does not reflect the Community’s opinion. The Community is not responsible for any use that might be made of data appearing in this publication. 1 1
(Show Context)

Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem

by Ravindra K. Ahuja, Krishna C. Jha, James B. Orlin, Dushyant Sharma - 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 NP-hard, and can be solved to optimality only for fairly small size instances ..."
Abstract - Cited by 150 (13 self) - Add to MetaCart
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 NP-hard, and can be solved to optimality only for fairly small size instances (typically, n < 25). Neighborhood search algorithms are the most popular heuristic algorithms to solve larger size instances of the QAP. The most extensively used neighborhood structure for the QAP is the 2-exchange neighborhood. This neighborhood is obtained by swapping the locations of two facilities and thus has size O(n²). Previous efforts to explore larger size neighborhoods (such as 3-exchange or 4-exchange 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 where the size of the neighborhood is very large and we propose a novel search procedure to heuristically enumerate good neighbors. Our search procedure relies on the concept of improvement graph which allows us to evaluate neighbors much faster than the existing methods. We present extensive computational results of our algorithms on standard benchmark instances. These investigations reveal that very large-scale neighborhood search algorithms give consistently better solutions compared the popular 2-exchange neighborhood algorithms considering both the solution time and solution accuracy.

Designing and reporting on computational experiments with heuristic methods

by Richard S. Barr, Bruce L. Golden, James P. Kelly, Mauricio G. C. Resende , William R. Stewart - JOURNAL OF HEURISTICS , 1995
"... This report discusses the design of computational experiments to test heuristic methods and provides reporting guidelines for such experimentation. The goal is to promote thoughtful, well-planned, and extensive testing of heuristics, full disclosure of experimental conditions, and integrity in and r ..."
Abstract - Cited by 142 (1 self) - Add to MetaCart
This report discusses the design of computational experiments to test heuristic methods and provides reporting guidelines for such experimentation. The goal is to promote thoughtful, well-planned, and extensive testing of heuristics, full disclosure of experimental conditions, and integrity in and reproducibility of the reported results.
(Show Context)

MAX-MIN Ant System and Local Search for the Traveling Salesman Problem

by Thomas Stützle, Holger Hoos - IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC'97) , 1997
"... Ant System is a general purpose algorithm inspired by the study of the behavior of Ant Colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. In this paper we introduce MAX --MIN Ant System, an improved version of basic Ant S ..."
Abstract - Cited by 138 (15 self) - Add to MetaCart
Ant System is a general purpose algorithm inspired by the study of the behavior of Ant Colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. In this paper we introduce MAX --MIN Ant System, an improved version of basic Ant System, and report our results for its application to symmetric and asymmetric instances of the well known Traveling Salesman Problem. We show how MAX --MIN Ant System can be significantly improved extending it with local search heuristics. Our results clearly show that MAX --MIN Ant System has the property of effectively guiding the local search heuristics towards promising regions of the search space by generating good initial tours. I. Introduction The Ant System algorithm, originally introduced in [3], [4], is a new cooperative search algorithm inspired by the behavior of real ants. Ants are able to find good solutions to shortest path problems between a food source and their home colony...
(Show Context)

Greedy Randomized Adaptive Search Procedures For The Steiner Problem In Graphs

by Simone L. Martins, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro - QUADRATIC ASSIGNMENT AND RELATED PROBLEMS, VOLUME 16 OF DIMACS SERIES ON DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE , 1999
"... We describe four versions of a Greedy Randomized Adaptive Search Procedure (GRASP) for finding approximate solutions of general instances of the Steiner Problem in Graphs. Di#erent construction and local search algorithms are presented. Preliminary computational results with one of the versions ..."
Abstract - Cited by 123 (31 self) - Add to MetaCart
We describe four versions of a Greedy Randomized Adaptive Search Procedure (GRASP) for finding approximate solutions of general instances of the Steiner Problem in Graphs. Di#erent construction and local search algorithms are presented. Preliminary computational results with one of the versions on a variety of test problems are reported. On the majority of instances from the OR-Library, a set of standard test problems, the GRASP produced optimal solutions. On those that optimal solutions were not found, the GRASP found good quality approximate solutions.

The ant colony optimization metaheuristic: Algorithms, applications, and advances

by Marco Dorigo, Thomas Stützle - Handbook of Metaheuristics , 2002
"... ..."
Abstract - Cited by 112 (5 self) - Add to MetaCart
Abstract not found
(Show Context)

A genetic algorithm for the weight setting problem in OSPF routing

by M. Ericsson, M. G. C. Resende, P. M. Pardalos - Journal of Combinatorial Optimization , 2002
"... Abstract. With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to desti ..."
Abstract - Cited by 111 (26 self) - Add to MetaCart
Abstract. With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used intra-domain Internet routing protocol (IRP). Traffic flow is routed along shortest paths, splitting flow at nodes with several outgoing links on a shortest path to the destination IP address. Link weights are assigned by the network operator. A path length is the sum of the weights of the links in the path. The OSPF weight setting (OSPFWS) problem seeks a set of weights that optimizes network performance. We study the problem of optimizing OSPF weights, given a set of projected demands, with the objective of minimizing network congestion. The weight assignment problem is NP-hard. We present a genetic algorithm (GA) to solve the OSPFWS problem. We compare our results with the best known and commonly used heuristics for OSPF weight setting, as well as with a lower bound of the optimal multi-commodity flow routing, which is a linear programming relaxation of the OSPFWS problem. Computational experiments are made on the AT&T Worldnet backbone with projected demands, and on twelve instances of synthetic networks. 1.
(Show Context)

The Quadratic Assignment Problem: A Survey and Recent Developments

by Panos M. Pardalos, Franz Rendl, Henry Wolkowicz - In Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, volume 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science , 1994
"... . Quadratic Assignment Problems model many applications in diverse areas such as operations research, parallel and distributed computing, and combinatorial data analysis. In this paper we survey some of the most important techniques, applications, and methods regarding the quadratic assignment probl ..."
Abstract - Cited by 109 (16 self) - Add to MetaCart
. Quadratic Assignment Problems model many applications in diverse areas such as operations research, parallel and distributed computing, and combinatorial data analysis. In this paper we survey some of the most important techniques, applications, and methods regarding the quadratic assignment problem. We focus our attention on recent developments. 1. Introduction Given a set N = f1; 2; : : : ; ng and n \Theta n matrices F = (f ij ) and D = (d kl ), the quadratic assignment problem (QAP) can be stated as follows: min p2\Pi N n X i=1 n X j=1 f ij d p(i)p(j) + n X i=1 c ip(i) ; where \Pi N is the set of all permutations of N . One of the major applications of the QAP is in location theory where the matrix F = (f ij ) is the flow matrix, i.e. f ij is the flow of materials from facility i to facility j, and D = (d kl ) is the distance matrix, i.e. d kl represents the distance from location k to location l [62, 67, 137]. The cost of simultaneously assigning facility i to locat...
(Show Context)