{"id":"https://openalex.org/W6884884903","doi":"https://doi.org/10.13016/lzys-apa2","title":"INTRODUCING MEETING LOCATIONS IN TAXI-SHARING SYSTEMS","display_name":"INTRODUCING MEETING LOCATIONS IN TAXI-SHARING SYSTEMS","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W6884884903","doi":"https://doi.org/10.13016/lzys-apa2"},"language":"en","primary_location":{"id":"doi:10.13016/lzys-apa2","is_oa":true,"landing_page_url":"https://doi.org/10.13016/lzys-apa2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Collection"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.13016/lzys-apa2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Aliari, Sanaz","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aliari, Sanaz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9929999709129333,"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"}},"topics":[{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9929999709129333,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.004399999976158142,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.0003000000142492354,"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/set","display_name":"Set (abstract data type)","score":0.6043999791145325},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5116000175476074},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5058000087738037},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.3481000065803528},{"id":"https://openalex.org/keywords/travel-time","display_name":"Travel time","score":0.34450000524520874},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.31189998984336853},{"id":"https://openalex.org/keywords/point-of-interest","display_name":"Point of interest","score":0.29919999837875366}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6043999791145325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5896999835968018},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5116000175476074},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5058000087738037},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4878000020980835},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.46309998631477356},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.3481000065803528},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C150140777","wikidata":"https://www.wikidata.org/wiki/Q960648","display_name":"Point of interest","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C2778625738","wikidata":"https://www.wikidata.org/wiki/Q358078","display_name":"Street network","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C2779888511","wikidata":"https://www.wikidata.org/wiki/Q244156","display_name":"Traffic congestion","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.2612000107765198}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.13016/lzys-apa2","is_oa":true,"landing_page_url":"https://doi.org/10.13016/lzys-apa2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Collection"}],"best_oa_location":{"id":"doi:10.13016/lzys-apa2","is_oa":true,"landing_page_url":"https://doi.org/10.13016/lzys-apa2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Collection"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7527117133140564,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Taxi-sharing":[0,24],"is":[1,140,154,193],"admittedly":[2],"a":[3,15,95,125,133,149,158,204,213,235,257,265,272,289,360,386,479],"promising":[4],"solution":[5],"to":[6,56,141,155,172,194,198,229,268,287,312,359,389,410,423,440],"reduce":[7,173,313],"travel":[8,175,347],"costs":[9],"and":[10,64,180,226,352,397,442,457,463],"mitigate":[11],"congestion.":[12],"However,":[13],"sharing":[14],"ride":[16],"with":[17,128,203,222,231,325,414],"other":[18],"passengers":[19,69,76,282],"may":[20,147,248],"impose":[21],"long":[22],"detours.":[23],"can":[25,37,104,471],"be":[26,38,105],"more":[27,285],"beneficial":[28,107],"if":[29],"the":[30,35,66,87,121,164,181,190,200,219,240,314,353,376,381,394,401,411,428,432,451,468],"vehicle":[31],"miles":[32],"traveled":[33],"for":[34,218,300,393],"detours":[36,63],"reduced":[39],"when":[40],"serving":[41],"additional":[42],"passengers.":[43],"In":[44,208],"this":[45,209],"study,":[46,210],"we":[47,211,384,398],"propose":[48,385],"incorporating":[49,337],"alternative":[50,129,166,223,323,338],"meeting":[51],"points":[52,131,168,187,225,303,340],"in":[53,86,108,113,120,132,234,256,304,342,345,431,454],"taxi-sharing":[54,74],"routing":[55],"further":[57],"boost":[58],"efficiency":[59],"by":[60,278],"eliminating":[61],"unnecessary":[62],"improving":[65],"chances":[67],"of":[68,98,124,160,184,252,281,297,316,328,355,380,427,434,446],"being":[70],"matched.":[71],"Unlike":[72],"traditional":[73],"systems,":[75],"are":[77,92,117,170,188,284,310,407],"not":[78],"necessarily":[79],"picked":[80],"up":[81,366],"at":[82],"their":[83,99,371,474],"original":[84],"location":[85],"proposed":[88,311,402],"system.":[89],"Instead,":[90],"they":[91],"serviced":[93],"within":[94],"walkable":[96],"distance":[97],"origin":[100],"(meeting":[101],"points).":[102],"This":[103,437],"especially":[106],"heavily":[109],"congested":[110],"road":[111],"networks":[112],"dense":[114,134],"urban":[115],"areas.There":[116],"several":[118],"challenges":[119,233],"real-world":[122,236],"implementation":[123],"ride-sharing":[126,220,362],"system":[127,363],"pick-up":[130,167,224,302,339],"high-demand":[135],"network.":[136],"The":[137,151,332],"first":[138,263],"challenge":[139,153,192],"find":[142,157,390],"appropriate":[143],"passenger":[144,368],"matches":[145,179],"that":[146,169,247,283,336,364,400,406,467],"share":[148,288],"ride.":[150,290],"second":[152],"effectively":[156],"set":[159,183,296,315],"specific":[161,421],"locations":[162,299,318,324],"as":[163],"potential":[165],"likely":[171,286],"total":[174,346,349],"times.":[176,418],"Once":[177],"possible":[178],"corresponding":[182],"candidate":[185,298,317],"pickup":[186],"selected,":[189],"last":[191],"obtain":[195],"optimal/near-optimal":[196],"routes":[197],"satisfy":[199],"passengers\u2019":[201],"demand":[202,245],"reasonable":[205],"computational":[206,378,417],"time.":[207],"formulate":[212],"mixed":[214],"integer":[215],"programming":[216],"model":[217],"problem":[221,274],"introduce":[227,264],"strategies":[228,309,439],"cope":[230],"these":[232],"setting.":[237],"We":[238,262,291,419],"use":[239],"New":[241],"York":[242],"City":[243],"taxi":[244],"data":[246],"sometimes":[249],"have":[250],"hundreds":[251],"demands":[253],"per":[254],"minute":[255],"relatively":[258],"small":[259],"geographical":[260],"area.":[261],"decomposition":[266],"procedure":[267],"break":[269],"down":[270],"such":[271,466],"large-scale":[273],"into":[275,319],"smaller":[276,320],"subproblems":[277],"pre-matching":[279],"groups":[280],"then":[292],"create":[293,443,458],"an":[294],"initial":[295],"all":[301],"each":[305,367,455],"group.":[306],"Then,":[307],"different":[308],"subsets,":[321],"including":[322],"higher":[326],"potentials":[327],"constructing":[329],"better":[330],"routes.":[331],"experimental":[333],"results":[334,341],"show":[335,399],"significant":[343],"savings":[344],"times,":[348,351],"wait":[350],"number":[354],"vehicles":[356],"used":[357],"compared":[358],"baseline":[361],"picks":[365],"exactly":[369],"from":[370,473],"requested":[372],"location.":[373],"Finally,":[374],"given":[375],"high":[377],"cost":[379],"optimization":[382],"problem,":[383,396],"genetic":[387,429],"algorithm":[388,403,430],"near-optimal":[391],"solutions":[392,405,448],"formulated":[395],"achieves":[404],"very":[408],"close":[409],"optimal":[412],"solutions,":[413],"significantly":[415],"lower":[416],"design":[420],"operations":[422],"implement":[424],"basic":[425],"components":[426],"context":[433],"our":[435],"algorithm.":[436],"includes":[438],"diversify":[441],"random":[444],"sets":[445],"feasible":[447,480],"(individuals),":[449],"select":[450],"fittest":[452],"individuals":[453,470],"generation,":[456],"new":[459,469],"generations":[460],"through":[461],"mutations":[462],"ordered":[464],"cross-over":[465],"inherit":[472],"parents":[475],"while":[476],"still":[477],"representing":[478],"solution.":[481]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}