Year: 2005
http://vanhemert.co.uk/publications/index.php?year=2005&bib=cv.bib&rss
bibtexbrowser v20101203Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
http://vanhemert.co.uk/publications/index.php?key=JTH2005&bib=cv.bib
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.
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics that exploit information about the partial colouring in an aim to improve performance. An evolutionary algorithm is used to drive the search. We compare the different strategies to each other on several very hard benchmarks and on generated problem instances, and show where the novel strategies improve the efficiency. cv.bib%3A%3AJTH200530 Mar 2005 00:00:00 +0000Property analysis of symmetric travelling salesman problem instances acquired through evolution
http://vanhemert.co.uk/publications/index.php?key=Hemert2005&bib=cv.bib
Property analysis of symmetric travelling salesman problem instances acquired through evolution (J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005.
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge about the efficiency of the two variants in relation to structural properties of the symmetric travelling salesman problem. cv.bib%3A%3AHemert200530 Mar 2005 00:00:00 +0000Genetic Programming, Proceedings of the 8th European Conference
http://www.springeronline.com/sgw/cda/frontpage/0,11855,3-40100-22-45347265-0,00.html?changeHeader=true
Genetic Programming, Proceedings of the 8th European Conference, (M. Keijzer, A. Tettamanzi, P. Collet, J. van Hemert, M. Tomassini, eds.), Springer, volume 3447, 2005.
cv.bib%3A%3AEuroGP200514 Mar 2005 00:00:00 +0000Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population
http://vanhemert.co.uk/publications/index.php?key=DLHP2005b&bib=cv.bib
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.
This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity discussed in the context of evolutionary biology. Partially defined solutions interact and evolve into aggregations until a full solution for the problem at hand is found. The impact of the initial population on the outcome and the dynamics of the process is evaluated using the domain of binary constraint satisfaction problems. cv.bib%3A%3ADLHP2005b04 Aug 2005 00:00:00 +0000Transition Models as an incremental approach for problem solving in Evolutionary Algorithms
http://dl.acm.org/authorize?N04343
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.
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model. It lets building units of a solution interact and then uses an evolutionary process to merge these units toward a full solution for the problem at hand. The paper provides a preliminary study on the evolutionary dynamics of this model as well as an empirical comparison with other evolutionary techniques on binary constraint satisfaction. cv.bib%3A%3ADLHP200525 Jul 2005 00:00:00 +0000Evolutionary Transitions as a Metaphor for Evolutionary Optimization
http://vanhemert.co.uk/publications/index.php?key=DLH2005&bib=cv.bib
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.
This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specifically it incorporates mechanisms for the emergence of increasingly complex individuals from the interaction of more simple ones. The biological principles for transition are outlined and mapped onto an evolutionary computation context. The class of binary constraint satisfaction problems is used to illustrate the transition mechanism. cv.bib%3A%3ADLH200509 Sep 2005 00:00:00 +0000