{"id":"https://openalex.org/W2016931564","doi":"https://doi.org/10.1109/bmei.2011.6098776","title":"Modified shuffled frog leaping algorithm applying on logistics distribution vehicle rounting problem","display_name":"Modified shuffled frog leaping algorithm applying on logistics distribution vehicle rounting problem","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2016931564","doi":"https://doi.org/10.1109/bmei.2011.6098776","mag":"2016931564"},"language":"en","primary_location":{"id":"doi:10.1109/bmei.2011.6098776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bmei.2011.6098776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 4th International Conference on Biomedical Engineering and Informatics (BMEI)","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/A5057292264","display_name":"\u674e\u5ca9 Li Yan","orcid":"https://orcid.org/0000-0002-7978-1801"},"institutions":[{"id":"https://openalex.org/I4210110558","display_name":"Xi'an Technological University","ror":"https://ror.org/01t8prc81","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210110558"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yan Li","raw_affiliation_strings":["School of Mechanical Engineering, Xi'an Technological University, Xian, China","School of Mechanical Engineering,Xi\u2032an Technological University,Xi\u2032an 710032,China)"],"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering, Xi'an Technological University, Xian, China","institution_ids":["https://openalex.org/I4210110558"]},{"raw_affiliation_string":"School of Mechanical Engineering,Xi\u2032an Technological University,Xi\u2032an 710032,China)","institution_ids":["https://openalex.org/I4210110558"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084896610","display_name":"Kong Xiu-fen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110558","display_name":"Xi'an Technological University","ror":"https://ror.org/01t8prc81","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210110558"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kong Xiu-fen","raw_affiliation_strings":["School of Mechanical Engineering, Xi'an Technological University, Xian, China","School of Mechanical Engineering,Xi\u2032an Technological University,Xi\u2032an 710032,China)"],"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering, Xi'an Technological University, Xian, China","institution_ids":["https://openalex.org/I4210110558"]},{"raw_affiliation_string":"School of Mechanical Engineering,Xi\u2032an Technological University,Xi\u2032an 710032,China)","institution_ids":["https://openalex.org/I4210110558"]}]},{"author_position":"last","author":{"id":null,"display_name":"Hao Rui-qing","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110558","display_name":"Xi'an Technological University","ror":"https://ror.org/01t8prc81","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210110558"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Rui-qing","raw_affiliation_strings":["School of Mechanical Engineering, Xi'an Technological University, Xian, China","School of Mechanical Engineering,Xi\u2032an Technological University,Xi\u2032an 710032,China)"],"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering, Xi'an Technological University, Xian, China","institution_ids":["https://openalex.org/I4210110558"]},{"raw_affiliation_string":"School of Mechanical Engineering,Xi\u2032an Technological University,Xi\u2032an 710032,China)","institution_ids":["https://openalex.org/I4210110558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057292264"],"corresponding_institution_ids":["https://openalex.org/I4210110558"],"apc_list":null,"apc_paid":null,"fwci":1.5238,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.84440654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"36","issue":null,"first_page":"2277","last_page":"2280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9959999918937683,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9932000041007996,"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.873753547668457},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8633617162704468},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6751589775085449},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6656589508056641},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.6617506146430969},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6193604469299316},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6059873700141907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.571678102016449},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5589197874069214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5447190999984741},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4399252235889435},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.35584813356399536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29393523931503296}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.873753547668457},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8633617162704468},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6751589775085449},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6656589508056641},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.6617506146430969},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6193604469299316},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6059873700141907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.571678102016449},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5589197874069214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5447190999984741},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4399252235889435},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.35584813356399536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29393523931503296},{"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/bmei.2011.6098776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bmei.2011.6098776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 4th International Conference on Biomedical Engineering and Informatics (BMEI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2032765915","https://openalex.org/W2072269936","https://openalex.org/W2108753073","https://openalex.org/W2167920923","https://openalex.org/W2352463879","https://openalex.org/W2357231897","https://openalex.org/W2363290963","https://openalex.org/W2369774897","https://openalex.org/W2370754727","https://openalex.org/W2375792801","https://openalex.org/W2379449794","https://openalex.org/W2385767638","https://openalex.org/W6708454514","https://openalex.org/W6983354532"],"related_works":["https://openalex.org/W2774602532","https://openalex.org/W2385780082","https://openalex.org/W2163647484","https://openalex.org/W1977672343","https://openalex.org/W2244079844","https://openalex.org/W2804769572","https://openalex.org/W47248985","https://openalex.org/W4293253022","https://openalex.org/W2000270779","https://openalex.org/W2171107778"],"abstract_inverted_index":{"To":[0],"solve":[1,22],"the":[2,8,23,48,62,69,91,105],"Logistics":[3],"Distribution":[4],"Vehicle":[5],"Routing":[6],"Problem(VRP),":[7],"Modified":[9],"Shuffled":[10],"Frog":[11],"leaping":[12],"Algorithm(MSFLA)":[13],"is":[14,19,53,65,72,96,110],"advanced.":[15],"The":[16,75],"Greedy":[17],"Method":[18],"applied":[20],"to":[21,42,45,81,103,112],"VRP":[24,30],"with":[25],"step-by-step":[26],"answers,":[27],"which":[28],"turns":[29],"into":[31],"Traveling":[32],"Salesman":[33],"Problem(TSP)seeking":[34],"for":[35,56],"route":[36],"K.":[37],"Then":[38],"SFLA":[39,52,95],"was":[40],"used":[41],"offer":[43],"solution":[44],"TSP.":[46],"But":[47],"traditional":[49,63],"model":[50],"of":[51],"not":[54],"fit":[55],"discrete":[57],"combinatorial":[58],"optimization":[59],"problems.":[60],"So":[61],"one":[64],"be":[66,113],"improved,":[67],"and":[68,90,109],"memetic":[70],"algorithm":[71,89],"brought":[73],"in.":[74],"computational":[76],"results":[77],"demonetrate":[78],"that":[79],"compared":[80],"ant":[82],"colony":[83],"optimization,":[84],"local":[85],"search":[86],"algorithm,":[87,94],"genetic":[88,93],"hybrid":[92],"faster.":[97],"It":[98],"has":[99],"a":[100],"stronger":[101],"ability":[102],"achieve":[104],"most":[106],"optimistic":[107],"result,":[108],"easier":[111],"implemented.":[114]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}