popmeta.bib
@comment{{This file has been generated by bib2bib 1.95}}
@comment{{Command line: /usr/bin/bib2bib --expand -ob popmeta.bib -oc popmeta-list.bib ../all-entries.bib ./bib-gualandi.bib -c 'keywords : "graph coloring problem"' -c 'keywords : "population-based metaheuristics" | keywords : "evolutionary algorithms"'}}
@inproceedings{BuiPat02,
author = {Thang N. Bui and Chirag M. Patel},
title = {An Ant System Algorithm for Coloring Graphs},
pages = {83--91},
crossref = {symposium02},
keywords = {graph coloring problem, local search methods, population-based metaheuristics}
}
@inproceedings{CroLucGheApe02,
author = {Cornelius Croitoru and Henri Luchian and Ovidiu Gheorghies and Adriana
Apetrei},
title = {A New Genetic Graph Coloring Heuristic},
pages = {63--74},
crossref = {symposium02},
keywords = {graph coloring problem, evolutionary algorithms}
}
@inproceedings{GalHerZuf03,
author = {P. Galinier and A. Hertz and N. Zufferey},
title = {Adaptive Memory Algorithms for Graph Colouring},
pages = {75--82},
note = {Also available as Technical Report G--2003--35, Les Cachiers du GERAD},
crossref = {symposium02},
keywords = {graph coloring problem, evolutionary algorithms}
}
@incollection{Mor96,
author = {C. Morgenstern},
title = {Distributed Coloration Neighborhood Search},
pages = {335--357},
crossref = {dimacs96},
keywords = {graph coloring problem, local search methods, population-based metaheuristics},
opturl = {citeseer.nj.nec.com/75655.html}
}
@article{DBLP:journals/dam/BuiNPP08,
author = {Thang Nguyen Bui and ThanhVu H. Nguyen and Chirag M. Patel and Kim-Anh
T. Phan},
title = {An ant-based algorithm for coloring graphs},
journal = {Discrete Applied Mathematics},
year = {2008},
volume = {156},
pages = {190-200},
number = {2},
bibsource = {DBLP, http://dblp.uni-trier.de},
doi = {10.1016/j.dam.2006.07.012},
keywords = {graph coloring problem, local search methods, population-based metaheuristics}
}
@article{CosHerDub95,
author = {D. Costa and A. Hertz and O. Dubuis},
title = {Embedding of a Sequential Procedure within an Evolutionary Algorithm
for Coloring Problems in Graphs},
journal = {Journal of Heuristics},
year = {1995},
volume = {1},
pages = {105--128},
number = {1},
keywords = {graph coloring problem, evolutionary algorithms}
}
@techreport{Croitoru2005,
author = {Cornelius Croitoru and Ovidiu Gheorghie{\c s} and Adriana Gheorghie{\c
s}},
title = { An Ordering-Based Genetic Approach to Graph Coloring},
institution = {``Al.I.Cuza'' University of Ia{\c s}i, Faculty of Computer Science},
year = {2005},
number = {TR 05-03},
keywords = {graph coloring problem, evolutionary algorithms}
}
@article{CosHer97,
author = {Costa D. and A. Hertz},
title = {Ants Can Colour Graphs},
journal = {Journal of the Operational Research Society},
year = {1997},
volume = {48},
pages = {295--305},
keywords = {graph coloring problem, local search methods, population-based metaheuristics}
}
@incollection{Davis91,
author = {L. Davis},
title = {Order-based Genetic Algorithms and the Graph Coloring Problem},
booktitle = {Handbook of Genetic Algorithms},
publisher = {Van Nostrand Reinhold; New York},
year = {1991},
pages = {72--90},
keywords = {graph coloring problem, evolutionary algorithms}
}
@incollection{DorHao98,
author = {R. Dorne and J. Hao},
title = {A New Genetic Local Search Algorithm for Graph Coloring},
booktitle = {Parallel Problem Solving from Nature - PPSN V, 5th International
Conference},
publisher = {Springer Verlag, Berlin, Germany},
year = {1998},
editor = {A. E. Eiben and Thomas B\"ack and Marc Schoenauer and Hans-Paul Schwefel},
volume = {1498},
series = {Lecture Notes in Computer Science},
pages = {745--754},
keywords = {graph coloring problem, evolutionary algorithms},
optaddress = {Berlin, Germany},
opturl = {citeseer.nj.nec.com/dorne98new.html}
}
@article{DowTho07,
author = {Kathryn A. Dowsland and Jonathan M. Thompson},
title = {An improved ant colony optimisation heuristic for graph colouring},
journal = {Discrete Applied Mathematics},
year = {2007},
note = {In Press, Corrected Proof.},
doi = {doi:10.1016/j.dam.2007.03.025},
keywords = {graph coloring problem, local search methods, population-based metaheuristics}
}
@article{Eiben98,
author = {A. E. Eiben and J. K. Van Der Hauw and J. I. Van Hemert},
title = {Graph Coloring with Adaptive Evolutionary Algorithms},
journal = {Journal of Heuristics},
year = {1998},
volume = {4},
pages = {25--46},
number = {1},
address = {Hingham, MA, USA},
doi = {10.1023/A:1009638304510},
issn = {1381-1231},
keywords = {graph coloring problem, evolutionary algorithms},
publisher = {Kluwer Academic Publishers}
}
@article{FleFer96:aor,
author = {C. Fleurent and J. Ferland},
title = {Genetic and Hybrid Algorithms for Graph Coloring},
journal = {Annals of Operations Research},
year = {1996},
volume = {63},
pages = {437--464},
keywords = {graph coloring problem, evolutionary algorithms}
}
@inproceedings{FotLikSte01,
author = {Dimitris Fotakis and Spiridon D. Likothanassis and Stamatis Stefanakos},
title = {An Evolutionary Annealing Approach to Graph Coloring},
booktitle = {Applications of Evolutionary Computing, EvoWorkshops 2001},
year = {2001},
editor = {Egbert J. W. Boers and Jens Gottlieb and Pier Luca Lanzi and Robert
E. Smith and Stefano Cagnoni and Emma Hart and G{\"u}nther R. Raidl
and H. Tijink},
volume = {2037},
series = {Lecture Notes in Computer Science},
pages = {120-129},
publisher = {Springer},
keywords = {graph coloring problem, evolutionary algorithms}
}
@article{GalHao99,
author = {P. Galinier and J. Hao},
title = {Hybrid evolutionary algorithms for graph coloring},
journal = {Journal of Combinatorial Optimization},
year = {1999},
volume = {3},
pages = {379--397},
number = {4},
doi = {10.1023/A:1009823419804},
keywords = {graph coloring problem, evolutionary algorithms},
opturl = {citeseer.nj.nec.com/galinier99hybrid.html}
}
@article{GlaPru03,
author = {C. A. Glass and Adam Pr{\"u}gel-Bennett},
title = {Genetic Algorithms for Graph Colouring: Exploration of {G}alinier
and {H}ao's Algorithm},
journal = {Journal of Combinatorial Optimization},
year = {2003},
volume = {7},
pages = {229--236},
number = {3},
keywords = {graph coloring problem, evolutionary algorithms}
}
@article{LorFur01,
author = {Luiz Antonio Nogueira Lorena and Jo{\~a}o Carlos Furtado},
title = {Constructive Genetic Algorithm for Clustering Problems.},
journal = {Evolutionary Computation},
year = {2001},
volume = {9},
pages = {309--328},
number = {3},
bibsource = {DBLP, http://dblp.uni-trier.de},
keywords = {graph coloring problem, evolutionary algorithms}
}
@article{Lu2010,
author = {Zhipeng L{\"u} and Jin-Kao Hao},
title = {A memetic algorithm for graph coloring},
journal = {European Journal of Operational Research},
year = {2010},
volume = {203},
pages = {241 - 250},
number = {1},
doi = {10.1016/j.ejor.2009.07.016},
issn = {0377-2217},
keywords = {graph coloring problem, evolutionary algorithms},
opturl = {http://www.sciencedirect.com/science/article/B6VCT-4WW9KRG-1/2/19472ecd6bdf18c9332a496485405254}
}
@article{Malaguti20080301,
author = {Malaguti, Enrico and Monaci, Michele and Toth, Paolo},
title = {A Metaheuristic Approach for the Vertex Coloring Problem},
journal = {INFORMS Journal on Computing},
year = {2008},
volume = {20},
pages = {p302 - 316},
number = {2},
abstract = {Given an undirected graph G = (V,E), the vertex coloring problem (VCP)
requires to assign a color to each vertex in such a way that colors
on adjacent vertices are different and the number of colors used
is minimized. In this paper, we propose a metaheuristic approach
for VCP that performs two phases: the first phase is based on an
evolutionary algorithm, whereas the second one is a postoptimization
phase based on the set covering formulation of the problem. Computational
results on a set of DIMACS instances show that the overall algorithm
is able to produce high-quality solutions in a reasonable amount
of time. For four instances, the proposed algorithm is able to improve
the best-known solution while for almost all the remaining instances,
it finds the best-known solution in the literature. ABSTRACT FROM
AUTHOR Copyright of INFORMS Journal on Computing is the property
of INFORMS: Institute for Operations Research and its content may
not be copied or emailed to multiple sites or post},
doi = {10.1287/ijoc.1070.0245},
issn = {10919856},
keywords = {ALGORITHMS, MATHEMATICAL optimization, MATHEMATICAL analysis, NEURAL
networks (Computer science), EVOLUTIONARY computation, ALGEBRA, evolutionary
algorithm, heuristics, set covering, graph coloring problem, local
search methods, evolutionary algorithms},
optfile = {:home/marco/Literature/MalagutiMonaciToth2008.pdf:PDF},
url = {http://search.ebscohost.com.proxy1-bib.sdu.dk:2048/login.aspx?direct=true&db=buh&AN=32007697&loginpage=Login.asp&site=ehost-live}
}
@inproceedings{marino00breaking,
author = {Anna Marino and Robert I. Damper},
title = {Breaking the Symmetry of the Graph Colouring Problem with Genetic
Algorithms},
booktitle = {Late Breaking Papers at the 2000 Genetic and Evolutionary Computation
Conference},
year = {2000},
editor = {Darrell Whitley},
pages = {240--245},
address = {Las Vegas, Nevada, USA},
keywords = {graph coloring problem, evolutionary algorithms},
optmonth = {8},
opturl = {citeseer.ist.psu.edu/374201.html}
}
@article{Plumettaz2010,
author = {Plumettaz, M. and Schindl, D. and Zufferey, N.},
title = {Ant Local Search and its efficient adaptation to graph colouring},
journal = {Journal of Operational Research Society},
year = {2010},
volume = {61},
pages = {819 -- 826},
number = {5},
doi = {10.1057/jors.2009.27},
keywords = {graph coloring problem, population-based metaheuristics},
owner = {marco},
timestamp = {2010.08.06}
}
@inproceedings{Por09,
author = {Daniel Porumbel and Jin-Kao Hao and Pascale Kuntz},
title = {Diversity Control and Multi-Parent Recombination for Evolutionary
Graph Coloring Algorithms},
booktitle = {9th European Conference on Evolutionary Computation in Combinatorial
Optimisation (Evocop 2009)},
year = {2009},
address = {T{\"u}bingen, Germany},
keywords = {graph coloring problem, evolutionary algorithms},
url = {http://www.info.univ-angers.fr/pub/porumbel/papers/EVOCOP09.pdf}
}
@article{Porumbel2010,
author = {Daniel Cosmin Porumbel and Jin-Kao Hao and Pascale Kuntz},
title = {An evolutionary approach with diversity guarantee and well-informed
grouping recombination for graph coloring},
journal = {Computers \& Operations Research},
year = {2010},
volume = {37},
pages = {1822 - 1832},
doi = {10.1016/j.cor.2010.01.015},
issn = {0305-0548},
issue = {10},
keywords = {graph coloring problem, evolutionary algorithms, Diversity control,
Population management, Multi-parent crossover, Memetic and hybrid
algorithm},
opturl = {http://www.sciencedirect.com/science/article/B6VC5-4Y9CFFX-4/2/aa95a380a3f6075d7f193d575f246148}
}
@article{Talbi2007,
author = {El-Ghazali Talbi and Benjamin Weinberg},
title = {Breaking the search space symmetry in partitioning problems: An application
to the graph coloring problem},
journal = {Theoretical Computer Science},
year = {2007},
volume = {378},
pages = {78 - 86},
number = {1},
doi = {10.1016/j.tcs.2007.01.023},
issn = {0304-3975},
keywords = {graph coloring problem, population-based metaheuristics, theoretical
analyses},
opturl = {http://www.sciencedirect.com/science/article/B6V1G-4N2TS51-1/2/c0e14c7ab5
b51f7eb823df7840578e48}
}
@incollection{Titiloye2011a,
author = {Titiloye, Olawale and Crispin, Alan},
title = {Graph Coloring with a Distributed Hybrid Quantum Annealing Algorithm},
booktitle = {Agent and Multi-Agent Systems: Technologies and Applications},
publisher = {Springer Berlin / Heidelberg},
year = {2011},
editor = {O'Shea, James and Nguyen, Ngoc and Crockett, Keeley and Howlett,
Robert and Jain, Lakhmi},
volume = {6682},
series = {Lecture Notes in Computer Science},
pages = {553-562},
abstract = {Quantum simulated annealing is analogous to a population of agents
cooperating to optimize a shared cost function defined as the total
energy between them. A hybridization of quantum annealing with mainstream
evolutionary techniques is introduced to obtain an effective solver
for the graph coloring problem. The state of the art is advanced
by the description of a highly scalable distributed version of the
algorithm. Most practical simulated annealing algorithms require
the reduction of a control parameter over time to achieve convergence.
The algorithm presented is able to keep all its parameters fixed
at their initial value throughout the annealing schedule, and still
achieve convergence to a global optimum in reasonable time. Competitive
results are obtained on challenging problems from the standard DIMACS
benchmarks. Furthermore, for some of the graphs, the distributed
hybrid quantum annealing algorithm finds better results than those
of any known algorithm.},
affiliation = {School of Computing, Mathematics and Digital Technology, Manchester
Metropolitan University, Manchester, M1 5GD U.K.},
doi = {10.1007/978-3-642-22000-5_57},
isbn = {978-3-642-21999-3},
keywords = {graph coloring problem, population-based metaheuristics},
optnote = {10.1007/978-3-642-22000-5_57}
}
@article{Titiloye2011,
author = {Olawale Titiloye and Alan Crispin},
title = {Quantum annealing of the graph coloring problem},
journal = {Discrete Optimization},
year = {2011},
volume = {8},
pages = {376 - 384},
number = {2},
abstract = {Quantum annealing extends simulated annealing by introducing artificial
quantum fluctuations. The path-integral Monte Carlo version chosen
is population-based and designed to be implemented on a classical
computer. Its first application to the graph coloring problem is
presented in this paper. It is shown by experiments that quantum
annealing can outperform classical thermal simulated annealing for
this particular problem. Moreover, quantum annealing proved competitive
when compared with the best algorithms on most of the difficult instances
from the DIMACS benchmarks. The quantum annealing algorithm has even
found that the well-known benchmark graph dsjc1000.9 has a chromatic
number of at most 222. This is an improvement on its best upper-bound
from a large body of literature.},
doi = {DOI: 10.1016/j.disopt.2010.12.001},
issn = {1572-5286},
keywords = {graph coloring problem, population-based metaheuristics},
opturl = {http://www.sciencedirect.com/science/article/pii/S1572528610000721}
}
@article{Xie2009a,
author = {Xie, Xiao-Feng and Liu, Jiming},
title = {Graph coloring by multiagent fusion search},
journal = {Journal of Combinatorial Optimization},
year = {2009},
volume = {18},
pages = {99--123},
number = {2},
month = aug,
abstract = {Abstract A multiagent fusion search is presented for the
graph coloring problem. In this method, each of agents performs the
fusion search, involving a local search working in a primary exploitation
role and a recombination search in a navigation role, with extremely
limited memory and interacts with others through a decentralized
protocol, thus agents are able to explore in parallel as well as
to achieve a collective performance. As the knowledge components
implemented with available structural information and in formalized
forms, the Quasi-Tabu local search and grouping-based recombination
rules are especially useful in addressing neutrality and ruggedness
of the problem landscape. The new method has been tested on some
hard benchmark graphs, and has been shown competitive in comparison
with several existing algorithms. In addition, the method provides
new lower bound solutions when applied to two large graphs. Some
search characteristics of the proposed method is also discussed.},
doi = {10.1007/s10878-008-9140-6},
keywords = {graph coloring problem, population-based metaheuristics},
owner = {marco},
timestamp = {2010.02.07}
}
@proceedings{symposium02,
title = {Proceedings of the Computational Symposium on Graph Coloring and
its Generalizations},
year = {2002},
editor = {D. S. Johnson and A. Mehrotra and M. Trick},
address = {Ithaca, New York, USA},
booktitle = {Proceedings of the Computational Symposium on Graph Coloring and
its Generalizations}
}
@book{dimacs96,
title = {Cliques, Coloring, and Satisfiability: Second {DIMACS} Implementation
Challenge, 1993},
publisher = {American Mathematical Society, Providence, RI, USA},
year = {1996},
editor = {David S. Johnson and Michael Trick},
volume = {26},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
keywords = {graph coloring problem, surveys}
}