{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:53:21Z","timestamp":1781110401412,"version":"3.54.1"},"reference-count":17,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4,1]]},"abstract":"<p>Generic cabling is a key component for multiplex cable wiring. It is one of the basic foundations of intelligent buildings. Using operation flow in generic cabling, the index constraints affecting generic cabling have been evolved in this paper. A mathematical model is built based on the ant colony algorithm with multiple constraints, and improvements were made on the original basis to extend the ant colony algorithm from the regular simple ant colony and structure to a multi-ant colony and structure. The equilibrium settlement of multiplex wiring is realized according to the introduction of the multi-ant colony model. The ant cycle model is combined to extend the optimization target from the local wiring path to the entire wiring path, and to solve the drawbacks existing in the regular ant colony algorithm and other search algorithms that take the local wiring path as the optimization target. The introduced retrospective algorithm make the ants avoid the path marked \u201cinvalid\u201d in the subsequent search process and improves the search performance and convergence speed of the ant colony algorithm.<\/p>","DOI":"10.4018\/jssci.2011040104","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:49:13Z","timestamp":1319028553000},"page":"49-61","source":"Crossref","is-referenced-by-count":0,"title":["Generic Cabling of Intelligent Buildings Based on Ant Colony Algorithm"],"prefix":"10.4018","volume":"3","author":[{"given":"Yunlong","family":"Wang","sequence":"first","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kueiming","family":"Lo","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jssci.2011040104-0","unstructured":"Colorni, A., Dorigo, M., & Maniezzo, V. (1991). Distributed optimization by ant colonies. In Proceedings of the Actes de la Premi\u00e8re Conf\u00e9rence Europ\u00e9enne sur la Vie Artificielle, Paris, France (pp. 134-142)."},{"key":"jssci.2011040104-1","unstructured":"Dorigo, M. (1992). Optimization, learning and natural algorithms. Unpublished doctoral dissertation, Politecnico di Milano, Milan, Italy."},{"key":"jssci.2011040104-2","doi-asserted-by":"crossref","unstructured":"Dorigo, M., & Gambardella, L. M. (1996). Study of some properties of ants (Tech. Rep. No. TR\/IRIDIA\/1996-4). Brussels, Belgium: University Librede Bruxelles.","DOI":"10.1007\/3-540-61723-X_1029"},{"key":"jssci.2011040104-3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","author":"M.Dorigo","year":"2004","journal-title":"Ant colony optimization"},{"key":"jssci.2011040104-4","doi-asserted-by":"publisher","DOI":"10.1016\/S1672-6529(06)60010-3"},{"key":"jssci.2011040104-5","doi-asserted-by":"publisher","DOI":"10.1109\/35.76555"},{"key":"jssci.2011040104-6","doi-asserted-by":"crossref","unstructured":"Gambardella, L. M., & Dorigo, M. (1995). Ant-Q: A reinforcement learning approach to the traveling salesman problem. In Proceedings of the 12th International Conference on Machine Learning, Tahoe City, CA (pp. 252-260).","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"jssci.2011040104-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.02.014"},{"key":"jssci.2011040104-8","first-page":"35","author":"C. M.Han","year":"2004","journal-title":"Academic analysis and software realization of generic cabling"},{"issue":"2","key":"jssci.2011040104-9","first-page":"32","article-title":"Application of ant algorithm in combinatorial optimization.","volume":"4","author":"L.Ma","year":"2001","journal-title":"Journal of Management Sciences in China"},{"key":"jssci.2011040104-10","author":"Z. H.Sheng","year":"2005","journal-title":"Probability theory and mathematical statistics"},{"key":"jssci.2011040104-11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"jssci.2011040104-12","author":"H. C.Thomas","year":"2001","journal-title":"Introduction to algorithms"},{"issue":"1","key":"jssci.2011040104-13","first-page":"45","article-title":"Application of ant colony algorithm in solving optimization problems in continuous space.","volume":"18","author":"L.Wang","year":"2003","journal-title":"Control and Decision"},{"key":"jssci.2011040104-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2008.11.011"},{"key":"jssci.2011040104-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2008.04.013"},{"key":"jssci.2011040104-16","author":"S. S.Xue","year":"2002","journal-title":"Intelligent building and generic cabling system"}],"container-title":["International Journal of Software Science and Computational Intelligence"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=55128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T18:21:10Z","timestamp":1654107670000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jssci.2011040104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jssci.2011040104","relation":{},"ISSN":["1942-9045","1942-9037"],"issn-type":[{"value":"1942-9045","type":"print"},{"value":"1942-9037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}