{"id":"https://openalex.org/W3088206282","doi":"https://doi.org/10.1109/jiot.2020.3025797","title":"Efficient Task Assignment for Multiple Vehicles With Partially Unreachable Target Locations","display_name":"Efficient Task Assignment for Multiple Vehicles With Partially Unreachable Target Locations","publication_year":2020,"publication_date":"2020-09-22","ids":{"openalex":"https://openalex.org/W3088206282","doi":"https://doi.org/10.1109/jiot.2020.3025797","mag":"3088206282"},"language":"en","primary_location":{"id":"doi:10.1109/jiot.2020.3025797","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jiot.2020.3025797","pdf_url":null,"source":{"id":"https://openalex.org/S2480266640","display_name":"IEEE Internet of Things Journal","issn_l":"2327-4662","issn":["2327-4662","2372-2541"],"is_oa":false,"is_in_doaj":false,"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 Internet of Things Journal","raw_type":"journal-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/A5066846708","display_name":"Xiaoshan Bai","orcid":"https://orcid.org/0000-0002-6782-5571"},"institutions":[{"id":"https://openalex.org/I180726961","display_name":"Shenzhen University","ror":"https://ror.org/01vy4gh70","country_code":"CN","type":"education","lineage":["https://openalex.org/I180726961"]},{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["CN","NL"],"is_corresponding":true,"raw_author_name":"Xiaoshan Bai","raw_affiliation_strings":["College of Mechatronics and Control Engineering, Shenzhen University, Shenzhen, China","Faculty of Mechanical, Maritime and Materials Engineering, Delft University of Technology, CD Delft, The Netherlands"],"affiliations":[{"raw_affiliation_string":"College of Mechatronics and Control Engineering, Shenzhen University, Shenzhen, China","institution_ids":["https://openalex.org/I180726961"]},{"raw_affiliation_string":"Faculty of Mechanical, Maritime and Materials Engineering, Delft University of Technology, CD Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055684040","display_name":"Weisheng Yan","orcid":"https://orcid.org/0000-0002-6789-4411"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weisheng Yan","raw_affiliation_strings":["School of Marine Science and Technology, Northwestern Polytechnical University, Xi\u2019an, China","School of Marine Science and Technology, Northwestern Polytechnical University, Xi'an, China"],"affiliations":[{"raw_affiliation_string":"School of Marine Science and Technology, Northwestern Polytechnical University, Xi\u2019an, China","institution_ids":["https://openalex.org/I17145004"]},{"raw_affiliation_string":"School of Marine Science and Technology, Northwestern Polytechnical University, Xi'an, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008501506","display_name":"Shuzhi Sam Ge","orcid":"https://orcid.org/0000-0001-5549-312X"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Shuzhi Sam Ge","raw_affiliation_strings":["Department of Electrical and Computer Engineering, National University of Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066846708"],"corresponding_institution_ids":["https://openalex.org/I180726961","https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":1.984,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.88643433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"8","issue":"5","first_page":"3730","last_page":"3742"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9984999895095825,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7133163809776306},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6022032499313354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5591017603874207},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5517397522926331},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5111809372901917},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.5094528794288635},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4755913019180298},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4592111110687256},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45344242453575134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18768516182899475},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08860111236572266},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08378267288208008}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7133163809776306},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6022032499313354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5591017603874207},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5517397522926331},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5111809372901917},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5094528794288635},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4755913019180298},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4592111110687256},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45344242453575134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18768516182899475},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08860111236572266},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08378267288208008},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jiot.2020.3025797","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jiot.2020.3025797","pdf_url":null,"source":{"id":"https://openalex.org/S2480266640","display_name":"IEEE Internet of Things Journal","issn_l":"2327-4662","issn":["2327-4662","2372-2541"],"is_oa":false,"is_in_doaj":false,"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 Internet of Things Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6227848623","display_name":null,"funder_award_id":"62003217","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1601649239","https://openalex.org/W1972391046","https://openalex.org/W1992868085","https://openalex.org/W2070585337","https://openalex.org/W2097571405","https://openalex.org/W2108170563","https://openalex.org/W2108357984","https://openalex.org/W2111706284","https://openalex.org/W2127350252","https://openalex.org/W2142544818","https://openalex.org/W2143996311","https://openalex.org/W2146870367","https://openalex.org/W2148228568","https://openalex.org/W2161711991","https://openalex.org/W2164313740","https://openalex.org/W2165042063","https://openalex.org/W2179119344","https://openalex.org/W2251882317","https://openalex.org/W2324108981","https://openalex.org/W2342567339","https://openalex.org/W2493109494","https://openalex.org/W2497712405","https://openalex.org/W2508993989","https://openalex.org/W2688378291","https://openalex.org/W2740070378","https://openalex.org/W2740867407","https://openalex.org/W2797487617","https://openalex.org/W2912024007","https://openalex.org/W2915814342","https://openalex.org/W2947448184","https://openalex.org/W2952213188","https://openalex.org/W2952408149","https://openalex.org/W2988480584","https://openalex.org/W3010172063","https://openalex.org/W3034038218","https://openalex.org/W3145128584","https://openalex.org/W4226300686","https://openalex.org/W4246219036","https://openalex.org/W4252801674","https://openalex.org/W6827597832"],"related_works":["https://openalex.org/W4205332774","https://openalex.org/W2937059810","https://openalex.org/W3202999461","https://openalex.org/W4214624958","https://openalex.org/W2548721895","https://openalex.org/W2373456246","https://openalex.org/W2413419736","https://openalex.org/W2786646446","https://openalex.org/W2352398686","https://openalex.org/W2106580143"],"abstract_inverted_index":{"This":[0],"article":[1],"studies":[2],"the":[3,46,53,68,80,93,110,114,118,125,134,142,148,154,164,183,186,192,204,224,239],"task":[4,213,241],"assignment":[5,214,242],"problem":[6],"for":[7,28,79],"a":[8,16,61,84,104,171,219,230],"fleet":[9],"of":[10,18,49,83,96,121,128,182],"dispersed":[11],"vehicles":[12,50,129,151],"to":[13,36,65,91,98,116,144,159,202,222,246],"efficiently":[14],"visit":[15,37,117],"set":[17],"target":[19,23,40,62,156,198],"locations":[20,24,41],"where":[21],"some":[22],"might":[25],"be":[26,99,131,145,160,168],"unreachable":[27],"one":[29],"or":[30],"several":[31],"vehicles.":[32],"The":[33],"objectives":[34,226],"are":[35,152],"as":[38,42],"many":[39],"possible":[43],"by":[44,123,228],"using":[45,124],"minimum":[47,126],"number":[48,95,120,127],"while":[51],"minimizing":[52],"vehicles'":[54,205],"total":[55,206],"travel":[56,175,207],"time.":[57,140],"We":[58],"first":[59],"propose":[60,218],"merging":[63],"strategy":[64],"deal":[66],"with":[67,196],"optimization":[69],"problem,":[70],"which":[71,113,177],"is":[72,178,189],"in":[73,112],"general":[74],"NP-hard,":[75],"and":[76,108,147],"show":[77,237],"that":[78,163,238],"special":[81],"case":[82],"single":[85],"vehicle,":[86],"it":[87],"requires":[88],"linear":[89,138],"time":[90],"calculate":[92],"maximum":[94,119],"targets":[97,122,143,166],"visited.":[100],"Second,":[101],"we":[102,209,217],"design":[103,210],"longest":[105,193],"path-based":[106,194],"algorithm":[107,136,195,221],"analyze":[109],"cases":[111],"objective":[115],"can":[130,244],"obtained":[132],"through":[133],"proposed":[135,240],"within":[137,170],"running":[139],"Once":[141],"visited":[146,169],"corresponding":[149],"employed":[150],"determined,":[153],"marginal-cost-based":[155],"inserting":[157,199],"principle":[158],"discussed":[161],"guarantees":[162],"chosen":[165],"will":[167],"computable":[172],"finite":[173],"maximal":[174],"time,":[176,208],"at":[179],"most":[180],"twice":[181],"optimal":[184],"when":[185],"cost":[187],"matrix":[188],"symmetric.":[190],"Integrating":[191],"two":[197,211],"principles":[200],"used":[201],"minimize":[203],"two-phase":[212],"algorithms.":[215,252],"Furthermore,":[216],"one-phase":[220],"optimize":[223],"multiple":[225],"simultaneously":[227],"improving":[229],"co-evolutionary":[231],"multipopulation":[232],"genetic":[233,251],"algorithm.":[234],"Numerical":[235],"simulations":[236],"algorithms":[243],"lead":[245],"satisfying":[247],"solutions":[248],"against":[249],"popular":[250]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}