{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:58:47Z","timestamp":1648868327205},"reference-count":21,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2009,2]]},"abstract":"<jats:p> The degree-constrained minimum spanning tree (dc-MST) problem is of high practical importance. Up to now there are few effective algorithms to solve this problem because of its NP-hard complexity. More recently, a genetic algorithm (GA) approach for this problem was tried by using Pr\u00fcfer number to encode a spanning tree. The Pr\u00fcfer number is a skillful encoding for tree but not efficient enough to deal with the dc-MST problem. In this paper, a new tree-based encoding is developed directly based on the tree structure. We denote it as tree-based permutation encoding and apply it to the dc-MST problem by using the GA approach. Compared with the numerical results and CPU runtimes between two encodings, the new tree-based permutation is effective to deal with the dc-MST problem and even more efficient than the Pr\u00fcfer number to evolve to the optimal or near-optimal solutions. <\/jats:p>","DOI":"10.1142\/s0218001409006989","type":"journal-article","created":{"date-parts":[[2009,3,20]],"date-time":"2009-03-20T10:36:08Z","timestamp":1237545368000},"page":"129-144","source":"Crossref","is-referenced-by-count":0,"title":["GA-BASED ALTERNATIVE APPROACHES FOR THE DEGREE-CONSTRAINED SPANNING TREE PROBLEM"],"prefix":"10.1142","volume":"23","author":[{"given":"GENGUI","family":"ZHOU","sequence":"first","affiliation":[{"name":"College of Business and Administration, Zhejiang University of Technology, Hangzhou 310023, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZHENYU","family":"CAO","sequence":"additional","affiliation":[{"name":"College of Business and Administration, Zhejiang University of Technology, Hangzhou 310023, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZHIQING","family":"MENG","sequence":"additional","affiliation":[{"name":"College of Business and Administration, Zhejiang University of Technology, Hangzhou 310023, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JIAN","family":"CAO","sequence":"additional","affiliation":[{"name":"College of Business and Administration, Zhejiang University of Technology, Hangzhou 310023, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf3","first-page":"376","volume":"23","author":"Cayley A.","journal-title":"Quart. J. Math."},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.12.061"},{"key":"rf6","volume-title":"Discrete Mathematics","author":"Dossey J.","year":"1993"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/72.265956"},{"key":"rf8","volume-title":"Evolution Computation: Toward a New Philosophy of Machine Intelligence","author":"Fogel D.","year":"1995"},{"key":"rf9","volume-title":"Genetic Algorithms and Engineering Design","author":"Gen M.","year":"1997"},{"key":"rf10","volume-title":"Genetic Algorithms and Engineering Optimization","author":"Gen M.","year":"2000"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1985.10011"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07418-3"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(80)90022-2"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260305"},{"key":"rf15","volume-title":"Computational Intelligence","author":"Pedrycz W.","year":"1998"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"rf17","first-page":"742","volume":"27","author":"Pr\u00fcfer H.","journal-title":"Arch. Math. Phys."},{"key":"rf18","first-page":"703","volume":"154","author":"Rafael A.","journal-title":"Discr. Appl. Math."},{"key":"rf19","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"Reeves C. R.","year":"1993"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(85)90032-2"},{"key":"rf21","first-page":"156","volume":"3","author":"Zhou G.","journal-title":"Engin. Des. Autom."},{"key":"rf22","first-page":"105","volume":"30","author":"Zhou G.","journal-title":"Networks"},{"key":"rf23","first-page":"229","volume":"25","author":"Zhou G.","journal-title":"Comput. Operat. Res."},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00016-2"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001409006989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:17:39Z","timestamp":1565144259000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001409006989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":21,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2009,2]]}},"alternative-id":["10.1142\/S0218001409006989"],"URL":"https:\/\/doi.org\/10.1142\/s0218001409006989","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2]]}}}