{"id":"https://openalex.org/W4417465380","doi":"https://doi.org/10.1287/trsc.2025.0016","title":"A Self-Adaptive Monte Carlo Tree Search Algorithm for Generalized Quay Crane Scheduling Problem","display_name":"A Self-Adaptive Monte Carlo Tree Search Algorithm for Generalized Quay Crane Scheduling Problem","publication_year":2025,"publication_date":"2025-12-18","ids":{"openalex":"https://openalex.org/W4417465380","doi":"https://doi.org/10.1287/trsc.2025.0016"},"language":"en","primary_location":{"id":"doi:10.1287/trsc.2025.0016","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2025.0016","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","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/A5010621156","display_name":"Lei Hai","orcid":"https://orcid.org/0009-0002-8693-1852"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lei Hai","raw_affiliation_strings":["School of Management, Northwestern Polytechnical University, Xi\u2019an 710072, China"],"affiliations":[{"raw_affiliation_string":"School of Management, Northwestern Polytechnical University, Xi\u2019an 710072, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001595417","display_name":"Chenhao Zhou","orcid":"https://orcid.org/0000-0001-8459-1722"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chenhao Zhou","raw_affiliation_strings":["School of Management, Northwestern Polytechnical University, Xi\u2019an 710072, China"],"affiliations":[{"raw_affiliation_string":"School of Management, Northwestern Polytechnical University, Xi\u2019an 710072, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100372201","display_name":"Xue Li","orcid":"https://orcid.org/0000-0002-4515-6792"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Xue","raw_affiliation_strings":["School of Management, Northwestern Polytechnical University, Xi\u2019an 710072, China; and China Eastern Technology Application Research and Development Center Co. Ltd., Shanghai 201707, China"],"affiliations":[{"raw_affiliation_string":"School of Management, Northwestern Polytechnical University, Xi\u2019an 710072, China; and China Eastern Technology Application Research and Development Center Co. Ltd., Shanghai 201707, China","institution_ids":["https://openalex.org/I17145004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010621156"],"corresponding_institution_ids":["https://openalex.org/I17145004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.54918166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"60","issue":"1","first_page":"155","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11223","display_name":"Maritime Ports and Logistics","score":0.9753999710083008,"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/T11223","display_name":"Maritime Ports and Logistics","score":0.9753999710083008,"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/T12176","display_name":"Optimization and Packing Problems","score":0.004100000020116568,"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/T12126","display_name":"Maritime Transport Emissions and Efficiency","score":0.0035000001080334187,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7738000154495239},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.5972999930381775},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5777000188827515},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.474700003862381},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4584999978542328},{"id":"https://openalex.org/keywords/container","display_name":"Container (type theory)","score":0.45239999890327454},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.41499999165534973},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.39160001277923584},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.38269999623298645}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7738000154495239},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7200000286102295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6363999843597412},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.5972999930381775},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5777000188827515},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.474700003862381},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4584999978542328},{"id":"https://openalex.org/C2781018962","wikidata":"https://www.wikidata.org/wiki/Q5164884","display_name":"Container (type theory)","level":2,"score":0.45239999890327454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4271000027656555},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.39160001277923584},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.38269999623298645},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.3783000111579895},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.34779998660087585},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.33399999141693115},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.30880001187324524},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.2727999985218048},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.26330000162124634},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2556999921798706},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.25130000710487366},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1287/trsc.2025.0016","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2025.0016","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1625390266","https://openalex.org/W1998016704","https://openalex.org/W2069479298","https://openalex.org/W2077373694","https://openalex.org/W2082330633","https://openalex.org/W2126316555","https://openalex.org/W2141603040","https://openalex.org/W2257979135","https://openalex.org/W2300437034","https://openalex.org/W2403225675","https://openalex.org/W2409315814","https://openalex.org/W2472129371","https://openalex.org/W2552545567","https://openalex.org/W2554708934","https://openalex.org/W2577971819","https://openalex.org/W2794402933","https://openalex.org/W2808746165","https://openalex.org/W2813258979","https://openalex.org/W2886847473","https://openalex.org/W2923560181","https://openalex.org/W3014744355","https://openalex.org/W3041688180","https://openalex.org/W3095465449","https://openalex.org/W4308310692","https://openalex.org/W4378174711","https://openalex.org/W4389139986","https://openalex.org/W4389819419","https://openalex.org/W4394858973","https://openalex.org/W4402140263","https://openalex.org/W4402596404","https://openalex.org/W7081935548"],"related_works":[],"abstract_inverted_index":{"Efficient":[0],"quay":[1,39],"crane":[2,40],"(QC)":[3],"handling":[4],"is":[5,85,97,107,124,167,254,297],"crucial":[6],"for":[7,49,99,169],"enhancing":[8],"service":[9],"levels":[10],"and":[11,51,59,64,67,72,79,115,133,153,172,203,223,275],"competitiveness":[12],"in":[13,205],"container":[14,25,135,241],"terminals,":[15],"particularly":[16],"with":[17,210,231],"the":[18,28,37,47,69,151,159,188,211,217,224,232,243,252,261,265,283],"advent":[19],"of":[20,30,147,150,156,158,200,207,260,288],"ultra-large":[21],"vessels":[22],"necessitating":[23],"rapid":[24],"turnover.":[26],"As":[27],"complexity":[29],"terminal":[31,273],"operations":[32],"escalates,":[33],"this":[34,55],"paper":[35],"addresses":[36],"generalized":[38],"scheduling":[41],"problem":[42,106],"(GQCSP),":[43],"aiming":[44],"to":[45,101,130,181],"minimize":[46],"makespan":[48,152,208],"discharging":[50],"loading":[52],"operations.":[53],"In":[54],"problem,":[56],"both":[57],"20-ft":[58],"40-ft":[60],"containers":[61],"are":[62,142],"mixed":[63],"stacked":[65],"above":[66],"below":[68],"hatch":[70],"covers,":[71],"QCs":[73,132],"operate":[74],"multidirectionally":[75],"under":[76],"safety":[77],"distance":[78],"noncrossing":[80],"constraints.":[81],"A":[82],"solution":[83],"approach":[84,267],"proposed":[86,125,189,244,266],"that":[87,126,187,264],"delivers":[88],"swift,":[89],"feasible":[90],"solutions":[91],"over":[92],"protracted":[93],"optimal":[94],"ones,":[95],"which":[96],"essential":[98],"adapting":[100],"last-minute":[102],"operational":[103],"changes.":[104],"The":[105,184,258,294],"formulated":[108],"as":[109],"a":[110,116,154,177,239],"Markov":[111],"decision":[112],"process":[113],"model,":[114],"self-adaptive":[117],"Monte":[118],"Carlo":[119],"tree":[120],"search":[121],"(MCTS)":[122],"algorithm":[123,138,191,220,226,246],"can":[127],"handle":[128],"up":[129],"11":[131],"280":[134],"groups.":[136],"For":[137],"acceleration,":[139],"problem-specific":[140],"methods":[141],"developed,":[143],"achieving":[144,197],"an":[145,163],"improvement":[146],"approximately":[148],"1.2%":[149],"reduction":[155],"two-thirds":[157],"computation":[160],"time.":[161],"Specifically,":[162],"adaptive":[164],"lower":[165],"bound":[166],"introduced":[168],"node":[170],"selection":[171],"subtree":[173],"pruning,":[174],"accompanied":[175],"by":[176,221,227,282],"lower-bound-based":[178],"reward":[179],"function":[180],"facilitate":[182],"backpropagation.":[183],"experiments":[185],"demonstrate":[186],"MCTS":[190,245],"significantly":[192],"outperforms":[193],"existing":[194],"heuristic":[195],"algorithms,":[196],"average":[198],"improvements":[199],"20.84%,":[201],"14.40%,":[202],"11.02%":[204],"terms":[206],"compared":[209,230],"strategy-based":[212],"approach,":[213],"while":[214],"also":[215,247],"surpassing":[216],"dynamic":[218],"programming":[219],"12.88%":[222],"memetic":[225],"72.79%.":[228],"Furthermore,":[229],"most":[233],"recent":[234],"Benders":[235],"decomposition":[236],"method":[237],"assuming":[238],"homogeneous":[240],"size,":[242],"demonstrates":[248,263],"comparable":[249],"performance":[250],"where":[251],"difference":[253],"less":[255],"than":[256],"0.4%.":[257],"significance":[259],"results":[262],"has":[268],"great":[269],"universality,":[270],"thus":[271],"improving":[272],"productivity":[274],"responsiveness.":[276],"Funding:":[277],"This":[278],"work":[279],"was":[280],"supported":[281],"National":[284],"Natural":[285],"Science":[286],"Foundation":[287],"China":[289],"[Grant":[290],"72471190].":[291],"Supplemental":[292],"Material:":[293],"online":[295],"appendix":[296],"available":[298],"at":[299],"https://doi.org/10.1287/trsc.2025.0016":[300],".":[301]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-12-18T00:00:00"}