Self Controlling Tabu Search algorithm for the Quadratic Assignment Problem

This paper addresses the application of the principles of feedback and self-controlling software to the tabu search algorithm. We introduce two new reaction strategies for the tabu search algorithm. The first strategy treats the tabu search algorithm as a target system to be controlled and uses a co...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & industrial engineering Ročník 60; číslo 2; s. 310 - 319
Hlavní autoři: Fescioglu-Unver, Nilgun, Kokar, Mieczyslaw M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.03.2011
Pergamon Press Inc
Témata:
ISSN:0360-8352, 1879-0550
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract This paper addresses the application of the principles of feedback and self-controlling software to the tabu search algorithm. We introduce two new reaction strategies for the tabu search algorithm. The first strategy treats the tabu search algorithm as a target system to be controlled and uses a control-theoretic approach to adjust the algorithm parameters that affect search intensification. The second strategy is a flexible diversification strategy which can adjust the algorithm’s parameters based on the search history. These two strategies, combined with tabu search, form the Self Controlling Tabu Search (SC-Tabu) algorithm. The algorithm is implemented and tested on the Quadratic Assignment Problem (QAP). The results show that the self-controlling features of the algorithm make it possible to achieve good performance on different types of QAP instances.
AbstractList This paper addresses the application of the principles of feedback and self-controlling software to the tabu search algorithm. We introduce two new reaction strategies for the tabu search algorithm. The first strategy treats the tabu search algorithm as a target system to be controlled and uses a control-theoretic approach to adjust the algorithm parameters that affect search intensification. The second strategy is a flexible diversification strategy which can adjust the algorithm's parameters based on the search history. These two strategies, combined with tabu search, form the Self Controlling Tabu Search (SC-Tabu) algorithm. The algorithm is implemented and tested on the Quadratic Assignment Problem (QAP). The results show that the self-controlling features of the algorithm make it possible to achieve good performance on different types of QAP instances.
This paper addresses the application of the principles of feedback and self-controlling software to the tabu search algorithm. We introduce two new reaction strategies for the tabu search algorithm. The first strategy treats the tabu search algorithm as a target system to be controlled and uses a control-theoretic approach to adjust the algorithm parameters that affect search intensification. The second strategy is a flexible diversification strategy which can adjust the algorithm's parameters based on the search history. These two strategies, combined with tabu search, form the Self Controlling Tabu Search (SC-Tabu) algorithm. The algorithm is implemented and tested on the Quadratic Assignment Problem (QAP). The results show that the self-controlling features of the algorithm make it possible to achieve good performance on different types of QAP instances. [PUBLICATION ABSTRACT]
Author Fescioglu-Unver, Nilgun
Kokar, Mieczyslaw M.
Author_xml – sequence: 1
  givenname: Nilgun
  surname: Fescioglu-Unver
  fullname: Fescioglu-Unver, Nilgun
  email: nfunver@etu.edu.tr
  organization: Department of Industrial Engineering, TOBB University of Economics and Technology, Ankara, Turkey
– sequence: 2
  givenname: Mieczyslaw M.
  surname: Kokar
  fullname: Kokar, Mieczyslaw M.
  email: mkokar@ece.neu.edu
  organization: Electrical and Computer Engineering Department, Northeastern University, Boston, MA, USA
