{"id":"https://openalex.org/W2915582198","doi":"https://doi.org/10.1109/glocom.2018.8647755","title":"A Greedy Approach for Vehicle Routing When Rebalancing Bike Sharing Systems","display_name":"A Greedy Approach for Vehicle Routing When Rebalancing Bike Sharing Systems","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2915582198","doi":"https://doi.org/10.1109/glocom.2018.8647755","mag":"2915582198"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2018.8647755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","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/A5019101253","display_name":"Yubin Duan","orcid":"https://orcid.org/0000-0003-0568-7262"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yubin Duan","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, USA","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100600528","display_name":"Jie Wu","orcid":"https://orcid.org/0000-0002-3472-1717"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jie Wu","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, USA","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044419929","display_name":"Huanyang Zheng","orcid":"https://orcid.org/0000-0002-5529-4080"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Huanyang Zheng","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, USA","institution_ids":["https://openalex.org/I84392919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019101253"],"corresponding_institution_ids":["https://openalex.org/I84392919"],"apc_list":null,"apc_paid":null,"fwci":2.2024,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88981156,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10298","display_name":"Urban Transport and Accessibility","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10298","display_name":"Urban Transport and Accessibility","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9995999932289124,"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.9987000226974487,"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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.725845217704773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7185864448547363},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6779899597167969},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6251192092895508},{"id":"https://openalex.org/keywords/bike-sharing","display_name":"Bike sharing","score":0.6247276067733765},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.5545392632484436},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4455033838748932},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.44172123074531555},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.35638105869293213},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3319292366504669},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.2746780514717102},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23563069105148315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16428759694099426},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1291896402835846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09862235188484192}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.725845217704773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7185864448547363},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6779899597167969},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6251192092895508},{"id":"https://openalex.org/C2994001137","wikidata":"https://www.wikidata.org/wiki/Q1358919","display_name":"Bike sharing","level":2,"score":0.6247276067733765},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.5545392632484436},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4455033838748932},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.44172123074531555},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.35638105869293213},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3319292366504669},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.2746780514717102},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23563069105148315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16428759694099426},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1291896402835846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09862235188484192},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2018.8647755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","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":19,"referenced_works":["https://openalex.org/W109636739","https://openalex.org/W1525106674","https://openalex.org/W1979411729","https://openalex.org/W1991798215","https://openalex.org/W1999750851","https://openalex.org/W2002356593","https://openalex.org/W2023689807","https://openalex.org/W2031736545","https://openalex.org/W2032251915","https://openalex.org/W2032686693","https://openalex.org/W2046876986","https://openalex.org/W2062147841","https://openalex.org/W2240814884","https://openalex.org/W2292146339","https://openalex.org/W2297059404","https://openalex.org/W2358962606","https://openalex.org/W2515292392","https://openalex.org/W4237543117","https://openalex.org/W6696824279"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2809387092","https://openalex.org/W3119129187"],"abstract_inverted_index":{"With":[0],"the":[1,4,43,78,89,114,126,129,134,160,174],"bloom":[2],"of":[3,18,29,42,56,159,176],"sharing":[5,8,20],"economy,":[6],"bike":[7,19,62,120],"systems":[9,21,31],"have":[10,22],"earned":[11],"increasing":[12],"attention,":[13],"and":[14,47,81,157,169,172],"a":[15,54,69,93,102,109,149,180],"great":[16],"amount":[17],"been":[23],"established":[24],"in":[25,77],"major":[26],"cities.":[27],"Users":[28],"these":[30],"mainly":[32],"conduct":[33,164],"one-way":[34],"trips,":[35],"which":[36,96],"leads":[37],"to":[38,58,83,101,138],"an":[39],"unbalanced":[40,119],"distribution":[41],"bikes":[44,60],"over":[45],"time":[46,155],"space.":[48],"The":[49,105,122],"system":[50],"operators":[51],"could":[52],"hire":[53],"fleet":[55],"vehicles":[57],"move":[59],"among":[61],"stations":[63],"for":[64,73,108],"rebalancing.":[65],"We":[66],"focus":[67],"on":[68,166],"routing":[70],"schedule":[71],"problem":[72],"each":[74],"vehicle":[75,110,130],"used":[76],"rebalancing":[79],"process":[80],"aims":[82],"minimize":[84],"its":[85],"moving":[86,132],"distance.":[87],"For":[88],"problem,":[90],"we":[91,163],"propose":[92],"greedy":[94],"algorithm":[95,123,147,178],"can":[97],"be":[98],"easily":[99],"extended":[100],"parallel":[103],"version.":[104],"scheduled":[106],"route":[107,127],"is":[111],"adapted":[112],"from":[113,143],"Hamiltonian":[115,135],"path":[116,136],"covering":[117],"all":[118],"stations.":[121],"greedily":[124],"adjusts":[125],"if":[128],"cannot":[131],"along":[133],"due":[137],"capacity":[139],"limitation":[140],"violation.":[141],"Different":[142],"previous":[144],"approaches,":[145],"our":[146,177],"has":[148],"more":[150],"flexible":[151],"tradeoff":[152],"between":[153],"running":[154],"consumption":[156],"optimality":[158],"output.":[161],"Finally,":[162],"experiments":[165],"both":[167],"real-world":[168],"synthetic":[170],"datasets":[171],"compare":[173],"performance":[175],"with":[179],"classic":[181],"approach.":[182]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}