{"id":"https://openalex.org/W4414490567","doi":"https://doi.org/10.1007/s44443-025-00205-0","title":"Edge assembly combined with arc-based crossover for undirected traveling salesman with profits","display_name":"Edge assembly combined with arc-based crossover for undirected traveling salesman with profits","publication_year":2025,"publication_date":"2025-09-24","ids":{"openalex":"https://openalex.org/W4414490567","doi":"https://doi.org/10.1007/s44443-025-00205-0"},"language":"en","primary_location":{"id":"doi:10.1007/s44443-025-00205-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-025-00205-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44443-025-00205-0.pdf","source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/s44443-025-00205-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032759914","display_name":"Jie Wang","orcid":"https://orcid.org/0009-0004-9624-9544"},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jie Wang","raw_affiliation_strings":["Anhui Provincial Key Laboratory of Multimodal Cognitive Computation, Anhui University, Hefei, 230093, China","College of Computer Science and Technology, Qingdao University, Qingdao, 266071, China"],"raw_orcid":"https://orcid.org/0009-0004-9624-9544","affiliations":[{"raw_affiliation_string":"Anhui Provincial Key Laboratory of Multimodal Cognitive Computation, Anhui University, Hefei, 230093, China","institution_ids":["https://openalex.org/I143868143"]},{"raw_affiliation_string":"College of Computer Science and Technology, Qingdao University, Qingdao, 266071, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038147670","display_name":"Xueshi Dong","orcid":"https://orcid.org/0000-0002-3859-5957"},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]},{"id":"https://openalex.org/I154099455","display_name":"Shandong University","ror":"https://ror.org/0207yh398","country_code":"CN","type":"education","lineage":["https://openalex.org/I154099455"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xueshi Dong","raw_affiliation_strings":["Anhui Provincial Key Laboratory of Multimodal Cognitive Computation, Anhui University, Hefei, 230093, China","College of Computer Science and Technology, Qingdao University, Qingdao, 266071, China","Shandong Provincial Key Laboratory of Software Engineering, Shandong University, Jinan, 250101, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Anhui Provincial Key Laboratory of Multimodal Cognitive Computation, Anhui University, Hefei, 230093, China","institution_ids":["https://openalex.org/I143868143"]},{"raw_affiliation_string":"College of Computer Science and Technology, Qingdao University, Qingdao, 266071, China","institution_ids":[]},{"raw_affiliation_string":"Shandong Provincial Key Laboratory of Software Engineering, Shandong University, Jinan, 250101, China","institution_ids":["https://openalex.org/I154099455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038147670"],"corresponding_institution_ids":["https://openalex.org/I143868143","https://openalex.org/I154099455"],"apc_list":{"value":1350,"currency":"USD","value_usd":1350},"apc_paid":{"value":1350,"currency":"USD","value_usd":1350},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32585227,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"8","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.9923999905586243,"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/crossover","display_name":"Crossover","score":0.9101999998092651},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8082000017166138},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.49000000953674316},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4733999967575073},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.3984000086784363},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.38589999079704285},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.3682999908924103}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9101999998092651},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8082000017166138},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7635999917984009},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.49000000953674316},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4733999967575073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4447000026702881},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39559999108314514},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.38589999079704285},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.3682999908924103},{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C44104985","wikidata":"https://www.wikidata.org/wiki/Q492886","display_name":"Supply chain management","level":3,"score":0.265500009059906},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.2531999945640564}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s44443-025-00205-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-025-00205-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44443-025-00205-0.pdf","source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:9657194d233d408ea5e6755bb7c2fadc","is_oa":true,"landing_page_url":"https://doaj.org/article/9657194d233d408ea5e6755bb7c2fadc","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of King Saud University: Computer and Information Sciences, Vol 37, Iss 8, Pp 1-27 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s44443-025-00205-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-025-00205-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44443-025-00205-0.pdf","source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4940443104","display_name":null,"funder_award_id":"ZR2023MF092","funder_id":"https://openalex.org/F4320324174","funder_display_name":"Natural Science Foundation of Shandong Province"}],"funders":[{"id":"https://openalex.org/F4320311026","display_name":"Shandong University","ror":"https://ror.org/0207yh398"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321435","display_name":"Anhui University","ror":"https://ror.org/05th6yx34"},{"id":"https://openalex.org/F4320324174","display_name":"Natural Science Foundation of Shandong Province","ror":null},{"id":"https://openalex.org/F4320326220","display_name":"Shandong Provincial Key Laboratory of Software Engineering","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414490567.pdf","grobid_xml":"https://content.openalex.org/works/W4414490567.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1501108511","https://openalex.org/W1979488556","https://openalex.org/W1980328733","https://openalex.org/W1982052569","https://openalex.org/W1986056047","https://openalex.org/W1991149726","https://openalex.org/W2003281104","https://openalex.org/W2017903413","https://openalex.org/W2022236762","https://openalex.org/W2028630422","https://openalex.org/W2033181249","https://openalex.org/W2044119054","https://openalex.org/W2075986198","https://openalex.org/W2102204056","https://openalex.org/W2106378689","https://openalex.org/W2111174053","https://openalex.org/W2119601963","https://openalex.org/W2135475768","https://openalex.org/W2137042221","https://openalex.org/W2140596151","https://openalex.org/W2520832036","https://openalex.org/W2750785333","https://openalex.org/W2909272244","https://openalex.org/W2998709212","https://openalex.org/W3097633812","https://openalex.org/W3214868035","https://openalex.org/W4230566462","https://openalex.org/W4250280589","https://openalex.org/W4381854486","https://openalex.org/W4389076400","https://openalex.org/W4399134844","https://openalex.org/W4404076337","https://openalex.org/W4404238003","https://openalex.org/W4408590817"],"related_works":[],"abstract_inverted_index":{"In":[0,51],"the":[1,7,54,93,117,124],"traveling":[2,13],"salesman":[3,14],"problem":[4,9,15],"with":[5,21],"profit,":[6],"orienteering":[8],"(OP)":[10],"and":[11,59,87,100,114,140],"prize-collecting":[12],"(PCTSP)":[16],"are":[17],"two":[18],"typical":[19],"TSPs":[20],"profits.":[22],"The":[23,37],"PCTSP":[24,60],"aims":[25],"to":[26,41,110,130],"minimize":[27],"travel":[28],"costs":[29],"while":[30],"satisfying":[31],"a":[32,46,65,76],"minimum":[33],"profit":[34,43],"threshold":[35],"constraint.":[36,50],"OP":[38,58,86],"objective":[39],"is":[40],"maximize":[42],"without":[44],"exceeding":[45],"given":[47],"maximum":[48],"cost":[49],"current":[52],"research,":[53],"conflicting":[55],"objectives":[56],"of":[57,84,95,136],"pose":[61],"challenges":[62],"for":[63,81],"designing":[64],"unified":[66,82],"solution":[67,83,138],"framework.":[68],"To":[69],"address":[70],"this":[71,73],"conflict,":[72],"study":[74],"proposes":[75],"new":[77],"genetic":[78],"algorithm":[79],"framework":[80,90,126],"both":[85],"PCTSP.":[88],"This":[89],"innovatively":[91],"combines":[92],"advantages":[94],"edge":[96],"assembly":[97],"crossover":[98,102],"operators":[99],"arc":[101],"operators,":[103],"introduces":[104],"an":[105],"adaptive":[106],"offspring":[107,118,137],"management":[108],"strategy":[109],"generate":[111],"high-quality":[112],"offspring,":[113],"continuously":[115],"optimizes":[116],"solutions.":[119],"Extensive":[120],"experiments":[121],"demonstrate":[122],"that":[123],"proposed":[125],"achieves":[127],"comparable":[128],"performance":[129],"existing":[131],"state-of-the-art":[132],"methods":[133],"in":[134],"terms":[135],"quality":[139],"algorithmic":[141],"efficiency.":[142]},"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}