Keywords: Constraint Satisfaction [rss]
2015
[31] Evolutionary Computation and Constraint Satisfaction (J. van Hemert), Chapter in Handbook of Computational Intelligence (J. Kacpryk, W. Pedrycz, eds.), Springer, 2015. [bib] [doi]
2009
[30] The Evolutionary Transition Algorithm: Evolving Complex Solutions out of Simpler Ones (T. Lenaerts, A. Defaweux, J.I. van Hemert), Chapter in Nature-Inspired Algorithms for Optimisation (Raymond Chiong, ed.), Springer, volume 193, 2009. [bib]
[29] Exploiting Fruitful Regions in Dynamic Routing using Evolutionary Computation (J.I. van Hemert, J.A. la Poutré), Chapter in Bio-inspired Approaches for the Vehicle Routing Problem (F. Pereira Babtista, J. Tavares, eds.), Springer, volume 161, 2009. [bib]
2008
[28] Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem (I. Juhos, J.I. van Hemert), Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta, J.I. van Hemert, eds.), Springer, 2008. [bib]
[27] Graph Colouring Heuristics Guided by Higher Order Graph Properties (I. Juhos, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (J. van Hemert, C. Cotta, eds.), Springer, volume 4972, 2008. [bib]
2006
[26] Increasing the efficiency of graph colouring algorithms with a representation based on vector operations (I. Juhos, J.I. van Hemert), In Journal of Software, volume 1, 2006. [bib]
[25] Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation (I. Juhos, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2006. [bib]
[24] Evolving combinatorial problem instances that are difficult to solve (J.I. van Hemert), In Evolutionary Computation, volume 14, 2006. [bib] [pdf]
[23] Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO (M. Gruber, J.I. van Hemert, G.R. Raidl), In Proceedings of the Genetic and Evolutionary Computation Conference (Maarten Keijzer et al., ed.), ACM, volume 2, 2006. [bib] [pdf]
2005
[22] Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring (I. Juhos, A. Tóth, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005. [bib]
[21] Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population (A. Defaweux, T. Lenaerts, J.I. van Hemert, J. Parent), In Proceedings of the Congress on Evolutionary Computation, IEEE Press, 2005. [bib]
[20] Transition Models as an incremental approach for problem solving in Evolutionary Algorithms (A. Defaweux, T. Lenaerts, J.I. van Hemert, J. Parent), In Proceedings of the Genetic and Evolutionary Computation Conference (H.-G. Beyer et al., ed.), ACM Press, 2005. [bib] [pdf]
[19] Evolutionary Transitions as a Metaphor for Evolutionary Optimization (A. Defaweux, T. Lenaerts, J.I. van Hemert), In Advances in Artificial Life (M. Capcarrere, A.A. Freitas, P.J. Bentley, C.G. Johnson, J. Timmis, eds.), Springer, 2005. [bib]
2004
[18] Binary Merge Model Representation of the Graph Colouring Problem (I. Juhos, A. Tóth, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2004. [bib]
[17] A Study into Ant Colony Optimization, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems (J.I. van Hemert, C. Solnon), In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2004. [bib]
[16] Robust parameter settings for variation operators by measuring the resampling ratio: A study on binary constraint satisfaction problems (J.I. van Hemert, T. Bäck), In Journal of Heuristics, volume 10, 2004. [bib]
2003
[15] A new permutation model for solving the graph k-coloring problem (I. Juhos, A. Tóth, M. Tezuka, P. Tann, J.I. van Hemert), In Kalmàr Workshop on Logic and Computer Science, 2003. [bib]
[14] Evolving binary constraint satisfaction problem instances that are difficult to solve (J.I. van Hemert), In Proceedings of the IEEE 2003 Congress on Evolutionary Computation, IEEE Press, 2003. [bib]
[13] Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems (B.G.W. Craenen, A.E. Eiben, J.I. van Hemert), In IEEE Transactions on Evolutionary Computation, volume 7, 2003. [bib] [pdf]
2002
[12] Use of Evolutionary Algorithms for Telescope Scheduling (R. Grim, M.L.M. Jansen, A. Baan, J.I. van Hemert, H. de Wolf), In Integrated Modeling of Telescopes (Torben Anderson, ed.), The International Society for Optical Engineering (SPIE), volume 4757, 2002. [bib]
[11] Application of Evolutionary Computation to Constraint Satisfaction and Data Mining (J.I. van Hemert), PhD thesis, Leiden University, 2002. (ISBN: 90-6734-057-X) [bib]
[10] Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation (J.I. van Hemert), In Applications of Evolutionary Computing (S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, G. Raidl, eds.), Springer, 2002. [bib]
[9] Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction (J.I. van Hemert, T. Bäck), In Parallel Problem Solving from Nature (J.J. Merelo, A. Panagiotis, H.-G. Beyer, José-Luis Fernández-Villacañas, Hans-Paul Schwefel, eds.), Springer, 2002. [bib]
2001
[8] Evolutionary Computation in Constraint Satisfaction and Machine Learning --- An abstract of my PhD. (J.I. van Hemert), 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), 2001. [bib]
2000
[7] Constraint Satisfaction Problems and Evolutionary Algorithms: A Reality Check (J.I. van Hemert), In Proceedings of the Twelfth Belgium/Netherlands Conference on Artificial Intelligence (A. van den Bosch, H. Weigand, eds.), 2000. [bib]
Powered by bibtexbrowser