{"id":"https://openalex.org/W2537489917","doi":"https://doi.org/10.1109/fskd.2016.7603219","title":"Solving the shortest-path problem in logistics distribution for vehicle-routing optimization","display_name":"Solving the shortest-path problem in logistics distribution for vehicle-routing optimization","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2537489917","doi":"https://doi.org/10.1109/fskd.2016.7603219","mag":"2537489917"},"language":"en","primary_location":{"id":"doi:10.1109/fskd.2016.7603219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fskd.2016.7603219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","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/A5082662223","display_name":"Baoxian Jia","orcid":"https://orcid.org/0000-0001-9864-5437"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Baoxian Jia","raw_affiliation_strings":["College of Computer Science, Liaocheng University, Liaocheng 252059, P.R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, Liaocheng University, Liaocheng 252059, P.R. China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052330166","display_name":"Yong Wang","orcid":"https://orcid.org/0000-0002-5247-043X"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yong Wang","raw_affiliation_strings":["College of Computer Science, Liaocheng University, Liaocheng 252059, P.R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, Liaocheng University, Liaocheng 252059, P.R. China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100963926","display_name":"Jinhai Yuan","orcid":null},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jinhai Yuan","raw_affiliation_strings":["College of Computer Science, Liaocheng University, Liaocheng 252059, P.R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, Liaocheng University, Liaocheng 252059, P.R. China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100623231","display_name":"Junqing Li","orcid":"https://orcid.org/0000-0002-3617-6708"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Junqing Li","raw_affiliation_strings":["College of Computer Science, Dongbei University, Shenyang 110006, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, Dongbei University, Shenyang 110006, PR China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15182786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"471","last_page":"475"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9707000255584717,"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/harmony-search","display_name":"Harmony search","score":0.8356263637542725},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7713693380355835},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6978122591972351},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6037219166755676},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5664347410202026},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5270258188247681},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.48805010318756104},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.47004809975624084},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4512667655944824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3465840816497803},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.29887574911117554},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2840041518211365},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.27694979310035706},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1567555069923401}],"concepts":[{"id":"https://openalex.org/C33099171","wikidata":"https://www.wikidata.org/wiki/Q26208718","display_name":"Harmony search","level":2,"score":0.8356263637542725},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7713693380355835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6978122591972351},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6037219166755676},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5664347410202026},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5270258188247681},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.48805010318756104},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.47004809975624084},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4512667655944824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3465840816497803},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.29887574911117554},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2840041518211365},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.27694979310035706},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1567555069923401},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fskd.2016.7603219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fskd.2016.7603219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1993885071","https://openalex.org/W2099239187","https://openalex.org/W2117473144","https://openalex.org/W2167378942"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2523719706","https://openalex.org/W2161960576","https://openalex.org/W2368964068","https://openalex.org/W4293054712","https://openalex.org/W2198982833","https://openalex.org/W2358094779","https://openalex.org/W2366342492","https://openalex.org/W2030169809","https://openalex.org/W2597144308"],"abstract_inverted_index":{"The":[0,9],"classical":[1,41],"harmony":[2,42,88],"search":[3],"(HS)":[4],"algorithm":[5,10,43,106,111,114],"has":[6],"been":[7],"improved.":[8],"effectively":[11],"prevents":[12],"it":[13],"from":[14],"becoming":[15],"trapped":[16],"by":[17,54],"a":[18],"local":[19],"optimal":[20,47],"solution.":[21],"It":[22],"allows":[23],"to":[24,27],"be":[25],"used":[26],"deale":[28],"the":[29,34,40,46,50,55,58,66,70,79,83,87,94,98,104,116],"shortest-path":[30],"issue.":[31],"To":[32],"solve":[33],"shortest":[35,95],"route":[36],"problem,":[37],"we":[38,64,91],"improved":[39],"and":[44,112],"seek":[45],"solution":[48],"in":[49,78],"global":[51],"scope.":[52],"Second,":[53],"application":[56],"of":[57,73,76,86],"dynamic":[59],"priority":[60,71],"value":[61,72],"encoding":[62],"scheme,":[63],"constructed":[65],"path":[67],"based":[68],"on":[69,115],"correspondent":[74],"nodes":[75],"variables":[77],"harmonic":[80],"vector.":[81],"Through":[82],"iterative":[84],"update":[85],"memory":[89],"banks,":[90],"finally":[92],"obtained":[93],"route.":[96],"Finally":[97],"simulation":[99],"experiments":[100],"show":[101],"us":[102],"that":[103],"proposed":[105],"is":[107],"better":[108],"than":[109],"PSO":[110],"HS":[113],"performance.":[117]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}