BookMark eNp9kc1u1DAURi1UJKalD8DOYgObDHYcO4lYVSMKiEpQtawt_1zPeOTExXaQePs6GlZdzMq6V-dcyd93iS7mOANC7yjZUkLFp-PWeNi2ZJ3pltDuFdrQoR8bwjm5QBvCBGkGxts36DLnIyGk4yPdoB8PEBzexbmkGIKf9_hR6QU_gErmgFXYx-TLYcIuJlwOgO8XZZMq3uCbnP1-nmAu-FeKOsD0Fr12KmS4_v9eod-3Xx5335q7n1-_727uGsOGsTRgFR2hV91ghe3FIBwAiE47q9SomXWWK83dKJQbKedC95r1rNW2LgVowa7Qh9PdpxT_LJCLnHw2EIKaIS5ZDqLrqGgFq-THsyQVPW1F1_Yr-v4FeoxLmus_5NCNLW8ZGyrUnyCTYs4JnDS-1DTW-JQPkhK5tiGPdQ9ybUNSKmsb1aQvzKfkJ5X-nXU-nxyoYf71kGSuyGzA-gSmSBv9GfsZnNukhw
CODEN CINDDL
CitedBy_id crossref_primary_10_32604_cmes_2023_027146
crossref_primary_10_1007_s00521_021_06262_6
crossref_primary_10_1007_s00500_020_04730_0
crossref_primary_10_1016_j_ins_2020_06_036
crossref_primary_10_1007_s00521_023_08387_2
crossref_primary_10_1016_j_asoc_2017_02_025
crossref_primary_10_3390_math12233726
crossref_primary_10_1155_2014_103059
crossref_primary_10_1016_j_engappai_2016_02_004
crossref_primary_10_3390_e23010108
crossref_primary_10_1016_j_ins_2012_06_032
crossref_primary_10_1016_j_asoc_2019_01_001
crossref_primary_10_1155_2021_6653056
crossref_primary_10_2175_106143014X13975035525708
crossref_primary_10_1007_s11740_015_0645_4
crossref_primary_10_1109_TSE_2017_2704579
crossref_primary_10_1109_TCYB_2013_2256892
crossref_primary_10_1016_j_cor_2012_10_014
crossref_primary_10_1016_j_eswa_2018_06_037
crossref_primary_10_1016_j_cie_2015_03_001
crossref_primary_10_1080_00207543_2012_746798
crossref_primary_10_1016_j_cie_2016_11_023
crossref_primary_10_1016_j_jss_2012_05_060
crossref_primary_10_1016_j_jss_2016_03_013
crossref_primary_10_1016_j_cie_2023_109220
Cites_doi 10.1109/5254.769883
10.1145/321958.321975
10.1016/S0167-8191(05)80147-4
10.1287/ijoc.1.3.190
10.1002/mde.4090110512
10.1090/dimacs/016/08
10.1016/S0377-2217(03)00438-7
10.1016/S0164-1212(99)00098-9
10.1007/s10589-005-4562-x
10.1109/STEP.2003.4
10.1109/DEXA.2005.137
10.1109/ICDCSW.2004.1284046
10.1007/11889205_17
10.1111/j.1475-3995.1998.tb00117.x
10.1109/ISIC.1997.626471
10.1109/MC.2003.1160055
10.1109/4235.771166
10.1016/S0377-2217(98)00099-X
10.1287/ijoc.2.1.4
10.1016/j.knosys.2004.03.001
10.1109/MIS.1999.769879
10.1287/ijoc.6.2.126
10.1023/A:1018979424002
10.1016/0966-8349(95)00008-6
ContentType Journal Article
Copyright 2010 Elsevier Ltd
Copyright Pergamon Press Inc. Mar 2011
Copyright_xml – notice: 2010 Elsevier Ltd
– notice: Copyright Pergamon Press Inc. Mar 2011
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.cie.2010.11.014
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Computer and Information Systems Abstracts
Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Engineering
EISSN 1879-0550
EndPage 319
ExternalDocumentID 2257659141
10_1016_j_cie_2010_11_014
S0360835210003104
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFWJ
AAIKC
AAIKJ
AAKOC
AALRI
AAMNW
AAOAW
AAQFI
AAQXK
AARIN
AATTM
AAXKI
AAXUO
ABAOU
ABDPE
ABJNI
ABMAC
ABUCO
ABWVN
ABXDB
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACRPL
ADBBV
ADEZE
ADGUI
ADMUD
ADNMO
ADRHT
ADTZH
AEBSH
AECPX
AEIPS
AEKER
AENEX
AFJKZ
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AIEXJ
AIGVJ
AIKHN
AITUG
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BKOMP
BLXMC
BNPGV
CS3
DU5
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HLZ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
KOM
LX9
LY1
LY7
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
RNS
ROL
RPZ
RXW
SBC
SDF
SDG
SDP
SDS
SES
SET
SEW
SPC
SPCBC
SSB
SSD
SSH
SST
SSW
SSZ
T5K
TAE
TN5
WUQ
XPP
ZMT
~G-
9DU
AAYWO
AAYXX
ACLOT
ACVFH
ADCNI
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKYEP
APXCP
CITATION
EFKBS
EFLBG
~HD
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c389t-eda19e7a48d6d7686feee64bfdaa9b3dfd5ab5f96af91556b7b3732bdb5f6eb63
ISICitedReferencesCount 31
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000287290100013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0360-8352
IngestDate Sat Sep 27 19:19:46 EDT 2025
Sat Sep 27 15:59:48 EDT 2025
Sun Nov 30 04:42:42 EST 2025
Sat Nov 29 01:39:44 EST 2025
Tue Nov 18 21:09:38 EST 2025
Sun Apr 06 06:54:00 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Reactive search
Tabu search
Self-controlling software
Quadratic Assignment Problem
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c389t-eda19e7a48d6d7686feee64bfdaa9b3dfd5ab5f96af91556b7b3732bdb5f6eb63
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
PQID 849252338
PQPubID 23500
PageCount 10
ParticipantIDs proquest_miscellaneous_864416263
proquest_miscellaneous_1671264273
proquest_journals_849252338
crossref_citationtrail_10_1016_j_cie_2010_11_014
crossref_primary_10_1016_j_cie_2010_11_014
elsevier_sciencedirect_doi_10_1016_j_cie_2010_11_014
PublicationCentury 2000
PublicationDate 2011-03-01
PublicationDateYYYYMMDD 2011-03-01
PublicationDate_xml – month: 03
  year: 2011
  text: 2011-03-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Computers & industrial engineering
