{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:39:25Z","timestamp":1778863165854,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,8,2]],"date-time":"2008-08-02T00:00:00Z","timestamp":1217635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10489-008-0137-8","type":"journal-article","created":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T12:20:13Z","timestamp":1217593213000},"page":"96-121","source":"Crossref","is-referenced-by-count":7,"title":["The property analysis of evolutionary algorithms applied to\u00a0spanning tree problems"],"prefix":"10.1007","volume":"32","author":[{"given":"Sang-Moon","family":"Soak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moongu","family":"Jeon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,2]]},"reference":[{"key":"137_CR1","first-page":"57","volume-title":"Proceeding of the seventh international conference on genetic algorithms","author":"L Alternberg","year":"1997","unstructured":"Alternberg L (1997) Fitness distance correlation analysis: an instructive counterexample. In: Proceeding of the seventh international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 57\u201364"},{"issue":"2","key":"137_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2):154\u2013160","journal-title":"ORSA J Comput"},{"issue":"3","key":"137_CR3","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/4235.930313","volume":"5","author":"H Chou","year":"2001","unstructured":"Chou H, Premkumar G, Chu CH (2001) Genetic algorithms for communications network design-an empirical study of the factors that influence performance. IEEE Trans Evol Comput 5(3):236\u2013249","journal-title":"IEEE Trans Evol Comput"},{"key":"137_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4:63\u201386","journal-title":"J Heuristics"},{"key":"137_CR5","first-page":"194","volume-title":"Lecture notes in economics and mathematical systems","author":"N Deo","year":"1996","unstructured":"Deo N, Kumar N (1996) Computation of constrained spanning trees: a unified approach. In: Lecture notes in economics and mathematical systems, vol 450. Springer, Berlin, pp 194\u2013220"},{"key":"137_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-45712-7_8","volume-title":"Parallel problem solving in nature VII","author":"C Eckert","year":"2002","unstructured":"Eckert C, Gottlieb J (2002) Direct representation and variation operators for the fixed charge transportation problem. In: Parallel problem solving in nature VII. Lecture notes in computer science, vol 2439. Springer, Berlin, pp 77\u201387"},{"key":"137_CR7","series-title":"Lecture notes in computer science","first-page":"1","volume-title":"Evo worshop 2001","author":"T Gaube","year":"2001","unstructured":"Gaube T, Rothlauf F (2001) The link and node biased encoding revisited: bias and adjustment of parameters. In: Evo worshop 2001. Lecture notes in computer science, vol 2037. Springer, Berlin, pp\u00a01\u201310"},{"key":"137_CR8","volume-title":"Genetic algorithms and engineering design","author":"M Gen","year":"1997","unstructured":"Gen M, Chen R (1997) Genetic algorithms and engineering design. Wiley, New York. Also see (for Pr\u00fcfer encoding): http:\/\/www.ads.tuwien.ac.at\/publications\/bib\/pdf\/gottlieb-01.pdf"},{"key":"137_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-45356-3_34","volume-title":"Parallel problem solving in nature VI","author":"J Gottlieb","year":"2000","unstructured":"Gottlieb J, Eckert C (2000) A comparison of two representations for the fixed charge transportation problem. In: Parallel problem solving in nature VI. Lecture notes in computer science, vol 1917. Springer, Berlin, pp 345\u2013354"},{"key":"137_CR10","unstructured":"Gottlieb J, Julstrom BA, Raidl GR, Rothlauf F (2000) Pr\u00fcfer numbers: a poor representation of spanning trees of evolutionary search. Working papers in information systems. University of Bayreuth"},{"key":"137_CR11","first-page":"283","volume-title":"Proceedings of the 2000 genetic and evolutionary computation conference","author":"J Gottlieb","year":"2000","unstructured":"Gottlieb J, Raidl GR (2000) The effects of locality on the dynamics of decoder-based evolutionary search. In: Proceedings of the 2000 genetic and evolutionary computation conference. Morgan Kaufmann, San Francisco, pp 283\u2013290"},{"key":"137_CR12","first-page":"184","volume-title":"Proceedings the sixth international conference on genetic algorithm","author":"T Jones","year":"1995","unstructured":"Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings the sixth international conference on genetic algorithm. Morgan Kaufmann, San Francisco, pp 184\u2013192"},{"key":"137_CR13","first-page":"256","volume-title":"Genetic and evolutionary computation conference","author":"BA Julstrom","year":"2001","unstructured":"Julstrom BA (2001) The Bolb code: a better string coding of spanning trees for evolutionary search. In: Genetic and evolutionary computation conference. Morgan Kaufmann, San Francisco, pp\u00a0256\u2013261"},{"key":"137_CR14","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1023\/A:1011977126230","volume":"7","author":"M Krishnamoorthy","year":"2001","unstructured":"Krishnamoorthy M, Ernst A, Sharaiha Y (2001) Comparison of algorithms for the DC-MST. J Heuristics 7:587\u2013611","journal-title":"J Heuristics"},{"key":"137_CR15","doi-asserted-by":"crossref","unstructured":"Kruskal JB (1956) On the shortest spanning tree of a graph and the travelling salesman problem. In: Proceedings of the American mathematical society, vol 7, no 1, pp\u00a048\u201350","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"137_CR16","unstructured":"Manderick B, de Weger M, Spiessens P (1991) The genetic algorithm and the structure of the fitness landscape. In: The 4th international conference on genetic algorithms, pp\u00a0143\u2013150"},{"issue":"1","key":"137_CR17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1162\/106365600568103","volume":"8","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evol Comput 8(1):61\u201391","journal-title":"Evol Comput"},{"key":"137_CR18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/net.3230260305","volume":"26","author":"CC Palmer","year":"1995","unstructured":"Palmer CC, Kershenbaum A (1995) An approach to a problem in network design using genetic algorithms. Networks 26:151\u2013163","journal-title":"Networks"},{"key":"137_CR19","unstructured":"Palmer CC, Kershenbaum A (1994) Representating trees in genetic algorithms. In: Proceedings of the IEEE conference on evolutionary computation, pp 379\u2013384"},{"issue":"2","key":"137_CR20","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TEVC.2006.871249","volume":"10","author":"T Paulden","year":"2006","unstructured":"Paulden T, Smith DK (2006) From the dandelion code to the rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality. IEEE Trans Evol Comput 10(2):108\u2013123","journal-title":"IEEE Trans Evol Comput"},{"key":"137_CR21","unstructured":"Picciotto S (1999) How to encode a tree. PhD dissertation, University of California, San Diego"},{"key":"137_CR22","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R Prim","year":"1957","unstructured":"Prim R (1957) Shortest connection networks and some generalisations. Bell Syst Tech J 36:1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"137_CR23","doi-asserted-by":"crossref","unstructured":"Raidl GR (2000) An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. In: Proceedings of the IEEE CEC, pp 104\u2013111","DOI":"10.1109\/CEC.2000.870282"},{"issue":"4","key":"137_CR24","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1162\/106365605774666886","volume":"13","author":"GR Raidl","year":"2005","unstructured":"Raidl GR, Gottlieb J (2005) Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem. Evol Comput 13(4):441\u2013475","journal-title":"Evol Comput"},{"issue":"3","key":"137_CR25","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"GR Raidl","year":"2003","unstructured":"Raidl GR, Julstrom B (2003) Edge-sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7(3):225\u2013239","journal-title":"IEEE Trans Evol Comput"},{"key":"137_CR26","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"CR Reeves","year":"1998","unstructured":"Reeves CR, Yamada T (1998) Genetic algorithms, path relinking, and the flowshop sequencing problem. Evol Comput 6:45\u201360","journal-title":"Evol Comput"},{"key":"137_CR27","unstructured":"Rothlauf F (2003) Locality, distance distortion, and binary representations of integers. Working papers in information systems, University of Mannheim"},{"issue":"1","key":"137_CR28","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1162\/106365602317301781","volume":"10","author":"F Rothlauf","year":"2002","unstructured":"Rothlauf F, Goldberg DE, Heinzl A (2002) Network random keys\u2014a tree network representation scheme for genetic and evolutionary algorithms. Evol Comput 10(1):75\u201397","journal-title":"Evol Comput"},{"issue":"4","key":"137_CR29","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1162\/106365603322519288","volume":"11","author":"F Rothlauf","year":"2003","unstructured":"Rothlauf F, Goldberg DE (2003) Redundant representations in evolutionary computation. Evol Comput 11(4):381\u2013415","journal-title":"Evol Comput"},{"key":"137_CR30","first-page":"3","volume-title":"Advances in artificial life","author":"P Schuter","year":"1995","unstructured":"Schuter P (1995) Artificial life and molecular evolutionary biology. In: Moran F et al. (eds) Advances in artificial life. Springer, Berlin, pp 3\u201319"},{"key":"137_CR31","first-page":"143","volume-title":"Evoworkshops","author":"B Schindler","year":"2002","unstructured":"Schindler B, Rothlauf F, Pesch H (2002) Evolution strategies, network random keys, and the one-max tree problem. In: Evoworkshops. Springer, Berlin, pp 143\u201352"},{"key":"137_CR32","volume-title":"Proceedings of the seventh international conference on genetic algorithms","author":"B Sendhoff","year":"1997","unstructured":"Sendhoff B, Kreutz M, Seelen WV (1997) A condition for the genotype-phenotype mapping: causality. In: Proceedings of the seventh international conference on genetic algorithms. Morgan Kauffman, San Mateo"},{"key":"137_CR33","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/978-3-540-30217-9_44","volume-title":"Parallel problem solving in nature VIII","author":"MS Soak","year":"2004","unstructured":"Soak MS, Corne D, Ahn BH (2004) A powerful new encoding for tree-based combinatorial optimisation problems. In: Parallel problem solving in nature VIII. Lecture notes in computer science, vol 3242. Springer, Berlin, pp 430\u2013439"},{"issue":"2","key":"137_CR34","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/TEVC.2006.871250","volume":"10","author":"MS Soak","year":"2006","unstructured":"Soak MS, Corne D, Ahn BH (2006) The edge-window-decoder representation for tree-based problems. IEEE Trans Evol Comput 10(2):124\u2013144","journal-title":"IEEE Trans Evol Comput"},{"issue":"10","key":"137_CR35","doi-asserted-by":"crossref","first-page":"2882","DOI":"10.1093\/ietfec\/e89-a.10.2882","volume":"E89-A","author":"MS Soak","year":"2006","unstructured":"Soak MS (2006) A new evolutionary approach for the optimum communication spanning tree problem. IEICE Trans Fundam Electron, Commun Comput Sci E89-A(10):2882\u20132893","journal-title":"IEICE Trans Fundam Electron, Commun Comput Sci"},{"key":"137_CR36","series-title":"Lecture notes in artificial intelligence","first-page":"952","volume-title":"KES 2004","author":"MS Soak","year":"2004","unstructured":"Soak MS, Corne D, Ahn BH (2004) A new encoding for the degree constrained minimum spanning tree problem. In: KES 2004. Lecture notes in artificial intelligence, vol 3213. Springer, Berlin, pp 952\u2013958"},{"key":"137_CR37","series-title":"Lecture notes in physics","first-page":"77","volume-title":"Complex systems and binary networks","author":"PF Stadler","year":"1996","unstructured":"Stadler PF (1996) Towards a theory of landscapes. In: Complex systems and binary networks. Lecture notes in physics, vol 461. Springer, New York, pp 77\u2013163"},{"issue":"1","key":"137_CR38","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TEVC.2006.880730","volume":"11","author":"E Thompson","year":"2007","unstructured":"Thompson E, Paulden T, Smith DK (2007) The dandelion code: a new coding of spanning trees for genetic algorithms. IEEE Trans Evol Comput 11(1):91\u2013100","journal-title":"IEEE Trans Evol Comput"},{"key":"137_CR39","unstructured":"Watson JP, Barbulescu L, Whitley LD, Howe AE Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. http:\/\/www.cs.colostate.edu\/~genitor\/Pubs.html"},{"key":"137_CR40","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"ED Weinberger","year":"1990","unstructured":"Weinberger ED (1990) Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol Cybern 63:325\u2013336","journal-title":"Biol Cybern"},{"issue":"3","key":"137_CR41","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0305-0548(97)00039-7","volume":"25","author":"G Zhou","year":"1998","unstructured":"Zhou G, Gen M (1998) An effective GA approach to the quadratic minimum spanning tree problem. Comput Oper Res 25(3):229\u2013237","journal-title":"Comput Oper Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0137-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-008-0137-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0137-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:25:42Z","timestamp":1559154342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-008-0137-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,2]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["137"],"URL":"https:\/\/doi.org\/10.1007\/s10489-008-0137-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,2]]}}}