{"id":"https://openalex.org/W2928616111","doi":"https://doi.org/10.1109/access.2019.2908011","title":"A Multi-Stage Metaheuristic Algorithm for Shortest Simple Path Problem With Must-Pass Nodes","display_name":"A Multi-Stage Metaheuristic Algorithm for Shortest Simple Path Problem With Must-Pass Nodes","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2928616111","doi":"https://doi.org/10.1109/access.2019.2908011","mag":"2928616111"},"language":"en","primary_location":{"id":"doi:10.1109/access.2019.2908011","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2019.2908011","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08681195.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08681195.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006987699","display_name":"Zhouxing Su","orcid":"https://orcid.org/0000-0002-4794-9833"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhouxing Su","raw_affiliation_strings":["SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"],"raw_orcid":"https://orcid.org/0000-0002-4794-9833","affiliations":[{"raw_affiliation_string":"SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101872054","display_name":"Junchen Zhang","orcid":"https://orcid.org/0000-0002-3631-5691"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junchen Zhang","raw_affiliation_strings":["SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112426558","display_name":"Zhipeng Lu","orcid":null},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhipeng Lu","raw_affiliation_strings":["SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"],"raw_orcid":"https://orcid.org/0000-0002-0618-4969","affiliations":[{"raw_affiliation_string":"SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47720641"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.6631,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.75551876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"7","issue":null,"first_page":"52142","last_page":"52154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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.9994000196456909,"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/T11106","display_name":"Data Management and Algorithms","score":0.9747999906539917,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9710999727249146,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6518852710723877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5997864007949829},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5810224413871765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.572489857673645},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5460680723190308},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5200493335723877},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.49144089221954346},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4482387602329254},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44422924518585205},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37367045879364014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35669609904289246},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16531884670257568}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6518852710723877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5997864007949829},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5810224413871765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.572489857673645},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5460680723190308},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5200493335723877},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.49144089221954346},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4482387602329254},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44422924518585205},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37367045879364014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35669609904289246},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16531884670257568},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2019.2908011","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2019.2908011","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08681195.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:619ce30b207948cd8aff64d91593629c","is_oa":true,"landing_page_url":"https://doaj.org/article/619ce30b207948cd8aff64d91593629c","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":"IEEE Access, Vol 7, Pp 52142-52154 (2019)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2019.2908011","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2019.2908011","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08681195.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2359263269","display_name":null,"funder_award_id":"71320107001","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5569725013","display_name":null,"funder_award_id":"61370183","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2928616111.pdf","grobid_xml":"https://content.openalex.org/works/W2928616111.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1914921536","https://openalex.org/W1965039153","https://openalex.org/W1981700549","https://openalex.org/W1982904363","https://openalex.org/W2011282943","https://openalex.org/W2017708378","https://openalex.org/W2042986967","https://openalex.org/W2059186030","https://openalex.org/W2092330486","https://openalex.org/W2107535850","https://openalex.org/W2119621371","https://openalex.org/W2131220848","https://openalex.org/W2135424692","https://openalex.org/W2144050074","https://openalex.org/W2151842399","https://openalex.org/W2163428398","https://openalex.org/W2346338475","https://openalex.org/W2355126332","https://openalex.org/W2540978065","https://openalex.org/W2580868853","https://openalex.org/W2613070411","https://openalex.org/W2757496057","https://openalex.org/W4245982627","https://openalex.org/W6732196983"],"related_works":["https://openalex.org/W2789681586","https://openalex.org/W2794361564","https://openalex.org/W4243392960","https://openalex.org/W3156820950","https://openalex.org/W4232791346","https://openalex.org/W2971069100","https://openalex.org/W2504553392","https://openalex.org/W2331509522","https://openalex.org/W2937748796","https://openalex.org/W2033250653"],"abstract_inverted_index":{"The":[0,35,100,138],"shortest":[1],"simple":[2,14,118],"path":[3,15,88,119],"problem":[4,64,111],"with":[5,151],"must-pass":[6,33],"nodes":[7,23,31,48,91],"(SSPP-MPN)":[8],"aims":[9],"to":[10,40,108,123,130],"find":[11],"a":[12,17,66,75],"minimum-cost":[13],"in":[16,128,161],"directed":[18],"graph,":[19],"where":[20],"some":[21],"specified":[22,30,47],"must":[24],"be":[25,41],"visited.":[26],"We":[27],"call":[28],"these":[29],"as":[32,58,60,84],"nodes.":[34],"SSPP-MPN":[36],"has":[37],"been":[38],"proven":[39],"NP-hard":[42,68],"when":[43],"the":[44,61,98,104,110,117,125,132,135,155,158],"number":[45],"of":[46,103,134,145,157,163],"is":[49,55,107],"more":[50],"than":[51],"one,":[52],"and":[53,93,121,149,167],"it":[54],"at":[56],"least":[57],"difficult":[59],"traveling":[62],"salesmen":[63],"(TSP),":[65],"well-known":[67],"problem.":[69,137],"In":[70],"this":[71],"paper,":[72],"we":[73],"propose":[74],"multi-stage":[76],"metaheuristic":[77],"algorithm":[78,106,160],"based":[79],"on":[80,142],"multiple":[81],"strategies":[82],"such":[83],"k-opt":[85],"move,":[86],"candidate":[87],"search,":[89],"conflicting":[90],"promotion,":[92],"connectivity":[94],"relaxation":[95],"for":[96],"solving":[97],"SSPP-MPN.":[99],"main":[101],"idea":[102],"proposed":[105,159],"transform":[109],"into":[112],"classical":[113],"TSP":[114],"by":[115],"relaxing":[116],"constraint":[120],"try":[122],"repair":[124],"obtained":[126],"solutions":[127],"order":[129],"meet":[131],"demands":[133],"original":[136],"computational":[139,168],"results":[140],"tested":[141],"three":[143],"sets":[144],"totally":[146],"863":[147],"instances":[148],"comparisons":[150],"reference":[152],"algorithms":[153],"show":[154],"efficacy":[156],"terms":[162],"both":[164],"solution":[165],"quality":[166],"efficiency.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}