{"id":"https://openalex.org/W2024250201","doi":"https://doi.org/10.1109/tits.2015.2413453","title":"A Partition-Based Match Making Algorithm for Dynamic Ridesharing","display_name":"A Partition-Based Match Making Algorithm for Dynamic Ridesharing","publication_year":2015,"publication_date":"2015-04-06","ids":{"openalex":"https://openalex.org/W2024250201","doi":"https://doi.org/10.1109/tits.2015.2413453","mag":"2024250201"},"language":"en","primary_location":{"id":"doi:10.1109/tits.2015.2413453","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2015.2413453","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"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 Transactions on Intelligent Transportation Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://mediatum.ub.tum.de/node?id=1280455","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039946079","display_name":"Dominik Pelzer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dominik Pelzer","raw_affiliation_strings":["Modeling and Optimization of Architectures and Infrastructure Group, TUM CREATE, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Modeling and Optimization of Architectures and Infrastructure Group, TUM CREATE, Singapore","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032729945","display_name":"Jiajian Xiao","orcid":"https://orcid.org/0000-0003-4893-9757"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiajian Xiao","raw_affiliation_strings":["Modeling and Optimization of Architectures and Infrastructure Group, TUM CREATE, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Modeling and Optimization of Architectures and Infrastructure Group, TUM CREATE, Singapore","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072390316","display_name":"Daniel Zehe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Zehe","raw_affiliation_strings":["Modeling and Optimization of Architectures and Infrastructure Group, TUM CREATE, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Modeling and Optimization of Architectures and Infrastructure Group, TUM CREATE, Singapore","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021090586","display_name":"Michael Lees","orcid":"https://orcid.org/0000-0002-5457-9180"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Michael H. Lees","raw_affiliation_strings":["Section Computational Science of the Faculty of Science, University of Amsterdam, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Section Computational Science of the Faculty of Science, University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063781430","display_name":"Alois Knoll","orcid":"https://orcid.org/0000-0003-4840-076X"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alois C. Knoll","raw_affiliation_strings":["Department of Informatics, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046449989","display_name":"Heiko Aydt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Heiko Aydt","raw_affiliation_strings":["Modeling and Optimization of Architectures and Infrastructure Group, TUM CREATE, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Modeling and Optimization of Architectures and Infrastructure Group, TUM CREATE, Singapore","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.7447,"has_fulltext":false,"cited_by_count":124,"citation_normalized_percentile":{"value":0.97642879,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"16","issue":"5","first_page":"2587","last_page":"2598"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":1.0,"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":1.0,"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/T12392","display_name":"Sharing Economy and Platforms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/heuristic","display_name":"Heuristic","score":0.6511837244033813},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.6488618850708008},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6105754375457764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5507640242576599},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5189780592918396},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4847233295440674},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48220527172088623},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.47857025265693665},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.43979644775390625},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.41644686460494995},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.37120383977890015},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.2981783449649811},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27597880363464355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1403295397758484},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12962377071380615},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08867946267127991}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6511837244033813},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.6488618850708008},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6105754375457764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5507640242576599},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5189780592918396},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4847233295440674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48220527172088623},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.47857025265693665},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.43979644775390625},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.41644686460494995},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.37120383977890015},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.2981783449649811},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27597880363464355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1403295397758484},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12962377071380615},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08867946267127991},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tits.2015.2413453","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2015.2413453","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"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 Transactions on Intelligent Transportation Systems","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/0f4a29fc-14e2-4e4c-be79-4c775e5b5b86","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/a-partitionbased-match-making-algorithm-for-dynamic-ridesharing(0f4a29fc-14e2-4e4c-be79-4c775e5b5b86).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pelzer, D, Xiao, J, Zehe, D, Lees, M H, Knoll, A C & Aydt, H 2015, 'A partition-based match making algorithm for dynamic ridesharing', IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 5, pp. 2587-2598. https://doi.org/10.1109/TITS.2015.2413453","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:mediatum.ub.tum.de:node/1280455","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=1280455","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/0f4a29fc-14e2-4e4c-be79-4c775e5b5b86","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/a-partitionbased-match-making-algorithm-for-dynamic-ridesharing(0f4a29fc-14e2-4e4c-be79-4c775e5b5b86).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems, 16(5), 2587 - 2598. IEEE","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:mediatum.ub.tum.de:node/1280455","is_oa":true,"landing_page_url":"http://mediatum.ub.tum.de/node?id=1280455","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320709","display_name":"National Research Foundation Singapore","ror":"https://ror.org/03cpyc314"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":68,"referenced_works":["https://openalex.org/W90525255","https://openalex.org/W110737430","https://openalex.org/W125870180","https://openalex.org/W174230839","https://openalex.org/W210081523","https://openalex.org/W569646844","https://openalex.org/W1481773530","https://openalex.org/W1492821746","https://openalex.org/W1519770485","https://openalex.org/W1525106674","https://openalex.org/W1559814459","https://openalex.org/W1582644925","https://openalex.org/W1963504979","https://openalex.org/W1969878341","https://openalex.org/W1972398006","https://openalex.org/W1972646085","https://openalex.org/W1980175144","https://openalex.org/W1980402561","https://openalex.org/W1982359112","https://openalex.org/W1986660228","https://openalex.org/W1989179252","https://openalex.org/W1992447230","https://openalex.org/W2017893044","https://openalex.org/W2028750005","https://openalex.org/W2031128290","https://openalex.org/W2031236641","https://openalex.org/W2033211895","https://openalex.org/W2049135000","https://openalex.org/W2052738533","https://openalex.org/W2052741113","https://openalex.org/W2060864767","https://openalex.org/W2061499265","https://openalex.org/W2062848345","https://openalex.org/W2062893072","https://openalex.org/W2063659595","https://openalex.org/W2063961786","https://openalex.org/W2073003110","https://openalex.org/W2079487902","https://openalex.org/W2082772228","https://openalex.org/W2092218477","https://openalex.org/W2094091661","https://openalex.org/W2094513248","https://openalex.org/W2100526409","https://openalex.org/W2114547164","https://openalex.org/W2121180493","https://openalex.org/W2124874218","https://openalex.org/W2145569785","https://openalex.org/W2148705556","https://openalex.org/W2152990587","https://openalex.org/W2158408225","https://openalex.org/W2158999695","https://openalex.org/W2159759713","https://openalex.org/W2163599294","https://openalex.org/W2168210873","https://openalex.org/W2169209751","https://openalex.org/W2171243111","https://openalex.org/W2335471126","https://openalex.org/W2950407096","https://openalex.org/W4285719527","https://openalex.org/W6604397821","https://openalex.org/W6608460006","https://openalex.org/W6629483879","https://openalex.org/W6630891747","https://openalex.org/W6663620081","https://openalex.org/W6675160116","https://openalex.org/W6684685677","https://openalex.org/W6983025648","https://openalex.org/W6983584783"],"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/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2807758032"],"abstract_inverted_index":{"Ridesharing":[0],"offers":[1],"the":[2,13,100,110,121,125,128,141,165,171,199,223,227],"opportunity":[3],"to":[4,55,88,145,169,191],"make":[5],"more":[6],"efficient":[7],"use":[8],"of":[9,15,33,83,120,127,201,214],"vehicles":[10],"while":[11,60,237],"preserving":[12],"benefits":[14],"individual":[16],"mobility.":[17],"Presenting":[18],"ridesharing":[19,58,71],"as":[20,131,133],"a":[21,51,64,74,80,162,210,232],"viable":[22],"option":[23],"for":[24,113,173],"commuters,":[25],"however,":[26],"requires":[27],"minimizing":[28],"certain":[29],"inconvenience":[30,150],"factors.":[31],"One":[32],"these":[34],"factors":[35],"includes":[36],"detours":[37,62],"which":[38,53,85,108],"result":[39],"from":[40,94],"picking":[41],"up":[42,190],"and":[43,78,118,149,188],"dropping":[44],"off":[45],"additional":[46],"passengers.":[47],"This":[48,138,178],"paper":[49],"proposes":[50],"method":[52,68],"aims":[54],"best":[56],"utilize":[57],"potential":[59,147,172],"keeping":[61],"below":[63],"specific":[65],"limit.":[66],"The":[67,116,195],"specifically":[69],"targets":[70],"systems":[72],"on":[73,124,134],"very":[75],"large":[76],"scale":[77],"with":[79,143],"high":[81],"degree":[82],"dynamics":[84],"are":[86],"difficult":[87],"address":[89],"using":[90,157],"classical":[91],"approaches":[92],"known":[93],"operations":[95],"research.":[96],"For":[97],"this":[98],"purpose,":[99],"road":[101,129],"network":[102,130],"is":[103,154,167,179,219],"divided":[104],"into":[105],"distinct":[106],"partitions":[107,122],"define":[109],"search":[111],"space":[112],"ride":[114],"matches.":[115],"size":[117],"shape":[119],"depend":[123],"topology":[126],"well":[132],"two":[135,192],"free":[136],"parameters.":[137],"allows":[139],"optimizing":[140],"partitioning":[142],"regard":[144],"sharing":[146,175,193],"utilization":[148],"minimization.":[151],"Match":[152],"making":[153],"ultimately":[155],"performed":[156],"an":[158],"agent-based":[159],"approach.":[160],"As":[161],"case":[163],"study,":[164],"algorithm":[166],"applied":[168],"investigate":[170],"taxi":[174],"in":[176,209],"Singapore.":[177],"done":[180],"by":[181,206,231,235],"considering":[182],"about":[183],"110":[184],"000":[185,216],"daily":[186,211],"trips":[187,202],"allowing":[189],"partners.":[194],"outcome":[196],"shows":[197],"that":[198,222],"number":[200],"could":[203],"be":[204],"reduced":[205],"42%":[207],"resulting":[208],"mileage":[212,228],"savings":[213,229],"230":[215],"km.":[217],"It":[218],"further":[220],"shown":[221],"presented":[224],"approach":[225],"exceeds":[226],"achieved":[230],"greedy":[233],"heuristic":[234],"6%":[236],"requiring":[238],"30%":[239],"lower":[240],"computational":[241],"efforts.":[242]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}