GRASP with Path Relinking for Three-Index Assignment

References

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