Research Group
"Metaheuristics, Optimization and Applications"

Dr. Jin-Kao Hao (郝进考)
 Professor (Computer Science)
(Professeur des Universités de classe exceptionnelle)

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

Our work is about modern metaheuristics and intelligent search methods 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 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...

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

• community detection in complex networks
• 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 and nurse rostering
• sports league scheduling
• progressive party problem...

and for general NP-hard problems such as:

• graph coloring and maximum clique
• graph partitioning, graph bisection and max cut
• (maximal) constraint satisfaction problems (CSP and MCSP) and satisfiability (SAT and Max-SAT)
• quadratic optimization and quadratic assignment
• linear arrangement and bandwidth minimization
• 2D strip packing
• multidimensional knapsack...

• biomakers identification and regulation networks
• gene selection, classification and biclustering of microarray data
• phylogeny reconstruction and maximum parsimony
• protein subcellular localization

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

• Identification of biomarkers using integration of omics data  (PHC Cai Yuanpei Sino-French Program, 2011-2012)
• Adaptive and intelligent search for optimization (Pays de La Loire Regional Project, 2009-2012)
• LigeRO (Operations research) (Pays de La Loire Regional Project, 2009-2013)
• BIL (BioInformatique Ligérienne, Pays de La Loire Regional Project 2007-2011)
• Integrated Vehicule and Crew Scheduling (CIFRE with PERINFO SA, 2004-2007, 2005-2008)
• 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

• Una Benlic (Regional scholarship, PhD starting in Oct 2009, defense planned for Nov. 2012)
• Yan Jin (CSC Sclolarship, from Huazhong University of Science and Technology, Wuhan, China, PhD starting in Sept. 2011, co-supervisor Dr. JP Hamiez)
• Yang Wang  (CSC Sclolarship, from Northwestern Polytechnical University, Xian, China, PhD starting in Oct 2009, defense planned for February 2013)
• Qinghua Wu (CSC Sclolarship, from Huazhong University of Science and Technology, Wuhan, China, PhD starting in Oct 2009, defense planned for February 2013)
• Rongqiang Zeng (CSC Sclolarship, from University of Electronic Science and Technology of China, Chengdu, PhD starting Dec. 2008, defense planned for June 2012, co-supervisor Dr. M. Basseur)