PublicationYear 2011
Publisher Elsevier Ltd
Pergamon Press Inc
Publisher_xml – name: Elsevier Ltd
– name: Pergamon Press Inc
References (pp. 11–18).
Kauffman (b0115) 1993
Drezner (b0035) 2005; 160
Glover (b0070) 1990; 11
Hoos, H. H. (2002). An adaptive noise mechanism for walksat. In
Birattari, M., Stutzle, T., Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring metaheuristics. In
Glover (b0065) 1989; 1
Garey, Johnson (b0060) 1979
Robertson, P., & Laddaga, R. (2004). The grava self-adaptive architecture: history; design; applications; and challenges. In
Glover (b0075) 1990; 2
Burkard, R., Çela, E., Karisch, S., & Rendl, F. (2008). Qaplib – A quadratic assignment problem library.
Taillard (b0165) 1991; 17
Franklin, Powell, Emami-Naemini (b0055) 2002
Fleurent, Ferland (b0050) 1994; 16
Zhu, X., Wang, Z., & Singhal, S. (2006). Utility-driven workload management using nested control design. In
Misevicius (b0145) 2004; 17
Wang, Z., Zhu, X., & Singhal, S. (2005). Utilization vs. slo-based control for dynamic sizing of resource partitions. In
Eracar, Y., & Kokar, M. (1997). An experiment in using control techniques in software engineering. In
Kokar, Baclawski, Eracar (b0125) 1999; 14
Hertz, Taillard, de Werra (b0095) 1997
Xu, Chiu, Glover (b0190) 1998; 5
Ph.D. thesis, The University of Queensland.
Sahni, Gonzalez (b0160) 1976; 23
(pp. 155–159).
Hutter, F., Hamadi, Y., Hoos, H. H., & Leyton-Brown, K. (2006). Performance prediction and automated tuning of randomized and parametric algorithms. In
Battiti, Tecchiolli (b0015) 1994; 6
Herring, C. E. (2002).
(pp. 655–660).
Taillard (b0170) 1995; 3
Battiti, Brunato (b0010) 2007
Glover, Laguna (b0080) 1998
Hellerstein, Diao, Parekh, Tilbury (b0085) 2004
Kokar, Eracar (b0130) 2000; 50
(pp. 298–303).
Taleb-Bendiab, A., Bustard, D., Sterritt, R., Laws, A., & Keenan, F. (2005). Model-based self-managing systems engineering. In
Voudouris, Tsang (b0180) 1999; 113
Mattfeld, Bierwirth, Kopfer (b0140) 1999; 86
Beer (b0020) 1981
.
(pp. 275–280).
Kephard, Chess (b0120) 2003; 36
Kai-Yuan, C., Cangussu, J., DeCarlo, R., & Mathur, A. (2003). An overview of software cybernetics. In
Adenso-Díaz, Laguna (b0005) 2006
(pp. 77–86).
Eiben, Hinterding, Michalewicz (b0040) 1999; 3
Misevicius (b0150) 2005; 30
Laddaga (b0135) 1999; 14
10.1016/j.cie.2010.11.014_b0025
Glover (10.1016/j.cie.2010.11.014_b0070) 1990; 11
10.1016/j.cie.2010.11.014_b0185
Eiben (10.1016/j.cie.2010.11.014_b0040) 1999; 3
Kephard (10.1016/j.cie.2010.11.014_b0120) 2003; 36
10.1016/j.cie.2010.11.014_b0045
10.1016/j.cie.2010.11.014_b0100
Misevicius (10.1016/j.cie.2010.11.014_b0150) 2005; 30
10.1016/j.cie.2010.11.014_b0105
Beer (10.1016/j.cie.2010.11.014_b0020) 1981
Glover (10.1016/j.cie.2010.11.014_b0080) 1998
Garey (10.1016/j.cie.2010.11.014_b0060) 1979
Kokar (10.1016/j.cie.2010.11.014_b0125) 1999; 14
Hertz (10.1016/j.cie.2010.11.014_b0095) 1997
Kauffman (10.1016/j.cie.2010.11.014_b0115) 1993
Battiti (10.1016/j.cie.2010.11.014_b0010) 2007
10.1016/j.cie.2010.11.014_b0030
10.1016/j.cie.2010.11.014_b0195
Adenso-Díaz (10.1016/j.cie.2010.11.014_b0005) 2006
10.1016/j.cie.2010.11.014_b0090
Drezner (10.1016/j.cie.2010.11.014_b0035) 2005; 160
Kokar (10.1016/j.cie.2010.11.014_b0130) 2000; 50
Battiti (10.1016/j.cie.2010.11.014_b0015) 1994; 6
Laddaga (10.1016/j.cie.2010.11.014_b0135) 1999; 14
Taillard (10.1016/j.cie.2010.11.014_b0165) 1991; 17
10.1016/j.cie.2010.11.014_b0175
10.1016/j.cie.2010.11.014_b0110
Glover (10.1016/j.cie.2010.11.014_b0075) 1990; 2
10.1016/j.cie.2010.11.014_b0155
Mattfeld (10.1016/j.cie.2010.11.014_b0140) 1999; 86
Sahni (10.1016/j.cie.2010.11.014_b0160) 1976; 23
Xu (10.1016/j.cie.2010.11.014_b0190) 1998; 5
Glover (10.1016/j.cie.2010.11.014_b0065) 1989; 1
Fleurent (10.1016/j.cie.2010.11.014_b0050) 1994; 16
Franklin (10.1016/j.cie.2010.11.014_b0055) 2002
Hellerstein (10.1016/j.cie.2010.11.014_b0085) 2004
Taillard (10.1016/j.cie.2010.11.014_b0170) 1995; 3
Misevicius (10.1016/j.cie.2010.11.014_b0145) 2004; 17
Voudouris (10.1016/j.cie.2010.11.014_b0180) 1999; 113
References_xml – year: 1998
  ident: b0080
  article-title: Tabu search
