Results 1  10
of
14
GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES
, 2002
"... GRASP is a multistart 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 639 (79 self)
 Add to MetaCart
GRASP is a multistart 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 memorybased intensification and postoptimization techniques using pathrelinking. Hybridizations with other metaheuristics, parallelization strategies, and applications are also reviewed.
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
 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 296 (16 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.
GRASP with pathrelinking: Recent advances and applications
 Metaheuristics: Progress as Real Problem Solvers
, 2005
"... Abstract: Pathrelinking is a major enhancement to the basic greedy randomized adaptive search procedure (GRASP), leading to significant improvements in solution time and quality. Pathrelinking adds a memory mechanism to GRASP by providing an intensification strategy that explores trajectories conn ..."
Abstract

Cited by 45 (22 self)
 Add to MetaCart
Abstract: Pathrelinking is a major enhancement to the basic greedy randomized adaptive search procedure (GRASP), leading to significant improvements in solution time and quality. Pathrelinking adds a memory mechanism to GRASP by providing an intensification strategy that explores trajectories connecting GRASP solutions and the best elite solutions previously produced during the search. This paper reviews recent advances and applications of GRASP with pathrelinking. A brief review of GRASP is given. This is followed by a description of pathrelinking and how it is incorporated into GRASP. Several recent applications of GRASP with pathrelinking are reviewed. The paper concludes with a discussion of extensions to this strategy, concerning in particular parallel implementations and applications of pathrelinking with other metaheuristics.
An Approach for Mixed Upward Planarization
 In Proc. 7th International Workshop on Algorithms and Data Structures (WADS’01
, 2003
"... In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing. ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing.
Algorithm 797: Fortran Subroutines for Approximate Solution Of . . .
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1999
"... ..."
Metaheuristics: Models, Design and Analysis
 Proceedings of the fifth AsiaPacific Industrial Engineering and Management Systems Conference 2004, & the seventh AsiaPacific division meeting, of the International Foundation of Production Research, Edited by Erhan
, 2004
"... In recent years, there have been significant advances in the theory and application of metaheuristics to the approximate solutions of complex optimization problems. A metaheuristic is an iterative master process that guides and modifies the operations of subordinate heuristics to produce highqual ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In recent years, there have been significant advances in the theory and application of metaheuristics to the approximate solutions of complex optimization problems. A metaheuristic is an iterative master process that guides and modifies the operations of subordinate heuristics to produce highquality solutions efficiently. In this paper, we first present a brief introduction to combinatorial optimization and metaheuristics. Second, the most common components and attributes of metaheuristics are identified. A complete graph on the components/attributes is constructed to provide a new framework to classify metaheuristics. The framework also invites investigators to diversify their overintensified search to generate new hybrids with the hope of finding the optimal metaheuristic. Third, the most successful hybrids are reviewed. Fourth, it is often said “my algorithm is better than yours“ using either the computational effort or the quality of solution but not both, among other criteria. A new way to compare metaheuristics is introduced. It is based on the concept of marginal improvement per unit of computational effort (MIC) which takes into account both quality and time criteria to produce a ranking of compared approaches. Last, we shall conclude with some directions of future research.
Two New Approximation Algorithms for the Maximum Planar Subgraph Problem
, 2006
"... The maximum planar subgraph problem (MPS) is defined as follows: given a graph G, find a largest planar subgraph of G. The problem is NPhard and it has applications in graph drawing and resource location optimization. Călinescu et al. [J. Alg. 27, 269302 (1998)] presented the first approximation a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
The maximum planar subgraph problem (MPS) is defined as follows: given a graph G, find a largest planar subgraph of G. The problem is NPhard and it has applications in graph drawing and resource location optimization. Călinescu et al. [J. Alg. 27, 269302 (1998)] presented the first approximation algorithms for MPS with nontrivial performance ratios. Two algorithms were given, a simple algorithm which runs in linear time for boundeddegree graphs with a ratio 7/18 and a more complicated algorithm with a ratio 4/9. Both algorithms produce outerplanar subgraphs. In this article we present two new versions of the simpler algorithm. The first new algorithm still runs in the same time, produces outerplanar subgraphs, has at least the same performance ratio as the original algorithm, but in practice it finds larger planar subgraphs than the original algorithm. The second new algorithm has similar properties to the first algorithm, but it produces only planar subgraphs. We conjecture that the performance ratios of our algorithms are at least 4/9 for MPS. We experimentally compare the new algorithms against the original simple algorithm. We also apply the new algorithms for approximating the thickness and outerthickness of a graph. Experiments show that the new algorithms produce clearly better approximations than the original simple algorithm by Călinescu et al.
A GRASPBased Approach for Technicians and Interventions Scheduling for Telecommunications
, 2013
"... Abstract. The Technicians and Interventions Scheduling Problem for Telecommunications embeds the scheduling of interventions, the assignment of teams to interventions and the assignment of technicians to teams. Every intervention is characterized, among others attributes, by a priority. The objectiv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. The Technicians and Interventions Scheduling Problem for Telecommunications embeds the scheduling of interventions, the assignment of teams to interventions and the assignment of technicians to teams. Every intervention is characterized, among others attributes, by a priority. The objective of this problem is to schedule interventions such that the interventions with the highest priority are scheduled at the earliest time possible while satisfying a set of constraints like the precedence between some interventions and the number of technicians with the required skill level by domain. To solve this problem, we propose a GRASP algorithm based on the dynamic update of the weights assigned to the interventions combined with a local search procedure. We also compute lower bounds and present experimental results that validate the effectiveness of this approach.