A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system
•An optimal, real-time algorithm for the multi-hop P2P ride-matching problem.•Serving requests as soon as they arrive on a first-come, first-served (FCFS) basis.•Numerical experiments quantify the impact of intersecting rider and driver sets.•Introducing P2P exchange mechanism to reverse the adverse...
Uloženo v:
| Vydáno v: | Transportation research. Part B: methodological Ročník 106; s. 218 - 236 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.12.2017
|
| Témata: | |
| ISSN: | 0191-2615, 1879-2367 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •An optimal, real-time algorithm for the multi-hop P2P ride-matching problem.•Serving requests as soon as they arrive on a first-come, first-served (FCFS) basis.•Numerical experiments quantify the impact of intersecting rider and driver sets.•Introducing P2P exchange mechanism to reverse the adverse impacts of the FCFS rule.
Real-time peer-to-peer ridesharing is a promising mode of transportation that has gained popularity during the recent years thanks to the wide-spread use of smart phones, mobile application development platforms, and online payment systems. An assignment of drivers to riders, known as the ride-matching problem, is a central component of a peer-to-peer ridesharing system. In this paper we discuss the features of a flexible ridesharing system and propose an algorithm to optimally solve the ride-matching problem in a flexible ridesharing system in real-time. We generate random instances of the problem, and perform sensitivity analysis over some of the important parameters in a ridesharing system. Furthermore, we discuss two novel approaches to increase the performance of a ridesharing system. |
|---|---|
| AbstractList | •An optimal, real-time algorithm for the multi-hop P2P ride-matching problem.•Serving requests as soon as they arrive on a first-come, first-served (FCFS) basis.•Numerical experiments quantify the impact of intersecting rider and driver sets.•Introducing P2P exchange mechanism to reverse the adverse impacts of the FCFS rule.
Real-time peer-to-peer ridesharing is a promising mode of transportation that has gained popularity during the recent years thanks to the wide-spread use of smart phones, mobile application development platforms, and online payment systems. An assignment of drivers to riders, known as the ride-matching problem, is a central component of a peer-to-peer ridesharing system. In this paper we discuss the features of a flexible ridesharing system and propose an algorithm to optimally solve the ride-matching problem in a flexible ridesharing system in real-time. We generate random instances of the problem, and perform sensitivity analysis over some of the important parameters in a ridesharing system. Furthermore, we discuss two novel approaches to increase the performance of a ridesharing system. |
| Author | Masoud, Neda Jayakrishnan, R. |
| Author_xml | – sequence: 1 givenname: Neda surname: Masoud fullname: Masoud, Neda email: nmasoud@umich.edu organization: Department of Civil and Environmental Engineering, University of Michigan Ann Arbor, Ann Arbor, MI, 48109, USA – sequence: 2 givenname: R. surname: Jayakrishnan fullname: Jayakrishnan, R. email: rjayakri@uci.edu organization: Department of Civil and Environmental Engineering, University of California Irvine, Irvine, CA, 92697, USA |
| BookMark | eNp9kMtqwzAQRUVJoUnaD-hOPyB35Ids01UIfUGgm3YtZHkUK9hWkERp_r5201UXWQ13uGdgzoosRjciIfccEg5cPByS6JskBV5OOQEQV2TJq7JmaSbKBVkCrzlLBS9uyCqEAwBkOfAlMRvqUfUs2gGp6vfO29gNNDoaXP-FNHZIj4ieRcfmSb1tkQ0q6s6Oe3r0rulxoHakipoev-0UfzuhU35uhFOIONySa6P6gHd_c00-n58-tq9s9_7ytt3smM5EFllW1FrzuuWNxsqYXJeoFIJJTcWLokaojZoaSjRYZbkSuRCFNhoKDijKNs3WpDzf1d6F4NFIbaOK1o3RK9tLDnLWJQ9y0iVnXfNq0jWR_B959HZQ_nSReTwzOL30ZdHLoC2OGlvrUUfZOnuB_gFJLIdX |
| CitedBy_id | crossref_primary_10_1007_s11116_025_10677_8 crossref_primary_10_1287_trsc_2021_1121 crossref_primary_10_1016_j_tre_2020_101871 crossref_primary_10_1016_j_tre_2025_104232 crossref_primary_10_1016_j_cstp_2024_101302 crossref_primary_10_1016_j_trd_2024_104108 crossref_primary_10_1016_j_tre_2024_103783 crossref_primary_10_1080_15472450_2022_2098730 crossref_primary_10_1016_j_trc_2025_105274 crossref_primary_10_1177_0361198120909107 crossref_primary_10_1016_j_trc_2021_103530 crossref_primary_10_1080_19427867_2022_2116674 crossref_primary_10_1016_j_trb_2021_06_002 crossref_primary_10_1007_s10489_021_02610_0 crossref_primary_10_3390_su16198374 crossref_primary_10_1287_serv_2020_0258 crossref_primary_10_1016_j_trb_2020_02_001 crossref_primary_10_1016_j_tre_2024_103655 crossref_primary_10_1016_j_trc_2023_104055 crossref_primary_10_1109_TITS_2022_3197990 crossref_primary_10_1016_j_asoc_2025_112988 crossref_primary_10_1016_j_energy_2019_02_166 crossref_primary_10_1016_j_trc_2020_02_008 crossref_primary_10_3390_info15040174 crossref_primary_10_1016_j_retrec_2021_101037 crossref_primary_10_1145_3501295 crossref_primary_10_1016_j_trc_2025_105181 crossref_primary_10_1080_13675567_2020_1751807 crossref_primary_10_1177_03611981221091759 crossref_primary_10_1016_j_cie_2020_107080 crossref_primary_10_3389_fbuil_2023_1125149 crossref_primary_10_1109_TITS_2023_3345174 crossref_primary_10_1016_j_scs_2021_103383 crossref_primary_10_3390_ijerph15081763 crossref_primary_10_1016_j_trpro_2019_05_043 crossref_primary_10_1016_j_jtrangeo_2024_104041 crossref_primary_10_1016_j_trc_2019_04_008 crossref_primary_10_1371_journal_pone_0229674 crossref_primary_10_1080_21680566_2022_2092231 crossref_primary_10_1016_j_trb_2020_03_011 crossref_primary_10_1016_j_tre_2023_103073 crossref_primary_10_1177_0361198121995493 crossref_primary_10_1016_j_omega_2019_102139 crossref_primary_10_1109_ACCESS_2023_3243264 crossref_primary_10_1287_trsc_2024_0507 crossref_primary_10_1016_j_cie_2021_107871 crossref_primary_10_1111_mice_12461 crossref_primary_10_1016_j_trc_2019_04_021 crossref_primary_10_1109_TBDATA_2018_2872450 crossref_primary_10_1007_s00521_018_3733_5 crossref_primary_10_1257_jel_20191504 crossref_primary_10_1016_j_ijtst_2024_05_007 crossref_primary_10_1016_j_tre_2020_102033 crossref_primary_10_1016_j_trb_2024_103082 crossref_primary_10_1093_comjnl_bxad092 crossref_primary_10_1109_ACCESS_2020_3011528 crossref_primary_10_1080_15568318_2020_1785595 crossref_primary_10_1080_23302674_2021_1922949 crossref_primary_10_1007_s42488_023_00099_5 crossref_primary_10_3390_futuretransp5020062 crossref_primary_10_3390_su16135788 crossref_primary_10_1093_jamia_ocaa033 crossref_primary_10_1016_j_tre_2021_102487 crossref_primary_10_4018_IJVTIS_2018010103 crossref_primary_10_1080_01441647_2020_1866096 crossref_primary_10_1080_16258312_2023_2238667 crossref_primary_10_1016_j_trc_2025_105111 crossref_primary_10_1016_j_tra_2021_05_008 crossref_primary_10_1080_15472450_2022_2121651 crossref_primary_10_1177_03611981211014205 crossref_primary_10_3390_app11177996 crossref_primary_10_1016_j_trc_2019_09_021 crossref_primary_10_1016_j_trb_2025_103290 crossref_primary_10_3390_ijerph18031197 crossref_primary_10_1007_s10732_022_09491_7 crossref_primary_10_1016_j_tre_2023_103207 crossref_primary_10_1016_j_trc_2020_102770 crossref_primary_10_1016_j_trc_2020_102891 crossref_primary_10_1016_j_trb_2025_103282 crossref_primary_10_1016_j_trc_2021_103287 crossref_primary_10_3390_a15020030 crossref_primary_10_3390_su16125175 crossref_primary_10_1007_s11067_021_09523_y crossref_primary_10_1002_isd2_12347 crossref_primary_10_1016_j_trb_2018_12_009 crossref_primary_10_3390_su13020902 crossref_primary_10_1177_0361198118799031 crossref_primary_10_1016_j_trd_2023_103832 crossref_primary_10_1007_s10707_019_00379_6 crossref_primary_10_1049_iet_its_2019_0641 crossref_primary_10_1109_ACCESS_2024_3369041 crossref_primary_10_3390_smartcities8020040 crossref_primary_10_1016_j_trc_2023_104366 crossref_primary_10_3390_su10114275 crossref_primary_10_1177_03611981231162600 crossref_primary_10_3390_su10082720 crossref_primary_10_1016_j_trb_2018_12_013 crossref_primary_10_1016_j_trb_2019_05_008 crossref_primary_10_1016_j_cie_2025_111419 crossref_primary_10_1186_s12544_021_00522_1 crossref_primary_10_1109_ACCESS_2020_3045558 crossref_primary_10_1109_ACCESS_2022_3162848 crossref_primary_10_1016_j_trip_2025_101437 crossref_primary_10_1016_j_trc_2025_105120 crossref_primary_10_1016_j_retrec_2018_10_003 crossref_primary_10_1016_j_trb_2019_07_003 crossref_primary_10_1016_j_trc_2025_105084 crossref_primary_10_1016_j_procs_2019_04_069 crossref_primary_10_1016_j_trc_2019_03_023 crossref_primary_10_1016_j_trpro_2020_03_107 |
| Cites_doi | 10.1016/j.trc.2014.09.003 10.3141/2359-06 10.1049/iet-its.2015.0131 10.1016/j.trb.2011.05.017 10.1016/j.tre.2017.04.007 10.1007/s10479-007-0170-8 10.1016/j.trb.2017.01.004 10.1109/3468.531903 10.1287/trsc.29.1.17 10.3141/2542-12 10.1016/j.trc.2009.05.015 10.1016/0191-2615(86)90020-2 10.1016/j.cor.2013.07.020 10.1287/trsc.12.3.232 10.3141/1783-22 10.1287/opre.1030.0106 10.1016/j.ejor.2006.12.030 10.1287/trsc.17.3.351 10.1016/S0305-0548(03)00186-2 10.1016/j.trb.2014.05.007 10.1287/inte.2013.0683 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier Ltd |
| Copyright_xml | – notice: 2017 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.trb.2017.10.006 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Economics Engineering |
| EISSN | 1879-2367 |
| EndPage | 236 |
| ExternalDocumentID | 10_1016_j_trb_2017_10_006 S0191261517301169 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABDEX ABDMP ABFNM ABLJU ABMAC ABMMH ABPPZ ABUCO ABXDB ABYKQ ACDAQ ACGFS ACNCT ACRLP ADBBV ADEZE ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHRSL AIEXJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK APLSM ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HMY HVGLF HZ~ H~9 IHE J1W KOM LY1 LY7 M3Y M41 MO0 MS~ N9A O-L O9- OAUVE OHT OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG ROL RPZ SDF SDG SDP SDS SES SET SEW SPCBC SSB SSD SSO SSS SSZ T5K WUQ XPP ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c363t-359cc19d1bce8ff4c7eaae0f2f81559e09fa9cca6be834a64665cfc0510e67d23 |
| ISICitedReferencesCount | 127 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000418218000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0191-2615 |
| IngestDate | Tue Nov 18 22:37:09 EST 2025 Sat Nov 29 05:58:22 EST 2025 Fri Feb 23 02:33:22 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Multi-modal transportation On-demand transportation Ride-matching Ridesharing |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c363t-359cc19d1bce8ff4c7eaae0f2f81559e09fa9cca6be834a64665cfc0510e67d23 |
| PageCount | 19 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_trb_2017_10_006 crossref_primary_10_1016_j_trb_2017_10_006 elsevier_sciencedirect_doi_10_1016_j_trb_2017_10_006 |
| PublicationCentury | 2000 |
| PublicationDate | December 2017 2017-12-00 |
| PublicationDateYYYYMMDD | 2017-12-01 |
| PublicationDate_xml | – month: 12 year: 2017 text: December 2017 |
| PublicationDecade | 2010 |
| PublicationTitle | Transportation research. Part B: methodological |
| PublicationYear | 2017 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Li, Quadrifoglio (bib0016) 2010; 18 Psaraftis (bib0021) 1983; 17 Wolfler Calvo, de Luigi, Haastrup, Maniezzo (bib0033) 2004; 31 Masoud, Jayakrishnan (bib0018) 2017; 99 Herbawi, Weber (bib0013) 2011 Regue, Masoud, Recker (bib0024) 2016; 2542 Cordeau, Laporte (bib0009) 2007; 153 Ghoseiri (bib0012) 2013 Jaw, Odoni, Psaraftis, Wilson (bib0015) 1986; 20 Baldacci, Maniezzo, Mingozzi (bib0003) 2004; 52 Masoud, Lloret-Batlle, Jayakrishnan (bib0019) 2017; 102 Vukan (bib0030) 1981 Cortés, Jayakrishnan (bib0010) 2002 Di Febbraro, Gattorna, Sacco (bib0011) 2013 Business Insider, 2015. Uber Just Released Its First Report On Its Drivers Here Are The Numbers. Böckmann (bib0004) 2013 Savelsbergh, Sol (bib0025) 1995; 29 Masson, Lehuédé, Péton (bib0020) 2014; 41 Shaheen, Chan (bib0027) 2015 Accessed: 2015-06-20. Qiu, Li, Zhang (bib0022) 2014; 48 Agatz, Erera, Savelsbergh, Wang (bib0002) 2011; 45 Herbawi, Weber (bib0014) 2012 Teodorovic, DellOrco (bib0029) 2005 Wagner, Willhalm, Zaroliagis (bib0032) 2005; 10 Braekers, Caris, Janssens (bib0005) 2014; 67 Wagner, Willhalm (bib0031) 2003; 3 Agatz, Erera, Savelsbergh, Wang (bib0001) 2009 Liaw, White, Bander (bib0017) 1996; 26 Stein (bib0028) 1978; 12 Carnes, Henderson, Shmoys, Ahghari, MacDonald (bib0008) 2013; 43 Cangialosi, Di Febbraro, Sacco (bib0007) 2016; 10 Quadrifoglio, Dessouky, Ordóñez (bib0023) 2008; 185 Schaub, Friedrich, O’Sullivan (bib0026) 2014; 263 Agatz (10.1016/j.trb.2017.10.006_bib0002) 2011; 45 Teodorovic (10.1016/j.trb.2017.10.006_bib0029) 2005 Ghoseiri (10.1016/j.trb.2017.10.006_bib0012) 2013 Herbawi (10.1016/j.trb.2017.10.006_bib0013) 2011 Baldacci (10.1016/j.trb.2017.10.006_bib0003) 2004; 52 Wolfler Calvo (10.1016/j.trb.2017.10.006_bib0033) 2004; 31 Shaheen (10.1016/j.trb.2017.10.006_bib0027) 2015 Vukan (10.1016/j.trb.2017.10.006_bib0030) 1981 Cordeau (10.1016/j.trb.2017.10.006_bib0009) 2007; 153 Qiu (10.1016/j.trb.2017.10.006_bib0022) 2014; 48 Cangialosi (10.1016/j.trb.2017.10.006_bib0007) 2016; 10 Liaw (10.1016/j.trb.2017.10.006_bib0017) 1996; 26 Carnes (10.1016/j.trb.2017.10.006_bib0008) 2013; 43 Masson (10.1016/j.trb.2017.10.006_bib0020) 2014; 41 Schaub (10.1016/j.trb.2017.10.006_bib0026) 2014; 263 Psaraftis (10.1016/j.trb.2017.10.006_bib0021) 1983; 17 Savelsbergh (10.1016/j.trb.2017.10.006_bib0025) 1995; 29 Böckmann (10.1016/j.trb.2017.10.006_bib0004) 2013 Masoud (10.1016/j.trb.2017.10.006_bib0018) 2017; 99 Quadrifoglio (10.1016/j.trb.2017.10.006_bib0023) 2008; 185 Cortés (10.1016/j.trb.2017.10.006_bib0010) 2002 Herbawi (10.1016/j.trb.2017.10.006_bib0014) 2012 Braekers (10.1016/j.trb.2017.10.006_bib0005) 2014; 67 10.1016/j.trb.2017.10.006_bib0006 Wagner (10.1016/j.trb.2017.10.006_bib0031) 2003; 3 Li (10.1016/j.trb.2017.10.006_bib0016) 2010; 18 Regue (10.1016/j.trb.2017.10.006_bib0024) 2016; 2542 Masoud (10.1016/j.trb.2017.10.006_bib0019) 2017; 102 Di Febbraro (10.1016/j.trb.2017.10.006_bib0011) 2013 Wagner (10.1016/j.trb.2017.10.006_bib0032) 2005; 10 Agatz (10.1016/j.trb.2017.10.006_bib0001) 2009 Jaw (10.1016/j.trb.2017.10.006_bib0015) 1986; 20 Stein (10.1016/j.trb.2017.10.006_bib0028) 1978; 12 |
| References_xml | – volume: 67 start-page: 166 year: 2014 end-page: 186 ident: bib0005 article-title: Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots publication-title: Transp. Res. Part B – reference: Business Insider, 2015. Uber Just Released Its First Report On Its Drivers Here Are The Numbers. – volume: 263 year: 2014 ident: bib0026 article-title: ECAI 2014: 21st european conference on artificial intelligence – volume: 52 start-page: pp.422 year: 2004 end-page: 439 ident: bib0003 article-title: An exact method for the car pooling problem based on lagrangean column generation publication-title: Oper. Res. – volume: 99 start-page: 1 year: 2017 end-page: 29 ident: bib0018 article-title: A decomposition algorithm to solve the multi-hop peer-to-peer ride-matching problem publication-title: Trans. Res. Part B – year: 2013 ident: bib0012 article-title: Dynamic rideshare optimized matching problem publication-title: PhD Dissertation at University of Maryland – volume: 10 start-page: 1 year: 2005 end-page: 3 ident: bib0032 article-title: Geometric containers for efficient shortest-path computation publication-title: J. Exp. Algorithmics (JEA) – volume: 3 start-page: 776 year: 2003 end-page: 787 ident: bib0031 article-title: Geometric speed-up techniques for finding shortest paths in large sparse graphs publication-title: Esa – volume: 43 start-page: 232 year: 2013 end-page: 239 ident: bib0008 article-title: Mathematical programming guides air-ambulance routing at ornge publication-title: Interfaces (Providence) – year: 2015 ident: bib0027 article-title: Mobility and the sharing economy: Impacts Synopsis publication-title: Technical Report – volume: 31 start-page: 2263 year: 2004 end-page: 2278 ident: bib0033 article-title: A distributed geographic information system for the daily car pooling problem publication-title: Comput. Oper. Res. – volume: 2542 start-page: 102 year: 2016 end-page: 110 ident: bib0024 article-title: Car2work: a shared mobility concept to connect commuters with workplaces publication-title: Transp. Res. Record: J. Transp. Res. Board – volume: 29 start-page: 17 year: 1995 end-page: 29 ident: bib0025 article-title: The general pickup and delivery problem publication-title: Transp. Sci. – start-page: 282 year: 2011 end-page: 288 ident: bib0013 article-title: Ant colony vs. genetic multiobjective route planning in dynamic multi-hop ridesharing publication-title: 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence – volume: 102 start-page: 60 year: 2017 end-page: 77 ident: bib0019 article-title: Using bilateral trading to increase ridership and user permanence in ridesharing systems publication-title: Transp. Res. Part E – volume: 45 start-page: 1450 year: 2011 end-page: 1464 ident: bib0002 article-title: Dynamic ride-sharing: A simulation study in metro atlanta publication-title: Transp. Res. B – volume: 185 start-page: 481 year: 2008 end-page: 494 ident: bib0023 article-title: Mobility allowance shuttle transit (mast) services: mip formulation and strengthening with logic constraints publication-title: Eur. J. Oper. Res. – start-page: 385 year: 2012 end-page: 392 ident: bib0014 article-title: A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows publication-title: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation – volume: 26 start-page: 552 year: 1996 end-page: 565 ident: bib0017 article-title: A decision support system for the bimodal dial-a-ride problem publication-title: IEEE Trans. Syst., Man, and Cybernetics - Part A – volume: 12 start-page: 232 year: 1978 end-page: 249 ident: bib0028 article-title: Scheduling dial-a-ride transportation systems publication-title: Transp. Sci. – start-page: 44 year: 2013 end-page: 50 ident: bib0011 article-title: Optimization of dynamic ridesharing systems publication-title: Trans. Res. Record – year: 1981 ident: bib0030 article-title: Urban public transportation: Systems and technology – start-page: 51 year: 2005 end-page: 60 ident: bib0029 article-title: Bee colony optimization–a cooperative learning approach to complex transportation problems publication-title: Advanced OR and AI Methods in Transportation: Proceedings of 16th Mini–EURO Conference and 10th Meeting of EWGT (13-16 September 2005).–Poznan: Publishing House of the Polish Operational and System Research – volume: 17 start-page: 351 year: 1983 end-page: 357 ident: bib0021 article-title: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows publication-title: Transp. Sci. – year: 2013 ident: bib0004 article-title: The shared economy: it is time to start caring about sharing; value creating factors in the shared economy publication-title: University of Twente, Faculty of Management and Governance – reference: . Accessed: 2015-06-20. – volume: 48 start-page: 229 year: 2014 end-page: 240 ident: bib0022 article-title: A dynamic station strategy to improve the performance of flex-route transit services publication-title: Transp. Res. Part C – volume: 20 start-page: 243 year: 1986 end-page: 257 ident: bib0015 article-title: A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows publication-title: Transp. Res. Part B: – start-page: 178 year: 2002 end-page: 187 ident: bib0010 article-title: Design and operational concepts of high-coverage point-to-point transit system publication-title: Transp. Res. Record – volume: 41 start-page: 12 year: 2014 end-page: 23 ident: bib0020 article-title: The dial-a-ride problem with transfers publication-title: Comput. Oper. Res. – year: 2009 ident: bib0001 article-title: Sustainable passenger transportation: Dynamic ride-sharing publication-title: ERIM Report Series Reference No. ERS-2010-010-LIS – volume: 18 start-page: 770 year: 2010 end-page: 780 ident: bib0016 article-title: Feeder transit services: choosing between fixed and demand responsive policy publication-title: Transp. Res. Part C – volume: 10 start-page: 227 year: 2016 end-page: 236 ident: bib0007 article-title: Designing a multimodal generalised ride sharing system publication-title: IET Intel. Transport Syst. – volume: 153 start-page: 29 year: 2007 end-page: 46 ident: bib0009 article-title: The dial-a-ride problem: models and algorithms publication-title: Ann. Oper. Res. – volume: 48 start-page: 229 year: 2014 ident: 10.1016/j.trb.2017.10.006_bib0022 article-title: A dynamic station strategy to improve the performance of flex-route transit services publication-title: Transp. Res. Part C doi: 10.1016/j.trc.2014.09.003 – start-page: 44 issue: 2359 year: 2013 ident: 10.1016/j.trb.2017.10.006_bib0011 article-title: Optimization of dynamic ridesharing systems publication-title: Trans. Res. Record doi: 10.3141/2359-06 – volume: 10 start-page: 227 issue: 4 year: 2016 ident: 10.1016/j.trb.2017.10.006_bib0007 article-title: Designing a multimodal generalised ride sharing system publication-title: IET Intel. Transport Syst. doi: 10.1049/iet-its.2015.0131 – volume: 45 start-page: 1450 issue: 9 year: 2011 ident: 10.1016/j.trb.2017.10.006_bib0002 article-title: Dynamic ride-sharing: A simulation study in metro atlanta publication-title: Transp. Res. B doi: 10.1016/j.trb.2011.05.017 – year: 2013 ident: 10.1016/j.trb.2017.10.006_bib0004 article-title: The shared economy: it is time to start caring about sharing; value creating factors in the shared economy publication-title: University of Twente, Faculty of Management and Governance – year: 1981 ident: 10.1016/j.trb.2017.10.006_bib0030 – year: 2013 ident: 10.1016/j.trb.2017.10.006_bib0012 article-title: Dynamic rideshare optimized matching problem publication-title: PhD Dissertation at University of Maryland – start-page: 282 year: 2011 ident: 10.1016/j.trb.2017.10.006_bib0013 article-title: Ant colony vs. genetic multiobjective route planning in dynamic multi-hop ridesharing – volume: 102 start-page: 60 year: 2017 ident: 10.1016/j.trb.2017.10.006_bib0019 article-title: Using bilateral trading to increase ridership and user permanence in ridesharing systems publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2017.04.007 – volume: 10 start-page: 1 year: 2005 ident: 10.1016/j.trb.2017.10.006_bib0032 article-title: Geometric containers for efficient shortest-path computation publication-title: J. Exp. Algorithmics (JEA) – ident: 10.1016/j.trb.2017.10.006_bib0006 – volume: 153 start-page: 29 issue: 1 year: 2007 ident: 10.1016/j.trb.2017.10.006_bib0009 article-title: The dial-a-ride problem: models and algorithms publication-title: Ann. Oper. Res. doi: 10.1007/s10479-007-0170-8 – volume: 99 start-page: 1 year: 2017 ident: 10.1016/j.trb.2017.10.006_bib0018 article-title: A decomposition algorithm to solve the multi-hop peer-to-peer ride-matching problem publication-title: Trans. Res. Part B doi: 10.1016/j.trb.2017.01.004 – volume: 26 start-page: 552 issue: 5 year: 1996 ident: 10.1016/j.trb.2017.10.006_bib0017 article-title: A decision support system for the bimodal dial-a-ride problem publication-title: IEEE Trans. Syst., Man, and Cybernetics - Part A doi: 10.1109/3468.531903 – volume: 29 start-page: 17 issue: 1 year: 1995 ident: 10.1016/j.trb.2017.10.006_bib0025 article-title: The general pickup and delivery problem publication-title: Transp. Sci. doi: 10.1287/trsc.29.1.17 – volume: 2542 start-page: 102 year: 2016 ident: 10.1016/j.trb.2017.10.006_bib0024 article-title: Car2work: a shared mobility concept to connect commuters with workplaces publication-title: Transp. Res. Record: J. Transp. Res. Board doi: 10.3141/2542-12 – volume: 18 start-page: 770 issue: 5 year: 2010 ident: 10.1016/j.trb.2017.10.006_bib0016 article-title: Feeder transit services: choosing between fixed and demand responsive policy publication-title: Transp. Res. Part C doi: 10.1016/j.trc.2009.05.015 – start-page: 51 year: 2005 ident: 10.1016/j.trb.2017.10.006_bib0029 article-title: Bee colony optimization–a cooperative learning approach to complex transportation problems – year: 2015 ident: 10.1016/j.trb.2017.10.006_bib0027 article-title: Mobility and the sharing economy: Impacts Synopsis – volume: 20 start-page: 243 issue: 3 year: 1986 ident: 10.1016/j.trb.2017.10.006_bib0015 article-title: A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows publication-title: Transp. Res. Part B: doi: 10.1016/0191-2615(86)90020-2 – year: 2009 ident: 10.1016/j.trb.2017.10.006_bib0001 article-title: Sustainable passenger transportation: Dynamic ride-sharing publication-title: ERIM Report Series Reference No. ERS-2010-010-LIS – volume: 41 start-page: 12 issue: 0 year: 2014 ident: 10.1016/j.trb.2017.10.006_bib0020 article-title: The dial-a-ride problem with transfers publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.07.020 – start-page: 385 year: 2012 ident: 10.1016/j.trb.2017.10.006_bib0014 article-title: A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows – volume: 12 start-page: 232 issue: 3 year: 1978 ident: 10.1016/j.trb.2017.10.006_bib0028 article-title: Scheduling dial-a-ride transportation systems publication-title: Transp. Sci. doi: 10.1287/trsc.12.3.232 – start-page: 178 issue: 1783 year: 2002 ident: 10.1016/j.trb.2017.10.006_bib0010 article-title: Design and operational concepts of high-coverage point-to-point transit system publication-title: Transp. Res. Record doi: 10.3141/1783-22 – volume: 52 start-page: pp.422 issue: 3 year: 2004 ident: 10.1016/j.trb.2017.10.006_bib0003 article-title: An exact method for the car pooling problem based on lagrangean column generation publication-title: Oper. Res. doi: 10.1287/opre.1030.0106 – volume: 185 start-page: 481 issue: 2 year: 2008 ident: 10.1016/j.trb.2017.10.006_bib0023 article-title: Mobility allowance shuttle transit (mast) services: mip formulation and strengthening with logic constraints publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.12.030 – volume: 263 year: 2014 ident: 10.1016/j.trb.2017.10.006_bib0026 – volume: 17 start-page: 351 issue: 3 year: 1983 ident: 10.1016/j.trb.2017.10.006_bib0021 article-title: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows publication-title: Transp. Sci. doi: 10.1287/trsc.17.3.351 – volume: 3 start-page: 776 year: 2003 ident: 10.1016/j.trb.2017.10.006_bib0031 article-title: Geometric speed-up techniques for finding shortest paths in large sparse graphs – volume: 31 start-page: 2263 issue: 13 year: 2004 ident: 10.1016/j.trb.2017.10.006_bib0033 article-title: A distributed geographic information system for the daily car pooling problem publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(03)00186-2 – volume: 67 start-page: 166 issue: 0 year: 2014 ident: 10.1016/j.trb.2017.10.006_bib0005 article-title: Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots publication-title: Transp. Res. Part B doi: 10.1016/j.trb.2014.05.007 – volume: 43 start-page: 232 issue: 3 year: 2013 ident: 10.1016/j.trb.2017.10.006_bib0008 article-title: Mathematical programming guides air-ambulance routing at ornge publication-title: Interfaces (Providence) doi: 10.1287/inte.2013.0683 |
| SSID | ssj0003401 |
| Score | 2.5821118 |
| Snippet | •An optimal, real-time algorithm for the multi-hop P2P ride-matching problem.•Serving requests as soon as they arrive on a first-come, first-served (FCFS)... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 218 |
| SubjectTerms | Multi-modal transportation On-demand transportation Ride-matching Ridesharing |
| Title | A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system |
| URI | https://dx.doi.org/10.1016/j.trb.2017.10.006 |
| Volume | 106 |
| WOSCitedRecordID | wos000418218000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2367 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003401 issn: 0191-2615 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZKh8R4QDBAbFzkB56IXOXW2H4saAgmVCEYqG-R49hrR0mmNKvGK7-c49i5lJsAiZe0suzG8vl6_Pn4XBB6SmlERaAC0H4sInEgfJLpRJB4mjEOW2BAGwfZj2_ofM4WC_52NPraxsJs17Qo2NUVv_ivooY2ELYJnf0LcXc_Cg3wHYQOTxA7PP9I8DMPeOCamKLxnliflXD6X342FBNeu1U2NEqpitQlMZ9etcoVAd5qnSpdgRljBhGeNtkyTWiV6bNZisZXz-Z-HpLaLkG6BZPLH7ScAD2tau-5MTrYQtWtou3N4JvysoHYXPWWgRPxRXwyhe9d6eR3k6FpAra7XTePLmamd1BqTJg8IHBus3fZyqpdRjkxueR29LK_q1nZYJMObdaUH_S_NUWcT-oqM257dGI99_rNrnNBfG_mYaYRNDou4dfQXkinnI3R3uz18eKk28-j2HdVLe2827vxxkvwuxf9nN0MGMvpbXTLHTXwzELkDhqp4gDdaCPRNwfo5iAZ5V2kZ7gDDu6Ag-sSN8DBABw8BA7eAQ52wMGrAgvcAgcPgIMtcO6hDy-PT1-8Iq4KB5FREtUkmnIpA54HmVRM61hSJYTydaiZudJWPtcCeogkUyyKRRInyVRqaZS9SmgeRvfRuCgL9QBhpalMmAyFiWf2OQNqzrKcaWDdIs5ZcIj8dvVS6VLUm0op67T1RTxPYcFTs-CmCRb8ED3rhlzY_Cy_6xy3IkkdwbTEMQX8_HrY0b8Ne4j2-z_FIzSuq0v1GF2X23q1qZ44lH0Dr-SgRg |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+real-time+algorithm+to+solve+the+peer-to-peer+ride-matching+problem+in+a+flexible+ridesharing+system&rft.jtitle=Transportation+research.+Part+B%3A+methodological&rft.au=Masoud%2C+Neda&rft.au=Jayakrishnan%2C+R.&rft.date=2017-12-01&rft.pub=Elsevier+Ltd&rft.issn=0191-2615&rft.eissn=1879-2367&rft.volume=106&rft.spage=218&rft.epage=236&rft_id=info:doi/10.1016%2Fj.trb.2017.10.006&rft.externalDocID=S0191261517301169 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0191-2615&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0191-2615&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0191-2615&client=summon |