– volume: 5
  start-page: 233
  year: 1998
  end-page: 244
  ident: b0190
  article-title: Fine-tuning a tabu search algorithm with statistical tests
  publication-title: International Transactions in Operational Research
– volume: 2
  start-page: 4
  year: 1990
  end-page: 32
  ident: b0075
  article-title: Tabu search-part 2
  publication-title: ORSA Journal on Computing
– reference: (pp. 11–18).
– volume: 14
  start-page: 37
  year: 1999
  end-page: 45
  ident: b0125
  article-title: Control theory based foundations of self-controlling software
  publication-title: IEEE Intelligent Systems and Their Applications
– reference: Herring, C. E. (2002).
– volume: 113
  start-page: 469
  year: 1999
  end-page: 499
  ident: b0180
  article-title: Guided local search and its application to the traveling salesman problem
  publication-title: European Journal of Operational Research
– reference: (pp. 275–280).
– volume: 1
  start-page: 190
  year: 1989
  end-page: 206
  ident: b0065
  article-title: Tabu search-part 1
  publication-title: ORSA Journal on Computing
– reference: Hutter, F., Hamadi, Y., Hoos, H. H., & Leyton-Brown, K. (2006). Performance prediction and automated tuning of randomized and parametric algorithms. In
– year: 2002
  ident: b0055
  article-title: Feedback control of dynamic systems
