Publications of Dr Jano van Hemert
2015
[30]Evolutionary Computation and Constraint Satisfaction (), Chapter in Handbook of Computational Intelligence (Kacpryk, J, Pedrycz, W, eds.), Springer, . [bibtex] [doi]
2009
[29]The Evolutionary Transition Algorithm: Evolving Complex Solutions out of Simpler Ones ( and ), In Nature-Inspired Algorithms for Optimisation (Raymond Chiong, ed.), Springer, volume 193, . [bibtex]
2008
[28]Graph Colouring Heuristics Guided by Higher Order Graph Properties ( and ), In Evol Comput in Comb Optim (van Hemert, J, Cotta, C, eds.), Springer, volume 4972, . [bibtex]
[27]Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem ( and ), Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (Cotta, C, van Hemert, J, eds.), Springer, . [bibtex]
2006
[26]Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO (, and ), In Genetic and Evolutionary Computation (Maarten Keijzer et al., ed.), ACM, volume 2, . [bibtex] [pdf]
[25] Evolving combinatorial problem instances that are difficult to solve (), In Evolutionary Computation, volume 14, . [bibtex] [url]
[24]Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation ( and ), In Evol Comput in Comb Optim (J Gottlieb, G Raidl, eds.), Springer, volume 3906, . [bibtex] [pdf]
[23]Increasing the efficiency of graph colouring algorithms with a representation based on vector operations ( and ), In Journal of Software, volume 1, . [bibtex] [pdf]
2005
[22]Evolutionary Transitions as a Metaphor for Evolutionary Optimization (, and ), In Advances in Artificial Life (M Capcarrere, AA Freitas, PJ Bentley, CG Johnson, J Timmis, eds.), Springer, volume 3630, . [bibtex] [pdf]
[21]Transition Models as an incremental approach for problem solving in Evolutionary Algorithms (, , and ), In Genetic and Evolutionary Computation (H-G Beyer et al., ed.), ACM Press, volume 7, . [bibtex] [pdf]
[20]Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population (, and ), In Congress on Evolutionary Computation, IEEE Press, volume 7, . [bibtex] [pdf]
[19]Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring (, and ), In Evol Comput in Comb Optim (G Raidl, J Gottlieb, eds.), Springer, volume 3448, . [bibtex] [pdf]
2004
[18]Robust parameter settings for variation operators by measuring the resampling ratio ( and ), In Journal of Heuristics, volume 10, . [bibtex]
[17]A Study into Ant Colony Optimization, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems ( and ), In Evol Comput in Comb Optim (J Gottlieb, G Raidl, eds.), Springer, volume 3004, . [bibtex] [pdf]
[16]Binary Merge Model Representation of the Graph Colouring Problem (, and ), In Evol Comput in Comb Optim (J Gottlieb, G Raidl, eds.), Springer, . [bibtex] [pdf]
2003
[15] Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems (, and ), In IEEE Trans Evol Comput, volume 7, . [bibtex] [pdf]
[14]Evolving binary constraint satisfaction problem instances that are difficult to solve (), In IEEE Trans Evol Comput, IEEE Press, volume 4, . [bibtex] [pdf]
[13]A new permutation model for solving the graph k-coloring problem (, , , and ), In Kalmàr Workshop on Logic and Computer Science, . [bibtex] [pdf]
2002
[12]Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction ( and ), In Parallel Problem Solving from Nature (JJ Merelo, A Panagiotis, H-G Beyer, José-Luis Fernández-Villacañas, Hans-Paul Schwefel, eds.), Springer, volume 2439, . [bibtex]
[11]Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation (), In Applications of Evolutionary Computing (S Cagnoni, J Gottlieb, E Hart, M Middendorf, G Raidl, eds.), Springer, volume 5, . [bibtex] [pdf]
[10]Application of Evolutionary Computation to Constraint Satisfaction and Data Mining (), PhD thesis, Leiden University, . [bibtex]
[9]Use of Evolutionary Algorithms for Telescope Scheduling (, , , and ), In Integrated Modeling of Telescopes (Torben Anderson, ed.), The International Society for Optical Engineering (SPIE), volume 4757, . [bibtex] [pdf]
2001
[8]Evolutionary Computation in Constraint Satisfaction and Machine Learning — An abstract of my PhD. (), In Proceedings of the Brussels Evolutionary Algorithms Day (BEAD-2001) (Anne Defaweux, Bernard Manderick, Tom Lenearts, Johan Parent, Piet van Remortel, eds.), Vrije Universiteit Brussel (VUB), . [bibtex] [pdf]
2000
[7]Constraint Satisfaction Problems and Evolutionary Algorithms: A Reality Check (), In Artificial Intelligence (van den Bosch, A, H Weigand, eds.), volume 12, . [bibtex] [pdf]
1999
[6]SAW-ing EAs: adapting the fitness function for solving constrained problems ( and ), Chapter in New ideas in optimization (D Corne, M Dorigo, F Glover, eds.), McGraw-Hill, London, . [bibtex] [pdf]
1998
[5]Graph Coloring with Adaptive Evolutionary Algorithms (, and ), In Journal of Heuristics, Kluwer Academic Publishers, volume 4, . [bibtex]
[4]Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function (, , and ), In Parallel Problem Solving from Nature (AE Eiben, Th. Bäck, M Schoenauer, H-P Schwefel, eds.), Springer, . [bibtex]
[3]Extended abstract: Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function (, , and ), In Proceedings of the Xth Netherlands/Belgium Conference on Artificial Intelligence (NAIC'98) (la Poutré, JA, van den Herik, J, eds.), . [bibtex]
[2]Applying Adaptive Evolutionary Algorithms to Hard Problems (), Master's thesis, Leiden University, . [bibtex]
1997
[1]Comparison of the SAW-ing Evolutionary Algorithm and the Grouping Genetic Algorithm for Graph Coloring ( and ), Technical report TR-97-14, Leiden University, . [bibtex]
Powered by bibtexbrowser