[7] | Discovering the suitability of optimisation algorithms by learning from evolved instances (K Smith-Miles, J van Hemert), In Annals of Mathematics and Artificial Intelligence, volume 61, 2011.
[bib] [pdf] [doi] |
[6] | Understanding TSP Dfficulty by Learning from Evolved Instances (KA Smith-Miles, J van Hemert, Y Lim), In Learning and Intelligent Optimization (C Blum, ed.), 2010.
[bib] |
[5] | Understanding TSP Difficulty by Learning from Evolved Instances (K Smith-Miles, J van Hemert, X Yu Lim), In Collective Optimization, 2010.
[bib] |
[4] | Evolving combinatorial problem instances that are difficult to solve (J van Hemert), In Evolutionary Computation, volume 14, 2006.
[bib] [pdf] |
[3] | Property analysis of symmetric travelling salesman problem instances acquired through evolution (J van Hemert), In Evol Comput in Comb Optim (G Raidl, J Gottlieb, eds.), Springer, volume 5, 2005.
[bib] |
[2] | Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation (J van Hemert, NB Urquhart), In Parallel Problem Solving from Nature (Xin Yao, Edmund Burke, Jose A Lozano, Jim Smith, Juan J Merelo-Guervós, John A Bullinaria, Jonathan Rowe, Peter Ti\vno Ata Kabán, Hans-Paul Schwefel, eds.), Springer, volume 3242, 2004.
[bib] [pdf] |
[1] | Evolving binary constraint satisfaction problem instances that are difficult to solve (J van Hemert), In IEEE Trans Evol Comput, IEEE Press, volume 4, 2003.
[bib] |