Skip to main content
SpringerLink
Log in

Developing an Effective Decomposition-Based Procedure for Solving the Quadratic Assignment Problem

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11756))

Included in the following conference series:

Abstract

The quadratic assignment problem is involved with designing the best layouts for facilities and has a wide variety of applications in industry. This paper presents a decomposition-based procedure for solving this NP-hard optimization problem. The procedure aims at enhancing an initial solution in five interacting and synergetic layers. In the first layer, the initial solution undergoes the process of local search and becomes local optimal. In the second layer, the linear assignment technique is called and results in a suggestion for an enhancement. The third layer is about decomposing the proposed suggestion into several cycles. Then, in the fourth layer, each cycle is further decomposed into several segments. The number of the segments associated with each cycle is the length of the corresponding cycle, which was calculated in the third layer. Finally, the segments are processed in the fifth layer and potentially enhance the original solution. The employed decomposition has proved to be effective, and comparing the performance of the procedure with that of other state-of-the-art procedures indicates its efficiency.

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 EPUB and 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

References

  1. Ahuja, R., Jha, K., Orlin, J., Sharma, D.: Very large-scale neighborhood search for the quadratic assignment problem. INFORMS J. Comput. 19(4), 646–657 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Amirghasemi, M., Zamani, R.: An effective structural iterative refinement technique for solving the quadratic assignment problem. In: Cerulli, R., Raiconi, A., Voß, S. (eds.) Computational Logistics, pp. 446–460. Springer International Publishing, Cham (2018)

    Chapter  Google Scholar 

  3. Anstreicher, K.: Recent advances in the solution of quadratic assignment problems. Math. Program. 97(1), 27–42 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baykasoğlu, A.: A meta-heuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells. J. Intell. Manufact. 15(6), 753–759 (2004)

    Article  Google Scholar 

  5. Burkard, R.E., Bönniger, T.: A heuristic for quadratic boolean programs with applications to quadratic assignment problems. Eur. J. Oper. Res. 13(4), 374–386 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB-a quadratic assignment problem library. J. Glob. Optim. 10(4), 391–403 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Colorni, A., Dorigo, M., Maffioli, F., Maniezzo, V., Righini, G., Trubian, M.: Heuristics from nature for hard combinatorial optimization problems. Int. Trans. Oper. Res. 3(1), 1–21 (1996)

    Article  MATH  Google Scholar 

  8. Connolly, D.: An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46(1), 93–100 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Dammeyer, F., Voß, S.: Dynamic tabu list management using the reverse elimination method. Ann. Oper. Res. 41(2), 29–46 (1993)

    Article  MATH  Google Scholar 

  10. Demirel, N., Toksarı, M.: Optimization of the quadratic assignment problem using an ant colony algorithm. Appl. Math. Comput. 183(1), 427–435 (2006)

    MathSciNet  MATH  Google Scholar 

  11. Domschke, W., Forst, P., Voß, S.: Tabu search techniques for the quadratic semi-assignment problem. In: Fandel, G., Gulledge, T., Jones, A. (eds.) New Directions for Operations Research in Manufacturing, pp. 389–405. Springer, Heidelberg (1992). https://doi.org/10.1007/978-3-642-77537-6_23

    Chapter  Google Scholar 

  12. Drezner, Z.: Heuristic algorithms for the solution of the quadratic assignment problem. J. Appl. Math. Decis. Sci. 6, 163–173 (2002)

    Article  Google Scholar 

  13. Drezner, Z.: The extended concentric tabu for the quadratic assignment problem. Eur. J. Oper. Res. 160(2), 416–422 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Drezner, Z., Hahn, P., Taillard, E.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. Oper. Res. 139(1), 65–94 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. Gambardella, L., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2), 167–176 (1999)

    Article  MATH  Google Scholar 

  16. Glover, F.: Tabu search - part II. ORSA J. Comput. 2(1), 4–32 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  17. James, T., Rego, C., Glover, F.: A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195(3), 810–826 (2009). https://doi.org/10.1016/j.ejor.2007.06.061

    Article  MATH  Google Scholar 

  18. James, T., Rego, C., Glover, F.: Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 39(3), 579–596 (2009)

    Article  Google Scholar 

  19. Lee, Y., Orlin, J.: Quickmatch: a very fast algorithm for the assignment problem. Report, Massachusetts Institute of Technology, Sloan School of Management (Report number: WP#3547-93) (1993)

    Google Scholar 

  20. Li, Y., Pardalos, P., Resende, M.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 237–261 (1994)

    Google Scholar 

  21. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 443–452 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  22. Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657–690 (2007). https://doi.org/10.1016/j.ejor.2005.09.032

    Article  MathSciNet  MATH  Google Scholar 

  23. Maniezzo, V., Colorni, A.: The ant system applied to the quadratic assignment problem. IEEE Trans. Knowl. Data Eng. 11(5), 769–778 (1999)

    Article  Google Scholar 

  24. Mavridou, T., Pardalos, P.: Simulated annealing and genetic algorithms for the facility layout problem: A survey. Comput. Optim. Appl. 7(1), 111–126 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  25. Misevicius, A.: A tabu search algorithm for the quadratic assignment problem. Comput. Optim. Appl. 30(1), 95–111 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  26. Nissen, V., Paul, H.: A modification of threshold accepting and its application to the quadratic assignment problem. OR Spectr. 17(2), 205–210 (1995)

    Article  MATH  Google Scholar 

  27. Rego, C., James, T., Glover, F.: An ejection chain algorithm for the quadratic assignment problem. Networks 56(3), 188–206 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  28. Solimanpur, M., Vrat, P., Shankar, R.: Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing. Eur. J. Oper. Res. 157(3), 592–606 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  29. Talbi, E.G., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Future Gener. Comput. Syst. 17(4), 441–449 (2001). https://doi.org/10.1016/S0167-739X(99)00124-7

    Article  MATH  Google Scholar 

  30. Thompson, P., Orlin, J.: The theory of cyclic transfers. Technical report, Operations Research Center Report, MIT, Cambridge, MA, oR 200–89 (1989)

    Google Scholar 

  31. Tseng, L.Y., Chen, S.C.: A hybrid metaheuristic for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 175(2), 707–721 (2006)

    Article  MATH  Google Scholar 

  32. Voß, S.: Solving quadratic assignment problems using the reverse elimination method. In: Nash, S.G., Sofer, A., Stewart, W.R., Wasil, E.A. (eds.) The Impact of Emerging Technologies on Computer Science and Operations Research. Operations Research/Computer Science Interfaces Series, vol. 4. Springer, Boston (1995). https://doi.org/10.1007/978-1-4615-2223-2_14

    Chapter  Google Scholar 

  33. West, D.: Algorithm 608: approximate solution of the quadratic assignment problem. ACM Trans. Math. Softw. (TOMS) 9(4), 461–466 (1983)

    Article  MathSciNet  Google Scholar 

  34. Zamani, R., Amirghasemi, M.: A self-adaptive nature-inspired procedure for solving the quadratic assignment problem (2019, submitted)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SMART Infrastructure Facility, Faculty of Engineering and Information Sciences, University of Wollongong, Wollongong, NSW, Australia

    Mehrdad Amirghasemi

  2. School of Computing and Information Technology, Faculty of Engineering and Information Sciences, University of Wollongong, Wollongong, NSW, Australia

    Reza Zamani

Authors
  1. Mehrdad Amirghasemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reza Zamani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mehrdad Amirghasemi .

Editor information

Editors and Affiliations

  1. Universidad del Norte, Barranquilla, Colombia

    Carlos Paternina-Arboleda

  2. Universität Hamburg, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Amirghasemi, M., Zamani, R. (2019). Developing an Effective Decomposition-Based Procedure for Solving the Quadratic Assignment Problem. In: Paternina-Arboleda, C., Voß, S. (eds) Computational Logistics. ICCL 2019. Lecture Notes in Computer Science(), vol 11756. Springer, Cham. https://doi.org/10.1007/978-3-030-31140-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-31140-7_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-31139-1

  • Online ISBN: 978-3-030-31140-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation