Top

Memetic Computing

Published in:

04-06-2019 | Technical Commentary

Letter: New best known solution for the most difficult QAP instance “tai100a”

Author: Alfonsas Misevičius

Published in: Memetic Computing | Issue 3/2019

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Excerpt

This is to announce that the new best known solution has been achieved for the very hard benchmark instance of the quadratic assignment problem (QAP) [5]. This instance is known as “ tai100a ”. It was proposed in [11] about 30 years ago and still remains a real challenge for the researchers around the world. …

previous article An improved differential evolution algorithm for optimization including linear equality constraints

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput 6:126–140. https://doi.org/10.1287/ijoc.6.2.126 CrossRefMATH

Benlic U, Hao J-K (2013) Breakout local search for the quadratic assignment problem. Appl Math Comput 219:4800–4815. https://doi.org/10.1016/j.amc.2012.10.106 MathSciNetMATH

Benlic U, Hao J-K (2015) Memetic search for the quadratic assignment problem. Expert Syst Appl 42:584–595. https://doi.org/10.1016/j.eswa.2014.08.011 CrossRef

Burkard RE, Karisch S, Rendl F (1997) QAPLIB: a quadratic assignment problem library. J Glob Optim 10:391–403. https://doi.org/10.1023/A:1008293323270 MathSciNetCrossRefMATH

Çela E (1998) The quadratic assignment problem: theory and algorithms. Kluwer, DordrechtCrossRefMATH

Drezner Z (2008) Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Comput Oper Res 35:717–736. https://doi.org/10.1016/j.cor.2006.05.004 MathSciNetCrossRefMATH

Misevicius A (2004) An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowl Based Syst 17:65–73. https://doi.org/10.1016/j.knosys.2004.03.001 CrossRef

Misevicius A (2005) A tabu search algorithm for the quadratic assignment problem. Comput Optim Appl 30:95–111. https://doi.org/10.1007/s10589-005-4562-x MathSciNetCrossRefMATH

Misevicius A (2012) An implementation of the iterated tabu search algorithm for the quadratic assignment problem. OR Spectr 34:665–690. https://doi.org/10.1007/s00291-011-0274-z MathSciNetCrossRefMATH

10.

Shylo PV (2017) Solving the quadratic assignment problem by the repeated iterated tabu search method. Cybern Syst Anal 53:308–311. https://doi.org/10.1007/s10559-017-9930-x CrossRefMATH

11.

Taillard ED (1991) Robust taboo search for the QAP. Parallel Comput 17:443–455. https://doi.org/10.1016/S0167-8191(05)80147-4 MathSciNetCrossRef

Title: Letter: New best known solution for the most difficult QAP instance “tai100a”
Author: Alfonsas Misevičius
Publication date: 04-06-2019
Publisher: Springer Berlin Heidelberg
Published in: Memetic Computing / Issue 3/2019
Print ISSN: 1865-9284
Electronic ISSN: 1865-9292
DOI: https://doi.org/10.1007/s12293-019-00289-y

Springer Professional

Excerpt

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Other articles of this Issue 3/2019

Birds foraging search: a novel population-based algorithm for global optimization

A unified distributed ELM framework with supervised, semi-supervised and unsupervised big data learning

A multi-level knee point based multi-objective evolutionary algorithm for AUC maximization

Editorial

OMNIREP: originating meaning by coevolving encodings and representations

An improved differential evolution algorithm for optimization including linear equality constraints

Premium Partner