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 F ORTRAN implementation of this GRASP is tested on several problem instances of the AP3. A parallelization strategy that combines GRASP and path re-linking 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.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aiex, R.M., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C. (2000). A GRASP for computing approximate solutions for the Three-Index Assignment Problem. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_67
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive