乐胖代购免代理版

{"id":"https://openalex.org/W2784236503","doi":"https://doi.org/10.1109/etfa.2017.8247622","title":"Decomposition and distributed algorithms for home healthcare routing and scheduling problem","display_name":"Decomposition and distributed algorithms for home healthcare routing and scheduling problem","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W2784236503","doi":"https://doi.org/10.1109/etfa.2017.8247622","mag":"2784236503"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2017.8247622","pdf_url":null,"source":null,"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/A5009533548","display_name":"Sarmad Riazi","orcid":"https://orcid.org/0000-0002-8450-311X"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sarmad Riazi","raw_affiliation_strings":["Electrical Engineering Department, Chalmers University of Technology, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036504431","display_name":"Oskar Wigstr\u00f6m","orcid":"https://orcid.org/0000-0002-5881-2226"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Oskar Wigstrom","raw_affiliation_strings":["Electrical Engineering Department, Chalmers University of Technology, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047696349","display_name":"Kristofer Bengtsson","orcid":"https://orcid.org/0000-0002-5290-682X"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Kristofer Bengtsson","raw_affiliation_strings":["Electrical Engineering Department, Chalmers University of Technology, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076331540","display_name":"Bengt Lennartson","orcid":"https://orcid.org/0000-0002-3406-3881"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt Lennartson","raw_affiliation_strings":["Electrical Engineering Department, Chalmers University of Technology, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.146,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":7,"citation_normalized_percentile":{"value":0.899244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":82,"max":84},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Problem and Variants","score":0.9999,"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 Problem and Variants","score":0.9999,"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":"Implications of Shared Autonomous Vehicle Services","score":0.9955,"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/T10586","display_name":"Sampling-Based Motion Planning Algorithms","score":0.9863,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.68695647},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.6144078},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle Routing Problem","score":0.568574},{"id":"https://openalex.org/keywords/real-time-planning","display_name":"Real-Time Planning","score":0.551474},{"id":"https://openalex.org/keywords/multi-depot-routing","display_name":"Multi-Depot Routing","score":0.528071},{"id":"https://openalex.org/keywords/probabilistic-roadmaps","display_name":"Probabilistic Roadmaps","score":0.527879},{"id":"https://openalex.org/keywords/hybrid-algorithms","display_name":"Hybrid Algorithms","score":0.516671}],"concepts":[{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.8876331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7538774},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.68695647},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.6144078},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.61067003},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.52345985},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5161153},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.49894238},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49130693},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46206626},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42224428},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42220634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29931378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16250509},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.101270795},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07691258},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2017.8247622","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":17,"referenced_works":["https://openalex.org/W1965032790","https://openalex.org/W1967965037","https://openalex.org/W1971985512","https://openalex.org/W1977133702","https://openalex.org/W2018691209","https://openalex.org/W2029681015","https://openalex.org/W2036969993","https://openalex.org/W2040678783","https://openalex.org/W2057348115","https://openalex.org/W2068424856","https://openalex.org/W2070585337","https://openalex.org/W2072408652","https://openalex.org/W2096305430","https://openalex.org/W2105560970","https://openalex.org/W2117905067","https://openalex.org/W2149335048","https://openalex.org/W2224737250"],"related_works":["https://openalex.org/W3089606439","https://openalex.org/W3037553096","https://openalex.org/W2911906655","https://openalex.org/W2595691866","https://openalex.org/W2499699449","https://openalex.org/W2333308323","https://openalex.org/W2158354221","https://openalex.org/W2117466569","https://openalex.org/W2040678783","https://openalex.org/W1556053881"],"abstract_inverted_index":{"Many":[0],"people":[1,20],"in":[2,8,191],"need":[3],"of":[4,42,132,170,193],"care":[5],"still":[6],"live":[7],"their":[9,25],"homes,":[10],"requiring":[11],"the":[12,19,43,53,113,130,142,171,177,188],"caretakers":[13,22],"to":[14,16,21,107,115,129],"travel":[15],"them.":[17],"Assigning":[18],"and":[23,64,72,84,167,181,183],"generating":[24],"schedules":[26],"can":[27],"be":[28,78],"formulated":[29],"as":[30,88],"a":[31,102,146],"mixed":[32],"integer":[33],"linear":[34],"programming":[35],"problem":[36,47,122,160],"(MILP)":[37],"that":[38,185],"inherits":[39],"many":[40],"features":[41],"well-known":[44],"vehicle":[45],"routing":[46],"with":[48,145,176],"time":[49],"windows":[50],"(VRPTW).":[51],"Currently,":[52],"most":[54],"successful":[55,79],"exact":[56],"algorithms":[57,92],"for":[58,80,96,119,158],"VRPTW":[59],"are":[60,93],"based":[61,149],"on":[62,150],"branch":[63],"price":[65],"framework,":[66],"which":[67,152],"combine":[68],"column":[69],"generation":[70],"(CG)":[71],"branching.":[73],"While":[74],"these":[75],"methods":[76],"could":[77],"Home":[81],"Healthcare":[82],"Routing":[83],"Scheduling":[85],"Problem":[86],"(HHCRSP)":[87],"well,":[89],"fast":[90],"approximate":[91,117],"appealing,":[94],"especially":[95],"large":[97,121,194],"problems.":[98,195],"We":[99,162],"recently":[100],"employed":[101],"heuristic":[103],"distributed":[104],"gossip":[105,143,173,179],"algorithm":[106,144,157,174],"solve":[108],"HHCRSP.":[109],"The":[110],"method":[111],"had":[112],"potential":[114],"provide":[116,164],"solutions":[118],"relatively":[120],"instances,":[123],"but":[124],"its":[125,133],"effectiveness":[126],"was":[127],"limited":[128],"performance":[131],"local":[134,147],"MILP":[135],"solver.":[136],"In":[137],"this":[138],"paper,":[139],"we":[140],"integrate":[141],"solver":[148],"CG,":[151,182],"makes":[153],"it":[154],"an":[155],"effective":[156],"larger":[159],"instances.":[161],"also":[163],"numerical":[165],"experiments":[166],"complexity":[168],"evaluations":[169],"improved":[172],"(gossip-CG)":[175],"standard":[178],"(gossip-MILP)":[180],"show":[184],"gossip-CG":[186],"outperforms":[187],"pure":[189],"CG":[190],"case":[192]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2784236503","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2024-12-03T02:28:17.279518","created_date":"2018-01-26"}