– reference: (pp. 655–660).
– reference: Hoos, H. H. (2002). An adaptive noise mechanism for walksat. In
– reference: . Ph.D. thesis, The University of Queensland.
– reference: (pp. 155–159).
– year: 1981
  ident: b0020
  article-title: Brain of the firm
– volume: 3
  start-page: 87
  year: 1995
  end-page: 105
  ident: b0170
  article-title: Comparison of iterative searches for the quadratic assignment problem
  publication-title: Location Science
– year: 2004
  ident: b0085
  article-title: Feedback control of computing systems
– volume: 50
  start-page: 209
  year: 2000
  end-page: 219
  ident: b0130
  article-title: An architecture for software that adapts to changes in requirements
  publication-title: Journal of Systems and Software
– reference: (pp. 77–86).
– volume: 16
  start-page: 173
  year: 1994
  end-page: 187
  ident: b0050
  article-title: Genetic hybrids for the quadratic assignment problem
  publication-title: DIMACS Series in Mathematics and Theoretical Computer Science
– reference: (pp. 298–303).
– year: 1997
  ident: b0095
  article-title: Local search in combinatorial optimization
– reference: Robertson, P., & Laddaga, R. (2004). The grava self-adaptive architecture: history; design; applications; and challenges. In
– reference: Kai-Yuan, C., Cangussu, J., DeCarlo, R., & Mathur, A. (2003). An overview of software cybernetics. In
– volume: 17
  start-page: 443
  year: 1991
  end-page: 455
  ident: b0165
  article-title: Robust taboo search for the quadratic assignment problem
  publication-title: Parallel Computing
– year: 2007
  ident: b0010
  article-title: Reactive search: Machine learning for memory-based heuristics
  publication-title: Approximation Algorithms and Metaheuristics
– volume: 160
  start-page: 416
  year: 2005
  end-page: 422
  ident: b0035
  article-title: The extended concentric tabu for the quadratic assignment problem
  publication-title: European Journal of Operational Research
– volume: 30
  start-page: 95
  year: 2005
  end-page: 111
  ident: b0150
  article-title: A tabu search algorithm for the quadratic assignment problem
  publication-title: Computational Optimization and Applications
– reference: Birattari, M., Stutzle, T., Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring metaheuristics. In
– start-page: 54
  year: 2006
  ident: b0005
  article-title: Fine-tuning of algorithms using fractional experimental design and local search
  publication-title: Operations Research
– reference: >.
– reference: Taleb-Bendiab, A., Bustard, D., Sterritt, R., Laws, A., & Keenan, F. (2005). Model-based self-managing systems engineering. In
– volume: 36
  start-page: 41
  year: 2003
  end-page: 52
  ident: b0120
  article-title: The vision of autonomic computing
  publication-title: IEEE Computer Magazine
– volume: 23
  start-page: 555
  year: 1976
  end-page: 565
  ident: b0160
  article-title: P-complete approximation problems
  publication-title: Journal of the ACM
– year: 1979
  ident: b0060
  article-title: Computers and intractability: A guide to the theory of NP-completeness
– volume: 17
  start-page: 65
  year: 2004
  end-page: 73
  ident: b0145
  article-title: An improved hybrid genetic algorithm: New results for the quadratic assignment problem
  publication-title: Knowledge-Based Systems
