IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v195y2009i3p810-826.html
   My bibliography  Save this article

A cooperative parallel tabu search algorithm for the quadratic assignment problem

Author

Listed:
  • James, Tabitha
  • Rego, Cesar
  • Glover, Fred

Abstract

In this study, we introduce a cooperative parallel tabu search algorithm (CPTS) for the quadratic assignment problem (QAP). The QAP is an NP-hard combinatorial optimization problem that is widely acknowledged to be computationally demanding. These characteristics make the QAP an ideal candidate for parallel solution techniques. CPTS is a cooperative parallel algorithm in which the processors exchange information throughout the run of the algorithm as opposed to independent concurrent search strategies that aggregate data only at the end of execution. CPTS accomplishes this cooperation by maintaining a global reference set which uses the information exchange to promote both intensification and strategic diversification in a parallel environment. This study demonstrates the benefits that may be obtained from parallel computing in terms of solution quality, computational time and algorithmic flexibility. A set of 41 test problems obtained from QAPLIB were used to analyze the quality of the CPTS algorithm. Additionally, we report results for 60 difficult new test instances. The CPTS algorithm is shown to provide good solution quality for all problems in acceptable computational times. Out of the 41 test instances obtained from QAPLIB, CPTS is shown to meet or exceed the average solution quality of many of the best sequential and parallel approaches from the literature on all but six problems, whereas no other leading method exhibits a performance that is superior to this.

Suggested Citation

  • James, Tabitha & Rego, Cesar & Glover, Fred, 2009. "A cooperative parallel tabu search algorithm for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 810-826, June.
    • Handle: RePEc:eee:ejores:v:195:y:2009:i:3:p:810-826
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01105-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    2. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
    3. Drezner, Zvi, 2005. "The extended concentric tabu for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 160(2), pages 416-422, January.
    4. Haghani, Ali & Chen, Min-Ching, 1998. "Optimizing gate assignments at airport terminals," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(6), pages 437-454, August.
    5. Zvi Drezner, 2003. "A New Genetic Algorithm for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 320-330, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Franck Butelle & Laurent Alfandari & Camille Coti & Lucian Finta & Lucas Létocart & Gérard Plateau & Frédéric Roupin & Antoine Rozenknop & Roberto Wolfler Calvo, 2016. "Fast machine reassignment," Annals of Operations Research, Springer, vol. 242(1), pages 133-160, July.
    2. Paul, G., 2011. "An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 209(3), pages 215-218, March.
    3. Fu, Zhanghua & Huang, Wenqi & Lü, Zhipeng, 2013. "Iterated tabu search for the circular open dimension problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 236-243.
    4. Xu, Jiuping & Song, Xiaoling & Wu, Yimin & Zeng, Ziqiang, 2015. "GIS-modelling based coal-fired power plant site identification and selection," Applied Energy, Elsevier, vol. 159(C), pages 520-539.
    5. Krešimir Mihić & Kevin Ryan & Alan Wood, 2018. "Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 295-308, May.
    6. Cheng-Ta Yeh & Lance Fiondella & Ping-Chen Chang, 2018. "Cost-oriented component redundancy allocation for a communication system subject to correlated failures and a transmission reliability threshold," Journal of Risk and Reliability, , vol. 232(3), pages 248-261, June.
    7. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.
    8. Yeh, Cheng-Ta & Fiondella, Lance, 2017. "Optimal redundancy allocation to maximize multi-state computer network reliability subject to correlated failures," Reliability Engineering and System Safety, Elsevier, vol. 166(C), pages 138-150.
    9. Mario Inostroza-Ponta & Regina Berretta & Pablo Moscato, 2011. "QAPgrid: A Two Level QAP-Based Approach for Large-Scale Data Analysis and Visualization," PLOS ONE, Public Library of Science, vol. 6(1), pages 1-18, January.
    10. Palubeckis, Gintaras, 2015. "Fast simulated annealing for single-row equidistant facility layout," Applied Mathematics and Computation, Elsevier, vol. 263(C), pages 287-301.
    11. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam, 2021. "Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1066-1084.
    12. Cheng-Ta Yeh, 2020. "Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints," Annals of Operations Research, Springer, vol. 287(1), pages 439-463, April.
    13. Vié, Marie-Sklaerder & Zufferey, Nicolas & Cordeau, Jean-François, 2019. "Solving the Wire-Harness Design Problem at a European car manufacturer," European Journal of Operational Research, Elsevier, vol. 272(2), pages 712-724.
    14. Schryen, Guido, 2020. "Parallel computational optimization in operations research: A new integrative framework, literature review and research directions," European Journal of Operational Research, Elsevier, vol. 287(1), pages 1-18.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Paul, G., 2011. "An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 209(3), pages 215-218, March.
    2. Krešimir Mihić & Kevin Ryan & Alan Wood, 2018. "Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 295-308, May.
    3. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2015. "Solving the planar p-median problem by variable neighborhood and concentric searches," Journal of Global Optimization, Springer, vol. 63(3), pages 501-514, November.
    4. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam, 2021. "Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1066-1084.
    5. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    6. Huizhen Zhang & Cesar Beltran-Royo & Liang Ma, 2013. "Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers," Annals of Operations Research, Springer, vol. 207(1), pages 261-278, August.
    7. Nyberg, Axel & Westerlund, Tapio, 2012. "A new exact discrete linear reformulation of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 314-319.
    8. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.
    9. Monique Guignard, 2020. "Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints," Annals of Operations Research, Springer, vol. 286(1), pages 173-200, March.
    10. Jingyang Zhou & Peter E.D. Love & Kok Lay Teo & Hanbin Luo, 2017. "An exact penalty function method for optimising QAP formulation in facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2913-2929, May.
    11. Mădălina M. Drugan, 2015. "Generating QAP instances with known optimum solution and additively decomposable cost function," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1138-1172, November.
    12. Mario Inostroza-Ponta & Regina Berretta & Pablo Moscato, 2011. "QAPgrid: A Two Level QAP-Based Approach for Large-Scale Data Analysis and Visualization," PLOS ONE, Public Library of Science, vol. 6(1), pages 1-18, January.
    13. Karsu, Özlem & Azizoğlu, Meral & Alanlı, Kerem, 2021. "Exact and heuristic solution approaches for the airport gate assignment problem," Omega, Elsevier, vol. 103(C).
    14. Eduardo G. Pardo & Mauricio Soto & Christopher Thraves, 2015. "Embedding signed graphs in the line," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 451-471, February.
    15. Zakir Hussain Ahmed, 2016. "Experimental analysis of crossover and mutation operators on the quadratic assignment problem," Annals of Operations Research, Springer, vol. 247(2), pages 833-851, December.
    16. Pawel Kalczynski & Jack Brimberg & Zvi Drezner, 2022. "Less is more: discrete starting solutions in the planar p-median problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 34-59, April.
    17. Silva, João & Kalakou, Sofia & Andrade, Antonio R., 2023. "Maximizing non-aeronautical revenues in airport terminals using gate assignment and passenger behaviour modelling," Journal of Air Transport Management, Elsevier, vol. 112(C).
    18. Yunpeng Sun & Ruoya Jia & Asif Razzaq & Qun Bao, 2023. "RETRACTED ARTICLE: Drivers of China’s geographical renewable energy development: evidence from spatial association network structure approaches," Economic Change and Restructuring, Springer, vol. 56(6), pages 4115-4163, December.
    19. Herrán, Alberto & Manuel Colmenar, J. & Duarte, Abraham, 2021. "An efficient variable neighborhood search for the Space-Free Multi-Row Facility Layout problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 893-907.
    20. Dorndorf, Ulrich & Drexl, Andreas & Nikulin, Yury & Pesch, Erwin, 2005. "Flight gate scheduling: State-of-the-art and recent developments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 584, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:195:y:2009:i:3:p:810-826. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.