{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T21:25:41Z","timestamp":1787261141081,"version":"build-2736575974"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.cor.2026.107595","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T20:09:53Z","timestamp":1782850193000},"page":"107595","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Reinforcement learning-driven dynamic threshold search for the uncapacitated r-allocation p-hub center problem"],"prefix":"10.1016","volume":"195","author":[{"given":"Yongliang","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinjie","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinmeng","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaowen","family":"Lan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raymond","family":"Chiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2026.107595_b1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","article-title":"TTT plots: a perl program to create time-to-target plots","volume":"1","author":"Aiex","year":"2007","journal-title":"Optim. Lett."},{"issue":"10","key":"10.1016\/j.cor.2026.107595_b2","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1016\/j.trb.2009.04.004","article-title":"The design of single allocation incomplete hub networks","volume":"43","author":"Alumur","year":"2009","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"2","key":"10.1016\/j.cor.2026.107595_b3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","article-title":"Machine learning for combinatorial optimization: a methodological tour d\u2019horizon","volume":"290","author":"Bengio","year":"2021","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107595_b4","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1111\/itor.12801","article-title":"The uncapacitated r-allocation p-hub center problem","volume":"29","author":"Brimberg","year":"2022","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2026.107595_b5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s11590-016-1004-x","article-title":"General variable neighborhood search for the uncapacitated single allocation p-hub center problem","volume":"11","author":"Brimberg","year":"2017","journal-title":"Optim. Lett."},{"issue":"1","key":"10.1016\/j.cor.2026.107595_b6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s10479-014-1720-5","article-title":"Iterated responsive threshold search for the quadratic multiple knapsack problem","volume":"226","author":"Chen","year":"2015","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2026.107595_b7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.engappai.2019.03.015","article-title":"Dynamic thresholding search for minimum vertex cover in massive sparse graphs","volume":"82","author":"Chen","year":"2019","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cor.2026.107595_b8","series-title":"Network Design with Applications To Transportation and Logistics","first-page":"567","article-title":"Hub network design","author":"Contreras","year":"2020"},{"issue":"1","key":"10.1016\/j.cor.2026.107595_b9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","article-title":"Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing","volume":"90","author":"Dueck","year":"1990","journal-title":"J. Comput. Phys."},{"issue":"7","key":"10.1016\/j.cor.2026.107595_b10","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1016\/j.cor.2008.08.021","article-title":"Uncapacitated single and multiple allocation p-hub center problems","volume":"36","author":"Ernst","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107595_b11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","article-title":"Efficient algorithms for the uncapacitated single allocation p-hub median problem","volume":"4","author":"Ernst","year":"1996","journal-title":"Locat. Sci."},{"key":"10.1016\/j.cor.2026.107595_b12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.cor.2017.09.022","article-title":"Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems","volume":"90","author":"Ghaffarinasab","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107595_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.disopt.2021.100625","article-title":"Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem","volume":"44","author":"Gu","year":"2022","journal-title":"Discrete Optim."},{"issue":"3","key":"10.1016\/j.cor.2026.107595_b14","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighborhood search: Principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107595_b15","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10589-013-9629-5","article-title":"Exact computational approaches to a stochastic uncapacitated single allocation p-hub center problem","volume":"59","author":"Hult","year":"2014","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cor.2026.107595_b16","series-title":"Principles and Practice of Constraint Programming-CP 2002: 8th International Conference, CP 2002 Ithaca, NY, USA, September 9\u201313, 2002 Proceedings 8","first-page":"233","article-title":"Scaling and probabilistic smoothing: Efficient dynamic local search for SAT","author":"Hutter","year":"2002"},{"issue":"3","key":"10.1016\/j.cor.2026.107595_b17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0966-8349(96)00016-2","article-title":"Airline network design and hub location problems","volume":"4","author":"Jaillet","year":"1996","journal-title":"Locat. Sci."},{"issue":"3","key":"10.1016\/j.cor.2026.107595_b18","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/321765.321768","article-title":"A note on Dijkstra\u2019s shortest path algorithm","volume":"20","author":"Johnson","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/j.cor.2026.107595_b19","series-title":"Advances in Resilient and Sustainable Transport. ICPLT 2023","first-page":"241","article-title":"Approximation algorithms for p-hub center problems","author":"Jost","year":"2023"},{"issue":"3","key":"10.1016\/j.cor.2026.107595_b20","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/S0377-2217(99)00274-X","article-title":"On the single-assignment p-hub center problem","volume":"125","author":"Kara","year":"2000","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107595_b21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00291-018-0526-2","article-title":"Heuristic algorithms for the single allocation p-hub center problem with routing considerations","volume":"41","author":"Kartal","year":"2019","journal-title":"OR Spectrum"},{"issue":"04","key":"10.1016\/j.cor.2026.107595_b22","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1142\/S0217595906001042","article-title":"Solving the uncapacitated multiple allocation p-hub center problem by genetic algorithm","volume":"23","author":"Kratica","year":"2006","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107595_b23","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1287\/ijoc.2023.1290","article-title":"Perturbation-based thresholding search for packing equal circles and spheres","volume":"35","author":"Lai","year":"2023","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107595_b24","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TEVC.2022.3175832","article-title":"A learning-based memetic algorithm for energy-efficient flexible job-shop scheduling with type-2 fuzzy processing time","volume":"27","author":"Li","year":"2022","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107595_b25","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/j.ejor.2023.07.014","article-title":"A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment","volume":"312","author":"Li","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107595_b26","first-page":"43","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Oper. Res. Perspect."},{"key":"10.1016\/j.cor.2026.107595_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105400","article-title":"Reinforcement learning for combinatorial optimization: A survey","volume":"134","author":"Mazyavkina","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2026.107595_b28","doi-asserted-by":"crossref","first-page":"3143","DOI":"10.1016\/j.cor.2008.07.011","article-title":"A 2-phase algorithm for solving the single allocation p-hub center problem","volume":"36","author":"Meyer","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107595_b29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","article-title":"Memetic algorithms and memetic computing optimization: A literature review","volume":"2","author":"Neri","year":"2012","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"10.1016\/j.cor.2026.107595_b30","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s10845-012-0717-7","article-title":"Hub network design problem in the presence of disruptions","volume":"25","author":"Parvaresh","year":"2014","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"10.1016\/j.cor.2026.107595_b31","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1111\/itor.12441","article-title":"Models and solution methods for the uncapacitated r-allocation p-hub equitable center problem","volume":"25","author":"Peir\u00f3","year":"2018","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2026.107595_b32","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.cor.2013.08.026","article-title":"GRASP for the uncapacitated r-allocation p-hub median problem","volume":"43","author":"Peir\u00f3","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107595_b33","doi-asserted-by":"crossref","first-page":"405","DOI":"10.5267\/j.ijiec.2015.2.002","article-title":"Solving uncapacitated multiple allocation p-hub center problem by Dijkstra\u2019s algorithm-based genetic algorithm and simulated annealing","volume":"6","author":"Rabbani","year":"2015","journal-title":"Int. J. Ind. Eng. Comput."},{"issue":"4","key":"10.1016\/j.cor.2026.107595_b34","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2014A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"issue":"5","key":"10.1016\/j.cor.2026.107595_b35","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1109\/TNN.1998.712192","article-title":"Reinforcement learning: An introduction","volume":"9","author":"Sutton","year":"1998","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1","key":"10.1016\/j.cor.2026.107595_b36","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/S0377-2217(02)00669-0","article-title":"A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem","volume":"152","author":"Tarantilis","year":"2004","journal-title":"European J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107595_b37","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1007\/s11590-015-0867-6","article-title":"A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem","volume":"11","author":"Todosijevi\u0107","year":"2017","journal-title":"Optim. Lett."},{"issue":"3","key":"10.1016\/j.cor.2026.107595_b38","first-page":"279","article-title":"Q-learning","volume":"8","author":"Watkins","year":"1992","journal-title":"Mach. Learn."},{"issue":"11","key":"10.1016\/j.cor.2026.107595_b39","doi-asserted-by":"crossref","first-page":"2725","DOI":"10.1016\/j.cor.2012.02.005","article-title":"Star p-hub center problem and star p-hub median problem with bounded path lengths","volume":"39","author":"Yaman","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107595_b40","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2024.103715","article-title":"Enhancing airline connectivity: An optimisation approach for flight scheduling in multi-hub networks with bank structures","volume":"191","author":"Yang","year":"2024","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.cor.2026.107595_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2023.103330","article-title":"The maximal detour liner shipping hub location problem: Improving the applicability of the p-hub center problem","volume":"179","author":"Yang","year":"2023","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.cor.2026.107595_b42","first-page":"12445","article-title":"Combining reinforcement learning with lin-kernighan-helsgaun algorithm for the traveling salesman problem","volume":"vol. 35","author":"Zheng","year":"2021"},{"key":"10.1016\/j.cor.2026.107595_b43","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.eswa.2016.07.047","article-title":"Reinforcement learning based local search for grouping problems: A case study on graph coloring","volume":"64","author":"Zhou","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107595_b44","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.ins.2021.04.014","article-title":"Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering","volume":"569","author":"Zhou","year":"2021","journal-title":"Inform. Sci."},{"key":"10.1016\/j.cor.2026.107595_b45","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106758","article-title":"A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem","volume":"170","author":"Zou","year":"2024","journal-title":"Comput. Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826002133?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826002133?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T20:56:03Z","timestamp":1787259363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826002133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":45,"alternative-id":["S0305054826002133"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107595","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reinforcement learning-driven dynamic threshold search for the uncapacitated -allocation -hub center problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107595","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107595"}}