Paper Info
Title
A GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem
Abstract
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 indicate that the GRASP and the parallel hybrid heuristic provide good approximate solutions to a variety of AP3 instances.
Year
DOI
Venue
2000
10.1007/3-540-45591-4_67
IPDPS Workshops
Keywords
Field
DocType
computational result,three-index assignment problem,approximate solution,fortran implementation,problem instance,good approximate solution,np-hard three-index assignment problem,computing approximate solutions,parallelization strategy,parallel hybrid,greedy randomized adaptive search,ap3 instance,assignment problem,indexation,greedy randomized adaptive search procedure
Mathematical optimization,Heuristic,GRASP,Computer science,Fortran,Greedy algorithm,Combinatorial optimization,Assignment problem,Adaptive algorithm,Greedy randomized adaptive search procedure
Conference
Volume
ISSN
ISBN
1800
0302-9743
3-540-67442-X
Citations 
PageRank 
References 
1
0.39
1
Authors
4
Name
Order
Citations
PageRank
Renata M. Aiex123611.36
Panos M. Pardalos23720397.84
Leonidas S. Pitsoulis317022.11
Mauricio G. C. Resende43729336.98