{"id":"https://openalex.org/W7125982199","doi":"https://doi.org/10.1109/smc58881.2025.11342705","title":"Controllable Multimodal Landscapes: An Interpretable Surrogate Model for Combinatorial Spaces and Its Application to the k-Order Traveling Salesman Problem","display_name":"Controllable Multimodal Landscapes: An Interpretable Surrogate Model for Combinatorial Spaces and Its Application to the k-Order Traveling Salesman Problem","publication_year":2025,"publication_date":"2025-10-05","ids":{"openalex":"https://openalex.org/W7125982199","doi":"https://doi.org/10.1109/smc58881.2025.11342705"},"language":null,"primary_location":{"id":"doi:10.1109/smc58881.2025.11342705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc58881.2025.11342705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-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/A5124130498","display_name":"Feng Luan","orcid":null},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Feng Luan","raw_affiliation_strings":["Xi&#x2019;an Jiaotong University,School of Mathematics and Statistics,Xi&#x2019;an,China,710049"],"affiliations":[{"raw_affiliation_string":"Xi&#x2019;an Jiaotong University,School of Mathematics and Statistics,Xi&#x2019;an,China,710049","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057345644","display_name":"Jialong Shi","orcid":"https://orcid.org/0000-0002-4965-916X"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jialong Shi","raw_affiliation_strings":["Xi&#x2019;an Jiaotong University,School of Mathematics and Statistics,Xi&#x2019;an,China,710049"],"affiliations":[{"raw_affiliation_string":"Xi&#x2019;an Jiaotong University,School of Mathematics and Statistics,Xi&#x2019;an,China,710049","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101947152","display_name":"Jiayu Sun","orcid":"https://orcid.org/0000-0002-0920-5948"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianyong Sun","raw_affiliation_strings":["Xi&#x2019;an Jiaotong University,School of Mathematics and Statistics,Xi&#x2019;an,China,710049"],"affiliations":[{"raw_affiliation_string":"Xi&#x2019;an Jiaotong University,School of Mathematics and Statistics,Xi&#x2019;an,China,710049","institution_ids":["https://openalex.org/I87445476"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5124130498"],"corresponding_institution_ids":["https://openalex.org/I87445476"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.78161512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1428","last_page":"1433"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.48910000920295715,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.48910000920295715,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.3716000020503998,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.03779999911785126,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8051999807357788},{"id":"https://openalex.org/keywords/fitness-landscape","display_name":"Fitness landscape","score":0.6171000003814697},{"id":"https://openalex.org/keywords/surrogate-model","display_name":"Surrogate model","score":0.6147000193595886},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.571399986743927},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5117999911308289},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.48739999532699585},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4246000051498413},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42340001463890076},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.3901999890804291}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8051999807357788},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.660099983215332},{"id":"https://openalex.org/C91852762","wikidata":"https://www.wikidata.org/wiki/Q3307742","display_name":"Fitness landscape","level":3,"score":0.6171000003814697},{"id":"https://openalex.org/C131675550","wikidata":"https://www.wikidata.org/wiki/Q7646884","display_name":"Surrogate model","level":2,"score":0.6147000193595886},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.571399986743927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5508000254631042},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5117999911308289},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.48739999532699585},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4246000051498413},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42340001463890076},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.3901999890804291},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.38029998540878296},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37040001153945923},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3521000146865845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34769999980926514},{"id":"https://openalex.org/C37423430","wikidata":"https://www.wikidata.org/wiki/Q6750281","display_name":"Hull","level":2,"score":0.3411000072956085},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3411000072956085},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.2696000039577484},{"id":"https://openalex.org/C169258074","wikidata":"https://www.wikidata.org/wiki/Q245748","display_name":"Random forest","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.2590999901294708},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc58881.2025.11342705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc58881.2025.11342705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7956882119178772,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2016851559","https://openalex.org/W2072484718","https://openalex.org/W2096369439","https://openalex.org/W2118806472","https://openalex.org/W2163428398","https://openalex.org/W2166739626","https://openalex.org/W2262276395","https://openalex.org/W2336467679","https://openalex.org/W2546299924","https://openalex.org/W2558036667","https://openalex.org/W2564051927","https://openalex.org/W2895700336","https://openalex.org/W3015164793","https://openalex.org/W3154887145","https://openalex.org/W4404095893"],"related_works":[],"abstract_inverted_index":{"Surrogate":[0],"models":[1,16],"are":[2,82,88,106],"widely":[3],"employed":[4],"to":[5,93,109,129],"address":[6],"optimization":[7],"problems":[8],"with":[9,61],"high":[10],"computational":[11],"complexity.":[12],"However,":[13],"interpretable":[14],"surrogate":[15,29,143],"for":[17,39],"Combinatorial":[18],"Optimization":[19,125],"Problems":[20],"(COPs)":[21],"remain":[22],"underexplored.":[23],"In":[24],"this":[25],"paper,":[26],"a":[27,56,65,69,111],"novel":[28],"model,":[30],"termed":[31],"the":[32,40,53,73,99,116,120,131,134,140],"Controllable":[33],"Multimodal":[34],"Landscape":[35],"(CML),":[36],"is":[37,50,127],"proposed":[38,48,141],"k-order":[41,74,121,157],"Traveling":[42,57],"Salesman":[43,58],"Problem":[44,59],"(k-order":[45],"TSP).":[46],"The":[47],"method":[49],"inspired":[51],"by":[52],"observation":[54],"that":[55,114,139],"(TSP)":[60],"cities":[62],"arranged":[63],"on":[64,91],"convex":[66,85],"hull":[67,86],"exhibits":[68],"unimodal":[70,96,104],"landscape.":[71],"For":[72],"TSP,":[75],"multiple":[76,95],"local":[77],"optima":[78],"(or":[79],"high-quality":[80],"solutions)":[81],"collected,":[83],"and":[84],"TSPs":[87],"constructed":[89],"based":[90],"them":[92],"generate":[94],"landscapes":[97,105],"sharing":[98],"same":[100],"search":[101],"space.":[102],"These":[103],"then":[107],"combined":[108],"form":[110],"multimodal":[112],"landscape":[113,118],"approximates":[115],"original":[117],"of":[119,133],"TSP.":[122],"Particle":[123],"Swarm":[124],"(PSO)":[126],"used":[128],"optimize":[130],"parameters":[132],"CML.":[135],"Experimental":[136],"results":[137],"demonstrate":[138],"CML":[142],"model":[144],"achieves":[145],"higher":[146],"accuracy":[147],"than":[148],"Random":[149],"Forest":[150],"(RF)":[151],"in":[152],"most":[153],"test":[154],"cases":[155],"involving":[156],"TSP":[158],"instances.":[159]},"counts_by_year":[],"updated_date":"2026-01-29T23:17:01.242718","created_date":"2026-01-29T00:00:00"}
