{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T18:10:09Z","timestamp":1745259009172,"version":"3.40.4"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100000646","name":"Japan Society for the Promotion of Science (JSPS) KAKENHI","doi-asserted-by":"publisher","award":["21K14367","23K20268","25K00180"],"award-info":[{"award-number":["21K14367","23K20268","25K00180"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3558359","type":"journal-article","created":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T21:59:37Z","timestamp":1744063177000},"page":"63952-63968","source":"Crossref","is-referenced-by-count":0,"title":["New Heuristic Approaches for the Min\u2013Max Regret Traveling Salesman Problem"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9019-9919","authenticated-orcid":false,"given":"Kazuki","family":"Hasegawa","sequence":"first","affiliation":[{"name":"Graduate School of Integrated Science and Technology, Shizuoka University, Hamamatsu, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0443-3642","authenticated-orcid":false,"given":"Wei","family":"Wu","sequence":"additional","affiliation":[{"name":"Graduate School of Integrated Science and Technology, Shizuoka University, Hamamatsu, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0970-9414","authenticated-orcid":false,"given":"Mutsunori","family":"Yagiura","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Nagoya University, Nagoya, Aichi, Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.09.012"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.01.053"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0065"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2014.10.003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2011111"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-015-0949-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1515\/mper-2015-0021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.03.008"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2011.01.056"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2014.0632"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey","key":"ref12"},{"volume-title":"The travelling salesman problem and related problems","year":"1978","author":"Gavish","key":"ref13"},{"key":"ref14","article-title":"Completeness in the polynomial hierarchy for many natural problems in bilevel and robust optimization","author":"Gr\u00fcne","year":"2023","journal-title":"arXiv:2311.10540"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107275"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/b101971"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IEEM55944.2022.9989586"},{"article-title":"The robust shortest path problem with interval data","year":"2001","author":"Kara\u015fan","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.11.001"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-021-00483-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2019.1607848"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.5772\/12909"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.02.060"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.10.008"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1060.0181"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.01.009"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.11.009"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-011-0876-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.02.018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref32","first-page":"1","article-title":"The traveling salesman problem under dynamic uncertainty","volume-title":"Proc. Int. Logistics Supply Chain Congr.","author":"Yan\u0131k"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107439"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3128433"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.08.007"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.1189"},{"key":"ref37","first-page":"7472","article-title":"NeuroLKH: Combining deep learning model with Lin-Kernighan-Helsgaun heuristic for solving the traveling salesman problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xin"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00078-5"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10950365.pdf?arnumber=10950365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T17:41:27Z","timestamp":1745257287000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10950365\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3558359","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}