Filters








267 Hits in 3.8 sec

GRASP with Path Relinking for Three-Index Assignment

Renata M. Aiex, Mauricio G. C. Resende, Panos M. Pardalos, Gerardo Toraldo
2005 INFORMS journal on computing  
This paper describes variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three index assignment problem (AP3).  ...  We show that the random variable "time to target solution," for all proposed GRASP with path relinking variants, fits a two-parameter exponential distribution.  ...  Spieksma for making available the test instances used in the experimental part of the paper.  ... 
doi:10.1287/ijoc.1030.0059 fatcat:ty7rppwrafewxlmrjuo2you2zq

Parallel Greedy Randomized Adaptive Search Procedures [chapter]

Mauricio G.C. Resende, Celso C. Ribeiro
2005 Parallel Metaheuristics  
A GRASP (Greedy Randomized Adaptive Search Procedure) is a metaheuristic for producing good-quality solutions of combinatorial optimization problems.  ...  It is usually implemented with a construction procedure based on a greedy randomized algorithm followed by local search. In this Chapter, we survey parallel implementations of GRASP.  ...  Path-relinking for job shop scheduling is similar to path-relinking for three-index assignment.  ... 
doi:10.1002/0471739383.ch14 fatcat:atclbdtb3bflvezdejh3zxz7n4

Hybridizations of GRASP with Path-Relinking [chapter]

Paola Festa, Mauricio G. C. Resende
2013 Studies in Computational Intelligence  
The hybridization of path-relinking and GRASP adds memory mechanisms to GRASP. This paper describes basic concepts of GRASP, path-relinking, and the hybridization of GRASP with path-relinking.  ...  A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  In a paper on GRASP with path-relinking for the three-index assignment problem, Aiex et al.  ... 
doi:10.1007/978-3-642-30671-6_5 fatcat:tw24f2sgnfcezd6r5julwevhmy

Automatic Tuning of GRASP with Evolutionary Path-Relinking [chapter]

L. F. Morán-Mirabal, J. L. González-Velarde, M. G. C. Resende
2013 Lecture Notes in Computer Science  
In this paper, we present a scheme for automatic tuning of GRASP with evolutionary path-relinking heuristics.  ...  For each problem we automatically tune a specific GRASP with evolutionary path-relinking heuristic to produce fast effective procedures.  ...  They propose the tuning procedure for an implementation of a GRASP with path-relinking heuristic for the generalized quadratic assignment problem (GQAP).  ... 
doi:10.1007/978-3-642-38516-2_6 fatcat:43o6os2tvresznnrjpe7aacdgi

An annotated bibliography of GRASP - Part I: Algorithms

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  This is the first of two papers with an annotated bibliography of the GRASP literature from 1989 to 2008. This paper covers algorithmic aspects of GRASP.  ...  When a vertex is selected, three moves are considered. Resende, M.G.C., Ribeiro, C.C., 2003. A GRASP with path-relinking for private virtual circuit routing. Networks 41, 104-114.  ... 
doi:10.1111/j.1475-3995.2009.00663.x fatcat:gqolwm2hafgzlfdckt7kblixgu

GRASP with path relinking for the weighted MAXSAT problem

Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
2007 ACM Journal of Experimental Algorithmics  
A GRASP with path-relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper.  ...  Experimental comparison of the pure GRASP (without path-relinking) and the GRASP with path-relinking illustrates the effectiveness of path-relinking in decreasing the average time needed to find a good-quality  ...  Since the time for one GRASP with path-relinking iteration is greater than for one pure GRASP iteration, we seek to determine if the potential reduction in number of iterations of GRASP with path-relinking  ... 
doi:10.1145/1187436.1216581 fatcat:uqpo2uom6vcglhhsn2c4z4b5ve

Randomized heuristics for handover minimization in mobility networks

L. F. Morán-Mirabal, J. L. González-Velarde, M. G. C. Resende, R. M. A. Silva
2013 Journal of Heuristics  
We propose several randomized heuristics for finding approximate solutions of this problem, including a GRASP with path-relinking for the generalized quadratic assignment problem, a GRASP with evolutionary  ...  path-relinking, and a biased random-key genetic algorithm.  ...  We then propose three randomized heuristics: a GRASP with path-relinking for generalized quadratic assignment, a GRASP with evolutionary path-relinking, and a biased random-key genetic algorithm. 2.1.  ... 
doi:10.1007/s10732-013-9223-0 fatcat:bxcwcjf7ungk5nmmpquaxqwj3a

On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms [chapter]

