In this talk a greedy randomized adaptive search procedure (GRASP) is presented for computing approximate solutions to the NP-hard three-index assignment problem (AP3). A FORTRAN implementation of this GRASP is tested on several problem instances of the AP3. A parallelization strategy that combines GRASP and path relinking is also proposed and tested for the problem. Computational results indic...

In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional two-staged cutting stock problem. This is a special cutting problem in which the cut is performed in two phases. In the first phase, the stock rectangle is slit down its width into different vertical strips and in the second phase, each of these strips is processed to obtain the f...

In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experiments show these heuristics improve solution quality when compared with the well-known GPS algorithm and recently-developed methods using tabu search and GRASP with Path Relinking. Further, the node adjustment approach o...

Submitted by Matthieu Basseur on Thu, 02/12/2015 13:53 Titre Path Relinking in Pareto Multi-objective Genetic Algorithms Type de publication Communication Type Communication avec actes dans un congrès Année 2005 Langue Anglais Date du colloque 09-11/03/2015 Titre du colloque Evolutionary Multi-Criterion Optimization Volume 3410 Pagination 120-134 Auteur Basseur, Matthieu [1], Seynhaeve, Franck ...

This paper presents TORNADO, a unique input replay tool based on system call replay. It is capable of tracing program executions with an acceptable overhead of less than a factor 2. It is fully operational for the Linux operating system. The tool requires no instrumentation, recompilation or relinking of the applications. This paper also presents a new technique capable of tracing write operati...

A metaheuristic procedure based on the Scatter Search approach is proposed for the non-hierarchical clustering problem under the criterion of minimum Sum-of-Squares Clustering. This algorithm incorporates procedures based on different strategies, such as Local Search, GRASP, Tabu Search or Path Relinking. The aim is to obtain quality solutions with short computation times. A series of computati...

We propose a parallel cooperative strategy for the implementation of the GRASP metaheuristic and we illustrate it with a GRASP with path-relinking heuristic for the 2-path network design problem. Numerical results illustrating the effectiveness of the approach are reported. We comment in detail the implementation strategies that take most advantage of the algorithm structure. Computational expe...

In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and columns resulting in the nonzero elements residing in a band as close as possible to the diagonal. Experiments show that this approach achieves the best solution quality when compared with the GPS [1] algorithm, Tabu ...