– reference: Eracar, Y., & Kokar, M. (1997). An experiment in using control techniques in software engineering. In
– volume: 14
  start-page: 25
  year: 1999
  end-page: 29
  ident: b0135
  article-title: Creating robust software through self-adaptation
  publication-title: IEEE Intelligent Systems and Their Applications
– volume: 6
  start-page: 126
  year: 1994
  end-page: 140
  ident: b0015
  article-title: The reactive tabu search
  publication-title: ORSA Journal on Computing
– volume: 86
  start-page: 441
  year: 1999
  end-page: 453
  ident: b0140
  article-title: A search space analysis of the job shop scheduling problem
  publication-title: Annals of Operations Research
– reference: Wang, Z., Zhu, X., & Singhal, S. (2005). Utilization vs. slo-based control for dynamic sizing of resource partitions. In
– reference: Burkard, R., Çela, E., Karisch, S., & Rendl, F. (2008). Qaplib – A quadratic assignment problem library. <
– volume: 11
  start-page: 365
  year: 1990
  end-page: 375
  ident: b0070
  article-title: Artificial intelligence, heuristic frameworks and tabu search
  publication-title: Managerial and Decision Economics
– reference: Zhu, X., Wang, Z., & Singhal, S. (2006). Utility-driven workload management using nested control design. In
– volume: 3
  start-page: 124
  year: 1999
  end-page: 141
  ident: b0040
  article-title: Parameter control in evolutionary algorithms
  publication-title: IEEE Transactions on Evolutionary Computation
– reference: .
– year: 1993
  ident: b0115
  article-title: The origins of order self-organization and selection in evolution
– volume: 14
  start-page: 37
  year: 1999
  ident: 10.1016/j.cie.2010.11.014_b0125
  article-title: Control theory based foundations of self-controlling software
  publication-title: IEEE Intelligent Systems and Their Applications
  doi: 10.1109/5254.769883
– volume: 23
  start-page: 555
  year: 1976
  ident: 10.1016/j.cie.2010.11.014_b0160
  article-title: P-complete approximation problems
  publication-title: Journal of the ACM
  doi: 10.1145/321958.321975
– volume: 17
  start-page: 443
  year: 1991
  ident: 10.1016/j.cie.2010.11.014_b0165
  article-title: Robust taboo search for the quadratic assignment problem
  publication-title: Parallel Computing
  doi: 10.1016/S0167-8191(05)80147-4
– volume: 1
  start-page: 190
  year: 1989
  ident: 10.1016/j.cie.2010.11.014_b0065
  article-title: Tabu search-part 1
  publication-title: ORSA Journal on Computing
  doi: 10.1287/ijoc.1.3.190
– year: 1993
  ident: 10.1016/j.cie.2010.11.014_b0115
– ident: 10.1016/j.cie.2010.11.014_b0100
– volume: 11
  start-page: 365
  year: 1990
  ident: 10.1016/j.cie.2010.11.014_b0070
  article-title: Artificial intelligence, heuristic frameworks and tabu search
  publication-title: Managerial and Decision Economics
  doi: 10.1002/mde.4090110512
– volume: 16
  start-page: 173
  year: 1994
  ident: 10.1016/j.cie.2010.11.014_b0050
  article-title: Genetic hybrids for the quadratic assignment problem
  publication-title: DIMACS Series in Mathematics and Theoretical Computer Science
  doi: 10.1090/dimacs/016/08
– volume: 160
  start-page: 416
  year: 2005
  ident: 10.1016/j.cie.2010.11.014_b0035
  article-title: The extended concentric tabu for the quadratic assignment problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(03)00438-7
– year: 2002
  ident: 10.1016/j.cie.2010.11.014_b0055
– volume: 50
  start-page: 209
  year: 2000
  ident: 10.1016/j.cie.2010.11.014_b0130
  article-title: An architecture for software that adapts to changes in requirements
  publication-title: Journal of Systems and Software
  doi: 10.1016/S0164-1212(99)00098-9
