{"id":"https://openalex.org/W4402984026","doi":"https://doi.org/10.1142/s1469026824500251","title":"A Bi-Population Competition Adaptive Interior Search Algorithm Based on Reinforcement Learning for Flexible Job Shop Scheduling Problem","display_name":"A Bi-Population Competition Adaptive Interior Search Algorithm Based on Reinforcement Learning for Flexible Job Shop Scheduling Problem","publication_year":2024,"publication_date":"2024-09-30","ids":{"openalex":"https://openalex.org/W4402984026","doi":"https://doi.org/10.1142/s1469026824500251"},"language":"en","primary_location":{"id":"doi:10.1142/s1469026824500251","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026824500251","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-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/A5103027725","display_name":"Tianhua Jiang","orcid":"https://orcid.org/0000-0001-7441-0684"},"institutions":[{"id":"https://openalex.org/I182707071","display_name":"Ludong University","ror":"https://ror.org/028h95t32","country_code":"CN","type":"education","lineage":["https://openalex.org/I182707071"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tianhua Jiang","raw_affiliation_strings":["School of Transportation, Ludong University, Shandong, Yantai 264025, P.\u00a0R.\u00a0China"],"raw_orcid":"https://orcid.org/0000-0001-7441-0684","affiliations":[{"raw_affiliation_string":"School of Transportation, Ludong University, Shandong, Yantai 264025, P.\u00a0R.\u00a0China","institution_ids":["https://openalex.org/I182707071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103016855","display_name":"Lu Liu","orcid":"https://orcid.org/0000-0001-5185-1276"},"institutions":[{"id":"https://openalex.org/I182707071","display_name":"Ludong University","ror":"https://ror.org/028h95t32","country_code":"CN","type":"education","lineage":["https://openalex.org/I182707071"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lu Liu","raw_affiliation_strings":["School of Transportation, Ludong University, Shandong, Yantai 264025, P.\u00a0R.\u00a0China"],"raw_orcid":"https://orcid.org/0000-0001-5185-1276","affiliations":[{"raw_affiliation_string":"School of Transportation, Ludong University, Shandong, Yantai 264025, P.\u00a0R.\u00a0China","institution_ids":["https://openalex.org/I182707071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I182707071"],"apc_list":null,"apc_paid":null,"fwci":0.8443,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76692001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"24","issue":"01","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.980400025844574,"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.980400025844574,"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.9571999907493591,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9488000273704529,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8465586304664612},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7911821007728577},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.597291111946106},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4956876039505005},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47733527421951294},{"id":"https://openalex.org/keywords/competition","display_name":"Competition (biology)","score":0.4526885747909546},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.43178796768188477},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37471383810043335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35992398858070374},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09515434503555298}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8465586304664612},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7911821007728577},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.597291111946106},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4956876039505005},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47733527421951294},{"id":"https://openalex.org/C91306197","wikidata":"https://www.wikidata.org/wiki/Q45767","display_name":"Competition (biology)","level":2,"score":0.4526885747909546},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.43178796768188477},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37471383810043335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35992398858070374},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09515434503555298},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1469026824500251","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026824500251","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8655377592","display_name":null,"funder_award_id":"ZR2021MG008","funder_id":"https://openalex.org/F4320324174","funder_display_name":"Natural Science Foundation of Shandong Province"}],"funders":[{"id":"https://openalex.org/F4320324174","display_name":"Natural Science Foundation of Shandong Province","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1075229800","https://openalex.org/W1967402817","https://openalex.org/W1995972800","https://openalex.org/W1999445878","https://openalex.org/W2046437335","https://openalex.org/W2057285547","https://openalex.org/W2564110208","https://openalex.org/W2615087190","https://openalex.org/W2809686363","https://openalex.org/W2897683126","https://openalex.org/W3001711537","https://openalex.org/W3012153991","https://openalex.org/W3021534971","https://openalex.org/W3042286978","https://openalex.org/W3082377584","https://openalex.org/W3152345596","https://openalex.org/W3168367332","https://openalex.org/W3199468096","https://openalex.org/W4205126619","https://openalex.org/W4206820958","https://openalex.org/W4210916375","https://openalex.org/W4220850901","https://openalex.org/W4283643224","https://openalex.org/W4296181692","https://openalex.org/W4309947033","https://openalex.org/W4313678757","https://openalex.org/W4386959364","https://openalex.org/W4388823069","https://openalex.org/W4390368000","https://openalex.org/W4390419755","https://openalex.org/W4391611464","https://openalex.org/W4391721686"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W4306904969","https://openalex.org/W2138720691","https://openalex.org/W4362501864","https://openalex.org/W4380318855","https://openalex.org/W2112121444","https://openalex.org/W2031695474","https://openalex.org/W2509452605","https://openalex.org/W3204654320"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3,13,39,58,122,144,150],"bi-population":[4,59],"competition":[5,97],"adaptive":[6],"interior":[7],"search":[8,84,125],"algorithm":[9,218,251],"(BCAISA)":[10],"based":[11,166],"on":[12,167,190],"reinforcement":[14],"learning":[15],"strategy":[16],"is":[17,36,61,99,113,139,182,200,205],"proposed":[18,140],"for":[19,76,115,155,252],"the":[20,30,33,54,65,103,107,111,116,153,173,178,186,191,194,230,236,239,247,254,259,262,265],"classical":[21,255],"flexible":[22],"job":[23],"shop":[24],"scheduling":[25,34,118],"problem":[26,119],"(FJSP)":[27],"to":[28,52,63,88,101,141,148,184,229,273],"optimize":[29],"makespan.":[31],"First,":[32],"solution":[35],"represented":[37],"using":[38],"machine-job-based":[40],"two-segment":[41],"integer":[42],"encoding":[43],"method,":[44],"and":[45,79,133,158],"various":[46],"heuristic":[47],"rules":[48],"are":[49,73,164],"then":[50,206],"applied":[51],"generate":[53],"initial":[55],"population.":[56],"Secondly,":[57],"mechanism":[60,98],"introduced":[62,100],"partition":[64],"population":[66],"into":[67],"two":[68,108],"distinct":[69],"sub-populations.":[70,109],"These":[71],"sub-populations":[72],"specifically":[74],"tailored":[75],"machine":[77],"assignment":[78],"operation":[80],"permutation,":[81],"employing":[82],"different":[83],"strategies":[85,199],"respectively,":[86],"aiming":[87,147],"facilitate":[89,102],"an":[90],"efficient":[91],"implementation":[92],"of":[93,124,172,177,196,224,249,264],"parallel":[94],"search.":[95],"A":[96,136],"information":[104],"exchange":[105],"between":[106,152],"Thirdly,":[110],"ISA":[112,266],"adapted":[114],"discrete":[117],"by":[120],"discretizing":[121],"series":[123],"operators,":[126],"which":[127],"include":[128],"composition":[129],"optimization,":[130],"mirror":[131],"search,":[132],"random":[134],"walk.":[135],"Q-learning-based":[137],"approach":[138],"dynamically":[142],"adjust":[143],"key":[145],"parameter,":[146],"strike":[149],"balance":[151],"capacity":[154],"global":[156],"exploration":[157],"local":[159],"exploitation.":[160],"Finally,":[161],"extensive":[162],"experiments":[163],"conducted":[165],"10":[168],"well-known":[169],"benchmark":[170,225],"instances":[171],"FJSP.":[174,256],"The":[175,203,212],"design":[176],"experiment":[179],"(DOE)":[180],"method":[181],"employed":[183],"determine":[185],"algorithm\u2019s":[187],"parameters.":[188],"Based":[189],"computational":[192],"results,":[193,238],"effectiveness":[195,248],"four":[197],"improvement":[198],"first":[201],"validated.":[202],"BCAISA":[204,240],"compared":[207],"with":[208],"fifteen":[209],"published":[210],"algorithms.":[211],"comparative":[213],"data":[214],"demonstrate":[215],"that":[216],"our":[217,250],"outperforms":[219],"other":[220],"algorithms":[221],"in":[222,270,277],"50%":[223],"instances.":[226],"Additionally,":[227],"according":[228],"relative":[231],"percentage":[232],"deviation":[233],"(RPD)":[234],"from":[235],"state-of-the-art":[237],"also":[241],"exhibits":[242],"superior":[243],"performance.":[244],"This":[245],"highlights":[246],"solving":[253],"To":[257],"enhance":[258],"practical":[260],"application,":[261],"scope":[263],"will":[267],"be":[268],"broadened":[269],"future":[271],"work":[272],"more":[274],"complex":[275],"problems":[276],"real-world":[278],"scenarios.":[279]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}