{"id":"https://openalex.org/W2026277823","doi":"https://doi.org/10.1109/coginf.2010.5599817","title":"Generic cabling with restrictions based on ant colony algorithm","display_name":"Generic cabling with restrictions based on ant colony algorithm","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2026277823","doi":"https://doi.org/10.1109/coginf.2010.5599817","mag":"2026277823"},"language":"en","primary_location":{"id":"doi:10.1109/coginf.2010.5599817","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coginf.2010.5599817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"9th IEEE International Conference on Cognitive Informatics (ICCI'10)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100398951","display_name":"Yunlong Wang","orcid":"https://orcid.org/0000-0001-7705-3889"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yunlong Wang","raw_affiliation_strings":["School of Software, Tsinghua University, Beijing, China","School of Software,  Tsinghua University,  Beijing 100084,  China;"],"affiliations":[{"raw_affiliation_string":"School of Software, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"School of Software,  Tsinghua University,  Beijing 100084,  China;","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100731621","display_name":"Guiming Luo","orcid":"https://orcid.org/0000-0001-7665-0526"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guiming Luo","raw_affiliation_strings":["School of Software, Tsinghua University, Beijing, China","School of Software,  Tsinghua University,  Beijing 100084,  China;"],"affiliations":[{"raw_affiliation_string":"School of Software, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"School of Software,  Tsinghua University,  Beijing 100084,  China;","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100398951"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.8121,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.77119801,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":null,"first_page":"728","last_page":"732"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9521999955177307,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14276","display_name":"Power Systems and Technologies","score":0.9422000050544739,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.921883761882782},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7072175145149231},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.592604398727417},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.575282096862793},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49088984727859497},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.48651641607284546},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41045209765434265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13466906547546387},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0881384015083313}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.921883761882782},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7072175145149231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.592604398727417},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.575282096862793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49088984727859497},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.48651641607284546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41045209765434265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13466906547546387},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0881384015083313},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coginf.2010.5599817","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coginf.2010.5599817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"9th IEEE International Conference on Cognitive Informatics (ICCI'10)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life below water","score":0.8500000238418579,"id":"https://metadata.un.org/sdg/14"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1566652554","https://openalex.org/W2296221186","https://openalex.org/W3140461181","https://openalex.org/W3145128584","https://openalex.org/W4251153269"],"related_works":["https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W4285338599","https://openalex.org/W2381829748","https://openalex.org/W2071981049","https://openalex.org/W2244460820","https://openalex.org/W2109336245","https://openalex.org/W2511325427","https://openalex.org/W2392795382"],"abstract_inverted_index":{"Generic":[0],"cabling":[1,29,214],"is":[2,30],"the":[3,9,17,20,40,44,58,69,74,79,102,105,111,116,120,128,132,137,144,148,159,164,172,175,180,186,193,205,212,220,223],"key":[4],"component":[5],"and":[6,22,36,43,64,84,90,141,153,184,189],"one":[7],"of":[8,12,19,95,104,192,222],"basic":[10],"foundations":[11],"intelligent":[13,216],"buildings.":[14],"According":[15],"to":[16,72,86,101,126,136,142,219],"analysis":[18],"theory":[21],"operation":[23],"flow":[24],"in":[25,147,179,200,215],"generic":[26,28,48,213],"cabling,":[27],"a":[31,87],"multiplex":[32,96],"cable":[33],"wiring":[34,97,118,134,139,161],"problem":[35],"we":[37],"have":[38],"evolved":[39],"known":[41],"conditions":[42],"index":[45],"constraints":[46],"affecting":[47],"cabling.":[49],"A":[50],"mathematical":[51],"model":[52,123],"was":[53,98,124],"built":[54],"based":[55],"on":[56,68],"ant":[57,75,82,121,150,194,207],"colony":[59,76,83,89,107,151,195,208],"algorithm":[60,77,152,170,209],"with":[61],"multiple":[62],"conditions,":[63],"improvements":[65],"were":[66],"made":[67],"original":[70],"basis":[71],"extend":[73,127],"from":[78,131],"regular":[80,149],"simple":[81],"structure":[85],"multi-ant":[88,106],"structure.":[91],"The":[92,167,197],"equilibrium":[93],"settlement":[94],"realized":[99],"according":[100,218],"introduction":[103],"model.":[108],"Considering":[109],"that":[110,157,204],"optimization":[112,129,165],"target":[113,130],"should":[114],"optimize":[115],"global":[117],"path,":[119,140],"cycle":[122],"combined":[125],"local":[133,160],"path":[135,162,176],"entire":[138],"solve":[143],"drawbacks":[145],"existing":[146],"others":[154],"earch":[155],"algorithms":[156],"take":[158],"as":[163],"target.":[166],"introduced":[168],"retrospective":[169],"make":[171],"ants":[173],"avoid":[174],"marked":[177],"\"invalid\"":[178],"subsequent":[181],"search":[182,187],"process":[183],"improves":[185],"performance":[188],"convergence":[190],"speed":[191],"algorithm.":[196],"results":[198,221],"presented":[199],"this":[201],"paper":[202],"indicate":[203],"improved":[206],"efficiently":[210],"handles":[211],"buildings":[217],"project":[224],"data.":[225]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
