{"id":"https://openalex.org/W1592447399","doi":"https://doi.org/10.5353/th_b4961806","title":"An enhanced ant colony optimization approach for integrating process planning and scheduling based on multi-agent system","display_name":"An enhanced ant colony optimization approach for integrating process planning and scheduling based on multi-agent system","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1592447399","doi":"https://doi.org/10.5353/th_b4961806","mag":"1592447399"},"language":"en","primary_location":{"id":"doi:10.5353/th_b4961806","is_oa":true,"landing_page_url":"https://doi.org/10.5353/th_b4961806","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The University of Hong Kong","raw_type":"dissertation"},"type":"dissertation","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5353/th_b4961806","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097169590","display_name":"Sulivan Zhang Sicheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sicheng, Sulivan Zhang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5097169590"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9760000109672546,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9760000109672546,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9567999839782715,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7795541286468506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5455216765403748},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.543426513671875},{"id":"https://openalex.org/keywords/ant","display_name":"ANT","score":0.51498943567276},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.44686242938041687},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.43379876017570496},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.39130327105522156},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36907100677490234},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33845648169517517},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.2935448884963989},{"id":"https://openalex.org/keywords/operations-management","display_name":"Operations management","score":0.21086132526397705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12389016151428223},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.053922563791275024}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7795541286468506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5455216765403748},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.543426513671875},{"id":"https://openalex.org/C97467695","wikidata":"https://www.wikidata.org/wiki/Q295802","display_name":"ANT","level":2,"score":0.51498943567276},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44686242938041687},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.43379876017570496},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.39130327105522156},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36907100677490234},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33845648169517517},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.2935448884963989},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.21086132526397705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12389016151428223},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.053922563791275024},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5353/th_b4961806","is_oa":true,"landing_page_url":"https://doi.org/10.5353/th_b4961806","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The University of Hong Kong","raw_type":"dissertation"},{"id":"pmh:oai:hub.hku.hk:10722/180985","is_oa":true,"landing_page_url":"http://hdl.handle.net/10722/180985","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hub.hku.hk/bib/B49618064","raw_type":"PG_Thesis"}],"best_oa_location":{"id":"doi:10.5353/th_b4961806","is_oa":true,"landing_page_url":"https://doi.org/10.5353/th_b4961806","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The University of Hong Kong","raw_type":"dissertation"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4237535716","https://openalex.org/W2110363036","https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W2381829748","https://openalex.org/W4399062323","https://openalex.org/W2244460820","https://openalex.org/W2109336245"],"abstract_inverted_index":{"\ufeffProcess":[0],"planning":[1,8,65,137,148],"and":[2,15,39,42,51,66,86,112,118,138,149,160,227,235,245,338,444,461],"scheduling":[3,27,67,139,150],"are":[4,11,151,233,238,267,284,298,389,434,456],"two":[5],"important":[6],"manufacturing":[7,37,110,144,164,279],"functions":[9,91,154],"which":[10,182,265,407,448],"traditionally":[12],"performed":[13],"separately":[14],"sequentially.":[16],"Usually,":[17],"the":[18,34,40,74,82,93,107,116,134,142,163,200,203,206,243,247,250,278,282,294,305,321,333,343,351,358,365,393,400,411,451],"process":[19,49,64,84,94,136,147],"plan":[20,85,95],"has":[21,69,183],"to":[22,33,72,133,199,240,272,300,364,391],"be":[23,29,101,123,468],"prepared":[24],"first":[25],"before":[26],"can":[28],"performed.":[30],"However,":[31,197],"due":[32,198],"complexity":[35],"of":[36,62,81,109,115,187,202,229,249,276,281,323,387,396,399,422,428],"systems":[38],"uncertainties":[41],"dynamical":[43],"changes":[44],"encountered":[45],"in":[46,104,141,162,194,264,327,404],"practical":[47,143],"production,":[48],"plans":[50],"schedules":[52],"may":[53],"easily":[54],"become":[55],"inefficient":[56],"or":[57],"even":[58],"infeasible.":[59],"The":[60,225,252,454],"concept":[61],"integrated":[63],"(IPPS)":[68],"been":[70,184],"proposed":[71,239],"improve":[73,246],"efficiency,":[75],"effectiveness":[76],"as":[77,79,269,287,353,355],"well":[78,354],"flexibility":[80],"respective":[83],"schedule.":[87],"By":[88],"combining":[89],"both":[90,152],"together,":[92],"for":[96,191,223],"producing":[97],"a":[98,169,178,257,288,302,313,378,419,425],"part":[99],"could":[100,122,128,467],"dynamically":[102],"arranged":[103],"accordance":[105],"with":[106,213,242,316,332,424,458],"availability":[108],"resources":[111],"current":[113],"status":[114],"system,":[117,165],"its":[119],"operations\u2019":[120],"schedule":[121],"determined":[124],"concurrently.":[125],"Therefore,":[126],"IPPS":[127,166,192],"provide":[129],"an":[130,219,309],"essential":[131],"solution":[132,315,465],"dynamic":[135],"problem":[140,193],"environment.":[145],"Nevertheless,":[146],"complex":[153,171],"that":[155,210,369],"depend":[156],"on":[157,256,304,350,357,374,383,410,464],"many":[158],"factors":[159],"flexibilities":[161],"is":[167,177,208,254,330,348,362,371,408,416,450],"therefore":[168],"highly":[170],"NP-hard":[172],"problem.\\n\\nAnt":[173],"colony":[174],"optimization":[175],"(ACO)":[176],"widely":[179],"applied":[180],"meta-heuristics,":[181],"proved":[185],"capable":[186],"generating":[188],"feasible":[189],"solutions":[190],"previous":[195],"research.":[196],"nature":[201],"ACO":[204,221,231,295,326,367],"algorithm,":[205,296],"performance":[207,248,432],"not":[209],"favourable":[211],"compared":[212,457],"other":[214,459],"heuristics.":[215],"This":[216,361],"thesis":[217,329],"presents":[218],"enhanced":[220,331],"approach":[222,415],"IPPS.":[224],"weaknesses":[226],"limitations":[228],"standard":[230,405],"algorithm":[232,368],"identified":[234],"corresponding":[236,314],"modifications":[237],"deal":[241],"drawbacks":[244],"algorithm.":[251],"mechanism":[253],"implemented":[255],"specifically":[258],"designed":[259],"multi-agent":[260],"system":[261],"(MAS)":[262],"framework":[263],"ants":[266,297],"assigned":[268],"software":[270],"agents":[271],"generate":[273],"solutions.":[274],"First":[275],"all,":[277],"processes":[280],"parts":[283],"graphically":[285],"formulated":[286],"disjunctive":[289,306],"AND/OR":[290],"graph.":[291,307],"In":[292,376],"applying":[293],"deployed":[299],"find":[301],"path":[303],"Such":[308],"ant":[310,324,359],"route":[311],"indicates":[312],"associated":[317],"operations":[318,388],"scheduled":[319],"by":[320,418],"sequence":[322],"visit.\\n\\nThe":[325],"this":[328],"novel":[334],"node":[335,344],"selection":[336,345],"heuristic":[337,394],"pheromone":[339,347,370],"update":[340],"strategy.":[341],"With":[342],"heuristic,":[346],"deposited":[349,373],"nodes":[352],"edges":[356],"path.":[360],"contrast":[363],"conventional":[366],"only":[372],"edges.":[375],"addition,":[377],"more":[379],"reasonable":[380],"strategy":[381,402],"based":[382,409],"\u201cearliest":[384],"completion":[385],"time\u201d":[386],"used":[390,403],"determine":[392],"desirability":[395],"ants,":[397],"instead":[398],"\u201cgreedy\u201d":[401],"ACO,":[406],"\u201cshortest":[412],"processing":[413],"time\u201d.\\n\\nThe":[414],"evaluated":[417],"comprehensive":[420],"set":[421,427],"problems":[423],"full":[426],"flexibilities,":[429],"while":[430],"multiple":[431],"measurements":[433],"considered,":[435],"including":[436],"makespan,":[437],"mean":[438],"flow":[439],"time,":[440,446],"average":[441],"machine":[442],"utilization":[443],"CPU":[445],"among":[447],"makespan":[449],"major":[452],"criterion.":[453],"results":[455],"approaches":[460],"encouraging":[462],"improvements":[463],"quality":[466],"observed.":[469]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}