{"id":"https://openalex.org/W3179727500","doi":"https://doi.org/10.1155/2021/9930113","title":"Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling","display_name":"Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3179727500","doi":"https://doi.org/10.1155/2021/9930113","mag":"3179727500"},"language":"en","primary_location":{"id":"doi:10.1155/2021/9930113","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/9930113","pdf_url":"https://downloads.hindawi.com/journals/complexity/2021/9930113.pdf","source":{"id":"https://openalex.org/S207319443","display_name":"Complexity","issn_l":"1076-2787","issn":["1076-2787","1099-0526"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://downloads.hindawi.com/journals/complexity/2021/9930113.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007710823","display_name":"Xiaokang Han","orcid":"https://orcid.org/0000-0002-7442-4944"},"institutions":[{"id":"https://openalex.org/I148099405","display_name":"Xi'an University of Architecture and Technology","ror":"https://ror.org/04v2j2k71","country_code":"CN","type":"education","lineage":["https://openalex.org/I148099405"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiaokang Han","raw_affiliation_strings":["Project Control Department, Hualu Engineering & Technology Co., Ltd., Xi'an 710065, China","School of Management, Xi'an University of Architecture and Technology, Xi'an 710055, China","Project Control Department, Hualu Engineering & Technology Co., Ltd., Xi'an 710065","School of Management, Xi'an University of Architecture and Technology, Xi'an 710055"],"affiliations":[{"raw_affiliation_string":"Project Control Department, Hualu Engineering & Technology Co., Ltd., Xi'an 710065, China","institution_ids":[]},{"raw_affiliation_string":"School of Management, Xi'an University of Architecture and Technology, Xi'an 710055, China","institution_ids":["https://openalex.org/I148099405"]},{"raw_affiliation_string":"Project Control Department, Hualu Engineering & Technology Co., Ltd., Xi'an 710065","institution_ids":[]},{"raw_affiliation_string":"School of Management, Xi'an University of Architecture and Technology, Xi'an 710055","institution_ids":["https://openalex.org/I148099405"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049087632","display_name":"Wenzhou Yan","orcid":null},"institutions":[{"id":"https://openalex.org/I148099405","display_name":"Xi'an University of Architecture and Technology","ror":"https://ror.org/04v2j2k71","country_code":"CN","type":"education","lineage":["https://openalex.org/I148099405"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenzhou Yan","raw_affiliation_strings":["School of Management, Xi'an University of Architecture and Technology, Xi'an 710055, China","School of Management, Xi'an University of Architecture and Technology, Xi'an 710055"],"affiliations":[{"raw_affiliation_string":"School of Management, Xi'an University of Architecture and Technology, Xi'an 710055, China","institution_ids":["https://openalex.org/I148099405"]},{"raw_affiliation_string":"School of Management, Xi'an University of Architecture and Technology, Xi'an 710055","institution_ids":["https://openalex.org/I148099405"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010771862","display_name":"Mei Lu","orcid":"https://orcid.org/0000-0001-9020-7731"},"institutions":[{"id":"https://openalex.org/I148099405","display_name":"Xi'an University of Architecture and Technology","ror":"https://ror.org/04v2j2k71","country_code":"CN","type":"education","lineage":["https://openalex.org/I148099405"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mei Lu","raw_affiliation_strings":["School of Management, Xi'an University of Architecture and Technology, Xi'an 710055, China","School of Management, Xi'an University of Architecture and Technology, Xi'an 710055"],"affiliations":[{"raw_affiliation_string":"School of Management, Xi'an University of Architecture and Technology, Xi'an 710055, China","institution_ids":["https://openalex.org/I148099405"]},{"raw_affiliation_string":"School of Management, Xi'an University of Architecture and Technology, Xi'an 710055","institution_ids":["https://openalex.org/I148099405"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007710823"],"corresponding_institution_ids":["https://openalex.org/I148099405"],"apc_list":{"value":2300,"currency":"USD","value_usd":2300},"apc_paid":{"value":2300,"currency":"USD","value_usd":2300},"fwci":1.0761,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78527031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"2021","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11006","display_name":"BIM and Construction Integration","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.8284404277801514},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6348612308502197},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6165749430656433},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5994169116020203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5827894806861877},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5631804466247559},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5570338368415833},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.53925621509552},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.515540599822998},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4555344581604004},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4525855481624603},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4506787955760956},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.43704739212989807},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4118228554725647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2844523787498474},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.19462183117866516},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11308518052101135},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08822867274284363},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0830860435962677}],"concepts":[{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.8284404277801514},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6348612308502197},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6165749430656433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5994169116020203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5827894806861877},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5631804466247559},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5570338368415833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.53925621509552},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.515540599822998},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4555344581604004},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4525855481624603},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4506787955760956},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.43704739212989807},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4118228554725647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2844523787498474},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.19462183117866516},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11308518052101135},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08822867274284363},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0830860435962677},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1155/2021/9930113","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/9930113","pdf_url":"https://downloads.hindawi.com/journals/complexity/2021/9930113.pdf","source":{"id":"https://openalex.org/S207319443","display_name":"Complexity","issn_l":"1076-2787","issn":["1076-2787","1099-0526"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complexity","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:hin:complx:9930113","is_oa":false,"landing_page_url":"http://downloads.hindawi.com/journals/complexity/2021/9930113.xml","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:5c690ed8a34b48d5902e387d5f0e48a4","is_oa":true,"landing_page_url":"https://doaj.org/article/5c690ed8a34b48d5902e387d5f0e48a4","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Complexity, Vol 2021 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1155/2021/9930113","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/9930113","pdf_url":"https://downloads.hindawi.com/journals/complexity/2021/9930113.pdf","source":{"id":"https://openalex.org/S207319443","display_name":"Complexity","issn_l":"1076-2787","issn":["1076-2787","1099-0526"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1900268119","display_name":null,"funder_award_id":"51478384","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G2087396116","display_name":null,"funder_award_id":"China","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G2560648409","display_name":null,"funder_award_id":"and 51","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G3317480652","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5994120800","display_name":null,"funder_award_id":"Natural","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7936272474","display_name":null,"funder_award_id":"51808424 and 51478384","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8246257870","display_name":null,"funder_award_id":"51808424","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3179727500.pdf","grobid_xml":"https://content.openalex.org/works/W3179727500.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W2036112575","https://openalex.org/W2154929945","https://openalex.org/W2155467293","https://openalex.org/W2169528473","https://openalex.org/W2352251943","https://openalex.org/W2354192157","https://openalex.org/W3048196244","https://openalex.org/W3089856079","https://openalex.org/W3096193467","https://openalex.org/W3125609744","https://openalex.org/W3133452713","https://openalex.org/W3155934579","https://openalex.org/W3158719152","https://openalex.org/W3159502203"],"related_works":["https://openalex.org/W2022506245","https://openalex.org/W2156431668","https://openalex.org/W2388410942","https://openalex.org/W2040572217","https://openalex.org/W191849398","https://openalex.org/W2018146256","https://openalex.org/W616034966","https://openalex.org/W2600678155","https://openalex.org/W2375775343","https://openalex.org/W2776102956"],"abstract_inverted_index":{"In":[0,76],"large":[1],"and":[2,94,115,140,187,218,235],"complex":[3],"project":[4,118],"schedule":[5],"networks,":[6],"existing":[7],"algorithms":[8],"to":[9,26,42,47,84,207],"determine":[10,48,85,230],"the":[11,28,31,43,49,56,61,65,69,73,86,91,99,134,149,159,164,172,181,189,200,209,213,224,231],"critical":[12,32,62,87,175,190,214,232],"path":[13,33,58,63,71,88,92,191,233],"are":[14],"considerably":[15],"slow.":[16],"Therefore,":[17],"an":[18,79],"algorithm":[19,38,83,150,219,228],"with":[20],"a":[21,109,125,152,168],"faster":[22],"convergence":[23,182],"is":[24,68,104,156,177],"needed":[25],"improve":[27,208],"efficiency":[29,210],"of":[30,108,128,211],"computation.":[34],"The":[35,106,121],"ant":[36,81,226],"colony":[37,82,227],"was":[39,119],"first":[40],"applied":[41],"travelling":[44],"salesman":[45],"problem":[46,67,234],"shortest":[50],"path.":[51,215],"However,":[52],"many":[53],"problems":[54],"require":[55],"longest":[57,70,173],"in":[59,64,72,199],"practice;":[60],"scheduling":[66,74],"network.":[75],"this":[77],"study,":[78],"improved":[80,225],"by":[89,195],"setting":[90,196],"distance":[93],"time":[95],"as":[96],"negative,":[97],"while":[98],"transition":[100],"probability":[101],"remains":[102],"unchanged,":[103],"proposed.":[105],"case":[107],"coal":[110],"power":[111],"plant":[112],"engineering,":[113],"procurement,":[114],"construction":[116],"(EPC)":[117],"considered.":[120],"results":[122],"show":[123],"that":[124,148,180,188,223],"peak":[126],"number":[127],"optimal":[129,170],"solutions":[130],"appeared":[131],"at":[132,158],"approximately":[133],"9":[135],"th":[136,161,166],"iteration;":[137,162],"however,":[138],"instabilities":[139],"continued":[141],"fluctuations":[142],"were":[143],"observed":[144],"even":[145],"afterward,":[146],"indicating":[147,179],"has":[151,204],"certain":[153],"randomness.":[154],"Convergence":[155],"apparent":[157],"29":[160],"after":[163],"34":[165],"iteration,":[167],"singular":[169],"solution,":[171],"or":[174],"path,":[176],"obtained,":[178],"rate":[183],"can":[184,192,229],"be":[185,193],"controlled":[186],"obtained":[194],"appropriate":[197],"parameters":[198],"solution":[201],"method.":[202],"This":[203],"been":[205],"found":[206],"calculating":[212],"Case":[216],"validation":[217],"performance":[220],"testing":[221],"confirmed":[222],"make":[236],"it":[237],"computationally":[238],"intelligent.":[239]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}