Skip to main content
SpringerLink
Log in

GRASP with Path-Relinking for the Quadratic Assignment Problem

  • Conference paper
Experimental and Efficient Algorithms (WEA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3059))

Included in the following conference series:

Abstract

This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are probed with local search for high-quality solutions. Each iteration of GRASP consists of the construction of a randomized greedy solution, followed by local search, starting from the constructed solution. Path-relinking is an approach to integrate intensification and diversification in search. It consists in exploring trajectories that connect high-quality solutions. The trajectory is generated by introducing in the initial solution, attributes of the guiding solution. Experimental results illustrate the effectiveness of GRASP with path-relinking over pure GRASP on the quadratic assignment problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aiex, R.M.: Uma investigação experimental da distribuição de probabilidade de tempo de solução em heurísticas GRASP e sua aplicação na análise de implementa ções paralelas. PhD thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil (2002)

    Google Scholar 

  2. Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing 29, 393–430 (2003)

    Article  MathSciNet  Google Scholar 

  3. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics 8, 343–373 (2002)

    Article  MATH  Google Scholar 

  4. Burkhard, R., Karisch, S., Rendl, F.: QAPLIB – A quadratic assignment problem library. Eur. J. Oper. Res. 55, 115–119 (1991), Online version on http://www.opt.math.tu-graz.ac.at/qaplib

    Article  Google Scholar 

  5. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67–71 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the max-cut problem. Optimization Methods and Software 7, 1033–1058 (2002)

    Article  MathSciNet  Google Scholar 

  8. Festa, P., Resende, M.G.C.: GRASP: An annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325–368. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  9. Glover, F.: Tabu search and adaptive memory programing – Advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer, Dordrecht (1996)

    Google Scholar 

  10. Koopmans, T.C., Berkmann, M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)

    Article  MATH  MathSciNet  Google Scholar 

  11. Laguna, M., Martí, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing 11, 44–52 (1999)

    Article  MATH  Google Scholar 

  12. Li, Y., Pardalos, P.M., Resende, M.G.C.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic assignment and related problems. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 237–261. American Mathematical Society, Providence (1994)

    Google Scholar 

  13. Mladenović, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. 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 23(2), 196–208 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  15. Resende, M.G.C., Pardalos, P.M., Li, Y.: Algorithm 754: FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software 22, 104–118 (1996)

    Article  MATH  Google Scholar 

  16. Resende, M.G.C., Ribeiro, C.C.: GRASP and path-relinking: Recent advances and applications. Technical Report TD-5TU726, AT&T Labs Research (2003)

    Google Scholar 

  17. Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219–249. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  18. Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the Association of Computing Machinery 23, 555–565 (1976)

    MATH  MathSciNet  Google Scholar 

  19. Voß, S.: Heuristics for nonlinear assignment problems. In: Pardalos, P.M., Pitsoulis, L. (eds.) Nonlinear Assignment Problems, pp. 175–215. Kluwer, Boston (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL, 32611, USA

    Carlos A. S. Oliveira & Panos M. Pardalos

  2. Algorithms and Optimization Research Department, AT&T Labs Research, Room C241, 180 Park Avenue, Florham Park, NJ, 07932, USA

    Mauricio G. C. Resende

Authors
  1. Carlos A. S. Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mauricio G. C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, RJ 24210-240, Niterói, Brazil

    Celso C. Ribeiro

  2. Departamento de Ciência da Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil

    Simone L. Martins

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.C. (2004). GRASP with Path-Relinking for the Quadratic Assignment Problem. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24838-5_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22067-1

  • Online ISBN: 978-3-540-24838-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation