GRASP with path relinking for three-index assignment

INFORMS Journal on Computing

Volumn 17, Issue 2, 2005, Pages 224-247

  Alex, Renata M ^a   Resende, Mauricio G C ^b   Pardalos, Panos M ^c   Toraldo, Gerardo ^d  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

^c UNIVERSITY OF FLORIDA   (United States)

^d UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

GRASP; Heuristics; Parallel programming; Path relinking; Statistical analysis; Three index assignment problem

Indexed keywords

CONSTRAINT THEORY; COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY; STATISTICAL METHODS;

GRASP; PARALLEL PROGRAMMING; PATH RELINKING; THREE-INDEX ASSIGNMENT PROBLEM;

ADAPTIVE SYSTEMS;

EID: 21244472297     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0059     Document Type: Article

References (43)

1. Ahuja, R. K., J. B. Orlin, A. Tiwari. 2000. A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27 917-934.
2. Aiex, R. M., M. G. C. Resende, C. C. Ribeiro. 2002. Probability distribution of solution time in GRASP: An experimental investigation. J. Heuristics 8 343-373.
3. Balas, E., M. J. Saltzman. 1991. An algorithm for the three-index assignment problem. Oper. Res. 39 150-161.
4. Burkard, R. E., K. Fröhlich. 1980. Some remarks on 3-dimensional assignment problems. Methods Oper. Res. 36 31-36.
5. Burkard, R. E., R. Rudolf. 1993. Computational investigations on 3-dimensional axial assignment problems. Belgian J. Oper. Res. Statist. Comput. Sci. 32 85-98.
6. Burkard, R. E., R. Rudolf, G. J. Woeginger. 1996. Three-dimensional axial assignment problems with decomposable cost coefficients. Discrete Appl. Math. 65 123-139.
7. Chambers, J. M., W. S. Cleveland, B. Kleiner, P. A. Tukey. 1983. Graphical Methods for Data Analysis. Chapman & Hall, Boston, MA.
8. Crama, Y., F. C. R. Spieksma. 1992. Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur. J. Oper. Res. 60 273-279.
9. Crama, Y., A. W. J. Kolen, A. G. Oerlemans, F. C. R. Spieksma. 1990. Throughput rate optimization in the automated assembly of printed circuit boards. Annals Oper. Res. 26 455-480.
10. Feo, T. A., J. L. González-Velarde. 1995. The intermodal trailer assignment problem: Models, algorithms, and heuristics. Transportation Sci. 29 330-341.
11. Feo, T. A., M. G. C. Resende. 1989. A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8 67-71.
12. Feo, T. A., M. G. C. Resende. 1995. Greedy randomized adaptive search procedures. J. Global Optim. 6 109-133.
13. Festa, P., M. G. C. Resende. 2002. GRASP: An annotated bibliography. C. C. Ribeiro, P. Hansen, eds. Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, Boston, MA, 325-367.
14. Fleurent, C., F. Glover. 1999. Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 11 198-204.
15. Frieze, A. M. 1983. Complexity of a 3-dimensional assignment problem. Eur. J. Oper. Res. 13 161-164.
16. Frieze, A. M., J. Yadegar. 1981. An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice. J. Oper. Res. Soc. 32 989-995.
17. Fröhlich, K. 1979. Dreidimensionale Zuordnungsprobleme. Master's thesis, Mathematik Institut, Universität Köln, Köln, Germany.
18. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York.
19. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Boston, MA.
20. Glover, F., M. Laguna, R. Martí. 2000. Fundamentals of scatter search and path-relinking. Control Cybernetics 39 653-684.
21. Hansen, P., L. Kaufman. 1973. A primal-dual algorithm for the three-dimensional assignment problem. Cahiers du CERO 15 327-336.
22. Hart, J. P., A. W. Shogan. 1987. Semi-greedy heuristics: An empirical study. Oper. Res. Lett. 6 107-114.
23. Laguna, M., R. Martí. 1999. GRASP and path-relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11 44-52.
24. Leue, O. 1972. Methoden zur Lösung dreidimensionaler Zuordnungsprobleme. Angewandte Informatik 14 154-162.
25. Li, Y., P. M. Pardalos, M. G. C. Resende. 1994. A greedy randomized adaptive search procedure for the quadratic assignment problem. P. M. Pardalos, H. Wolkowicz, eds. Quadratic Assignment and Related Problems, Vol. 16. DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, 237-261.
26. Mavridou, T., P. M. Pardalos, L. S. Pitsoulis, M. G. C. Resende. 1998. A GRASP for the biquadratic assignment problem. Eur. J. Oper. Res. 105 613-621.
27. Murphey, R. A., P. M. Pardalos, L. S. Pitsoulis. 1998. A parallel GRASP for the data association multidimensional assignment problem. P. M. Pardalos, ed. Parallel Processing of Discrete Problems, Vol. 106. The IMA Volumes in Mathematics and Its Applications. Springer-Verlag, New York, 159-180.
28. Pardalos, P. M., L. S. Pitsoulis. 2000. Nonlinear Assignment Problems: Algorithms and Applications. Kluwer Academic Publishers, Boston, MA.
29. Pardalos, P. M., M. G. C. Resende, eds. 2002. Handbook of Applied Optimization. Oxford University Press, New York.
30. Pardalos, P. M., L. S. Pitsoulis, M. G. C. Resende. 1995. A parallel GRASP implementation for the quadratic assignment problem. A. Ferreira, J. Rolim, eds. Parallel Algorithms for Irregularly Structured Problems - Irregular'94. Kluwer Academic Publishers, Boston, MA, 115-130.
31. Pardalos, P. M., L. S. Pitsoulis, M. G. C. Resende. 1997. Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP ACM Trans. Math. Software 23 196-208.
32. Pierskalla, W. P. 1967. The tri-substitution method for the three-multidimensional assignment problem. Canadian Oper. Res. Soc. J. 5 71-81.
33. Pierskalla, W. P. 1968. The multidimensional assignment problem. Oper. Res. 16 422-431.
34. Pitsoulis, L. S. 1999. Algorithms for Nonlinear Assignment Problems. Ph.D. thesis, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
35. Pitsoulis, L. S., P. M. Pardalos, D. W. Hearn. 2001. Approximate solutions to the turbine balancing problem. Eur. J. Oper. Res. 130 147-155.
36. Rangel, M. C., N. M. M. Abreu, P. O. Boaventura Netto. 1999. GRASP in the QAP: An acceptance bound for initial solution. Proc. 3rd Metaheuristics Internat. Conf., Catholic University of Rio de Janeiro, Angra dos Reis, Rio de Janeiro, Brazil, 381-386.
37. Resende, M. G. C., P. M. Pardalos, Y. Li. 1996. Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Trans. Math. Software 22 104-118.
38. Robertson, A. J. 2001. A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem. Comput. Optim. App. 19 145-164.
39. Schrage, L. 1979. A more portable Fortran random number generator. ACM Trans. Math. Software 5 132-138.
40. Snir, M., S. Otto, S. Huss-Lederman, D. Walker, J. Dongarra. 1998. MPI-The Complete Reference, Volume 1 - The MPI Core. The MIT Press, Cambridge, MA.
41. Verhoeven, M. G. A., E. H. L. Aarts. 1995. Parallel local search. J. Heuristics 1 43-66.
42. Vlach, M. 1967. Branch and bound method for the three-index assignment problem. Ekonomicko-Mathematický Obzor 3 181-191.
43. Voss, S. 2000. Heuristics for nonlinear assignment problems. P. M. Pardalos, L. S. Pitsoulis, eds. Nonlinear Assignment Problems: Algorithms and Applications. Kluwer Academic Publishers, Boston, MA, 175-215.