Research Group
"Metaheuristics, Optimization and Applications"

Dr. Jin-Kao Hao
Professor and initial founder of the Group
(Professeur des Universités, 1ère Classe)

LERIA (Director)
Faculty of Sciences - University of Angers
2, Boulevard Lavoisier, 49045 Angers Cedex 01 - France
Email: Jin-Kao.Hao[at]univ-angers.fr
Phone: (+33) 2 41 73 50 76, Fax: (+33) 2 41 73 50 73

Key words

Metaheuristics and heuristics, large-scale combinatorial optimization, mobile radio and Internet network optimization, constraint solving and constrained optimization, resource assignment-planning-scheduling, timetabling, optimization in transportation and logistics, bioinformatics, data mining.

Research

The group "Metaheuristics, Optimization and Applications" works on modern metaheuristics for solving large-scale complex combinatorial problems. We are especially interested in the following methods:

• Advanced neighborhood search methods: tabu search, iterated local search, simulated annealing...
• Evolutionary algorithms: genetic algorithms...
• Hybrid and memetic algorithms: genetic and local search, exact and heuristics search...

Metaheuristics are based on very general principles and applicable to a large number of problems. Metaheuristics are known today to be among the most powerful methods for tackling hard and large combinatorial problems.

Target applications of metaheuristics concern those highly combinatorial and strongly constrained problems which cannot be solved other ways. Typical examples of such applications include resource assignment, planning, scheduling and re-scheduling, timetabling and inventory...

Research in our group is carried out in several tightly related directions. We develop high performance heuristic methods for real applications including:

• frequency assignment for mobile radio networks (application of France Telecom)
• antenna positioning for mobile radio networks (European Esprit IV project)
• inferring autonomous system relationships in the Internet (France Telecom R&D)
• photograph scheduling of an earth observation satellite (application of CNES)
• integrated vehicle and driver scheduling 
• optimization of BSS architecture (application of Bouygues Telecom)
• timetabling
• sports league scheduling
• progressive party problem...

and for general NP-hard problems such as:

• graph coloring and T-coloring
• (maximal) constraint satisfaction problems (CSP and MCSP)
• satisfiability (SAT and Max-SAT)
• linear arrangement minimization
• bandwidth minimization
• multidimensional knapsack...

• gene selection and classification of DNA microarray data
• phylogeny reconstruction
• protein subcellular localization
• multiple sequence alignment

We are also interested in regulation networks and protein structure prediction.

Other ongoing research activities include multiobjective optimization, dynamic optimization and uncertain optimization by metaheuristics. Finally, we are interested in general purpose problem solvers based on metaheuristics, fundamental issues related to the design and understanding of the heuristic methods (landscapes, search space analysis, distribution of local optima...).

R&D grants and contracts

• Integrated Vehicule and Crew Scheduling (CIFRE with PERINFO SA, 2004-2007, 2005-2008)
• Adaptive search and machine learning for optimization (Pays de La Loire Regional Project, 2008-2011)
• BIL (BioInformatique Ligérienne, Pays de La Loire Regional Project 2007-2009)
• Inference of Autonomous System Relationships in the Internet (France Telecom R&D, 2005-2006)
• Network design and topology optimization (France Telecom R&D, 2006-2008)
• Post-Genome (Bioinformatics, 2000-2006)
• Ouest Genopole (Bioinformatics, since 2001)
• Parallel metaheuristics for combinatorial problem solving (Franco-Mexican Joint Lab in Computer Science LAFMI, 2005-2006)
• Meta-heuristics for uncertain optimization (PRA and LIAMA 2000-2003)
• Meteor (Migration & Evolution of Telecom Equipment through Operations Research, RNRT,2000-2002)
• Mobile radio networks: planning, evolution and optimization (CNRS Telecoms Programme, 2000-2001)
• Optimization and decision making in cork industry (CIFRE with SABATE, 1999-2002)
• ARNO (Algorithms for Radio Network Optimisation, ESPRIT 4, No. 23243, 1997-1999)
• FAP I & II (Frequency assignment for mobile radio networks, CNET - France Telecom, 1994-1997)
• OPT (Modern heuristics for optimisation, ANVAR, 1996-1997)