(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

1. Wassim Ayadi (Assistant Professor at the Faculty of Sciences of Tunis, Tunisia, co-supervisor Dr. M. Elloumi, PhD defense Dec. 2011)
2. Vincent Barichard (Assistant Professor at the Université d'Angers, PhD defense in 2003, from the Université d'Angers)
3. Meriema Belaidouni (Post-doc at the Institut National de Telecommunications, Paris, PhD defense in 2001, from the Université Houari Boumédiène, Algeria)
4. Edmondo Bonilla Huerta (Assistant Professor at the Instituto Tecnologico Apizaco, Tlaxcala, Mexico,  PhD defense in November 2008, Mexican COSNET scholarship, from the Instituto Tecnologico Apizaco, co-supervisor Dr. B. Duval, )
5. Marc-Olivier Buob (R&D Engineer, PhD defense in November 2008, 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. J.J. Lutton, France Telecom R&D)
6. Alain Chabrier (ODMS Tools and Platforms R&D Director, ILOG, an IBM Company, Madrid, PhD defense in 2003, from the Ecole Polytechnique, Paris)
7. Daniela Claro (Associate Professor, Universidade Federal da Bahia, Brasil, co-supervisor Dr. P. Albers, PhD defense in 2006, from Universidade Federal de Santa Catarina, Brazil)
8. Herve Deleau (Teaching and Research Assistant, PhD defense in 2005, from the Université d'Amiens, co-supervisor Dr. F. Saubion)
9. Vincent Derrien (Assistant Professor at the Higher Engineering School ESIGELEC, Regional scholarship, graduated from the Université d'Angers, PhD defense in March 2008, co-supervisor Dr. J.M. Richer)
10. 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)
11. Philippe Galinier (Associate Professor at the Ecole Polytechnique de Montreal, Canada, PhD defense in 1999, from the Université de Montpellier II)
12. Adrien Goeffon (Assistant Professor at the Université d'Angers,, co-supervisor Dr. J.M. Richer, PhD defense in 2006, from the Université d'Angers)
13. Giglia Gomez-Villouta (Professor at the Universidad de Valparaiso, Chile, co-supervisor Dr. J.P. Hamiez, PhD defense in Sept 2010)
14. Valérie Guihaire (R&D Engineer, PhD defense in December 2009, Industrial research grant CIFRE with PERINFO SA, from the Université Catholique de l'Ouest)
15. Jean-Philippe Hamiez (Assistant Professor at the Université d'Angers, PhD defense in 2002, from the Université d'Amiens)
16. José Crispin Hernandez Hernandez (Assistant Professor at the Instituto Tecnologico Apizaco, Tlaxcala, Mexico, PhD defense in November 2008, Mexican COSNET scholarship, from the Instituto Tecnologico Apizaco, co-supervisor Dr. B. Duval, )
17. Frederic Lardeux (Assistant Professor at the Université d'Angers, co-supervisor Dr. F. Saubion, PhD defence in 2005, from the Université d'Angers)
18. Samir Laroum (Teaching and Research Assistant Regional scholarship, at the Université d'Angers, co-supervisors Dr. Beatrice Duval and Dr. D. Tessier, PhD defense  in Nov 2011, Regional scholarship, from Université de Montouri Constantine, Alegeria, Master of Université de Montpellier, France)
19. Benoit Laurent (R&D team leader at PERINFO SA, PhD defense in December 2008, Industrial research grant CIFRE with PERINFO SA, from the Université d'Angers)
20. Hakim Mabed (Assistant Professor at the Université de Franche-Comté, co-supervised by Dr. A. Caminada, France Telecom R&D, PhD defense in 2003)
21. Nicolas Pech-Gourg (Assistant Professor at the Higher Engineering School IMERIR, France, PhD defense in 2002, from the Ecole des Mines d'Alès)
22. Daniel Porumbel (Assistant Professor at the Université d'Artois, co-supervisor Dr. P. Kuntz, Polytech'Nantes, joint Master of the Polytech'Nantes and the Université "Politehnica" de Bucarest, Romania, PhD defense in Nov. 2009)
23. Eduardo A. Rodriguez-Tello (Researcher at the Cinvestav Tamaulipas, Mexican CONACyT scholarship, PhD defense in July 2007, from ITESM Cuernavaca, Mexico, in cooperation with Dr. J. Torres-Jimenez)
24. Michel Vasquez (Director of the LGI2P Lab at the National Higher Engineering School "Ecole des Mines d'Ales", France, PhD defense in 2000, from the Ecole des Mines d'Alèes )

• Zhanghua Fu (since March 2012, PhD from Huazhong University of Science and Technology)
• Zhipeng Lu (2007-2011, PhD from Huazhong University of Science and Technology, Research Professor at HUST, China since March 2011)
• Manuel Clergue (2000-2001, PhD from Université de Nice, Assistant Professor at Université de Nice since 2001, Associate Professor at Université des Antilles et de la Guyane since 2010)
• 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 holds a full Professor position in the Department of Computer Science of the University of Angers (France) since 1999. He was nominated Distinguished Professor (Professeur de classe exceptionnelle) in 2010 by the French National Council of Universities (CNU 27). He is currently the Director of the LERIA Laboratory (Angers Computer Science Lab, ranked "A" in 2007, 2011 by AERES, the French National Research Evaluation Agency) and the initial founder of the leading research group "Metaheuristics, Optimization and Applications" (ranked 'A+'). Before joining the University of Angers, he has been an Associate Professor at the National Higher Engineering School "Ecole des Mines d'Ales" (EERIE Campus at Nîmes) and head of the "Constraints and Heuristics" research group until September 1999. He is the holder of the French National Research and Doctoral Supervision Awards (PEDR).

His research focuses on the solution of large-scale combinatorial search problems and on the design of effective heuristic and metaheuristic methods for practical applications. He is known for his contributions to the solution of significant NP-hard problems like graph coloring and maximum clique, bandwidth and linear arrangement minimization, graph partitioning, SAT, multidimensional 0-1 knapsack problem, unconstrained quadratic binary optimization, constraint satisfaction as well as various applications in the areas of bioinformatics, data mining, telecommunication networks and transportation, among others. 

His work has been featured in top International Conferences (AE, CP, CPAIOR, ECAI, EvoBIO, EvoCOP, EMO, GECCO, IEEE CEC, ICTAI, IJCAI, MIC, PPSN) and Journals (Annals of Operations Research, Applied Soft Computing, European J. of Operational Research, Computers & Industrial Engineering, Computers & Operations Research, Discrete Applied Mathematics, 4OR, Evolutionary Computation, IEEE Transactions on Evolutionary Computation, IEEE/ACM Trans. on Computational Biology and Bioinformatics, BioData Mining, Bioinformatics, Briefings in Bioinformatics, BMC Bioinformatics, Genomics Proteomics & Bioinformatics, J. of Combinatorial Optimization, Computational Optimization and Applications, J. of Heuristics, Intl. J. of Metaheuristics, Intl. J. of Applied Metaheuristic Computing, Intl. J. of Mathematics in Operational Research, J. of Mathematical Modelling and Algorithms, Intl J. of Mobile Network Design & Innovation, Knowledge-based Systems, Knowledge and Information Systems, Natural Computing and Applications, Neurocomputing, RAIRO Operations Research, Transportation Research). His work with his co-authors has been recognized by several awards (Bronze Medal at the Nurse Rostering Competition 2010, Silver Medal at the PATAT-WATT 2007 ITC Competition, EvoCOP 2009, MICAI 2006, PPSN 1996 best paper awards or nominees) and received multiple citations. His work includes more than 150 peer-reviewed publications in international journals, book chapters and conference proceedings in the fields of Metaheuristics, Evolutionary Computation, Combinatorial Optimization, Bioinformatics, Constraint Programming and Artificial Intelligence.

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 nurse rostering. He has initiated a number of large 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 Biogenouest, the CPER "Post-Genome" and Regional Bioinformatics and Operational Research programs. He is involved in several internatinal collaboration programs, in particular with China, Canada, Mexico, Tunisia and USA.

Dr. Hao has served as an Invited Member of more than 140 Program Committees of some 30 International and National Conferences and serves regularly as a reviewer for some 35 well-established Journals in his research domain. He served as the Program co-chair or General chair for several Conferences (in particular, EvoCOP 2011, EvoCOP 2012, AE 2011, EMO 2009, Area Chair for ICTAI 2010, 2011). He is on the Editorial Board of 4 International Journals and participated in the organization of several Conferences and Workshops in addition to co-editing 7 volumes of Springer LNCS series. In his capacity as a Professor, he has supervised 24 defended PhD theses till 2011 and served on more than 90 PhD Examination Boards (in France and abroad).

Dr. Hao has held or still holds a number of national responsabilities including Panel Member of the SIMI 2 Board (Basic Research and International Joint Research) for the French National Research Agency ANR; Member of the National Jury for attibuting the "Research Excellence Prize"; Invited Expert of proposal evaluation for foreign research agencies (Canada, China, Slovakia, Swiss, UK); Member of the Jury for the French OR Society Roadef's "Robert Faure Prize"; Member of Regional Jury for the "5th National Challenge for Hi-Tech Company Creation" of the French Research and New Technology Ministry; External member of Searching Committee for several Universities.

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. 1987) from the National Institute of Applied Sciences (INSA Lyon, France), the Ph.D. in Constraint Programming (Feb. 1991, from the University of Franch-Comté, suppervised by Prof. Jean-Jacques Chabrier of the University of Burgundy, Dijon, France) and the Professorship Diploma HDR (Habilitation a Diriger des Recherches) (Jan. 1998) from the University of Montpellier II (France).

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

(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. Jin-Kao Hao. Memetic Algorithms in Discrete Optimization. In F. Neri, C. Cotta, P. Moscato (Eds.) Handbook of Memetic Algorithms. Studies in Computational Intelligence 379,  Chapter 6, pages 73-94, 2011. Draft (pdf) Springer©
2. Una Benlic and Jin-Kao Hao. Hybrid metaheuristics for the graph partitioning problem. In EG Talbi (Ed.) Hybrid Metaheuristics. Studies in Computational Intelligence, Chapter 9, 2012. Draft (pdf) Springer©
3. Philippe Galinier, Jean-Philippe Hamiez, Jin-Kao Hao, Daniel Cosmin Porumbel. Recent advances in graph vertex coloring. In I. Zelinka, A. Abraham, V. Snasel (Eds.) Handbook of Optimization. 2012. Draft (pdf) Springer©.
4. Zhipeng Lü, Fred Glover, Jin-Kao Hao. Neighborhood Combination for Unconstrained Binary Quadratic Problems. In M. Caserta and S. Voss (Eds.): MIC-2009 Post-Conference Book, Chapter 4, pages 49-61, 2012 (pdf), Springer©. 
5. Jin-Kao Hao, Christine Solnon. Méta-heuristiques et IA. In P. Marquis, O. Papini, H. Prade (Eds.) Panorama actuel de l'IA - ses bases méthodologiques et ses développement. Tome II, chapitre 28,  Draft (pdf) Hermes, 2012.
6. Adelaide Freitas, Wassim Ayadi, Mourad Elloumi, José Luis Oliveira, Jin-Kao Hao. A survey on biclustering of gene expression data. In M. Elloumi, A.Y. Zomaya (Eds.) Algorithms in Computational Biology. Chapter 2, 2012. Draft (pdf) Wiley
7. Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao, Heuristic methods for phylogenetic reconstruction with maximum parsimony. In M. Elloumi, A.Y. Zomaya (Eds.) Algorithms in Computational Molecular Biology - Techniques, Approaches and Applications. Chapter 25, pages 579-598, 2011. Draft (pdf) Wiley
8. Oliver Bailleux and Jin-Kao Hao, Stochastic search algorithms (in French). In L. Sais (Ed.), "Problem SAT: progresses and challenges", Chapter 5, Draft (pdf), Hermes, 2008. 
9. 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.
10. Daniela Claro, Patrick Albers, Jin-Kao Hao, Web services composition. In J. Cardoso, Sheth, Amit (Eds.) Semantic Web Services, Processes and Applications, Chapter 8, 2006, (pdf)  Springer©
11. Jean-Philippe Hamiez, 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). 
12. 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, Hermes, 2002.
13. Raphaël Dorne, 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, C. Roucairol (Eds.), Kluwer, 1998. (pdf)
14. Philippe Galinier, 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, C. Roucairol (Eds.), Kluwer, 1998. (Draft version pdf)

1. Qinghua Wu and Jin-Kao Hao. An effective heuristic algorithm for sum coloring of graphs. Computers & Operations Research 39(7): 1593-1600, 2012. (pdf, doi) Elsevier©
2. Qinghua Wu and Jin-Kao Hao. Coloring large graphs based on independent set extraction. Computers & Operations Research 39(2): 283-290, 2012. (pdf, doi) Elsevier©
   
3. Qinghua Wu, Jin-Kao Hao, Fred Glover. Multi-neighborhood tabu search for the maximum weight clique problem. Accepted to Annals of Operations Research March 2012. (pdf, doi) Springer© (Program Code is HERE)
4. Qinghua Wu and Jin-Kao Hao. An adaptive multistart tabu search approach to solve the maximum clique problem. Accepted to Journal of Combinatorial Optimization Nov. 2011. (pdf, doi) Springer©
5. Qinghua Wu and Jin-Kao Hao. An extraction and expansion approach for graph coloring. Accepted to Asia-Pacific Journal of Operational Research and to appear in 2012. (pdf, doi) World Scientific©
6. Una Benlic and Jin-Kao Hao. A multilevel memetic approach for improving graph k-partitions. IEEE Transactions on Evolutionary Computation 15(5): 624-472, 2011. (pdf, doi) IEEE CSP©
7. Una Benlic and Jin-Kao Hao. An effective multilevel tabu search approach for balanced graph partitioning. Computers & Operations Research 38(7): 1066-1075, 2011. (pdf, doi) Elsevier©
8. Jin-Kao Hao and Una Benlic. Lower Bounds for the ITC-2007 Curriculum-Based Course Timetabling Problem. European Journal of Operational Research 212(3): 464-472, 2011. (pdf, doi) Elsevier©
9. Zhipeng Lü and Jin-Kao Hao. Adaptive neighborhood search for nurse rostering. European Journal of Operational Research  218(3): 865-876, 2012. (pdf, doi) Elsevier©
10. Zhipeng Lü and Jin-Kao Hao. Adaptive memory-based local search for Max-SAT. Accepted to Applied Soft Computing, Feb. 2012. (pdf, doi) Elsevier©.
11. Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao. Probabilistic GRASP-tabu search algorithms for the UBQP problem. Accepted to Computers & Operations Research Dec. 2011. (pdf, doi) Elsevier©
12. Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao. Backbone guided tabu search for solving the UBQP problem. Accepted to Journal of Heuristics Sept. 2011 (pdf, doi) Springer©
13. Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao. BiMine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data. Accepted to Knowledge-based Systems April 2012. Draft (pdf, doi) Elsevier©
14. Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao. BicFinder: A Biclustering Algorithm for Microarray Data Analysis.  Knowledge and Information Systems: An International Journal 30(2): 341-358, 2012 (pdf, doi) Springer©
15. Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao. Pattern-driven neighborhood search for biclustering of microarray data. Accepted to BMC Bioinformatics 13(Suppl 7):S11, 2012. Draft (pdf, doi) BioMed Central©
16. Xiujun Zhang, Xing-Ming Zhao, Kun He, Le Lu, Yongwei Cao, Jingdong Liu, Jin-Kao Hao, Zhi-Ping Liu, Luonan Chen. Inferring gene regulatory networks from gene expression data by PC-algorithm based on conditional mutual information. Bioinformatics, 28(1): 94-104, 2012. Draft (pdf, doi) Oxford Journals©
17. Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover. A Simple and Effective Algorithm for the MaxMin Diversity Problem. Annals of Operations Research 186(1): 275-293, 2011. Draft (pdf,doi) Springer©
18. Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. An Efficient Algorithm for Computing the Distance Between Close Partitions. Discrete Applied Mathematics 159: 53-59, 2011. Draft (pdf, doi) Elsevier©
19. Gary Kochenberger, Jin-Kao Hao, Zhipeng Lü, Haibo Wang, Fred Glover. Solving large scale max cut problems via tabu search. Accepted to Journal of Heuristics to appear in 2012 (pdf, doi) Springer©
20. Zhipeng Lü, Jin-Kao Hao, Fred Glover. Neighborhood Analysis: A Case Study on Curriculum-Based Course Timetabling. Journal of Heuristics 17(2): 97-118, 2011. (pdf, doi) Springer©
21. Hakim Mabed, Alexandre Caminada, Jin-Kao Hao. Genetic Tabu Search for robust channel assignment under dynamic traffic data. Computational Optimization and Applications 50(3): 483-506, 2011.  (pdf,doi)  Springer©
22. Fred Glover and Jin-Kao Hao. The Case for Strategic Oscillation. Annals of Operations Research 183(1): 163-173, 2011. Draft (pdf,doi) Springer© 
23. Fred Glover, Jin-Kao Hao, Gary Kochenberger. Polynomial unconstrainted binary optimisation - Part 1.  International Journal of Metaheuristics 1(3):232-256, 2011. Draft (pdf), Inderscience Publishers©
24. Fred Glover, Jin-Kao Hao, Gary Kochenberger. Polynomial unconstrainted binary optimisation - Part II. International Journal of Metaheuristics 1(4): 317-354, 2011. Draft (pdf), Inderscience Publishers©
25. Zhipeng Lü, Fred Glover, Jin-Kao Hao. A Hybrid Metaheuristic Approach to Solving the UBQP Problem. European Journal of Operational Research 207(3): 1254-1262, 2010. (pdf, doi) Elsevier© 
26. Zhipeng Lü and Jin-Kao Hao. A Memetic Algorithm for Graph Coloring. European Journal of Operational Research 203(1): 241-250, 2010. Draft (pdf, doi) Elsevier© (Program Code is HERE, Readme is HERE)
27. Zhipeng Lü and Jin-Kao Hao. Adaptive Tabu Search for Course Timetabling. European Journal of Operational Research 200(1): 235-244, 2010. Draft (pdf, doi) Elsevier© 
28. Fred Glover, Zhipeng Lü, Jin-Kao Hao. Diversification-Driven Tabu Search for Unconstrained Binary Quadratic Problems. 4OR -A Quarterly Journal of Operations Research 8(3): 239-253, 2010. Draft (pdf, doi) Springer© 
29. Matthieu Basser, Rongqiang Zeng, Jin-Kao Hao. Hypervolume-based multi-objective local search. Accepted to appear in Natural Computing and Applications Oct. 2010, Draft (pdf,doi)  Springer©,
30. Jean-Philippe Hamiez, Jin-Kao Hao, Fred Glover. A Study of Tabu Search for Coloring Random 3-colorable Graphs Around Phase Transition. International Journal of Applied Metaheuristic Computing 1(4): 1-24, 2010. Draft (pdf, doi), IGI Global©.
31. Giglia Gomez Villouta, Jean-Philippe Hamiez, Jin-Kao Hao. A Reinforced Tabu Search Approch for 2D Strip Packing. International Journal of Applied Metaheuristic Computing 1(3): 20-36, 2010. Draft (pdf, doi) IGI Global©. 
32. Fred Glover and Jin-Kao Hao. Fast 2-flip Move Evaluations for Binary Unconstrained Quadratic Optimization Problems. International Journal of Metaheuristics 1(2):100-107, 2010. Draft (pdf), Inderscience Publishers©
33. Fred Glover and Jin-Kao Hao. Efficient Evaluation for Solving 0-1 Unconstrained Quadratic Optimization Problems. International Journal of Metaheuristics 1(1): 3-10, 2010. Draft (pdf), Inderscience Publishers©
34. Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. An Evolutionary Approach with Diversity Guarantee and Well-Informed Grouping Recombination for Graph Coloring. Computers & Operations Research 37(10): 1822-1832, 2010. Draft (pdf, doi) Elsevier©
35. Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. A Search Space Cartography for Guiding Graph Coloring Heuristics. Computers & Operations Research 37(4): 769-778, 2010. Draft (pdf, doi) Elsevier©
36. Edmundo Bonilla Huerta, Béatrice Duval, Jin-Kao Hao, A Hybrid LDA and Genetic Algorithm for Gene Selection and Classification of Microarray Data. Neurocomputing 73(13-15): 2375-2383, 2010. Draft (pdf, doi) Elsevier© (Extended version of PRIB'08 paper)
37. Béatrice Duval and Jin-Kao Hao. Advances in Metaheuristics for Gene Selection and Classification of Microarray Data. Briefings in Bioinformatics 11(1): 127-141, 2010. Draft (pdf), Oxford Journals©
38. Valérie Guihaire and Jin-Kao Hao. Transit Network Timetabling and Vehicle Assignment for Regulating Authorities. Computers & Industrial Engineering 59(1): 16-23, 2010. Draft (pdf, doi) Elsevier©
39. Benoit Laurent and Jin-Kao Hao. Iterated Local Search for the Multiple Depot Vehicle Scheduling Problem. Computers & Industrial Engineering 57(1): 277-286, 2009. Draft (pdf), Elsevier©
40. Benoit Laurent and Jin-Kao Hao. List Graph Coloring for Multi-depot Vehicle Scheduling. International Journal of Mathematics in Operational Research 1(1-2): 228-245, 2009. Draft (pdf), Inderscience Publishers©
41. Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao. A Biclustering Algorithm based on a Bicluster Enumeration Tree: Application to DNA Microarray Data. BioData Mining 2:9, 2009. Draft (pdf, doi), Springer©
42. Jean-Philippe Hamiez, 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©
43. Eduardo Rodriguez-Tello, Jin-Kao Hao,  José Torres-Jimenez. An improved Simulated Annealing algorithm for bandwidth minimization. European Journal of Operational Research 185(3): 1319-1335, 2008. Draft (pdf) Elsevier©
44. 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©
45. 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©
46. 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.
47. 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, 2008. Draft (pdf) Elsevier©
48. 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©
49. 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©
50. José Crispin Hernandez Hernandez, Béatrice Duval and Jin-Kao Hao. A counting technique based on SVM-RFE for selection and classification of microarray data. Research in Computing Science 23: 99-107, 2006.
51. 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©.
52. 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©.
53. 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©. 
54. 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)  Springer©
55. 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) Elsevier©. 
56. 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. Draft (postscript) (pdf)  Springer©
57. 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, Hermes, 2003.
58. Michel Vasquez and Jin-Kao Hao, A heuristic approach for antenna positioning in cellular networks. Journal of Heuristics 7(5): 443-472, 2001. (postscript) (pdf)  Springer©
59. 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. (postscript) (pdf)  Springer©
60. 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©
61. Philippe Galinier and Jin-Kao Hao, Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization. 3(4): 379-397, 1999. (Draft version pdf)  Springer©
62. 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. (Draft version pdf) Hermes. 
63. 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. Draft  (postscript or pdf)  Springer©

1. Una Benlic, Jin-Kao Hao. Breakout local search for maximum clique problems. Jan. 2012.
2. Olivier Gach, Jin-Kao Hao. Combined neighborhood tabu search for community detection in complex networks. Feb. 2012.
3. Una Benlic, Jin-Kao Hao. Breakout local search for the max-cut problem. Feb. 2012.
4. Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao. Path relinking for unconstrained binary quadratic programming. (Revised, March 2012).
5. Yang Wang, Jin-Kao Hao, Fred Glover, Zhipeng Lü. Solving the maximum clique and maximum vertex weight clique problems via binary quadratic programming. March 2012.
6. Yang Wang, Jin-Kao Hao, Fred Glover, Zhipeng Lü. Solving the minimum sum coloring problem via binary quadratic programming. May 2012.
7. Jin-Kao Hao, Qinghua Wu. Improving the extraction and expansion method for large graph coloring. Nov. 2011.
8. Qinghua Wu, Jin-Kao Hao. Memetic search for the max-bisection problem. (Revised, May 2012).
9. Una Benlic, Jin-Kao Hao. Breakout local search for the quadratic assignment problem. Nov. 2011.
10. Una Benlic, Jin-Kao Hao. Memetic search for the quadratic assignment problem. Feb. 2012.
11. Rongqiang Zeng, Mattieu Basseur, Jin-Kao Hao. Experiments on path relinking methods for hypervolume-based bi-objective optimization. March 2012.

1. Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao. A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization.  In N. Beldiceanu, N. Jussien, E. Pinson (Eds.): CPAIOR 2012, Lecture Notes in Computer Science 7298: 395-408, 2012. Draft (pdf) Springer©
2. Daniel Porumbel, Jin-Kao Hao, Pascale Kuntz. Spacing memetic algorithms. Proceedings of GECCO-2011, pages 1061-1068, July 12-16, 2011. Dublin, Ireland. Draft (pdf) ACM Press©.
3. Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao. Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming. In P. Merz, J.K. Hao. (Eds.): EvoCOP 2011, Lecture Notes in Computer Science 6622: 72-83, 2011. Draft (pdf) Springer©
4. Sami Laroum, Dominique Tessier, Béatrice Duval, Jin-Kao Hao. Multi-neighborhood search for discrimination of signal peptides and transmembrane segments. In M. Giacobini, M.D. Ritchie, C. Pizzuti (Eds.): EvoBIO 2011, Lecture Notes in Computer Science 6623: 134-145, 2011. Draft (pdf) Springer©
5. Yang Wang, Zhipeng Lü, Jin-Kao Hao. A Study of Multi-Parent Crossover Operator in a Memetic Algorithm. In R. Schaerfer et al. (Eds.): PPSN 2010, Lecture Notes in Computer Science 6238: 556-565, 2010. Draft (pdf) Springer©
6. Zhipeng Lü, Jin-Kao Hao, Fred Glover. A Study of Memetic Search with Multi-parent Combination for UBQP. In P.I. Cowling, P. Merz (Eds.): EvoCOP 2010, Lecture Notes in Computer Science 6022: 145-165, 2010. Draft  (pdf) Springer©
7. Una Benlic and Jin-Kao Hao. An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning. In E. Grégoire (Ed.): ICTAI 2010, pages 121-128, 2010. Draft (pdf)  IEEE CSP©
8. Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao. Iterated Local Search for Biclustering of Microarray Data. In T. Dijkstra et al. (Eds.). PRIB 2010, Lecture Notes in Bioinformatics 6282: 211-221, 2010. Draft (pdf) Springer©
9. Sami Laroum, Dominique Tessier, Béatrice Duval, Jin-Kao Hao. A Local Search Approach for Transmembrane Segment and Signal Peptide Discrimination. In C. Pizzuti, M.D. Ritchie, M. Giacobini (Eds.): EvoBIO 2010, Lecture Notes in Computer Science 6023: 134-145, 2010. Draft (pdf) Springer©
10. Giglia Gomez Villouta, Jean-Philippe Hamiez, Jin-Kao Hao.Tabu Search with Consistent Neighbourhood for Strip Packing. In C. Fyfe, N. Garcia-Pedrajas, F. Herrera, M. Ali (Eds.): IEA/AIE 2010, Lecture Notes in Artificial Intelligence 6096: 1-10, 2010. (pdf) Springer© 
11. Valérie Guihaire and Jin-Kao Hao. Improving Timetable Quality in Scheduled Transit Networks. In C. Fyfe, N. Garcia-Pedrajas, F. Herrera, M. Ali (Eds.): IEA/AIE 2010, Lecture Notes in Artificial Intelligence 2096: 21-30, 2010. (pdf) Springer©
12. Béatrice Duval, Jin-Kao Hao, José Crispin Hernandez Hernandez. A Memetic Algorithm for Gene Selection and Molecular Classification of Cancer. Proc. of 11th Annual Conference on Genetic and Evolutionary Computation (GECCO-09), pages 201-208, Montreal, Canada, July 2009. ACM Press. (pdf) ACM Press©
13. Jean-Michel Richer, Adrien Goëffon, Jin-Kao Hao. A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony. In C. Pizzuti, M.D. Ritchie, and M. Giacobini (Eds.): EvoBIO 2009, Lecture Notes in Computer Science 5483: 164-175, 2009. (pdf) Springer©
14. Zhipeng Lü and Jin-Kao Hao. A Critical Element-Guided Perturbation Strategy for Iterated Local Search. In C. Cotta and P. Cowling (Eds.): EvoCOP 2009, Lecture Notes in Computer Science 5482: 1–12. 2009. (pdf) Springer©. 
15. Jean-Philippe Hamiez, Julien Robet, Jin-Kao Hao. A Tabu Search Algorithm with Direct Representation for Strip Packing. In C. Cotta and P. Cowling (Eds.): EvoCOP 2009, Lecture Notes in Computer Science 5482: 61–72, 2009. (pdf) Springer©
16. Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. Position-Guided Tabu Search Algorithm for the Graph Coloring Problem. In T. Stuetzle (Ed.), selected papers from Learning and Intelligent OptimizatioN (LION III), Lecture Notes in Computer Science 5851: 148-162, 2009. (pdf) Springer©
17. Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms. In C. Cotta and P. Cowling (Eds.): EvoCOP 2009 (Best Paper Nominee), Lecture Notes in Computer Science 5482: 121–132, 2009. (pdf) Springer©.
18. Valérie Guihaire and Jin-Kao Hao. Transit network re-timetabling and vehicle scheduling? Le Thi Hoai An, Pascal Bouvry, Pham Dinh Tao (Eds.): MCO 2008, Communications in Computer and Information Science (CCIS) 14: 135-144, Springer, 2008 (pdf) Springer©
19. Edmundo Bonilla Huerta, Béatrice Duval and Jin-Kao Hao, Gene selection for Microarray data by a LDA-based genetic algorithm. Madhu Chetty, Alioune Ngom, Shandar Ahmad (Eds.): PRIB 2008, Lecture Notes in Bioinformatics 5265: 252-263, Springer-Verlag, 2008 (pdf) Sprigner©
20. 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©
21. 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©
22. 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©
23. 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© 
24. 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©
25. 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©
26. 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©
27. Giglia Gomez Villouta, Jean-Philippe Hamiez, Jin-Kao Hao. A dedicated genetic algorithm for two-dimensional non-guillotine strip packing. Proceedings of Sixth Mexican International Conference on Artificial Intelligence (MICAI 2007), Special Session, pages 264-274, 2007. (pdf) IEEE Press.
28. 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©
29. 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©
30. 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©
31. 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 available HERE.
32. 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©
33. 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©
34. 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©
35. 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©
36. 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©
37. 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.
38. 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)
39. 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©
40. 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©
41. 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©
42. 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)
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. 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©
45. 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©
46. 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©
47. 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©
48. 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©
49. 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)
50. 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)
51. 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©
52. 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©
53. 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)
54. 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)
55. 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©
56. 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.
57. 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)
58. 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 (RFIA-98), Vol. II, pp97-106, Jan. 1998. (postscript) (pdf)
59. 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©
60. 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, Sept. 1996. (postscript) (pdf)  Springer©
61. Jin-Kao Hao and Raphaël Dorne, Empirical studies of heuristic local search for constraint solving.Lecture Notes in Computer Science 1118: 194-208, Aug. 1996. (postscript) (pdf)  Springer©
62. 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)
63. 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)
64. Jin-Kao Hao and Raphaël Dorne, Study of genetic search for the frequency assignment problem. Lecture Notes in Computer Science 1063: 333-344, Sept. 1995. (postscript) (pdf) Springer©
65. 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, pp289-295, April 1995. (postscript) (pdf)  Springer©
66. 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)
67. 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 CEC-94), IEEE Press, pp450-455, June-July 1994.
68. Jin-Kao Hao, Jean-Jacques Chabrier. A partial evaluator and its application to constraint logic programming. Proc. of 3rd Intl. Conf. of Young Computer Scientists, pp2.23-2.28, Beijing, Chine, July 1993, Tsinghua University Press.
69. Jin-Kao Hao, François Trousset, Jean-Jacques Chabirer, Prototyping an Inconsistency Checking Tool for Software Process Models.  Proc. of The 4th Intl. Conf. on on Software Engineering and Knowledge Engineering (SEKE-92), pages 227-234, June, 15-20 1992, Capri, Italy. Knowledge Systems Institute 1992.
70. Jin-Kao Hao, Jean-Jacques Chabrier, A modular architecture for constraint logic programming. Proc. of 19th ACM Computer Science Conference (ACM CSC-91), San Antonio, ACM Press, pp203-210, March 1991.
71. Jin-Kao Hao, Jean-Jacques Chabrier, Combining partial evaluation and constraint solving: a new approach to constraint logic programming. Proc. of 2nd IEEE Intl. Conf. on Tools for Artificial Intelligence (ICTAI-90), pp494-500, Washington D.C., Nov. 1990, IEEE CS Press.
72. Jin-Kao Hao, Jean-Jacques Chabrier, A finite domaine constraint solver & its implementation in Prolog. Proc. of CIPS Information Technology Conference, pp1-12, Edmonton, Canada, Oct. 1990, CIPS Press.

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, Université de Franch-Comté (defended at the 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