This is a list of references concerning the Tabu Search (sorted by date).
If you miss your favourite reference or if you know any reference that
should be in the list please send me an e-mail (monaldo@idsia.ch).
I will complete the list.
@InProceedings{EURO-PDP01*273,
author = "G. Danese and
I. De Lotto and F. Leporati and A.
Quagllni and S. Ramat and G. Tecchiolli",
title = "A Parallel
Neurochip for Neural Networks Implementing
the Reactive Tabu Search Algorithm: Application Case
Studies",
pages = "273--281",
editor = "Bob Werner",
booktitle = "Proceedings of the Ninth Euromicro
Workshop on
Parallel and Distributed Processing",
month = feb # " ~7--9",
publisher = "IEEE Computer Society",
address = "Los Alamitos, California",
year = "2001",
}
From Evolutionary Multiobjective Optimization:
@InCollection{Balicki01,
author = "Jerzy Balicki
and Zybmunt Kitowski",
key =
"Balicki \& Kitowski, 2001",
booktitle = "First International Conference
on Evolutionary
Multi-Criterion Optimization",
title = "Multicriteria
Evolutionary Algorithm with Tabu Search
for Task Assignment",
editor = "Eckart Zitzler
and Kalyanmoy Deb and Lothar Thiele and
Carlos A. Coello Coello and David Corne",
publisher = "Springer-Verlag. Lecture Notes
in Computer Science No.
1993",
pages = "373--384",
year = "2001",
}
From Evolutionary Multiobjective Optimization:
@InCollection{Khor01,
author = "E. F. Khor and
K. C. Tan and T. H. Lee",
key =
"Khor et al., 2001",
booktitle = "First International Conference
on Evolutionary
Multi-Criterion Optimization",
title = "Tabu-{B}ased
{E}xploratory {E}volutionary {A}lgorithm
for {E}ffective {M}ulti-objective {O}ptimization",
editor = "Eckart Zitzler
and Kalyanmoy Deb and Lothar Thiele and
Carlos A. Coello Coello and David Corne",
publisher = "Springer-Verlag. Lecture Notes
in Computer Science No.
1993",
pages = "344--358",
year = "2001",
}
From Bibliography of the Proceedings of the Congress on Evolutionary Computation:
@InProceedings{alabas:2000:TONKGASATS,
author = "Cigdem Alabas
and Fulya Altiparmak and Berna Dengiz",
title = "The Optimization
of Number of Kanbans with Genetic
Algorithms, Simulated Annealing and Tabu Search",
booktitle = "Proceedings of the 2000 Congress
on Evolutionary
Computation CEC00",
year = "2000",
pages = "580--585",
address = "La Jolla Marriott Hotel
La Jolla, California, USA",
publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway,
NJ
08855-1331, USA",
month = "6-9 " # jul,
organisation = "IEEE Neural Network Council (NNC), Evolutionary
Programming Society (EPS), Institution of Electrical
Engineers (IEE)",
publisher = "IEEE Press",
keywords = "engineering applications",
ISBN = "0-7803-6375-2",
notes = "CEC-2000
- A joint meeting of the IEEE, Evolutionary
Programming Society, Galesia, and the IEE. IEEE Catalog
Number = 00TH8512, Library of Congress Number =
00-018644",
}
From A large bibliography on theory/foundations of computer science (2000):
@InProceedings{MatsumuraEtAl00,
author = "Matsumura and
Nakamura and Tamaki and Onaga",
title = "A Parallel
Tabu Search and Its Hybridization with
Genetic Algorithms",
booktitle = "ISPAN: Proceedings of the International
Symposium on
Parallel Architectures, Algorithms, and Networks
(I-SPAN)",
publisher = "IEEE Computer Society Press",
year = "2000",
}
From The Map Labeling Bibliography:
@Article{ycl-tshpf-00,
author = "Missae Yamamoto
and Gilberto Cam{\^a}ara and Luiz
Antonio Nogueira Lorena",
title = "Tabu Search
Heuristic for Point-Feature Cartographic
Label Placement",
journal = "GeoInformatica",
year = "2000",
note = "To appear",
url =
"http://www.lac.inpe.br/~lorena/missae/index.html",
pdf =
"http://www.lac.inpe.br/~{}lorena/missae/tabu.pdf",
}
From Bibliography on algorithms for k shortest paths:
@Article{BerGenPot-JH-00,
title = "{Tabu search
for a network loading problem with
multiple facilities}",
author = "D. Berger and
B. Gendron and J.-Y. Potvin and S.
Raghavan and P. Soriano",
journal = "J. Heuristics",
volume = "6",
number = "2",
pages = "253--267",
month = jun,
year = "2000",
abstract = "Examines a network design
problem that arises in the
telecommunications industry. In this problem,
communication between a gateway vertex and a number of
demand vertices is achieved through a network of
fiber-optic cables. Since each cable has an associated
capacity (bandwidth), enough capacity must be installed
on the links of the network to satisfy the demand,
possibly using different types of cables. Starting with
a network with no capacity or some capacity already
installed, a tabu search heuristic is designed to find
a solution that minimizes the cost of installing any
additional capacity on the network. This tabu search
applies a k-shortest path algorithm to find alternative
paths from the gateway to the demand vertices.
Numerical results are presented on different types of
networks with up to 200 vertices and 100 demand
vertices.",
}
From Evolutionary Multiobjective Optimization:
@Article{Gandibleux00,
author = "Xavier Gandibleux
and Arnaud Freville",
title = "Tabu {S}earch
{B}ased {P}rocedure for {S}olving the
0-1 {M}ulti-{O}bjective {K}napsack {P}roblem: {T}he
{T}wo {O}bjectives {C}ase",
journal = "Journal of Heuristics",
volume = "6",
number = "3",
pages = "361--383",
month = aug,
year = "2000",
}
From Bibliography on interior point optimization:
@Article{hertz2,
author = "A. Hertz and G.
Laporte and M. Mittaz",
title = "A tabu search
heuristic for the capacitated arc
routing problem",
year = "2000",
journal = "Operations Research",
volume = "48(1)",
pages = "129--135",
}
From Bibliography on interior point optimization:
@Article{crainic1,
author = "T. G. Crainic
and M. Gendreau and J. M. Farvolden",
title = "A simplex-based
tabu search method for capacitated
network design",
journal = "INFORMS Journal on
Computing",
volume = "12",
number = "3",
year = "2000",
pages = "223--236",
}
From Bibliography of the journal Parallel Computing:
@Article{Porto:2000:PEP,
author = "Stella C. S. Porto
and Jo{\~a}o Paulo F. W. Kitajima
and Celso C. Ribeiro",
title = "Performance
evaluation of a parallel tabu search task
scheduling algorithm",
journal = "Parallel Computing",
volume = "26",
number = "1",
pages = "73--90",
month = jan,
year = "2000",
coden = "PACOEJ",
ISSN = "0167-8191",
bibdate = "Sat Oct 28 17:44:12
MDT 2000",
url =
"http://www.elsevier.nl/gej-ng/10/35/21/42/23/27/abstract.html;
http://www.elsevier.nl/gej-ng/10/35/21/42/23/27/article.pdf",
acknowledgement = ack-nhfb,
}
From Bibliography of the Proceedings of the Genetic and Evolutionary Computation Conference:
@InProceedings{Kurahashi:2000:GECCO,
author = "Setsuya Kurahashi
and Takao Terano",
title = "A Genetic
Algorithm with Tabu Search for Multimodal
and Multiobjective Function Optimization",
pages = "291--298",
year = "2000",
publisher = "Morgan Kaufmann",
booktitle = "Proceedings of the Genetic and
Evolutionary
Computation Conference (GECCO-2000)",
editor = "Darrell Whitley
and David Goldberg and Erick Cantu-Paz
and Lee Spector and Ian Parmee and Hans-Georg Beyer",
address = "Las Vegas, Nevada,
USA",
publisher_address = "San Francisco, CA 94104, USA",
month = "10-12 " #
jul,
ISBN = "1-55860-708-0",
notes = "A joint meeting
of the ninth International Conference
on Genetic Algorithms (ICGA-2000) and the fifth Annual
Genetic Programming Conference (GP-2000) Part of
whitley:2000:GECCO",
}
From A large bibliography on theory/foundations of computer science (2000):
@InProceedings{SchWei00,
author = "Schneider and
Weiss",
title = "Hardware
Support for Simulated Annealing and Tabu
Search",
booktitle = "SPDP: IEEE Symposium on Parallel
and Distributed
Processing",
publisher = "ACM Special Interest Group on
Computer Architecture
(SIGARCH), and IEEE Computer Society",
year = "2000",
}
From Evolutionary Multiobjective Optimization:
@Article{Alves00,
author = "M. Jo\~{a}o Alves
and Jo\~{a}o Cl\'{\i}maco",
title = "An {I}nteractive
{M}ethod for 0-1 {M}ultiobjective
{P}roblems {U}sing {S}imulated {A}nnealing and {T}abu
{S}earch",
journal = "Journal of Heuristics",
volume = "6",
number = "3",
pages = "385--403",
month = aug,
year = "2000",
}
From Bibliography of The Computer Journal:
@Article{Ahmad:2000:TTS,
author = "Imtiaz Ahmad and
Muhammad K. Dhodhi and Faridah M.
Ali",
title = "{TLS}: {A}
Tabu Search Based Scheduling Algorithm for
Behavioral Synthesis of Functional Pipelines",
journal = "The Computer Journal",
volume = "43",
number = "2",
pages = "152--166",
month = "????",
year = "2000",
coden = "CMPJA6",
ISSN = "0010-4620",
bibdate = "Fri Apr 28 16:14:22
MDT 2000",
url =
"http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_02/430152.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_02/pdf/430152.pdf",
acknowledgement = ack-nhfb,
}
From Bibliography of the journal Computer Systems Science and Engineering:
@Article{Youssef:1999:TDG,
author = "Habib Youssef
and Sadiq M. Sait",
title = "Timing-driven
global routing for standard-cell {VLSI}
design",
journal = "International Journal
of Computer Systems Science and
Engineering",
volume = "14",
number = "3",
pages = "175--185",
month = may,
year = "1999",
coden = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Mon Sep 27 18:34:41
MDT 1999",
acknowledgement = ack-nhfb,
affiliation = "King Fahd Univ of Petroleum and Minerals",
affiliationaddress = "Dhahran, Saudi Arabia",
classification = "714.2; 721; 921.5",
journalabr = "Comput Syst Sci Eng",
keywords = "Integrated circuit layout;
Interconnection networks;
Simulated annealing; Tabu search; VLSI circuits",
}
From The Map Labeling Bibliography:
@InProceedings{ylc-tsapf-99,
author = "Missae Yamamoto
and Luiz Antonio Nogueira Lorena and
Gilberto Cam{\^a}ara",
title = "Tabu Search
Application for Point Features
Cartographic Label Placement Problems",
booktitle = "Proc. 3rd Metaheuristics International
Conference
(MIC'99)",
year = "1999",
month = "19--22~"
# jul,
address = "Angra dos Reis",
pdf =
"http://www.lac.inpe.br/\~{}lorena/proceed2e.pdf",
}
From Bibliography on reconfigurable logic:
@InProceedings{EmBh99,
author = "John M. Emmert
and Dinesh K. Bhatia",
title = "Tabu Search:
Ultra-Fast Placement for {FPGA}s",
booktitle = "Field-Programmable Logic and
Applications",
editor = "Patrick Lysaght
and James Irvine and Reiner W.
Hartenstein",
publisher = "Springer-Verlag, Berlin",
month = aug # "/"
# sep,
year = "1999",
pages = "81--90",
note = "Proceedings
of the 9th International Workshop on
Field-Programmable Logic and Applications, {FPL} 1999.
Lecture Notes in Computer Science 1673.",
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Burke:1999:HTS,
author = "E. Burke and P.
{De Causmaecker} and G. {Vanden
Berghe}",
title = "A Hybrid
Tabu Search Algorithm for the Nurse Rostering
Problem",
journal = "Lecture Notes in Computer
Science",
volume = "1585",
pages = "187--194",
year = "1999",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Tue Sep 14 06:09:05
MDT 1999",
acknowledgement = ack-nhfb,
keywords = "learning; SEAL; simulated
evolution",
}
From Bibliography for the IEEE Transactions on Fuzzy Systems:
@Article{ieee-fs-sep:Denna+Mauri+Zanaboni:1999,
author = "M. Denna and G.
Mauri and A. M. Zanaboni",
title = "Learning
Fuzzy Rules with {T}abu {S}earch - {A}n
Application to Control",
journal = "IEEE-FS",
year = "1999",
type = "Paper",
volume = "7",
number = "3",
month = jun,
pages = "295",
}
From Bibliography on interior point optimization:
@Article{jxu2,
author = "J. Xu and S. Y.
Chiu and F. Glover",
title = "Optimizing
a ring-based private line telecommunication
network using tabu search",
journal = "Management Science",
year = "1999",
volume = "45(3)",
pages = "330--345",
}
From Bibliography of the Proceedings of the Congress on Evolutionary Computation:
@InProceedings{merz:1999:ACMATSACQAP,
author = "Peter Merz and
Bernd Freisleben",
title = "A Comparison
of Memetic Algorithms, Tabu Search, and
Ant Colonies for the Quadratic Assignment Problem",
booktitle = "Proceedings of the Congress on
Evolutionary
Computation",
year = "1999",
editor = "Peter J. Angeline
and Zbyszek Michalewicz and Marc
Schoenauer and Xin Yao and Ali Zalzala",
volume = "3",
pages = "2063--2070",
address = "Mayflower Hotel, Washington
D.C., USA",
publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway,
NJ
08855-1331, USA",
month = "6-9 " # jul,
organisation = "Congress on Evolutionary Computation, IEEE /
Neural
Networks Council, Evolutionary Programming Society,
Galesia, IEE",
publisher = "IEEE Press",
keywords = "evolutionary computation
methods",
ISBN = "0-7803-5536-9
(softbound)",
ISBN = "0-7803-5537-7
(Microfiche)",
notes = "CEC-99 -
A joint meeting of the IEEE, Evolutionary
Programming Society, Galesia, and the IEE. Library of
Congress Number = 99-61143",
}
From Bibliography on Evolutionary Computation:
@InProceedings{merz:1999:cmatsacqap,
author = "Peter Merz and
Bernd Freisleben",
title = "A comparion
of memetic algorithms, Tabu search, and
ant colonies for the quadratic assignment problem",
booktitle = "1999 {C}ongress on {E}volutionary
{C}omputation",
pages = "2063--2070",
year = "1999",
address = "Piscataway, NJ",
publisher = "IEEE Service Center",
}
From Bibliography of the proceedings of many conferences (seal98):
@InProceedings{SEAL98*187,
author = "E. Burke and P.
De Causmaecker and G. {Vanden
Berghe}",
title = "A Hybrid
Tabu Search Algorithm for the Nurse Rostering
Problem",
pages = "187--194",
ISBN = "3-540-65907-2",
editor = "Bob McKay and
Xin Yao and Charles S. Newton and
Jong-Hwan Kim and Takeshi Furuhashi",
booktitle = "Proceedings of the 2nd Asia-Pacific
Conference on
Simulated Evolution and Learning ({SEAL}-98)",
month = nov # "~24--27",
series = "LNAI",
volume = "1585",
publisher = "Springer",
address = "Berlin",
year = "1999",
}
From Bibliography of the proceedings of many conferences (ecai98):
@InProceedings{ECAI98*520,
author = "A. Oddi",
title = "Solving Multiple
Capacitated Scheduling Problems with
Tabu Search",
pages = "520--521",
ISBN = "0-471-98431-0",
editor = "Henri Prade",
booktitle = "Proceedings of the 13th European
Conference on
Artificial Intelligence ({ECAI}-98)",
month = aug # "~23--28",
publisher = "John Wiley & Sons",
address = "Chichester",
year = "1998",
}
From Bibliography of publications in the journal Computing:
@Article{Ganley:1998:EEL,
author = "J. L. Ganley and
L. S. Heath",
title = "An Experimental
Evaluation of Local Search Heuristics
for Graph Partitioning",
journal = "Computing",
volume = "60",
number = "2",
pages = "121--132",
year = "1998",
coden = "CMPTA2",
ISSN = "0010-485X
(printed version), 1436-5057 (electronic
version)",
mrclass = "90C35 (05C85)",
mrnumber = "1 606 265",
bibdate = "Tue Oct 12 16:33:42
MDT 1999",
acknowledgement = ack-nhfb,
classification = "921; 921.4; 921.5",
journalabr = "Comput Vienna New York",
keywords = "Computational methods; Genetic
algorithms; Graph
partitioning; Graph theory; Heuristic methods; Local
search heuristics; Problem solving; Set theory;
Simulated annealing; Tabu search",
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Aiex:1998:CMT,
author = "R. M. Aiex and
S. L. Martins and C. C. Ribeiro and N.
D. L. R. Rodriguez",
title = "Cooperative
Multi-thread Parallel Tabu Search with an
Application to Circuit Partitioning",
journal = "Lecture Notes in Computer
Science",
volume = "1457",
pages = "310--??",
year = "1998",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Sat Oct 10 14:40:24
MDT 1998",
acknowledgement = ack-nhfb,
}
From Bibliography on interior point optimization:
@Book{glover4,
author = "F. Glover and
M. Laguna",
title = "Tabu Search",
year = "1998",
publisher = "Kluwer Academic Publishers",
address = "Dordrecht, The Netherlands",
}
From Bibliography on Computational Intelligence and Efficient Algorithms:
@Article{talbi98:_paral_adapt_tabu_searc_approac,
author = "El-Ghazali Talbi
and Z. Dafidi and Jean-Marc Geib",
title = "A Parallel
Adaptive Tabu Search Approach",
journal = "Parallel Computing",
year = "1998",
volume = "24",
pages = "2003--2019",
language = "english",
}
From Bibliography of the proceedings of many conferences (ecai98):
@InProceedings{ECAI98*420,
author = "P. Br{\'e}zellec
and H. Soldano",
title = "Tabata: a
Learning Algorithm Performing a
Bidirectional Search in a Reduced Search Space Using a
Tabu Strategy",
pages = "420--424",
ISBN = "0-471-98431-0",
editor = "Henri Prade",
booktitle = "Proceedings of the 13th European
Conference on
Artificial Intelligence ({ECAI}-98)",
month = aug # "~23--28",
publisher = "John Wiley & Sons",
address = "Chichester",
year = "1998",
}
From A large bibliography on theory/foundations of computer science (1998):
@InProceedings{FerLuc98a,
author = "Ferragina and
Luccio",
title = "Multi-String
Search in {BSP}",
booktitle = "SEQS: Sequences '91",
year = "1998",
}
From A large bibliography on theory/foundations of computer science (1998):
@InProceedings{CerFue98,
author = "Cerveron and Fuertes",
title = "Parallel
Random Search and Tabu Search for the Minimal
Consistent Subset Selection Problem",
booktitle = "RANDOM: International Workshop
on Randomization and
Approximation Techniques in Computer Science",
publisher = "LNCS",
year = "1998",
}
From Bibliography of the journal Parallel Computing:
@Article{Talbi:1998:PAT,
author = "E. G. Talbi and
Z. Hafidi and J-M. Geib",
title = "A parallel
adaptive tabu search approach",
journal = "Parallel Computing",
volume = "24",
number = "14",
pages = "2003--2019",
day =
"1",
month = dec,
year = "1998",
coden = "PACOEJ",
ISSN = "0167-8191",
bibdate = "Fri Aug 6 10:15:42
MDT 1999",
url =
"http://www.elsevier.com/cas/tree/store/parco/sub/1998/24/14/1363.pdf",
acknowledgement = ack-nhfb,
}
From Bibliography for the journal "Theoretical Computer Science":
@Article{Angel:1998:ACG,
author = "E. Angel and V.
Zissimopoulos",
title = "Autocorrelation
coefficient for the graph
bipartitioning problem",
journal = "Theoretical Computer
Science",
volume = "191",
number = "1--2",
pages = "229--243",
day =
"30",
month = jan,
year = "1998",
coden = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:21:31
MDT 1999",
url =
"http://www.elsevier.com/cas/tree/store/tcs/sub/1998/191/1-2/2712.pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory)",
corpsource = "Lab. de Recherche en Inf., Univ. de
Paris-Sud, Orsay,
France",
keywords = "approximate solution; autocorrelation
coefficient;
combinatorial optimization; computability; cost
function; edge-weighted graph; graph bipartitioning;
graph theory; local search; neighborhood structure;
NP-hard optimization; optimisation; quality solutions;
search problems; simulated annealing; tabu search",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
From Bibliography on the Euclidian Distance completion problem:
@InCollection{MR1641321,
author = "Panos M. Pardalos
and Xin Liu",
title = "A tabu based
pattern search method for the distance
geometry problem",
booktitle = "New trends in mathematical programming",
pages = "223--234",
publisher = "Kluwer Acad. Publ.",
address = "Boston, MA",
year = "1998",
mrclass = "92C55 (90C30 92D20)",
mrnumber = "1 641 321",
}
From Bibliography on Evolutionary Computation:
@Article{brucker:1998:tmjp,
author = "Peter Brucker
and J{\"u}rgen Neyer",
title = "Tabu-search
for the multi-mode job-shop problem",
journal = "{OR} {S}pektrum",
year = "1998",
volume = "20",
pages = "21--28",
}
From Bibliography of the proceedings of many conferences (ecp97):
@InProceedings{ECP97*351,
author = "A. Oddi and A.
Cesta",
title = "A tabu search
strategy to solve scheduling problems
with deadlines and complex metric constraints",
pages = "351--363",
ISBN = "3-540-63912-8",
editor = "Sam Steel and
Rachid Alami",
booktitle = "Proceedings of the 4th European
Conference on Planning
({ECP}-97): Recent Advances in {AI} Planning",
month = sep # "~24--26",
series = "LNAI",
volume = "1348",
publisher = "Springer",
address = "Berlin",
year = "1997",
}
From Bibliography on interior point optimization:
@TechReport{berger2,
author = "A. J. Berger and
J. E. Mitchell and J. M. Mulvey and
R. Rush",
title = "A tabu search
procedure for target-matching in
financial scenario generation",
year = "1997",
month = dec,
institution = "DSES, Rensselaer Polytechnic Institute",
address = "Troy, NY 12180",
url =
"http://www.rpi.edu/~mitchj/papers/target.html",
}
From Bibliography of the SEL-HPC Article Archive:
@InProceedings{SmailNIARA1997a,
author = "Arnaud FREVILLE
Smail NIAR",
booktitle = "Interna. Parallel Processing
Sympo. 97",
title = "{A} Parallel
Tabu Search Algorithm For The 0-1
Multidimensionnal Knapsack Problem",
year = "1997",
url =
"http://glardax.univ-valenciennes.fr:8000/limav/niar/pub/rech/",
keywords = "Tabu Search, Parallel Processing,
Multidimensionnal
Knapsack Problem.",
month = "avril 1997",
scope = "opt",
}
From Richard Webber's Research Bibliography:
@InCollection{ref:Hertz:1997a,
author = "Alain Hertz and
Eric Taillard and Dominique {de}
Werra",
title = "Tabu Search",
pages = "121--136",
chapter = "5",
editor = "Emile H. L. Aarts
and Jan Karel Lenstra",
booktitle = "Local Search in Combinatorial
Optimization",
publisher = "Wiley-Interscience",
address = "Chichester, England",
series = "Discrete Mathematics
and Optimization",
month = jun,
year = "1997",
ISBN = "0-471-94822-5",
containedin = "\cite{ref:Aarts:1997a}",
library = "Uni of Newcastle, Auchmuty
Library - 519.7 AART",
}
From Bibliography of the proceedings of many conferences (ki97):
@InProceedings{ki97*337,
author = "Olaf Steinmann
and Antje Strohmaier and Thomas
St{\"u}tzle",
title = "Tabu Search
vs. Random Walk",
pages = "337--348",
ISBN = "3-540-63493-2",
editor = "Gerhard Brewka
and Christopher Habel and Bernhard
Nebel",
booktitle = "Proceedings of the 21st Annual
German Conference on
Artificial Intelligence ({KI}-97): Advances in
Artificial Intelligence",
month = sep # "~9--12",
series = "LNAI",
volume = "1303",
publisher = "Springer",
address = "Berlin",
year = "1997",
}
From Evolutionary Multiobjective Optimization:
@InProceedings{Hansen97,
author = "Michael Pilegaard
Hansen",
booktitle = "Proceedings of the 13th International
Conference on
Multiple Criteria Decision Making (MCDM'97)",
title = "Tabu {S}earch
in {M}ultiobjective {O}ptimisation :
{MOTS}",
address = "Cape Town, South Africa",
month = jan,
year = "1997",
}
From Bibliography of publications in the journal Computer Networks and ISDN Systems: The International Journal of Computer and Telecommunications Networking:
@InProceedings{Pierre:1997:ICN,
author = "S. Pierre and
A. Elgibaoui",
title = "Improving
Communication Network Topologies Using Tabu
Search",
editor = "{IEEE Computer
Society. Technical Committee on
Computer Communications}",
booktitle = "Proceedings, 22nd annual Conference
on Local Computer
Networks: {LCN} '97: November 2--5, 1997, Minneapolis,
Minnesota",
publisher = "IEEE Computer Society Press",
address = "1109 Spring Street,
Suite 300, Silver Spring, MD
20910, USA",
year = "1997",
ISBN = "0-8186-8141-1,
0-8186-8142-X (casebound),
0-8186-8143-8 (microfiche)",
ISSN = "0742-1303",
volume = "22",
pages = "44--53",
year = "1997",
bibdate = "Mon Sep 27 10:52:58
MDT 1999",
acknowledgement = ack-nhfb,
keywords = "local computer networks;
LCN; IEEE; computer
networks",
}
From Neural Network Bibliography:
@Unpublished{lagi,
author = "Steve Lawrence
and C. Lee Giles",
title = "The {NECI}
Meta-search Engine: Raptor Search",
note = "Tech
Report, NEC Researh Institute",
year = "1997",
}
From Neural Network Bibliography:
@Misc{mamma,
title = "Mamma meta
search engine",
url =
"\url{http://www.mamma.com}",
year = "1997",
}
From A large bibliography on theory/foundations of computer science (1997):
@Article{CorGenLap97,
author = "Cordeau and Gendreau
and Laporte",
title = "A Tabu Search
Heuristic for Periodic and Multi-Depot
Vehicle Routing Problems",
journal = "NETWORKS: Networks:
An International Journal",
volume = "30",
year = "1997",
}
From Bibliography of the proceedings of many conferences (aaai97_iaai97):
@InProceedings{AAAI97_IAAI97*281,
author = "Bertrand Mazure
and Lakhdar Sa{\"\i}s and {\'E}ric
Gr{\'e}goire",
title = "Tabu Search
for {SAT}",
pages = "281--285",
ISBN = "0-262-51095-2",
booktitle = "Proceedings of the 14th National
Conference on
Artificial Intelligence and 9th Innovative Applications
of Artificial Intelligence Conference
({AAAI}-97/{IAAI}-97)",
month = jul # "~27--31",
publisher = "AAAI Press",
address = "Menlo Park",
year = "1997",
}
From Evolutionary Multiobjective Optimization:
@InCollection{Gandibleux97,
author = "X. Gandibleux
and N. Mezdaoui and N. Fr\'{e}ville",
title = "A tabu search
procedure to solve combinatorial
optimisation problems",
booktitle = "Advances in Multiple Objective
and Goal Programming",
volume = "455",
series = "Lecture Notes
in Economics and Mathematical Systems",
publisher = "Springer-Verlag",
editor = "R. Caballero and
F. Ruiz and R. E. Steuer",
pages = "291--300",
year = "1997",
}
From Bibliography on interior point optimization:
@Article{jxu1,
author = "J. Xu and S. Y.
Chiu and F. Glover",
title = "Tabu search
for dynamic routing communications network
design",
journal = "Telecommunications
Systems",
year = "1997",
volume = "8",
pages = "55--77",
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Oddi:1997:TSS,
author = "Oddi and Cesta",
title = "A tabu search
strategy to solve scheduling problems
with deadlines and complex metric constraints",
journal = "Lecture Notes in Computer
Science",
volume = "1348",
pages = "351--??",
year = "1997",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Tue Apr 28 08:51:33
MDT 1998",
acknowledgement = ack-nhfb,
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Steinmann:1997:TSV,
author = "O. Steinmann and
A. Strohmaier and T. Stfitzle",
title = "Tabu Search
vs. Random Walk",
journal = "Lecture Notes in Computer
Science",
volume = "1303",
pages = "337--??",
year = "1997",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Tue Apr 28 08:51:33
MDT 1998",
acknowledgement = ack-nhfb,
}
From A large bibliography on theory/foundations of computer science (1997):
@Article{SharaihaEtAl97,
author = "Sharaiha and Gendreau
and Laporte and Osman",
title = "A Tabu Search
Algorithm for the Capacitated Shortest
Spanning Tree Problem",
journal = "NETWORKS: Networks:
An International Journal",
volume = "29",
year = "1997",
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Galinier:1997:TSM,
author = "P. Galinier and
J.-K. Hao",
title = "Tabu Search
for Maximal Constraint Satisfaction
Problems",
journal = "Lecture Notes in Computer
Science",
volume = "1330",
pages = "196--??",
year = "1997",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Tue Apr 28 08:51:33
MDT 1998",
acknowledgement = ack-nhfb,
}
From Bibliography on Evolutionary Computation:
@Article{vigo:1997:gthapap,
author = "Daniele Vigo and
Vittorio Maniezzo",
title = "A Genetic/Tabu
Thresholding Hybrid Algorithm for the
Process Allocation Problem",
journal = "Journal of {H}euristics",
year = "1997",
volume = "3",
number = "2",
pages = "91--110",
}
From Multiprocessor/Distributed Processing Bibliography (1997):
@InProceedings{Niar97,
author = "Smail Niar and
Arnaud Freville",
title = "A Parallel
Tabu Search Algorithm for the 0-1
Multidimensional Knapsack Problem",
booktitle = "Proceedings of the 11th International
Parallel
Processing Symposium (IPPS'97)",
publisher = "The Institute of Electrical and
Electronics
Engineers",
address = "Geneva, Switzerland",
month = apr,
year = "1997",
keywords = "CD-ROM, algorithms, Knapsack
Problem, Tabu Search,
Combinatorial Optimization, capital budgeting, resource
allocation.",
abstract = "From the text: The 0-1 MKP
is a combinatorial
optimization problem which is often used for modelling
different applications like capital budgeting or
resource allocation.\par The method uses a Tabu Search
(TS) algorithm which shows many opportunities for
parallelization including parallel search threads.",
note = "Universite
de Valenciennes, LIMAV, France",
}
From Bibliography on graph coloring:
@InProceedings{flfe93,
author = "Charles Fleurent
and Jacques A. Ferland",
title = "Object-Oriented
Implementation of Heuristic Search
Methods for Graph Coloring, Maximum Clique, and
Satisfiability.",
booktitle = "Cliques, Coloring, and Satisfiability:
Second DIMACS
Implementation Challenge",
year = "1996",
editor = "David S. Johnson
and Michael A. Trick",
pages = "619--652",
series = "DIMACS Series
in Discrete Mathematics and Theoretical
Computer Science",
volume = "26",
annote = "A generral framework
for mixing TABU and Genetic
algorithms for coloring, maximum clique and
satisfiability.",
}
From Bibliography of the proceedings of many conferences (aaai96-1):
@InProceedings{aaai96-1*363,
author = "Andrea Schaerf",
title = "Tabu Search
Techniques for Large High-School
Timetabling Problems",
pages = "363--368",
ISBN = "0-262-51091-X",
booktitle = "Proceedings of the Thirteenth
National Conference on
Artificial Intelligence and the Eighth Innovative
Applications of Artificial Intelligence Conference",
month = aug # "~4--8",
publisher = "AAAI Press / MIT Press",
address = "Menlo Park",
year = "1996",
}
From Stochastic Programming Bibliography:
@Article{LokketangenWoodruff96,
author = "A. L{\o}kketangen
and D. L. Woodruff",
year = "1996",
title = "Progressive
Hedging and Tabu Search Applied To Mixed
Integer (0,1) Multi-Stage Stochastic Programming",
journal = "Journal of Heuristics",
volume = "2",
pages = "111--128",
}
From Bibliography on Evolutionary Computation:
@TechReport{schaerf:1996:tstlhtp,
author = "Andrea Schaerf",
title = "Tabu Search
Techniques for Large High-School
Timetabling Problems",
institution = "CWI",
number = "CS-R9611",
address = "Amsterdam, NL",
year = "1996",
}
From Bibliography of technical reports of the Centrum voor Wiskunde en Informatica:
@InCollection{Schaerf96,
author = "Andrea Schaerf",
title = "Tabu search
techniques for large high-school
timetabling problems",
booktitle = "88",
pages = "17",
publisher = "Centrum voor Wiskunde en Informatica
(CWI)",
address = "ISSN 0169-118X",
month = mar # " 30",
year = "1996",
keywords = "timetabling, combinatorial
optimization, scheduling,
local search techniques, tabu search.",
url =
"ftp://ftp.cwi.nl/pub/CWIreports/AP/CS-R9611.ps.Z",
abstract = "The high-school timetabling
problem regards the weekly
scheduling for all the lectures of a high school. The
problem consists in assigning lectures to periods in
such a way that no teacher (or class) is involved in
more than one lecture at a time, and other side
constraints are satisfied.The problem is NP-complete
and is usually tackled using heuristic methods.This
paper describes a solution algorithm (and its
implementation) based on $<$i$>$tabu search$<$/i$>$.
The algorithm interleaves different types of
$<$i$>$moves$<$/i$>$ and makes use of an adaptive
relaxation of the hard constraints.The implementation
of the algorithm has been successfully experimented in
some large high schools with various kinds of side
constraints.",
note = "AP (Department
of Software Technology)",
note = "CS-R9611",
note = "Fri,
26 Sep 1997 08:09:22 GMT",
contents = "(not listed)",
}
From Bibliography of Work in Philosophy of Language, Semantics, Artificial Intelligence, and Assorted Related Topics:
@Article{brooks_rr-etal:1996a,
author = "R. R. Brooks and
S. S. Iyengar and J. Chen",
title = "Automatic
Correlation and Calibration of Noisy Sensor
Readings Using Elite Genetic Algorithms",
journal = "Artificial Intelligence",
year = "1996",
volume = "84",
number = "1--2",
pages = "339--354",
contentnote = "Abstract: This paper explores an image
processing
application of optimization techniques which entails
interpreting noisy sensor data. The application is a
generalization of image correlation; we attempt to find
the optimal gruence which matches two overlapping gray
scale images corrupted with noise. Both tabu search and
genetic algorithms are used to find the parameters
which match the two images. A genetic algorithm
approach using an elitist reproduction scheme is found
to provide significantly superior results. Keyword(s):
Genetic algorithms; Tabu search; Sensor fusion; Noise
reduction; Image matching interpreting noisy sensor
data; image correlation; automatic correlation; sensor
fusion; automatic calibration; elitist reproduction
scheme; image processing; optimization techniques; tabu
search; noise reduction; elite genetic algorithms;
image matching; overlapping gray scale images; noisy
sensor readings; optimal gruence",
topic = "genetic-algorithms;reasoning-about-noisy-sensors;
noise-reduction;",
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Miller:1996:REG,
author = "J. F. Miller and
P. Thompson",
title = "Restricted
Evaluation Genetic Algorithms with Tabu
Search for Optimising {Boolean} Functions as
Multi-Level {AND-EXOR} Networks",
journal = "Lecture Notes in Computer
Science",
volume = "1143",
pages = "85--??",
year = "1996",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Sat Dec 21 09:47:26
1996",
acknowledgement = ack-nhfb,
}
From Minimax Game Tree Searching: A Bibliography:
@PhdThesis{mmt/Plaa96a,
author = "Aske Plaat",
title = "Research
{Re:} search \& {Re}-search",
school = "Tinbergen Institute
and Department of Computer Science
Erasmus University Rotterdam",
year = "1996",
address = "Rotterdam, Netherlands",
month = jun,
}
From Bibliography on Evolutionary Computation:
@Article{laguna:1996:wits,
author = "M. Laguna and
F. Glover",
title = "What is {T}abu
{S}earch?",
journal = "Colorado {B}usiness
{R}eview",
year = "1996",
volume = "LXI",
number = "5",
}
From Bibliography on interior point optimization:
@Article{potvin1,
author = "J.-Y. Potvin and
T. Kervahut and B.-L. Garcia and
J.-M. Rousseau",
title = "The vehicle
routing problem with time windows --- Part
{I}: Tabu search",
journal = "INFORMS Journal on
Computing",
year = "1996",
volume = "8",
pages = "158--164",
}
From Bibliography on interior point optimization:
@Article{gendreau1,
author = "M. Gendreau and
G. Laporte and R. S\'{e}guin",
title = "A tabu search
heuristic for the vehicle routing
problem with stochastic demands and customers",
journal = "Operations Research",
volume = "44",
year = "1996",
pages = "469--477",
}
From Bibliography on Fuzzy Genetic Algorithms:
@InProceedings{Karaboga1996,
editor = "Michael H. Smith
and Michael A. Lee and Jim Keller and
John Yen",
booktitle = "1996 Biennial Conference of the
North American Fuzzy
Information Processing Society - {N}{A}{F}{I}{P}{S}",
year = "1996",
month = jun # " 19-22",
publisher = "IEEE Service Center",
address = "445 Hoes Lane, Box
1331, Piscataway, NJ 08855-1331",
author = "D. Karaboga",
title = "Design of
Fuzzy Controllers Using {T}abu Search
Algorithm",
pages = "489--491",
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Giordano:1996:GIU,
author = "J. Y. Giordano",
title = "Grammatical
inference using tabu search",
journal = "Lecture Notes in Computer
Science",
volume = "1147",
pages = "292--??",
year = "1996",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Sat Dec 21 09:47:26
1996",
acknowledgement = ack-nhfb,
}
From Bibliography of the proceedings of many conferences (icgi96):
@InProceedings{icgi96*292,
author = "J. Y. Giordano",
title = "Grammatical
inference using tabu search.",
pages = "292--300",
ISBN = "3-540-61778-7",
editor = "Laurent Miclet
and Colin de la Hieguera",
booktitle = "Proceedings of the Third International
Colloquium on
Grammatical Inference ({ICGI}-96): Learning Syntax from
Sentences",
month = sep # "~25--27",
series = "LNAI",
volume = "1147",
publisher = "Springer",
address = "Berlin",
year = "1996",
}
From Bibliography of the book "Research Directions in Parallel Functional Programming":
@Book{BH1,
author = "P. Brinch-Hansen",
title = "{The Search
for Simplicity}",
publisher = "IEEE Computer Press",
year = "1996",
}
From Bibliography of Technical Reports: CWI - Centrum voor Wiskunde en Informatica:
@TechReport{ercim.cwi//CS-R9611,
type = "Technical
Report",
number = "CS-R9611",
institution = "CWI - Centrum voor Wiskunde en Informatica",
title = "Tabu search
techniques for large high-school
timetabling problems",
month = mar # " 30,",
year = "1996",
bibdate = "September 26, 1997",
url =
"ftp://ftp.cwi.nl/pub/CWIreports/AP/CS-R9611.ps.Z",
author = "Andrea Schaerf",
abstract = "The high-school timetabling
problem regards the weekly
scheduling for all the lectures of a high school. The
problem consists in assigning lectures to periods in
such a way that no teacher (or class) is involved in
more than one lecture at a time, and other side
constraints are satisfied.The problem is NP-complete
and is usually tackled using heuristic methods.This
paper describes a solution algorithm (and its
implementation) based on <i>tabu search</i>. The
algorithm interleaves different types of <i>moves</i>
and makes use of an adaptive relaxation of the hard
constraints.The implementation of the algorithm has
been successfully experimented in some large high
schools with various kinds of side constraints.",
}
From Bibliography of the technical reports of the International Computer Science Institute ICSI:
@TechReport{ICSI-TR-95-052,
author = "R. Battiti and
M. Protasi",
title = "Reactive
Local Search for the Maximum Clique Problem",
institution = "International Computer Science Institute",
number = "TR-95-052",
address = "Berkeley, CA",
month = sep,
year = "1995",
keywords = "maximum clique problem,
heuristic algorithms, tabu
search, reactive search",
abstract = "A new Reactive Local Search
(RLS) algorithm is
proposed for the solution of the Maximum-Clique
problem. RLS is based on local search complemented by a
feedback (memory-based) scheme to determine the amount
of diversification. The reaction acts on the single
parameter that decides the temporary prohibition of
selected moves in the neighborhood, in a manner
inspired by Tabu Search. The performance obtained in
computational tests appears to be significantly better
with respect to all algorithms tested at the the second
DIMACS implementation challenge. The worst-case
complexity per iteration of the algorithm is
O(max{n,m}) where n and m are the number of nodes and
edges of the graph. In practice, when a vertex is
moved, the number of operations tends to be
proportional to its number of missing edges and
therefore the iterations are particularly fast in dense
graphs. <P>",
}
From Bibliography of the proceedings of many conferences (adt95-2):
@InProceedings{adt95-2*253,
author = "G. Waligora",
title = "A {Tabu}
Search Algorithm for Some Discrete-Continuous
Scheduling Problems",
pages = "253--260",
booktitle = "Proceedings of the Conference
on Applied Decision
Technologies ({ADT} '95). Volume 2: Modern Heuristic
Search Methods",
month = apr,
publisher = "Unicom Seminars",
address = "Uxbridge, UK",
year = "1995",
}
From Bibliography of the proceedings of many conferences (adt95-2):
@InProceedings{adt95-2*233,
author = "C. Dimitropoulos",
title = "{Tabu} Search
for the Radio Links Frequency Assignment
Problem",
pages = "233--252",
booktitle = "Proceedings of the Conference
on Applied Decision
Technologies ({ADT} '95). Volume 2: Modern Heuristic
Search Methods",
month = apr,
publisher = "Unicom Seminars",
address = "Uxbridge, UK",
year = "1995",
}
From Bibliography on queueing systems and telecommunication (1995):
@Article{Xu1995,
author = "J. Xu and S. Y.
Chiu and F. Glover",
title = "A Tabu Search
Heuristic for a Telecommunication
Network Design Problem",
journal = "Proc. 3rd Int'l Conference
on Telecommunication
Systems Modeling and Analysis; 16.-19.03.95",
year = "1995",
pages = "278--295",
references = "7",
town = "Nashville",
country = "USA",
language = "English",
enum = "12037",
descriptors = "heuristics; network design; graph theory;",
date = "18/04/95",
by_date = "Er",
revision = "26/06/95",
by_rev = "Le",
location = "TUDD-IFN-TK",
annote = "This paper presents
a computional study of a network
design problem arising in the telecommunication
industry. The objective can be formulated as that of
finding an optimal degree constrained Steiner tree in a
graph whose nodes and edges are weighted by costs. We
develop a Tabu Search heuristic for this problem that
incorporates long term memory and probabilistic move
selections.",
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Pardalos:1995:PSC,
author = "P. M. Pardalos
and L. Pitsoulis and T. Mavridou and M.
G. C. Resende",
title = "Parallel
Search for Combinatorial Optimization:
Genetic Algorithms, Simulated Annealing, Tabu Search
and {GRASP}",
journal = "Lecture Notes in Computer
Science",
volume = "980",
pages = "317--??",
year = "1995",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Sat May 11 13:45:32
MDT 1996",
acknowledgement = ack-nhfb,
}
From Bibliography on interior point optimization:
@Article{glover1,
author = "F. Glover",
title = "Tabu thresholding:
Improved search by nonmonotonic
trajectories",
journal = "ORSA Journal on Computing",
year = "1995",
volume = "7",
pages = "426--442",
}
From Bibliography for the IEEE Transactions on Neural Networks:
@Article{ieee-nn:Battiti+Tecchiolli:1995,
author = "Roberto Battiti
and Giampietro Tecchiolli",
title = "Training
Neural Nets with the Reactive Tabu Search",
journal = "IEEE Transactions on
Neural Networks",
year = "1995",
volume = "6",
number = "5",
pages = "1185--1200",
month = sep,
}
From Bibliography of the proceedings of many conferences (adt95-2):
@InProceedings{adt95-2*327,
author = "S. Voss",
title = "Observing
Logical Interdependencies in {Tabu} Search -
Methods and Results",
pages = "327--344",
booktitle = "Proceedings of the Conference
on Applied Decision
Technologies ({ADT} '95). Volume 2: Modern Heuristic
Search Methods",
month = apr,
publisher = "Unicom Seminars",
address = "Uxbridge, UK",
year = "1995",
}
From Bibliography on graph coloring:
@Article{flfe95b,
author = "Charles Fleurent
and Jacques A. Ferland",
title = "Genetic and
Hybrid Algorithms for Graph Coloring",
journal = "Annals of Operations
Research",
year = "1995",
pages = "to appear",
annote = "By creating a
hybrid of TABU and genetic algorithms,
the authors obtain quality solutions fo some graphs.",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@InProceedings{carmusciano1995,
author = "F. Carmusciano
and D. De Luca Cardillo",
title = "A simulated
annealing with tabu list algorithm for the
school timetable problem",
booktitle = "Proceedings of the First International
Conference on
the Practice and Theory of Automated Timetabling
(ICPTAT '95)",
year = "1995",
pages = "231--243",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@InProceedings{sheung1995,
author = "H. W. Chan and
Julian Sheung",
title = "Roster scheduling
at an air cargo terminal: a tabu
search approach",
booktitle = "Proceedings of the First International
Conference on
the Practice and Theory of Automated Timetabling
(ICPTAT '95)",
year = "1995",
pages = "409--422",
}
From Bibliography on Graph Partitioning:
@Article{KadW95,
author = "Piotr Kad{\l}uczka
and Konrad Wala",
title = "Tabu search
and genetic algorithms for the generalized
graph partitioning problem",
journal = "Control and cybernetics",
year = "1995",
volume = "24",
number = "4",
pages = "459--476",
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Grolimund:1995:ICB,
author = "S. Grolimund and
J.-G. Ganascia",
title = "Integrating
case-based reasoning and tabu search for
solving optimisation problems",
journal = "Lecture Notes in Computer
Science",
volume = "1010",
pages = "451--460",
year = "1995",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Mon Aug 25 08:40:30
MDT 1997",
acknowledgement = ack-nhfb,
annote = "Also known as
ICCBR-95",
keywords = "case-based reasoning; ICCBR",
}
From Bibliography of the proceedings of many conferences (iccbr95):
@InProceedings{ICCBR95*451,
author = "Stephan Grolimund
and Jean-Gabriel Ganascia",
title = "Integrating
case-based reasoning and tabu search for
solving optimisation problems",
pages = "451--460",
ISBN = "3-540-60598-3",
editor = "Manuela Veloso
and Agnar Aamodt",
booktitle = "Proceedings of the 1st International
Conference on
Case-Based Reasoning Research and Development",
month = oct # "~23--26",
series = "LNAI",
volume = "1010",
publisher = "Springer Verlag",
address = "Berlin",
year = "1995",
}
From Bibliography of the technical reports of the University of Montreal:
@TechReport{Crainic94,
author = "T. Crainic and
M. Toulouse and M. Gendreau",
title = "An appraisal
of Asynchronous Parallelization
Approaches for Tabu Search Algorithms",
institution = "Dept. d'Informatique et de Recherche Opérationnelle,
Université de Montréal",
number = "IRO-914",
year = "1994",
}
From Bibliography on interior point optimization:
@Article{garcia1,
author = "B.-L. Garcia and
J.-Y. Potvin and J.-M. Rousseau",
title = "A parallel
implementation of the tabu search heuristic
for vehicle routing problems with time window
constraints",
journal = "Computers and Operations
Research",
year = "1994",
volume = "21",
pages = "1025--1033",
}
From Bibliography of the technical reports of the University of Montreal:
@TechReport{Crainic94b,
author = "T. Crainic and
M. Toulouse and M. Gendreau",
title = "Towards a
Taxonomy of Parallel Tabu Search
Algorithms",
institution = "Dept. d'Informatique et de Recherche Opérationnelle,
Université de Montréal",
number = "IRO-912",
year = "1994",
}
From Bibliography of papers published in Lecture Notes in Computer Science (LNCS, Springer Verlag):
@Article{Morzy:1994:TSO,
author = "T. Morzy and M.
Matysiak and S. Salza",
title = "Tabu Search
Optimization of Large Join Queries",
journal = "Lecture Notes in Computer
Science",
volume = "779",
pages = "309--322",
year = "1994",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Wed Sep 15 18:44:20
MDT 1999",
acknowledgement = ack-nhfb,
keywords = "database technology; EDBT;
extending database
technology",
}
From Evolutionary Multiobjective Optimization:
@Article{Hertz94,
author = "Alain Hertz and
Brigitte Jaumard and C. C. Ribeiro and
W. P. Formosinho Filho",
title = "A multi-criteria
tabu search approach to cell
formation problems in group technology with multiple
objectives",
journal = "RAIRO/Operations Research",
pages = "303--328",
volume = "28",
number = "3",
year = "1994",
}
From A large bibliography on theory/foundations of computer science (1994):
@Article{Fiechter94a,
author = "Fiechter",
title = "A Parallel
Tabu Search Algorithm for Large Traveling
Salesman Problems",
journal = "DAMATH: Discrete Applied
Mathematics and Combinatorial
Operations Research and Computer Science",
volume = "51",
year = "1994",
}
From Bibliography of the technical reports of the University of Montreal:
@TechReport{Crainic94a,
author = "T. Crainic and
M. Toulouse and M. Gendreau",
title = "A study of
Synchronous Parallelization Strategies for
Tabu Search",
institution = "Dept. d'Informatique et de Recherche Opérationnelle,
Université de Montréal",
number = "IRO-913",
year = "1994",
}
From Bibliography of the proceedings of many conferences (mpcs94):
@InProceedings{mpcs94*564,
author = "E. Tarantino {I.
De Falco, R. Del Balio} and R.
Vaccaro",
title = "Parallel
tabu search versus parallel evolution
strategy",
pages = "564--569",
ISBN = "0-8186-6322-7",
booktitle = "Proceedings of the 1st International
Conference on
Massively Parallel Computing Systems",
month = may,
publisher = "IEEE Computer Society Press",
address = "Los Alamitos, CA, USA",
year = "1994",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@Article{costa1994,
author = "D. Costa",
title = "A Tabu Search
Algorithm for Computing an Operational
Timetable",
journal = "European Journal of
Operational Research",
volume = "76",
pages = "98--110",
year = "1994",
}
From Bibliography of the technical reports of the University of Montreal:
@TechReport{Soriano94a,
author = "P. Soriano and
M. Gendreau",
title = "Diversification
Strategies in Tabu Search Algorithms
for the Maximum Clique Problem",
institution = "Dept. d'Informatique et de Recherche Opérationnelle,
Université de Montréal",
number = "IRO-915",
year = "1994",
}
From Bibliography of the technical reports of the University of Montreal:
@TechReport{Soriano94,
author = "P. Soriano and
M. Gendreau",
title = "Tabu Search
Algorithms for the Maximum Clique
Problem",
institution = "Dept. d'Informatique et de Recherche Opérationnelle,
Université de Montréal",
number = "IRO-918",
year = "1994",
}
From Bibliography on interior point optimization:
@Article{knox1,
author = "J. Knox",
title = "Tabu search
performance on the symmetric traveling
salesman problem",
journal = "Computers and Operations
Research",
volume = "21",
year = "1994",
pages = "867--876",
}
From Bibliography on interior point optimization:
@Article{gendreau3,
author = "M. Gendreau and
G. Laporte and R. S\'{e}guin",
title = "A tabu search
heuristic for the vehicle routing
problem",
journal = "Management Science",
volume = "40",
year = "1994",
pages = "1276--1290",
}
From Bibliography on interior point optimization:
@Article{semet1,
author = "F. Semet and E.
Taillard",
title = "Solving real-life
vehicle routing problems efficiently
using tabu search",
journal = "Annals of Operations
Research",
volume = "41",
year = "1993",
pages = "469--488",
}
From Bibliography of the proceedings of many conferences (icga93):
@InProceedings{icga93*641,
author = "Takashi Kido and
Hiroaki Kitano and Masakuzo
Nakanishi",
title = "A Hybrid
Search for Genetic Algorithms: Combining
Genetic Algorithms, {TABU} Search, and Simulated
Annealing",
pages = "641--641",
ISBN = "1-55860-299-2",
editor = "Stephanie Forrest",
booktitle = "Proceedings of the 5th International
Conference on
Genetic Algorithms",
month = jul,
publisher = "Morgan Kaufmann",
address = "San Mateo, CA, USA",
year = "1993",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@TechReport{obolenska1993,
author = "T. E. Obolens'ka
and G. I. Spyak",
title = "Problemy
planuvannya u vuzi j vykorystannya
informatsijnyh modelej i komp'yuternyh tehnologij pry
skladanni navchal'nyh planiv dystsyplin",
publisher = "K.: Instytut systemnyh doslijen'",
year = "1993",
pages = "1--64",
institution = "Ternopil': Instytut narodnogo gospodar.",
annote = "competition tabu
search",
}
From Bibliography of the proceedings of many conferences (annga93):
@InProceedings{annga93*496,
author = "S. J. Beaty",
title = "Genetic Algorithms
Versus Tabu Search for Instruction
Scheduling",
pages = "496--501",
ISBN = "3-211-82459-6",
editor = "N .C. Steele {R.
F. Albrecht, C. R. Reeves}",
booktitle = "Proceedings of the International
Conference on
Artificial Neural Nets and Genetic Algorithms",
address = "Innsbruck, Austria",
month = feb,
year = "1993",
publisher = "Springer",
}
From Bibliography on combinatorial optimization:
@Book{Reeves:modern,
author = "Colin R. Reeves",
title = "Modern Heuristic
Techniques for Combinatorial
Problems",
year = "1993",
publisher = "Halsted Press",
address = "New York",
annotate = "A collection of papers on
heuristic technqiues,
including simulated annealing and tabu search.",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@InProceedings{glover1993,
author = "F. Glover and
J. P. Kelly",
title = "Overview
of metaheuristics and recent advances. Tabu
search, genetic algorithms, simulated annealing",
booktitle = "Atti conferenza AIRO, Capri",
year = "1993",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@Article{laguna1993,
author = "M. Laguna and
F. Glover",
title = "Integrating
target analysis and tabu search for
improved scheduling systems",
journal = "Expert Systems with
Applications",
volume = "6",
pages = "287--297",
year = "1993",
}
From Bibliography on interior point optimization:
@Article{osman1,
author = "I. H. Osman",
title = "Metastrategy
simulated annealing and tabu search
algorithms for the vehicle routing problem",
journal = "Annals of Operations
Research",
volume = "41",
year = "1993",
pages = "421--451",
}
From Bibliography on interior point optimization:
@Article{glover2,
author = "F. Glover and
E. Taillard and D. de Werra",
title = "A user's
guide to tabu search",
journal = "Annals of Operations
Research",
volume = "41",
year = "1993",
pages = "3--28",
}
From Bibliography on interior point optimization:
@Article{fox1,
author = "B. L. Fox",
title = "Integrating
and accelerating tabu search, simulated
annealing, and genetic algorithms",
journal = "Annals of Operations
Research",
volume = "41",
year = "1993",
pages = "47--67",
}
From Bibliography of the technical reports of the University of Montreal:
@TechReport{Michelon93,
author = "Philippe Michelon
and Marcelo Dib Cruz and Viviane
Gascon",
title = "Using the
Tabu Search Method for the Distribution of
Supplies in a Hospital",
institution = "Dept. d'Informatique et de Recherche Opérationnelle,
Université de Montréal",
number = "IRO-851",
pages = "12",
year = "1993",
}
From Bibliography of the proceedings of many conferences (annga93):
@InProceedings{annga93*344,
author = "C. R. Reeves",
title = "Diversity
and Diversification in Genetic Algorithms:
Some Connections with Tabu Search",
pages = "344--351",
ISBN = "3-211-82459-6",
editor = "N .C. Steele {R.
F. Albrecht, C. R. Reeves}",
booktitle = "Proceedings of the International
Conference on
Artificial Neural Nets and Genetic Algorithms",
address = "Innsbruck, Austria",
month = feb,
year = "1993",
publisher = "Springer",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@InCollection{glover1993,
author = "F. Glover and
M. Laguna",
title = "Tabu search",
booktitle = "Modern Heuristic Techniques for
Combinatorial
Problems",
publisher = "Scientific Publications, Oxford",
year = "1993",
}
From Bibliography of the proceedings of many conferences (edac_euroasic93):
@InProceedings{edac_euroasic93*398,
author = "S. Amellal and
B. Kaminska",
title = "Scheduling
Algorithm in Data Path Synthesis Using the
Tabu Search Technique",
pages = "398--402",
ISBN = "0-8186-4310-3",
booktitle = "Proceedings of the European Conference
on Design
Automation with the European Event in {ASIC} Design",
month = feb # "~22--25",
publisher = "IEEE Computer Society Press",
address = "Los Alamitos, CA, USA",
year = "1993",
}
From Richard Webber's Research Bibliography:
@InProceedings{Glover+1993a,
author = "Fred Glover and
M. Laguna",
title = "Tabu Search",
booktitle = "Modern Heuristic Techniques for
Combinatorial
Problems",
year = "1993",
editor = "C. Reeves",
publisher = "Blackwell Scientific Publishing",
address = "Oxford, England",
}
From Bibliography on graph coloring:
@TechReport{soge93,
author = "Patrick Soriano
and Michel Gendreau",
title = "Diversification
Strategies in Tabu Search Algorithms
for the Maximum Clique Problem",
institution = "Center for Research in Transportation,
university of
Montreal",
year = "1993",
type = "Research
Report",
number = "CRT-940",
month = sep,
}
From Bibliography on Hashing:
@Article{Woodruff:1993:HVT,
author = "D. L. Woodruff
and E. Zemel",
title = "Hashing vectors
for tabu search",
journal = "Annals of Operations
Research",
volume = "40",
number = "1 / 4",
pages = "123--??",
day =
"1",
month = may,
year = "1993",
coden = "AOREEV",
ISSN = "0254-5330",
bibdate = "Sat May 25 13:29:25
MDT 1996",
acknowledgement = ack-nhfb,
}
From Bibliography of Technical Reports: University of Colorado, Denver - Center for Computational Mathematics:
@TechReport{ncstrl.cudenver_ccm//UCD-CCM-009,
year = "1993",
type = "Technical
Report",
number = "UCD-CCM-009",
institution = "University of Colorado, Denver - Center
for
Computational Mathematics",
title = "Heuristics
for Efficient Clasification",
bibdate = "November 21, 1998",
author = "Kathryn Fraughnaugh
and Jennifer Ryan and Holly Zullo
and L. A. Cox",
abstract = "The classification problem
is to determine the class
of an object when it is costly to observe the values of
its attributes. This type of problem arises in fault
diagnosis, in the design of interactive expert systems,
in reliability analysis of coherent systems, in
discriminant analysis of test data, and in many other
applications. We introduce a generic decision rule that
specifies the next attribute to test at any location in
a decision tree. Random searches and tabu searches are
applied to determine the best specific from of the
rule. The most successful heuristics that we developed
are based on the tabu search paradigm. We present
computational results for problems with a variety of
characteristics and compare our heuristics to an exact
dynamic programming algorithm.",
month = dec # " 1,",
}
From Bibliography of Technical Reports: Virginia Polytechnic Inst. and State University:
@TechReport{ncstrl.vatech_cs//TR-93-28,
type = "Technical
Report",
number = "TR-93-28",
institution = "Virginia Polytechnic Inst. and State University",
title = "Local Search
for the Retrieval Layout Problem",
month = aug # " 27,",
year = "1993",
bibdate = "July 6, 1995",
url =
"ftp://ftp.cslab.vt.edu/pub/local/reports/93/TR-93-28.ps.Z",
author = "Lenwood S. Heath
and Joseph W. Lavinus",
abstract = "An information graph is
a data representation for
object-oriented databases in which each object is a
vertex and each relationship between objects is an
edge. The retrieval layout problem is to arrange the
storage of an information graph on a physical medium so
as to use storage efficiently and to allow rapid
navigation along paths in the graph. This paper
describes an empirical study of the performance of
various local search heuristics for the retrieval
layout problem, including local optimization, simulated
annealing, tabu search, and genetic algorithms. In
addition, the hierarchical hybrid approach is
introduced.",
}
From Bibliography on secure protocols:
@Proceedings{Wiener93,
title = "{Efficient
DES Key Search}",
year = "1993",
series = "Crypto 93",
month = aug,
}
From Bibliography on interior point optimization:
@Article{dammeyer1,
author = "F. Dammayer and
S. Vo\ss",
title = "Dynamic tabu
list management using the reverse
elimination method",
journal = "Annals of Operations
Research",
volume = "41",
year = "1993",
pages = "31--46",
}
From Bibliography on algorithms for k shortest paths:
@Article{LagGlo-MS-93,
title = "{Bandwidth
packing: a tabu search approach}",
author = "M. Laguna and
F. Glover",
journal = "Management Science",
volume = "39",
pages = "492--500",
year = "1993",
abstract = "The bandwidth packing (BWP)
problem is a
combinatorially difficult problem arising in the area
of telecommunications. The problem consists of
assigning calls to paths in a capacitated graph such
that capacities are not violated and the total profit
is maximized. The authors discuss the development of a
tabu search (TS) method for the BWP problem. The method
makes use of an efficient implementation of the
k-shortest path algorithm, that allows the
identification of a controlled set of feasible paths
for each call. A tabu search is then performed to find
the best path assignment for each call. The TS method
developed incorporates a number of features that have
proved useful for obtaining optimal and near optimal
solutions to difficult combinatorial problems. The
authors establish the effectiveness of their approach
by comparing its performance in speed and solution
quality to other specialized heuristics and to a
standard optimization package applied to a 0-1 integer
programming formulation of the problem.",
}
From Bibliography on Artificial Intelligence:
@Book{reeves,
editor = "Colin R. Reeves",
title = "Modern Heuristic
Techniques for Combinatorial
Problems",
publisher = "Blackwell Scientific Press, Oxford,
UK.",
year = "1992",
annote = "ISBN 0-632-03238-3;
John Wiley are handling the
American edition, ISBN 0-470-22079-1. Keywords: genetic
algorithms, simulated annealing, tabu search,
artificial neural networks, Lagrangean relaxation.",
}
From Bibliography on the Quadratic Assignment Problem:
@InProceedings{Do92,
author = "P. Forst W. Domschke
and S. Voss",
title = "Tabu search
techniques for the quadratic
semi-assignment problem",
booktitle = "New Directions for Operations
Research in
Manufacturing",
editors = "G. Fandel, T. Gulledge
and A. Jones",
publisher = "Springer, Berlin",
pages = "389--405",
year = "1992",
}
From A Bibliography on Computer Security:
@InProceedings{Wie92,
author = "Michael J. Wiener",
title = "Efficient
{DES} Key Search",
booktitle = "Crypto'92",
year = "1992",
}
From Bibliography of the technical reports of the Center for Parallel Computing (ZPR) at the University of Köln:
@Article{zpr90-083,
author = "U. Faigle and
W. Kern",
institution = "Mathematisches Institut, Universit{\"a}t
zu K{\"o}ln",
title = "Some Convergence
Results for Probabilistic Tabu
Search",
journal = "ORSA Journal on Computing",
volume = "4",
number = "1",
pages = "32--37",
year = "1992",
keywords = "local search, tabu search,
memory based strategies,
simulated annealing; 90C27, 90-08",
annote = "During recent
years, much work has gone into the
exploration of general fundamental principles
underlying local search strategies for combinatorial
optimization. Many of these strategies can be subsumed
under the general framework of tabu search, which
introduces mechanisms of guidance and control based on
flexible memory processes, broadening the range of
strategic possibilities beyond those incorporated in
memoryless search heuristics such as simulated
annealing. We consider some examples of such memory
based strategies for modifying both the generation and
acceptance probabilities and investigate their impact
on convergence results. It turns out that several tabu
search ideas can be subjected to mathematical analysis
similar to those applied to simulated annealing, making
it possible to establish corresponding convergence
properties based on a broader foundation.",
}
From Bibliography on the Quadratic Assignment Problem:
@Article{Klincewicz89,
author = "J. G. Klincewicz",
title = "{Avoiding
local optima in the $p$-hub location problem
using tabu search and {\sc grasp}}",
journal = "Annals of Operations",
volume = "40",
pages = "283--302",
year = "1992",
}
From A large bibliography on theory/foundations of computer science (1992):
@Article{AmoBarRib92,
author = "de Amorim and
Barthelemy and Ribeiro",
title = "Clustering
and Clique Partitioning: Simulated
Annealing and Tabu Search Approaches",
journal = "CLASSIF: Journal of
Classification",
volume = "9",
year = "1992",
}
From Bibliography on the Quadratic Assignment Problem:
@Article{ChaSko92b,
author = "J. Chakrapani
and J. Skorin-Kapov",
title = "Massively
Parallel Tabu Search for the Quadratic
Assignment problem",
journal = "Annals of Operations
Research",
volume = "forthcoming",
year = "1992",
}
From A large bibliography on theory/foundations of computer science (1992):
@Article{Hertz92,
author = "Hertz",
title = "Finding a
Feasible Course Schedule Using Tabu Search",
journal = "DAMATH: Discrete Applied
Mathematics and Combinatorial
Operations Research and Computer Science",
volume = "35",
year = "1992",
}
From A large bibliography on theory/foundations of computer science (1992):
@Article{Maddox92b,
author = "Maddox",
title = "The Endless
Search for Primality",
journal = "NATURE: Nature",
volume = "356",
year = "1992",
}
From Bibliography on the Quadratic Assignment Problem:
@Article{FiRoWe92,
author = "A. Rogger C. N.
Fiechter and D. de Werra",
title = "Basic ideas
of tabu search with an application to
traveling salesman and quadratic assignment",
journal = "Ricerca Operativa",
volume = "62",
pages = "5--28",
year = "1992",
}
From Bibliography on Evolutionary Computation:
@Article{Battiti92,
author = "R. Battitti and
G. Tecchiolli",
title = "Parallel
based Search for Combinatorial Optimization -
Genetic Algorithms and Tabu",
journal = "Microprocessors and
MicroSystems",
year = "1992",
volume = "16",
number = "7",
pages = "351--367",
annote = "Optimization",
}
From Bibliography on Artificial Intelligence:
@Article{hoeksema91a,
author = "Jack Hoeksema",
year = "1991",
title = "Theoretische
aspekten van partikelvooropplaatsing",
journal = "{TABU}",
volume = "21",
pages = "18--26",
keyword = "dutch particles syntax",
}
From Bibliography on the Quadratic Assignment Problem:
@Article{Tai91,
author = "E. Taillard",
title = "Robust Tabu
search for the quadratic assignment
problem",
journal = "parcomput",
volume = "17",
pages = "443--455",
year = "1991",
}
From Bibliography on Artificial Intelligence:
@Article{hoeksema91b,
author = "Jack Hoeksema",
year = "1991",
title = "'Nogmaals
partikelvooropplaatsing",
journal = "{TABU}",
volume = "21",
pages = "141--144",
keyword = "dutch particles syntax",
}
From Bibliography on Speech Recognition and Spoken Language Systems:
@InProceedings{Paul_Decoder_ICASSP91,
author = "D. B. Paul",
title = "Algorithms
for an Optimal {$A^{*}$} Search and
Linearizing the Search in the Stack Decoder",
booktitle = "Proc. ICASSP '91",
address = "Toronto, Canada",
month = may,
year = "1991",
pages = "693--696",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@Article{hertz1991,
author = "A. Hertz",
title = "Tabu Search
for Large Scale Timetabling Problems",
journal = "European Journal of
Operational Research",
volume = "54",
pages = "39--47",
year = "1991",
annote = "school tabu search",
}
From Bibliography of publications in the journal Computing:
@InProceedings{deWerra:1990:HGC,
author = "D. de Werra",
title = "Heuristics
for Graph Coloring",
editor = "Gottfried Tinhofer
and R. (Rudolf) Albrecht and
others",
booktitle = "Computational graph theory",
volume = "7",
publisher = "Spring{\-}er",
address = "Wien / New York",
year = "1990",
ISBN = "0-387-82177-5
(New York), 3-211-82177-5 (Wien)",
series = "Computing. Supplementum",
volume = "7",
pages = "191--208",
year = "1990",
coden = "COSPDM",
ISSN = "0344-8029",
bibdate = "Fri Oct 15 07:10:22
1999",
series = "Computing. Supplementum",
keywords = "graph coloring heuristics
tabu search sequential
coloring",
}
From Bibliography on combinatorial optimization:
@Article{Glover:tabuII,
author = "Fred Glover",
title = "Tabu Search--
Part {II}",
journal = "ORSA Journal on Computing",
volume = "2",
number = "1",
pages = "4--32",
year = "1990",
}
From Bibliography on queueing systems and telecommunication (1990):
@Article{Glover1990,
author = "F. Glover",
title = "Tabu Search:
{A} Tutorial",
journal = "Interfaces, Vol. 20,
:4, 74-94",
year = "1990",
references = "0",
language = "English",
enum = "9858",
descriptors = "Survey; Tutorial; Mathematical Method;",
date = "01/07/93",
by_date = "VBI",
revision = "20/05/94",
by_rev = "Le",
location = "DTU-IT:VBI",
annote = "(VBI-002903)",
}
From Bibliography on graph coloring:
@InCollection{wer90,
author = "D. de Werra",
title = "Heuristics
for Graph Coloring",
booktitle = "Computational Graph Theory",
year = "1990",
editor = "G. Tinhofer and
E. Mayr and H. Noltemeier",
pages = "191--208",
publisher = "Springer-Verlag",
address = "Berlin",
series = "Computing, Supplement",
volume = "7",
keywords = "graph coloring heuristics
tabu search sequential
coloring",
}
From Bibliography on Computational Intelligence and Efficient Algorithms:
@Article{glover90:_tabu_searc,
author = "Fred Glover",
title = "Tabu Search---Part
{II}",
journal = "ORSA Journal on Computing",
year = "1990",
volume = "2",
number = "1",
pages = "4--32",
month = "Winter",
note = "``orsa''
is called informs today",
url =
"http://joc.pubs.informs.org/BackIssues/Vol002/Vol002No01Paper01.pdf",
language = "english",
}
From Bibliography on the Quadratic Assignment Problem:
@Article{Sko90,
author = "J. Skorin-Kapov",
title = "Tabu search
applied to the quadratic assignment
problem",
journal = "ORSA Journal on Computing",
volume = "2",
number = "1",
pages = "33--45",
year = "1990",
}
From Bibliography on queueing systems and telecommunication (1989):
@Article{de_Werra1989,
author = "D. de Werra and
A. Hertz",
title = "Tabu Search
Techniques ({A} Tutorial and an
Application to neural Networks)",
journal = "OR Spektrum 11",
year = "1989",
pages = "131--141",
references = "0",
language = "English",
enum = "9603",
descriptors = "Optimization; Algorithm; Neural Network;",
date = "01/07/93",
by_date = "VBI",
revision = "19/05/94",
by_rev = "Le",
location = "DTU-IT:VBI",
annote = "(VBI-002391) Abstract:
Tabu Search is a general
heuristic procedure for global optimization. Based on
simple ideas it has been extremely efficient in getting
almost optimal solutions for many types of difficult
combinatorial optimization problems. The principles of
Tabu Search are described and illustrations are given.
An example of problem type where the use of Tabu Search
has drastically cut down the computational effort is
presented. It cons",
}
From Bibliography of the technical reports of the University of Montreal:
@TechReport{Hertz89a,
author = "A. Hertz",
title = "Finding a
Feasiable Course Schedule using Tabu
Search",
institution = "Dept. d'Informatique et de Recherche Opérationnelle,
Université de Montréal",
number = "IRO-703",
pages = "18",
year = "1989",
}
From Bibliography of publications in the journal Computing:
@Article{Friden:1989:STF,
author = "C. Friden and
A. Hertz and D. de Werra",
title = "{STABULUS}:
{A} Technique for Finding Stable Sets in
Large Graphs with Tabu Search",
journal = "Computing",
volume = "42",
number = "1",
pages = "35--44",
year = "1989",
coden = "CMPTA2",
ISSN = "0010-485X
(printed version), 1436-5057 (electronic
version)",
bibdate = "Sat Oct 16 11:44:15
1999",
acknowledgement = ack-nhfb,
annote = "Yes, ``tabu search'',
not ``table search''.",
}
From Bibliography on Computational Intelligence and Efficient Algorithms:
@Article{glover89:_tabu_searc,
author = "Fred Glover",
title = "Tabu Search---Part
{I}",
journal = "ORSA Journal on Computing",
year = "1989",
volume = "1",
number = "3",
pages = "190--206",
month = "Summer",
note = "``orsa''
is called informs today",
url =
"http://joc.pubs.informs.org/BackIssues/Vol001/Vol001No03Paper06.pdf",
language = "english",
}
From Bibliography of Technical Reports: University of Texas, Austin:
@TechReport{UTEXAS_CS//CS-TR-89-06,
year = "1989",
type = "Technical
Report",
number = "CS-TR-89-06",
institution = "University of Texas, Austin",
title = "A Hybrid
Algorithm Technique",
bibdate = "November 24, 98",
author = "Miroslaw Malek
and Mohan Guruswamy and Howard Owens
and Mihir Pandya",
abstract = "A new hybrid algorithm technique
(HAT) based on the
idea of mixing two or more algorithms is proposed.
Though the algorithm is general and may be applied to
the majority of optimization problems, a hybrid
algorithm search technique (HAST) is the focus of this
paper. As an example of HAST, this paper describes
mixing of simulated annealing and tabu search
algorithms into a new hybrid search algorithm applied
to the traveling salesman problem. A brief introduction
to the simulated annealing and tabu search algorithms
is given followed by a description of how we mixed
these algorithms to form a new parallel hybrid search
technique. Comparison of our algorithm mixer with
simulated annealing and tabu search indicates
consistently better results. Examples include 33, 42,
50, 57, 75, and 100 city problems from the literature.
Solutions for the 50 and 75 city problems outperform
best known published to date results.",
month = mar # " 1,",
}
From Bibliography on the Quadratic Assignment Problem:
@Article{Glo89B,
author = "F. Glover",
title = "Tabu Search
- {P}art 2",
journal = "ORSA Journal on Computing",
volume = "2",
number = "1",
pages = "4--32",
year = "1989",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@Article{glover1990,
author = "F. Glover",
title = "Tabu Search,
Part {II}",
journal = "ORSA Journal on Computing",
volume = "2",
pages = "4--32",
year = "1989",
}
From Bibliography for the book ``Artificial Intelligence: A Modern Approach'':
@Article{Glover:1989,
author = "F. Glover",
year = "1989",
title = "Tabu search:~1",
journal = "ORSA Journal on Computing",
volume = "1",
number = "3",
month = "Summer",
pages = "190--206",
note = "\iindex{Glover,
F.}",
}
From Bibliography on graph coloring:
@Article{glo89,
author = "Fred Glover",
title = "Tabu Search--{Part
I}",
journal = "ORSA Journal on Computing",
year = "1989",
volume = "1",
number = "3",
pages = "190--206",
keywords = "graph coloring tabu",
}
From Bibliography on clique and coloring problems:
@Article{Gl89,
author = "Fred Glover",
journal = "ORSA Journal on Computing",
pages = "190--206",
title = "Tabu Search,
Part 1",
volume = "1",
year = "1989",
annote = "A tutorial on
tabu search for combinatorial
optimization problems.",
}
From Bibliography on the Quadratic Assignment Problem:
@TechReport{GendreauSalvailSoriano89,
author = "A. Gendreau and
L. Salvail and P. Soriano",
title = "{Solving
the maximum clique problem using a tabu
search approach}",
institution = "Center for Research on Transportation,
University of
Montr\'eal",
address = "Montr\'eal, Canada",
year = "1988",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@Article{hertz1987,
author = "A. Hertz and D.
de Werra",
title = "Using Tabu
Search Techniques for Graph Colouring",
journal = "Computing",
volume = "39",
pages = "345--351",
year = "1987",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@Article{glover1987,
author = "F. Glover",
title = "Tabu search
methods in artificial intelligence and
operations research",
journal = "ORSA Artificial Intelligence
Newsletters",
volume = "1",
year = "1987",
}
From Bibliography on queueing systems and telecommunication (1987):
@Article{Hertz1987,
author = "A. Hertz and D.
de Werra",
title = "Using Tabu
Search Techniques for Graph Coloring",
journal = "Computing, Vol. 39,
:",
year = "1987",
pages = "345--351",
references = "0",
language = "English",
enum = "10007",
descriptors = "graph marking algorithm;",
date = "01/07/93",
by_date = "VBI",
revision = "29/05/94",
by_rev = "Le",
location = "DTU-IT:VBI",
annote = "(VBI-002212) graph
coloring; tabu search; simulated
annealing; Abstract: Tabu search techniques are used
for moving step by step towards the minimum value of a
function. A tabu list of forbidden movements is updated
during the iterations to avoid cycling and being
trapped in local minima. Such techniques are adapted to
graph coloring problems. We show that they provide
almost optimal coloring of graphs having up to 1000
nodes and their efficien",
}
From Bibliography of Work in Philosophy of Language, Semantics, Artificial Intelligence, and Assorted Related Topics:
@Article{ibaraki:1986a,
author = "Toshihide Ibaraki",
title = "Generalization
of Alpha-Beta and {SSS}* Search
Procedures",
journal = "Artificial Intelligence",
year = "1986",
volume = "29",
number = "1",
pages = "73--117",
topic = "search;",
}
From Bibliography on graph coloring:
@Article{glo86,
author = "Fred Glover",
title = "Future Paths
for Integer Programming and Links to
Artificial Intelligence",
journal = "Computers and Operations
Research",
year = "1986",
volume = "13",
pages = "533--549",
keywords = "tabu search",
}
From Bibliography of Work in Philosophy of Language, Semantics, Artificial Intelligence, and Assorted Related Topics:
@Article{georgeff:1983a,
author = "Michael P. Georgeff",
title = "Strategies
in Heuristic Search",
journal = "Artificial Intelligence",
year = "1983",
volume = "20",
number = "4",
pages = "393--425",
topic = "search;",
}
From Bibliography of Work in Philosophy of Language, Semantics, Artificial Intelligence, and Assorted Related Topics:
@Article{simon_ha:1983a,
author = "Herbert A. Simon",
title = "Search and
Reasoning in Problem Solving",
journal = "Artificial Intelligence",
year = "1983",
volume = "21",
number = "1--2",
pages = "7--29",
topic = "search;problem-solving;",
}
From Bibliography of Work in Philosophy of Language, Semantics, Artificial Intelligence, and Assorted Related Topics:
@Article{palay:1982a,
author = "Andrew J. Palay",
title = "The {B}*
Tree Search Algorithm---New Results",
journal = "Artificial Intelligence",
year = "1982",
volume = "19",
number = "2",
pages = "145--163",
topic = "search;",
}
From Bibliography on online competitive algorithms:
@Book{Gal80,
author = "S. Gal",
title = "Search Games",
publisher = "Academic Press",
year = "1980",
}
From Bibliography of Work in Philosophy of Language, Semantics, Artificial Intelligence, and Assorted Related Topics:
@Article{martelli:1977a,
author = "Alberto Martelli",
title = "On the Complexity
of Admissible Search Algorithms",
journal = "Artificial Intelligence",
year = "1977",
volume = "8",
number = "1",
pages = "1--13",
topic = "search;complexity-in-AI;",
}
From Bibliography for Relational Methods in Computer Science - RelMiCS:
@Book{Bunge-1967,
author = "M. Bunge",
title = "Scientific
Research {I}, The Search for System",
publisher = "Springer",
year = "1967",
address = "Berlin",
}
From Bibliography on Geometric Modeling:
@Misc{bib:havModelSearch,
author = "T. Havr\'{a}nek",
title = "On model
Search Methods",
}
From Bibliography on Practice and Theory of Automated Timetabling:
@Article{mooney0000,
author = "E. L. Mooney and
R. L. Rardin",
title = "Tabu Search
for a Class of Schedulng Problems",
journal = "Annals of Oper. Res.
(issue of Tabu Search)",
note = "To appear",
annote = "school tabu search",
}
From Nachum Dershowitz's personal bibliography:
@Misc{Hsiang0000a,
author = "Hsiang",
title = "In Search
of an {AC}-Ordering",
note = "Hand-written",
}
From Bibliography on the Quadratic Assignment Problem:
@Article{Sko92,
author = "J. Skorin-Kapov",
title = "Extensions
of Tabu Search Adaptation to the Quadratic
Assignment Problem",
journal = "Computers and Operations
Research",
volume = "forthcoming",
}
From Bibliography on interior point optimization:
@TechReport{hertz1,
author = "A. Hertz and E.
Taillard and D. de Werra",
title = "A tutorial
on tabu search",
year = "??",
institution = "EPFL, D\'{e}partment de Math\'{e}tiques,
MA-Ecublens",
address = "CH--1015, Lausanne",
}