{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:39:35Z","timestamp":1753886375930,"version":"3.41.2"},"reference-count":21,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T00:00:00Z","timestamp":1330473600000},"content-version":"vor","delay-in-days":59,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>Planning primary electric power distribution involves solving an optimization problem using nonlinear components, which makes it difficult to obtain the optimum solution when the problem has dimensions that are found in reality, in terms of both the installation cost and the power loss cost. To tackle this problem, heuristic methods have been used, but even when sacrificing quality, finding the optimum solution still represents a computational challenge. In this paper, we study this problem using genetic algorithms. With the help of a coding scheme based on the dandelion code, these genetic algorithms allow larger instances of the problem to be solved. With the stated approach, we have solved instances of up to 40,000 consumer nodes when considering 20 substations; the total cost deviates 3.1% with respect to a lower bound that considers only the construction costs of the network.<\/jats:p>","DOI":"10.1155\/2012\/738409","type":"journal-article","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T21:01:28Z","timestamp":1330549288000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Evolutionary Optimization of Electric Power Distribution Using the Dandelion Code"],"prefix":"10.1155","volume":"2012","author":[{"given":"Jorge","family":"Sabattin","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Contreras Bolton","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Arias","sequence":"additional","affiliation":[]},{"given":"V\u00edctor","family":"Parada","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2012,2,29]]},"reference":[{"key":"e_1_2_5_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/61.53134"},{"key":"e_1_2_5_2_2","first-page":"306","article-title":"The logical design of electrical networks using linear programming methods","volume":"107","author":"Knight U. G.","year":"1960","journal-title":"Proceedings of the IEE A"},{"key":"e_1_2_5_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAS.1984.318447"},{"key":"e_1_2_5_4_2","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"Cayley A.","year":"1984","journal-title":"Quarterly Journal of Mathematics"},{"key":"e_1_2_5_5_2","first-page":"742","article-title":"Neuer beweis eines satzes \u00fcber permutationen","volume":"27","author":"Pr\u00fcfer H.","year":"1918","journal-title":"Archiv fur Mathematik und Physik"},{"key":"e_1_2_5_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRD.2009.2033929"},{"key":"e_1_2_5_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRD.2004.829091"},{"volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","year":"1989","author":"Goldberg D. E.","key":"e_1_2_5_8_2"},{"key":"e_1_2_5_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2009.2016052"},{"key":"e_1_2_5_10_2","doi-asserted-by":"crossref","unstructured":"LiY.andncepu_liyou@163.com ChangX. Changxianrong1@163.com A MST-based and new GA supported distribution network planning Proceedings of the International Conference on Mechatronic Science Electric Engineering and Computer (MEC \u203211) 2011 2534\u20132538 https:\/\/doi.org\/10.1109\/MEC.2011.6026009.","DOI":"10.1109\/MEC.2011.6026009"},{"key":"e_1_2_5_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/59.667402"},{"volume-title":"Electric Power Distribution","year":"2004","author":"Pabla A. S.","key":"e_1_2_5_12_2"},{"key":"e_1_2_5_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32444-5_2"},{"key":"e_1_2_5_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.871249"},{"key":"e_1_2_5_15_2","unstructured":"RothlaufF. Towards a theory of representations for genetic and evolutionary algorithms University of Bayreuth Alemania 2001."},{"key":"e_1_2_5_16_2","doi-asserted-by":"crossref","unstructured":"PalmerC. C.andKershenbaumA. Representing trees in genetic algorithms 1 Proceedings of IEEE Conference on Evolutionary Computation 1994 379\u2013384.","DOI":"10.1109\/ICEC.1994.349921"},{"key":"e_1_2_5_17_2","unstructured":"PicciottoS. How to encode a tree Univ. California California 1999."},{"key":"e_1_2_5_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_2_5_19_2","unstructured":"AriasM. SanhuezaH. andQuintanaV. H. Nuevo algoritmo para c\u00e1lculo de flujo de potencia en alimentadores de distribuci\u00f3n the 6th Congreso Chileno de Ingenier\u00eda Electrica 1995 Punta Arenas Chile."},{"key":"e_1_2_5_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1986.289288"},{"key":"e_1_2_5_21_2","unstructured":"De JongK. A. An analysis of the behavior of a class of genetic adaptive systems University of Michigan USA 1975."}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2012\/738409.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2012\/738409.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2012\/738409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T06:44:40Z","timestamp":1742625880000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2012\/738409"}},"subtitle":[],"editor":[{"given":"Edgar","family":"Carreno","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1155\/2012\/738409"],"URL":"https:\/\/doi.org\/10.1155\/2012\/738409","archive":["Portico"],"relation":{},"ISSN":["2090-0147","2090-0155"],"issn-type":[{"type":"print","value":"2090-0147"},{"type":"electronic","value":"2090-0155"}],"subject":[],"published":{"date-parts":[[2012,1]]},"assertion":[{"value":"2011-08-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-11-12","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-02-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"738409"}}