– ident: 10.1016/j.cie.2010.11.014_b0185
– ident: 10.1016/j.cie.2010.11.014_b0030
– volume: 30
  start-page: 95
  year: 2005
  ident: 10.1016/j.cie.2010.11.014_b0150
  article-title: A tabu search algorithm for the quadratic assignment problem
  publication-title: Computational Optimization and Applications
  doi: 10.1007/s10589-005-4562-x
– ident: 10.1016/j.cie.2010.11.014_b0110
  doi: 10.1109/STEP.2003.4
– year: 2004
  ident: 10.1016/j.cie.2010.11.014_b0085
– ident: 10.1016/j.cie.2010.11.014_b0175
  doi: 10.1109/DEXA.2005.137
– year: 1979
  ident: 10.1016/j.cie.2010.11.014_b0060
– ident: 10.1016/j.cie.2010.11.014_b0025
– ident: 10.1016/j.cie.2010.11.014_b0155
  doi: 10.1109/ICDCSW.2004.1284046
– year: 2007
  ident: 10.1016/j.cie.2010.11.014_b0010
  article-title: Reactive search: Machine learning for memory-based heuristics
– year: 1981
  ident: 10.1016/j.cie.2010.11.014_b0020
– ident: 10.1016/j.cie.2010.11.014_b0105
  doi: 10.1007/11889205_17
– volume: 5
  start-page: 233
  year: 1998
  ident: 10.1016/j.cie.2010.11.014_b0190
  article-title: Fine-tuning a tabu search algorithm with statistical tests
  publication-title: International Transactions in Operational Research
  doi: 10.1111/j.1475-3995.1998.tb00117.x
– ident: 10.1016/j.cie.2010.11.014_b0045
  doi: 10.1109/ISIC.1997.626471
– volume: 36
  start-page: 41
  year: 2003
  ident: 10.1016/j.cie.2010.11.014_b0120
  article-title: The vision of autonomic computing
  publication-title: IEEE Computer Magazine
  doi: 10.1109/MC.2003.1160055
– ident: 10.1016/j.cie.2010.11.014_b0195
– year: 1998
  ident: 10.1016/j.cie.2010.11.014_b0080
– volume: 3
  start-page: 124
  year: 1999
  ident: 10.1016/j.cie.2010.11.014_b0040
  article-title: Parameter control in evolutionary algorithms
  publication-title: IEEE Transactions on Evolutionary Computation
  doi: 10.1109/4235.771166
– start-page: 54
  year: 2006
  ident: 10.1016/j.cie.2010.11.014_b0005
  article-title: Fine-tuning of algorithms using fractional experimental design and local search
  publication-title: Operations Research
– volume: 113
  start-page: 469
  year: 1999
  ident: 10.1016/j.cie.2010.11.014_b0180
  article-title: Guided local search and its application to the traveling salesman problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(98)00099-X
– ident: 10.1016/j.cie.2010.11.014_b0090
– volume: 2
  start-page: 4
  year: 1990
  ident: 10.1016/j.cie.2010.11.014_b0075
  article-title: Tabu search-part 2
  publication-title: ORSA Journal on Computing
  doi: 10.1287/ijoc.2.1.4
– volume: 17
  start-page: 65
  year: 2004
  ident: 10.1016/j.cie.2010.11.014_b0145
  article-title: An improved hybrid genetic algorithm: New results for the quadratic assignment problem
  publication-title: Knowledge-Based Systems
  doi: 10.1016/j.knosys.2004.03.001
– year: 1997
  ident: 10.1016/j.cie.2010.11.014_b0095
– volume: 14
  start-page: 25
  year: 1999
  ident: 10.1016/j.cie.2010.11.014_b0135
  article-title: Creating robust software through self-adaptation
  publication-title: IEEE Intelligent Systems and Their Applications
  doi: 10.1109/MIS.1999.769879
– volume: 6
  start-page: 126
  year: 1994
  ident: 10.1016/j.cie.2010.11.014_b0015
  article-title: The reactive tabu search
  publication-title: ORSA Journal on Computing
  doi: 10.1287/ijoc.6.2.126