Celso C. Ribeiro, Isabel Rosseti, Reinaldo Vallejos
2009 Lecture Notes in Computer Science  
Numerical examples illustrate the application of this tool in the comparison of different algorithms for three different problems.  ...  For the case where the running times of both algorithms fit exponential distributions, we derive a closed form index that gives the probability that one of them finds a solution at least as good as a given  ...  Fig. 16 . 16 Superimposed run time distributions of pure GRASP and three versions of GRASP with path-relinking.  ... 
doi:10.1007/978-3-642-03751-1_2 fatcat:4aw62ym3prh53cxynd4ce3mfnq

Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms

Celso C. Ribeiro, Isabel Rosseti, Reinaldo Vallejos
2011 Journal of Global Optimization  
For the case where the running times of both algorithms fit exponential distributions, we derive a closed form index that gives the probability that one of them finds a solution at least as good as a given  ...  Run time distributions or time-to-target plots are very useful tools to characterize the running times of stochastic algorithms for combinatorial optimization.  ...  The second is an application to the three-index assignment prob- lem [1] .  ... 
doi:10.1007/s10898-011-9769-z fatcat:hq5suqqqpve5npzxfmc7ofbe3q

Path-relinking intensification methods for stochastic local search algorithms

Celso C. Ribeiro, Mauricio G. C. Resende
2011 Journal of Heuristics  
Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times.  ...  We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as genetic algorithms and scatter search.  ...  Time to target plots comparing running times of GRASP with and without path-relinking on distinct problems: three-index assignment , maximum satisfiability (Festa et al., 2006) , bandwidth packing (Resende  ... 
doi:10.1007/s10732-011-9167-1 fatcat:v3nrtbwelrhbhp3r5fvvgkfh4y

A hybrid genetic algorithm for the Three-Index Assignment Problem

Gaofeng Huang, Andrew Lim
2006 European Journal of Operational Research  
The Three-Index Assignment Problem (AP3) is well-known problem which has been shown to be NP-hard.  ...  We further hybridize our heuristic with the genetic algorithm (GA).  ...  with Path Relinking multiLS LSGA Avg. obj.  ... 
doi:10.1016/j.ejor.2004.09.042 fatcat:gtyxaj5a3ffpbj3rvwh3xgxotm

An annotated bibliography of GRASP-Part II: Applications

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  This is the second of two papers with an annotated bibliography of the GRASP literature from 1989 to 2008. In the companion paper, algorithmic aspects of GRASP are surveyed.  ...  GRASP with path relinking for three-index assignment. INFORMS J. on Computing, 17(2):224-247, 2005.  ... 
doi:10.1111/j.1475-3995.2009.00664.x fatcat:wdqwc6xvcnfq3fi5ujy6jy5wtm

A hybrid GRASP algorithm for an integrated production planning and a group layout design in a dynamic cellular manufacturing system

K. Khamlichi, K. Oufaska, T. Zouadi, R. Dkiouak
2020 IEEE Access  
Algorithm 1 presents the general scheme of a GRASP with path relinking procedure. A.  ...  LOCAL SEARCH WITH PATH RELINKING The proposed GRASP is enhanced with a path-relinking procedure, which is a local search aiming to intensify the research and making significant improvements in terms of  ... 
doi:10.1109/access.2020.3018505 fatcat:3hwahagpofhprign3rjlnzmyhi

Greedy Randomized Adaptive Search Procedures

Thomas A. Feo, Mauricio G. C. Resende
1995 Journal of Global Optimization  
We discuss in detail implementation strategies of memory-based intensification or post-optimization techniques using path-relinking.  ...  GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search.  ...  Figure 10 . 10 Empirical distributions of time to target solution value for GRASP, GRASP with forward path-relinking, GRASP with backwards path-relinking, and GRASP with back and forward path-relinking  ... 
doi:10.1007/bf01096763 fatcat:uvxhzf6h75cjdmdyhrdh5jn7q4

Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications [chapter]

Mauricio G.C. Resende, Celso C. Ribeiro, Fred Glover, Rafael Martí
2010 International Series in Operations Research and Management Science  
We describe its mechanics, implementation issues, randomization, the use of pools of high-quality solutions to hybridize path-relinking with other heuristic methods, and evolutionary path-relinking.  ...  We also describe the hybridization of path-relinking with genetic algorithms to implement a progressive crossover operator.  ...  Applications and concluding remarks There are three main sources where successful applications of scatter search and path-relinking can be found.  ... 
doi:10.1007/978-1-4419-1665-5_4 fatcat:r2uzmou55ngnfjph5mlepnfl2y
« Previous Showing results 1 — 15 out of 267 results