Ph.D and Post-doc supervision

Ongoing Ph.D. candidates

• Edmondo Bonilla Huerta, José Crispin Hernandez Hernandez (Mexican COSNET scholarship, from the Instituto Tecnologico Apizaco, Tlaxcala, Mexico, co-supervisor Dr. B. Duval)
• Marc-Olivier Buob (France Telecom R&D research scholarship, from the Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE), former IIE  Paris, co-supervisor Dr. Jean-Luc Lutton, France Telecom R&D)
• Giglia Gomez (Chilean CONICyT scholarship, from the Universidad de Valparaiso, Chile, co-supervisor Dr. J.P. Hamiez)
• Valérie Guihaire (Industrial research grant CIFRE with PERINFO SA,  from the Université Catholique de l'Ouest)
• Benoit Laurent (Industrial research grant CIFRE with PERINFO SA, from the Université d'Angers)
• Daniel Porumbel (Regional scholarship, co-supervisor Dr. P. Kuntz, Polytech'Nantes, from the Université "Politehnica" de Bucarest, Romania)

(Wishing to do a PhD with us? click here)

(Notice that we don't take undergraduate students for their training program)

Former Ph.D. candidates

• Vincent Barichard (Assistant Professor at the Université d'Angers, PhD defense in 2003, from the Université d'Angers)
• Meriema Belaidouni (Post-doc at the Institut National de Telecommunications, Paris, PhD defense in 2001, from the Université Houari Boumédiène, Algeria)
• Alain Chabrier (Senior R&D research scientist and team leader, ILOG Madrid, PhD defense in 2003, from the Ecole Polytechnique, Paris)
• Daniela Claro (Assistant Professor, Universidade Federal da Bahia, Brasil, co-supervisor Dr. P. Albers, PhD defense in 2006, from Universidade Federal de Santa Catarina, Brazil)
• Herve Deleau (Teaching and Research Assistant, co-supervisor Dr. F. Saubion, PhD defense in 2005, from the Université d'Amiens)
• Vincent Derrien (Regional scholarship, graduated from the Université d'Angers, PhD defense in March 2008, co-supervisor Dr. J.M. Richer)
• Raphaël Dorne (Senior research scientist at British Telecom's Advanced Communications Technology Centre, Suffolk, U.K., PhD defense in 1998, from the Université de Montpellier II)
• Philippe Galinier (Associate Professor at the Ecole Polytechnique de Montreal, Canada, PhD defense in 1999, from the Université de Montpellier II)
• Adrien Goeffon (Post-doc at LaBRI, co-supervisor Dr. J.M. Richer, PhD defense in 2006, from the Université d'Angers)
• Jean-Philippe Hamiez (Assistant Professor at the Université d'Angers, PhD defense in 2002, from the Université d'Amiens)
• Frederic Lardeux (Assistant Professor at the Université d'Angers, co-supervisor Dr. F. Saubion, PhD defence in 2005, from the Université d'Angers)
• Hakim Mabed (Researcher  at UTBM, co-supervised by Dr. A. Caminada, France Telecom R&D, PhD defense in 2003)
• Nicolas Pech-Gourg (Assistant Professor at the Higher Engineering School IMERIR, France, PhD defense in 2002, from the Ecole des Mines d'Alèes )
• Eduardo A. Rodriguez-Tello ( Researcher - Cinvestav Tamaulipas, Mexican CONACyT scholarship, PhD defense in July 2007, from ITESM Cuernavaca, Mexico, co-supervisor Prof. J. Torres-Jimenez)
• Michel Vasquez (Permanent researcher at the National Higher Engineering School "Ecole des Mines d'Ales", France, HDR since july 2004, PhD defense in 2000, from the Ecole des Mines d'Alèes )

• Zhipeng Lu (since 2007, PhD from Huazhong University of Science and Technology, funded by a post-doc scholarship from Angers Loire Metropole) Manuel Clergue (2000-2001, PhD from Université de Nice, Assistant Professor at Université de Nice since 2001)
• Yufeng Hao (2004-2005, PhD from Southeast University, China, funded by the Franco-Chinese Foundation)
• Jian Zhou (2003-2004, Ph.D from Tsinghua University, China, funded by the French Research Ministry, Assistant Professor at Tsinghua University since October 2004)

(Wishing to do a post-doc with us? click here)

Mini CV

Jin-Kao Hao is a full Professor at the Department of Computer Science of the University of Angers, France since 1999 (promoted to 1st class Professor since 2006 by the French National Council of Universities). He is the initial founder of the research group "Metaheuristics, Optimization and Applications" with the LERIA (Angers Computer Science Lab). Before joining the University of Angers, he has been an Associate Professor at the Ecole des Mines d'Ales (EERIE site in Nîmes) and head of the "Constraints and Heuristics" research group until September 1999.

His main research interests lie in practical solving of large-scale combinatorial problems with heuristic and hybrid methods. With the members of his group, they have developed high performance heuristic algorithms for several NP-hard problems such as graph coloring, SAT, multidimensional 0-1 knapsack problem, bandwidth and linear arrangement minimization, maximum parsimony, constraint satisfaction and other optimization problems.

He has supervised and worked on several real world applications including business relationship inference in the Internet, antenna positioning and frequency assignment for mobile radio networks, daily photograph scheduling of an earth observation satellite, integrated scheduling of vehicles and drivers, sports league scheduling, timetabling and decision making for marketing investment. He has initiated a number of important R&D projects including an EC funded Esprit project (96-99) and French National Research Network RNRT project (1999-2002). Since 2001, he has been working on "Heuristic Algorithms for Bioinformatics" within the Ouest Genepole, the CER "Post-Genome" and Regional Bioinformatics programs. He is involved in several internatinal collaboration programs, in particular with China, Canada and Mexico. He is currently leading a regional research project on "adaptive search and machine learning for optimization".

He has co-authored some one hundred publications in international journals, book chapters or fully refereed conference proceedings in the field of Metaheuristics, Evolutionary Computation, Combinatorial Optimization, Constraint Programming and Artificial Intelligence. He is on the Program Committee of several main International and National Conferences (more than one hundred times) and serves regularly as a reviewer for more than twenty international Journals in the area of his research interests. He is a member of the Editorial Board of several International Journals. He also participated in the organization of several Conferences or Workshops and co-edited three volumes of Springer LNCS series. He is the supervisor of more than twenty Ph.D candidats (15 of them have completed their PhD till 2007) and twenty Master thesis. He has been on some sixty PhD Examination Boards (in France and abroad).

Jin-Kao Hao was born in Nov. 1961 in China. He graduated in 1982 from the National University of Defense Technology (School of Computer Science) (China). He received a Master degree (Oct. 87) from the National Institute of Applied Sciences (INSA Lyon, France), the Ph.D. (Feb. 91, suppervised by Prof. Jean-Jacques Chabrier) from the University of Burgundy (Dijon, France) and the Professorship Diploma HDR (Habilitation a Diriger des Recherches) (Jan. 98) from the University of Montpellier II (France).

Selected publications since 1995 
(Examples citing our papers can be found from Google Scholar, see also DBLP or Google(CiteSeer) 

Journals, books and refereed conferences

(If you encounter problems to download any paper, you may contact me at mailto: jin-kao.hao[at]univ-angers.fr, replace [at] by @)

1. Benoit Laurent and and Jin-Kao Hao, Iterated Local Search for the multiple depot vehicle scheduling problem. To appear in Computers & Industrial Engineering, 2009. Draft (pdf), Elsevier©
2. Benoit Laurent and and Jin-Kao Hao, List graph coloring for multi-depot vehicle scheduling. To appear in International Journal of Mathematics in Operational Research 1(1-2), 2009. Draft (pdf), Inderscience Publishers©.
3. Jean-Philippe Hamiez and Jin-Kao Hao, Using solution properties within an enumerative search to solve a sports league scheduling problem. Discrete Applied Mathematics 156(10): 1683-1693, 2008. Draft (pdf) Elsevier©
4. Eduardo Rodriguez-Tello, Jin-Kao Hao and José Torres-Jimenez, An improved Simulated Annealing algorithm for bandwidth minimization. European Journal of Operational Research 185(3): 1319-1335, 2008. Draft (pdf) Elsevier©
5. Eduardo Rodriguez-Tello, Jin-Kao Hao and José Torres-Jimenez, An effective two-stage simulated annealing algorithm for the Minimum Linear Arrangement problem. Computers & Operations Research 35(10): 3331-3346, 2008. Draft (pdf) Elsevier©
6. Oliver Bailleux and Jin-Kao Hao, Stochastic search algorithms (in French). In L. Sais (Ed.), "Problem SAT: progresses and challenges", Chapter 5, Hermes, 2008. 
7. Alexandre Caminada, Jin-Kao Hao, Jean-Luc Lutton and Vincent Martin, Telecommunication networks. In G. Finke (Ed.), "Operational Research and Networks", Chapter 7, Wiley, 2008.
8. Valérie Guihaire and Jin-Kao Hao, Transit network design and scheduling: a global review. Transportation Research Part A: Policy and Practice 42: 1251-1273, 2008. Draft (pdf), Elsevier©
9. Valérie Guihaire and Jin-Kao Hao, Transit network re-timetabling and vehicle scheduling. Communications in Computer and Information Science (CCIS) 14: 135-144, Springer, 2008 (pdf) Springer©
10. Benoit Laurent and Jin-Kao Hao, Simultaneous vehicle and driver scheduling: a case study in a limousine rental company. Computers & Industrial Engineering 53(3): 542-558, 2007. Draft (pdf) Elsevier©
11. Adrien Goëffon, Jean-Michel Richer and Jin-Kao Hao, Progressive tree neighborhood applied to the Maximum Parsimony problem. IEEE/ACM Transactions on Computational Biology and Bioinformatics 5(1): 136-145, 2008. Draft (pdf) IEEE CSP©. Software is available HERE.
12. Edmundo Bonilla Huerta, Béatrice Duval and Jin-Kao Hao, Fuzzy logic for elimination of redundant information of microarray data. Genomics Proteomics & Bioinformatics 6(2): 61-73, June 2008. Draft (pdf) Elsevier©
13. Edmundo Bonilla Huerta, Béatrice Duval and Jin-Kao Hao, Gene selection for Microarray data by a LDA-based genetic algorithm. Lecture Notes in Bioinformatics 5265: 252-263, Springer-Verlag, 2008 (pdf) Sprigner©
14. José Crispin Hernandez Hernandez, Béatrice Duval and Jin-Kao Hao, SVM-based local search for gene selection and classification of Microarray data. Communications in Computer and Information Science (CCIS) 13: 599-598, Springer, 2008 (pdf) Springer©
15. Zhipeng Lü and Jin-Kao Hao, Solving the course timetabling problem with a hybrid heuristic algorithm. Lecture Notes in Computer Science 5253: 262-273, Springer, 2008, Draft (pdf) Springer©
16. Benoït Laurent and Jin-Kao Hao, Simultaneous vehicle and crew scheduling for extra urban transports. Lecture Notes in Artificial Intelligence 5027: 466–475, Springer, 2008, Draft (pdf) Springer©
17. Benoit Laurent and Jin-Kao Hao, A study of neighborhood structures for the multiple depot vehicle scheduling problem. Lecture Notes in Computer Science 4638: 197-201, Springer, 2007 (pdf) Springer© 
18. Daniel Porumbel, Jin-Kao Hao and Pascale Kuntz, A study of evaluation functions for the graph K-coloring problem. Selected papers from the 8th International Conference on Artificial Evolution (EA-07). Lecture Notes in Computer Science 4926: 124-135, Springer, 2008. (pdf) Springer©
19. José Crispin Hernandez Hernandez, Béatrice Duval and Jin-Kao Hao,  A study of crossover operators for gene selection of microarray data. Selected papers from the 8th International Conference on Artificial Evolution (EA-07). Lecture Notes in Computer Science 4926: 243-254, Springer, 2008. (pdf) Springer©
20. José Crispin Hernandez Hernandez, Béatrice Duval and Jin-Kao Hao, A genetic embedded approach for gene selection and classification of microarray data. Lecture Notes in Computer Science 4447: 90-101, Springer, 2007. (pdf) Springer©
21. Jean-Michel Richer, Vincent Derrien, and Jin-Kao Hao, A new dynamic programming algorithm for multiple sequence alignment. Lecture Notes in Computer Science 4616: 52-61, Springer-Verlag, 2007. (pdf) Springer©
22. Eduardo Rodriguez-Tello, Jin-Kao Hao and José Torres-Jimenez,  A refined evaluation function for the MinLA problem. Lecture Notes in Artificial Intelligence: 4293: 392-403, Springer-Verlag, 2006 (5th Mexican International Conference on Artificial Intelligence, Best paper award, 3rd price), (pdf) Springer©
23. Jean-Philippe Hamiez and Jin-Kao Hao, Sports league scheduling: enumerative searh for Prob026 from CSPLib. Lecture Notes in Computer Science 4204: 716-720, Springer-Verlag, 2006. (pdf) Springer©
24. Adrien Goëffon, Jean-Michel Richer and Jin-Kao Hao, A distance-based information preservation tree crossover for the maximum parsimony problem. Lecture Notes in Computer Science 4193: 761-770, Springer-Verlag, 2006. (pdf) Springer©. Software is freely available HERE.
25. Edmundo Bonilla Huerta, Béatrice Duval and Jin-Kao Hao, A hybrid GA/SVM approach for gene selection and classification of Microarry data. Lecture Notes in Computer Science 3907: 34-44, Springer-Verlag, 2006. (pdf) Springer©
26. Benoit Laurent, Valerie Guihaire and Jin-Kao Hao, A heuristic solution for a driver-vehicule scheduling problem. Operations Research Proceedings 2005: 703-708, Springer-Verlag, 2006. (pdf) Springer©
27. Eduardo Rodriguez-Tello, Jin-Kao Hao and Jose Torres-Jimenez, Memetic algorithms for the MinLA problem. Lecture Notes in Computer Science 3871: 73-84, Springer-Verlag, 2006. (pdf) Springer©
28. Frédéric Lardeux, Frédéric Saubion and Jin-Kao Hao, GASAT: a genetic local search algorithm for the satisfibility problem. Evolutionary Computation 14(2): 223-253, 2006. (pdf)  MIT Press©
29. Daniela Claro, Patrick Albers and Jin-Kao Hao, Web services composition. In J. Cardoso, Sheth, Amit (Eds.) « Semantic Web Services, Processes and Applications », Chapter 8, 2006, (pdf)  Springer©
30. Eduardo Rodriguez-Tello, Jin-Kao Hao and J. Torres-Jimenez, A comparison of memetic recombination operators for the MinLA problem. Lecture Notes in Computer Science 3789: 613-622, Springer-Verlag, 2005. (pdf) Springer©
31. Adrien Goëffon, Jean-Michel Richer and Jin-Kao Hao, Local search for the maximum parsimony problem. Lecture Notes in Computer Science 3612: 678-683. Springer-Verlag, 2005. (pdf) Springer©
32. Vincent Derrien, J.M. Richer and Jin-Kao Hao, Plasma, a progressive algorithm for multiple sequence alignment (in French). Proceedings of French Open Days on Biology, Computer Science and Mathematics (JOBIM-05), Lyon, July 6-8 2005. (pdf). To use our Plasma multiple alignment tool, click here.
33. Frédéric Lardeux, Frédéric Saubion and Jin-Kao Hao, Three truth values for SAT and MAX-SAT problems. Proc. of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), pp187-192, Edinburgh, July-August, 2005. (pdf)
34. Hakim Mabed, Alexandre Caminada and Jin-Kao Hao, Impact of tradeoff between blocking and interference on TDMA cell capacity planning. International Journal of Mobile Network Design and Innovation, (1)1:24-33, 2005. Inderscience Publishers©.
35. Hervé Deleau, Jin-Kao Hao and Frédéric Saubion, Hybrid strategies for solving constraint satisfaction problems (in French). RAIRO Operational Research 39:87-103, 2005. (pdf) EDP Sciences©.
36. Jean-Philippe Hamiez and Jin-Kao Hao, A linear-time algorithm to solve the sports league scheduling problem. Discrete Applied Mathematics 143: 252-265, 2004. Draft  (postscript) (pdf) Elsevier©. 
37. Philippe Galinier and Jin-Kao Hao, A general approach for constraint solving by local search. Journal of Mathematical Modelling and Algorithms 3(1): 73-88, 2004. Draft. (pdf) Kluwer.
38. Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez, An improved evaluation function for the bandwidth minimization problem. Lecture Notes in Computer Science 3242: 650-659, Springer-Verlag, 2004. (pdf)  Springer©
39. Vincent Barichard, Hervé Deleau, Jin-Kao Hao, Frédéric Saubion, A hybrid evolutionary algorithm for constraint satisfaction problems. Lecture Notes in Computer Science 2936: 79-90, Springer-Verlag, 2004. (pdf)  Springer©
40. Frédéric Lardeux, Frédéric Saubion and Jin-Kao Hao, Recombination operators for satisfiability problems. Lecture Notes in Computer Science 2936: 103-114, Springer-Verlag, 2004. (pdf)  Springer©
41. Vincent Barichard and Jin-Kao Hao, A population and interval constraint propagation algorithm. Lecture Notes in Computer Science 2632: 88-101, Springer-Verlag, 2003. (postscript) (pdf)
42. Vincent Barichard and Jin-Kao Hao, Genetic tabu search for the multi-objective knapsack problem. Journal of Tsinghua Science and Technology, 8(1): 8-13, 2003. (postscript) (pdf)
43. Jin-Kao Hao, Frédéric Lardeux and Frédéric Saubion, Evolutionary computing for the satisfiability problem. Lecture Notes in Computer Science  2611: 258-268, Springer-Verlag, 2003. (postscript) (pdf)  Springer©
44. Michel Vasquez and Jin-Kao Hao, Upper bounds for the SPOT 5 daily photograph scheduling problem. Journal of Combinatorial Optimization, 7(1):  87-103,2003.Kluwer. (postscript) (pdf)
45. Jean-Philippe Hamiez and Jin-Kao Hao, An analysis of solution properties of the graph coloring problem. "Metaheuristics: Computer Decision-Making", Chapter 15, pp325-346, M.G.C. Resende and J.P. de Sousa (Eds.), Kluwer, 2003. (postscript) (pdf). 
46. Hakim Mabed, Alexandre Caminada and Jin-Kao Hao, Multi-period channel assignment. Lecture Notes in Computer Science 2775: 541-554, Springer-Verlag, 2003. (pdf)  Springer©
47. Nicolas Pech-Gourg, Jin-Kao Hao, Métaheuristiques pour l'optimisation de règles de classification de bouchons naturels en liege. Revue d'Extraction des Connaissances et Apprentissage (ECA), 16(6) : 785-806, Hermès, 2003. (In French)
48. Hakim Mabed, Alexandre Caminada, Jin-Kao Hao and Denis Renaud, A dynamic traffic model for frequency assignment. Lecture Notes in Computer Science 2439: 779-788, Springer-Verlag, 2002.  (pdf)  Springer©
49. Jean-Philippe Hamiez and Jin-Kao Hao, Scatter search for graph coloring. Lecture Notes in Computer Science 2310: 168-179, Springer-Verlag, 2002. (postscript) (pdf)  Springer©
50. Alexandre Caminada, Jin-Kao Hao, Jean-Luc Lutton, Vincent Martin, Réseaux de télécommunications. In G. Finke (Ed.) "Recherche Opérationnelle et Réseaux" traité IGAT, Chapitre 7, pp196-240, Hermès, 2002. (In French)
51. Mériéma Bélaidouni and Jin-Kao Hao, SAT, local search dynamics and density of states. Leture Notes in Computer Science 2310: 192-204, Springer, 2002. (postscript) (pdf)  Springer©
52. Jean-Philippe Hamiez and Jin-Kao Hao, Solving the sports league scheduling problem with Tabu search. Lecture Notes in Artificial Intelligence 2148: 24-36, Springer-Verlag, 2001. (postscript) (pdf).  Springer©
53. Michel Vasquez and Jin-Kao Hao, A hybrid approach for the multidimensional 0-1 knapsack problem. Proc. of the 17th Intl. Joint Conference on Artificial Intelligence (IJCAI-01), pages 328-333, Seattle, Washington, USA, August 2001. Morgan Kaufmann Publishers. (postscript) (pdf)
54. Nicolas Pech-Gourg and Jin-Kao Hao, A genetic algorithm for the classification of natural corks. Proc. of 2001 Genetic and Evolutionary  Computation Conference (GECCO-01), pages 1382-1388, San Francisco, California, July 2001. Morgan Kaufmann Publishers. (postscript) (pdf)
55. Michel Vasquez and Jin-Kao Hao, A heuristic approach for antenna positioning in cellular networks. Journal of Heuristics. 7(5): 443-472, 2001. Kluwer. (postscript) (pdf)
56. Michel Vasquez and Jin-Kao Hao, A "logic-constrained" knapsack formulation and a Tabu algorithm for the daily photograph scheduling of an earth observation satellite. Computational Optimization and Applications, 20(2): 137-157, 2001 Kluwer. (postscript) (pdf)
57. Michel Vasquez and Jin-Kao Hao, Une approche hybride pour le problème de sac-à-dos multidimensionnel. RAIRO Operational Research 35(4): 415-438, 2001. (pdf)  EDP Sciences©
58. Pierre Collet, Cyril Fonlupt, Jin-Kao Hao, Evelyne Lutton, Marc Schoenauer (Ed.), Lecture Notes in Computer Science 2310, Springer-Verlag, ISBN 3-540-43544-1, 2002. Selected Papers Selected papers from the 5th European Conference on Artificial Evolution (AE-01), Le Creusot, France, Oct. 2001.
59. Mériéma Bélaidouni and Jin-Kao Hao, Analysis of the configuration space of the maximal constraint satisfaction problem. Lecture Notes in Computer Science 1917: 49-58, Springer-Verlag, 2000 (postscript) (pdf) Springer©
60. Mériéma Bélaidouni and Jin-Kao Hao, Landscapes of the maximal constraint satisfaction problem. Lecture Notes in Computer Science 1829: 244-255, Springer-Verlag, 2000. (postscript) (pdf)  Springer©
61. Mériéma Bélaidouni and Jin-Kao Hao, A measure of combinational landscape difficulty for the Metropolis algorithm. Artificial Intelligence and Mathematics VI, Fort Lauderdale, Florida, January 2000. (postscript)
62. Jean-Philippe Hamiez and Jin-Kao Hao, Recherche tabou et planification de rencontres sportives Tabu Search and sports league scheduling. RFIA 2000, Paris, Jan. 2000. (pdf)
63. Cyril Fonlupt, Jin-Kao Hao, Evelyne Lutton, Edmund Ronald and Marc Schoenauer (Eds.), Selected papers from the 4th European Conference on Artificial Evolution (EA-99), Dunkerque, France, Nov. 2000, Lecture Notes in Computer Science 1829, ISBN-3-540-67846-8, Springer, 349 pages, 2000.
64. Philippe Galinier and Jin-Kao Hao, Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization. 3(4): 379-397, 1999. Kluwer. (Draft version is here postscript or pdf)
65. Jin-Kao Hao, Philippe Galinier and Michel Habib, Metaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes. Revue d'Intelligence Artificielle, 13(2): 283-324, 1999. Hermes. (Draft version postscript or pdf)
66. Raphaël Dorne and Jin-Kao Hao, A new genetic local search algorithm for graph coloring. Lecture Notes in Computer Science 1498: 745-754, Springer-Verlag, Sept. 1998. (Best Paper Nominee, Parallel Problem Solving from Nature - PPSN V, Amsterdam, The Netherlands, Sept, 1998) (postscript) (pdf)  Springer©
67. Jin-Kao Hao, Raphaël Dorne and Philippe Galinier, Tabu search for frequency assignment in mobile radio networks. Journal of Heuristics, 4(1): 47-62, 1998. Kluwer. (Draft version is here postscript or pdf)
68. Raphaël Dorne and Jin-Kao Hao, Tabu search for graph coloring, T-colorings and set T-colorings. "Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization", Chapter 6, pp77-92, S. Voss, S. Martello, I.H. Osman and C. Roucairol (Eds.), Kluwer, 1998. (Draft version is here postscript or pdf)
69. Philippe Galinier and Jin-Kao Hao, Solving the progressive party problem by local search. "Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization", Chapter 29, pp418-432, S. Voss, S. Martello, I.H. Osman and C. Roucairol (Eds.), Kluwer, 1998. (Draft version is here postscript or pdf)
70. Jin-Kao Hao, Evelyne Lutton, Edmund Ronald, Marc Schoenauer and D. Snyers (Eds.), Proc. of European Conference on Artificial Evolution (AE-97), Nimes, Oct. 1997, Lecture Notes in Computer Science 1363, ISBN 3-540-64169-6, Springer-Verlag, 349 pages, February 1998.
71. Jin-Kao Hao and Jérôme Pannier, Simulated annealing and tabu search for constraint solving. Artificial Intelligence and Mathematics V, Electronic Proceeding http://rutcor.rutgers.edu/~amai/Proceedings.html, January 1998. (postscript) (pdf)
72. Jin-Kao Hao and Jérôme Pannier, Etude expérimentale de recherche locale pour la résolution de contraintes. 11eme Congres on Reconnaissance des Formes et Intelligence Artificielle, Vol. II, pp97-106, Jan. 1998. (postscript) (pdf)
73. Philippe Galinier and Jin-Kao Hao, Tabu search for maximal constraint satisfaction problems. Lecture Notes in Computer Science 1330: 196-208, Springer-Verlag, Nov., 1997. (postscript) (pdf)  Springer©
74. Raphaël Dorne and Jin-Kao Hao, Constraint handling in evolutionary search: a case study on frequency assignment. Lecture Notes in Computer Science 1141 : 801-810, Springer-Verlag, Sept. 1996. (postscript) (pdf)  Springer©
75. Jin-Kao Hao and Raphaël Dorne, Empirical studies of heuristic local search for constraint solving. Lecture Notes in Computer Science 1118: 194-208, Springer-Verlag, Aug. 1996. (postscript) (pdf)  Springer©
76. Jin-Kao Hao and Laurent. Tetart, CH-SAT: a complete procedure for satisfiability problems. ECAI'96 Workshop on Advances in Propositional Deduction, pp27-38, Aug. 1996. (postscript) (pdf)
77. Raphaël Dorne and Jin-Kao Hao, An evolutionary approach for frequency assignment in cellular radio networks. Proc. of IEEE Intl. Conf. on Evolutionary Computation, Perth, Australia, Nov.-Dec. 1995, IEEE Press. pp539-544. (postscript) (pdf)
78. Jin-Kao Hao and Raphaël Dorne, Study of genetic search for the frequency assignment problem. Lecture Notes in Computer Science 1063: 333-344, Springer-Verlag, Sept. 1995. (postscript) (pdf) Springer©
79. Jin-Kao Hao, A clausal genetic representation and its related evolutionary procedures for satisfiability problems. Proc. of Intl. Conf. on Artificial Neural Nets & Genetic Algorithms, Springer-Verlag, pp289-292, April 1995. (postscript) (pdf)  Springer©
80. Jin-Kao Hao and Raphaël Dorne, A new population-based method for satisfiability problems. Proc. of 11th European Conf. on Artificial Intelligence (ECAI-94), John Wiley & Sons, pp135-139, Amsterdam, Aug. 1994. (postscript) (pdf)
81. Jin-Kao Hao and Raphaël Dorne, An empirical comparison of two evolutionary methods for satisfiability problems. Proc. of IEEE Intl. Conf. on Evolutionary Computation, IEEE Press, pp450-455, June-July 1994.

Thesis and tutorial

1. Jin-Kao Hao, Metaheuristics for combinatorial optimization (slides of a tutorial). April 2001 (English version is here pdf) (French version is here pdf)

2. Jin-Kao Hao, Metaheuristics for combinatorial optimization and constrained solving (in French). Habilitation thesis (Professorship Diploma), Univerisity of Montpellier II, January 1998.

3. Jin-Kao Hao, A study of partial evaluation for constraint logic programming (in French). Ph.D thesis, University of Burgundy, February 1991.

Back to: Homepage Beginning, Computer Science Lab. LERIA, Department of Computer Science, Faculty of Sciences, University of Angers, City of Angers, France