– volume: 86
  start-page: 441
  year: 1999
  ident: 10.1016/j.cie.2010.11.014_b0140
  article-title: A search space analysis of the job shop scheduling problem
  publication-title: Annals of Operations Research
  doi: 10.1023/A:1018979424002
– volume: 3
  start-page: 87
  year: 1995
  ident: 10.1016/j.cie.2010.11.014_b0170
  article-title: Comparison of iterative searches for the quadratic assignment problem
  publication-title: Location Science
  doi: 10.1016/0966-8349(95)00008-6
SSID ssj0004591
Score 2.128028
Snippet This paper addresses the application of the principles of feedback and self-controlling software to the tabu search algorithm. We introduce two new reaction...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 310
SubjectTerms Adjustment
Algorithms
Assignment problem
Computer programs
Control systems
Optimization algorithms
Principles
Quadratic Assignment Problem
Reactive search
Searching
Self-controlling software
Software
Strategy
Studies
Tabu search
Title Self Controlling Tabu Search algorithm for the Quadratic Assignment Problem
URI https://dx.doi.org/10.1016/j.cie.2010.11.014
https://www.proquest.com/docview/849252338
https://www.proquest.com/docview/1671264273
https://www.proquest.com/docview/864416263
Volume 60
WOSCitedRecordID wos000287290100013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-0550
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004591
  issn: 0360-8352
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Jj9MwFLZKhwMcWAZGlAFkJObCyCipszjHEbRiGUoRrdRbZCdOyRDS0jbDwD_h3_IcO0sHTQUHLlHkbK3f57fYn99D6JlMKIs5F8QWLCLgEVtEOIKSKArAvjNwYWNWFpvwRyM2mwXjTudXtRfmPPPznF1cBMv_KmpoA2GrrbP_IO76pdAA5yB0OILY4fhXgv8ks0Rt5FMM9HKv-YSL4ljTio95Nl-s0s3nrzW98GPB41WZthUklc41OWCsy8y0Pdeq_MO6BEvaVPyQTUbDxq8Ew7qYZwWZ5oYhOkqzedGs-C--aGL3-1RGP38ALL-badm4mVGl7QmIsVzNVWEkzRnZpm-CebSI8vG0tdEqlvkBsVydbrbSwbqmgMFav6VQqSa9_qHo9ZzD2QtQgJqfp1Kx6u2o20m1Rx_C4fT0NJwMZpPtq6UR76uAyw1sxz6iw-U3osqRqWX7I_pKQ-Ma2utDTGV10d7Jm8HsbSsVvS7HWP3Fasm8JA9e-llXOT2XzH_p00zuoFsmGMEnGkR3UUfm--i2CUywUfvrfXSzlbXyHnqnEIZbCMMKYVgjDNcIw4AwDAjDNcJwgzBsEHYfTYeDycvXxNTkIBG4thsiY24H0ucOi70YQlUvkVJ6jkhgwAeCxknscuEmgccTVXnAE76gPu2LGBo9KTx6gLr5IpcPEGaWH3BLULAriUOTiFPuWpHwLVcKiFLcHrKqTgsjk7Be1U3JwoqZeAbtMlT9DIFsCP3cQ8_rR5Y6W8uum51KEqFxN7UbGQLIdj12WEktNMN-HTKV47NPKeuhp_VVUNRq9Y3nclGsQ9vzbYg-IFzoIXzFPUxFJyo_1MOdHzlEN5qB-Ah1N6tCPkbXo_NNul49MUD9DWzXwFo
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Self+Controlling+Tabu+Search+algorithm+for+the+Quadratic+Assignment+Problem&rft.jtitle=Computers+%26+industrial+engineering&rft.au=Fescioglu-Unver%2C+Nilgun&rft.au=Kokar%2C+Mieczyslaw+M&rft.date=2011-03-01&rft.pub=Pergamon+Press+Inc&rft.issn=0360-8352&rft.eissn=1879-0550&rft.volume=60&rft.issue=2&rft.spage=310&rft_id=info:doi/10.1016%2Fj.cie.2010.11.014&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2257659141
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon