Graph coloring with a distributed hybrid quantum annealing algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6682 LNAI, Issue , 2011, Pages 553-562

  Titiloye, Olawale ^a   Crispin, Alan ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

Distributed Algorithms; Graph Coloring; Multi agent; Optimization; Quantum Annealing; Simulated Annealing

Indexed keywords

CONTROL PARAMETERS; EVOLUTIONARY TECHNIQUES; GLOBAL OPTIMUM; GRAPH COLORING PROBLEM; GRAPH COLORINGS; INITIAL VALUES; MULTI-AGENT; QUANTUM ANNEALING; SIMULATED ANNEALING ALGORITHMS; STATE OF THE ART; TOTAL ENERGY;

ALGORITHMS; ANNEALING; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; INTELLIGENT AGENTS; MULTI AGENT SYSTEMS; PARAMETER ESTIMATION; QUANTUM THEORY;

SIMULATED ANNEALING;

EID: 79960291872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22000-5_57     Document Type: Conference Paper

References (18)

1. Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671-680 (1983)
2. Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Physical Review E 58, 5355 (1998)
3. Das, A., Chakrabarti, B.K.: Quantum Annealing and quantum analog computation. Rev. Mod. Phys. 80, 1061 (2008)
4. Martoňák, R., Santoro, G.E., Tosatti, E.: Quantum annealing of the traveling salesman problem. Phys. Rev. E 70, 057701 (2004)
5. Battaglia, D.A., Santoro, G.E., Tosatti, E.: Optimization by quantum annealing: Lessons from hard satisfiability problems. Phys. Rev. 71, 066707 (2005)
6. Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379-397 (1999)
7. Malaguti, E., Monaaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS Journal on Computing 20(2), 302-316 (2008)
8. Lü, Z., Hao, J.K.: A memetic algorithm for graph coloring. European Journal of Operational Research 203(1), 241-250 (2010)
9. Porumbel, D.C., Hao, J.K., Kuntz, P.: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph colouring. Computers and Operations Research 37(1), 1822-1832 (2010)
10. Morita, S., Nishimori, H.: Mathematical foundations of quantum annealing. Journal of Mathematical Physics 49, 12521 (2008)
11. Titiloye, O., Crispin, A.: Quantum annealing of the graph coloring problem. Discrete Optimization (2011), doi:10.1016/j.disopt.2010.12.001
12. Johnson, D.S., Trick, M.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol. 26. American Mathematical Society, Providence (1996)
13. Morgenstern, C.: Distributed coloration neighborhood search. In: [12], pp. 335-358
14. Cohn, H., Fielding, M.: Simulated annealing: searching for an optimal temperature schedule. SIAM Journal on Optimization 9, 779-802 (1999)
15. Greene, J.A., Supowit, K.J.: Simulated annealing without rejected moves. IEEE Trans.Comput.-Aided Design CAD 5(1), 221-228 (1986)
16. Gusfield, D.: Partition-distance: a problem and class of perfect graphs arising in clustering. Information Processing Letters 82(3), 159-164 (2002)
17. Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the k-coloring problem. Discrete Applied Mathematics 156(2), 267-279 (2008)
18. Blöchliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers and Operations Research 35(3), 960-975 (2008)