乐胖代购免代理版

{"id":"https://openalex.org/W2246405718","doi":"https://doi.org/10.1109/ieem.2015.7385846","title":"An iterated local search algorithm for the multi-vehicle covering tour problem","display_name":"An iterated local search algorithm for the multi-vehicle covering tour problem","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2246405718","doi":"https://doi.org/10.1109/ieem.2015.7385846","mag":"2246405718"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem.2015.7385846","pdf_url":null,"source":{"id":"https://openalex.org/S4363607822","display_name":"2021 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5082865897","display_name":"Yosuke TAKADA","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"funder","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yosuke Takada","raw_affiliation_strings":["Nagoya Daigaku, Nagoya, Aichi, JP"],"affiliations":[{"raw_affiliation_string":"Nagoya Daigaku, Nagoya, Aichi, JP","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108412538","display_name":"Yannan Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"funder","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yannan Hu","raw_affiliation_strings":["Nagoya Daigaku, Nagoya, Aichi, JP"],"affiliations":[{"raw_affiliation_string":"Nagoya Daigaku, Nagoya, Aichi, JP","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084267191","display_name":"Hideki Hashimoto","orcid":"https://orcid.org/0000-0003-4771-1240"},"institutions":[{"id":"https://openalex.org/I48840829","display_name":"Tokyo University of Marine Science and Technology","ror":"https://ror.org/048nxq511","country_code":"JP","type":"funder","lineage":["https://openalex.org/I48840829"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hideki Hashimoto","raw_affiliation_strings":["Dept. Logistics and Information Engineering, Tokyo University of Marine Science and Technology, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. Logistics and Information Engineering, Tokyo University of Marine Science and Technology, Tokyo, Japan","institution_ids":["https://openalex.org/I48840829"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046237399","display_name":"Mutsunori Yagiura","orcid":"https://orcid.org/0000-0003-0970-9414"},"institutions":[{"id":"https://openalex.org/I48840829","display_name":"Tokyo University of Marine Science and Technology","ror":"https://ror.org/048nxq511","country_code":"JP","type":"funder","lineage":["https://openalex.org/I48840829"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Mutsunori Yagiura","raw_affiliation_strings":["Dept. Logistics and Information Engineering, Tokyo University of Marine Science and Technology, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. Logistics and Information Engineering, Tokyo University of Marine Science and Technology, Tokyo, Japan","institution_ids":["https://openalex.org/I48840829"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":2,"citation_normalized_percentile":{"value":0.523655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":73,"max":76},"biblio":{"volume":"226","issue":null,"first_page":"1242","last_page":"1246"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998,"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.9998,"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.9961,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9904,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.69828326},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6785741},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.49301454}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.715107},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.69828326},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6785741},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.56825507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5587754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.51759064},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.49301454},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4902025},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4770343},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4646221},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40173548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33854276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24884212},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11655223},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem.2015.7385846","pdf_url":null,"source":{"id":"https://openalex.org/S4363607822","display_name":"2021 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.73}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":5,"referenced_works":["https://openalex.org/W1966175066","https://openalex.org/W1978887754","https://openalex.org/W2052142239","https://openalex.org/W2149906774","https://openalex.org/W4210521336"],"related_works":["https://openalex.org/W4394238759","https://openalex.org/W4385205110","https://openalex.org/W3081534731","https://openalex.org/W2887485518","https://openalex.org/W2346455737","https://openalex.org/W2151690061","https://openalex.org/W2083844986","https://openalex.org/W2005660029","https://openalex.org/W1996453501","https://openalex.org/W1666350026"],"abstract_inverted_index":{"Given":[0],"two":[1,68],"sets":[2],"of":[3,16,28,34,75],"vertices":[4,55,82],"V":[5,12,35],"and":[6,142],"W,":[7,17],"where":[8],"each":[9],"vertex":[10,48],"in":[11,49,56,125],"covers":[13],"a":[14,26,32,86,95,106],"subset":[15,33],"the":[18,40,44,57,88,117],"multi-vehicle":[19],"covering":[20],"tour":[21],"problem":[22],"asks":[23],"to":[24,38,70,78,115,120],"determine":[25],"number":[27],"vehicle":[29],"routes":[30],"on":[31,130],"so":[36],"as":[37],"minimize":[39],"total":[41],"distance":[42],"under":[43],"constraint":[45],"that":[46,66,93,134],"every":[47],"W":[50],"must":[51],"be":[52],"covered":[53],"by":[54],"routes.":[58],"We":[59,110],"propose":[60,105,112],"an":[61,99],"iterated":[62],"local":[63],"search":[64,121],"algorithm":[65,136],"features":[67],"procedures":[69],"improve":[71],"solutions:":[72],"one":[73],"consists":[74],"three":[76],"operations":[77],"remove":[79],"or":[80,84],"insert":[81],"from":[83],"into":[85],"route;":[87],"other":[89],"is":[90,143],"path":[91,97],"reconstruction":[92],"replaces":[94],"partial":[96],"with":[98],"optimal":[100],"one,":[101],"for":[102,122,145],"which":[103],"we":[104],"dynamic":[107],"programming":[108],"algorithm.":[109],"also":[111],"efficient":[113,144],"methods":[114,141],"reduce":[116],"computation":[118],"time":[119],"improved":[123],"solutions":[124],"neighborhoods.":[126],"The":[127],"computational":[128],"results":[129],"benchmark":[131],"instances":[132],"show":[133],"our":[135],"performs":[137],"better":[138],"than":[139],"existing":[140],"large-scale":[146],"instances.":[147]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2246405718","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-04-18T10:16:29.400727","created_date":"2016-06-24"}