SRide: An Online System for Multi-Hop Ridesharing
In the context of smart cities, ridesharing in urban areas is gaining researchers’ interest and is considered to be a sustainable transportation solution. In this paper, we present SRide (Shared Ride), a multi-hop ridesharing system as a mode of sustainable transportation. Multi-hop ridesharing is a...
Gespeichert in:
| Veröffentlicht in: | Sustainability Jg. 12; H. 22; S. 9633 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Basel
MDPI AG
18.11.2020
|
| Schlagworte: | |
| ISSN: | 2071-1050, 2071-1050 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In the context of smart cities, ridesharing in urban areas is gaining researchers’ interest and is considered to be a sustainable transportation solution. In this paper, we present SRide (Shared Ride), a multi-hop ridesharing system as a mode of sustainable transportation. Multi-hop ridesharing is a type of ridesharing in which a rider travels in multiple hops to reach a destination, transferring from one driver to another between hops. The key problem in multi-hop ridesharing is to find an optimal itinerary or route plan for a rider from an origin to a destination in a dynamic, online setting. SRide adopts a novel approach to finding itineraries for riders suited to the online nature of the problem. The system represents ride offers as a time-dependent directed graph and finds itineraries dynamically by updating the graph incrementally and decrementally as ride offers are updated in the system. The system’s distinguishing feature is its incremental and decremental operation, which is enabled by employing dynamic single-source shortest-path algorithms. We conducted two extensive simulation studies to evaluate its performance. Metrics, including the matching rate, savings in total system-wide vehicle-miles, and total system-wide driving times were measured. In the first study, SRide’s dynamic update algorithms were compared with their non-dynamic versions. Results show that SRide’s algorithms run up to thirteen times faster than their non-dynamic versions. In the second study, we used data from the travel demand model for metropolitan Atlanta in the US state of Georgia, to assess the benefits of multi-hop ridesharing. Results show that matching rates increase up to 68%, saving in total system-wide vehicle-miles of up to 12%, and reduction in the total system-wide driving time of up to 12.86% is achieved. |
|---|---|
| AbstractList | In the context of smart cities, ridesharing in urban areas is gaining researchers’ interest and is considered to be a sustainable transportation solution. In this paper, we present SRide (Shared Ride), a multi-hop ridesharing system as a mode of sustainable transportation. Multi-hop ridesharing is a type of ridesharing in which a rider travels in multiple hops to reach a destination, transferring from one driver to another between hops. The key problem in multi-hop ridesharing is to find an optimal itinerary or route plan for a rider from an origin to a destination in a dynamic, online setting. SRide adopts a novel approach to finding itineraries for riders suited to the online nature of the problem. The system represents ride offers as a time-dependent directed graph and finds itineraries dynamically by updating the graph incrementally and decrementally as ride offers are updated in the system. The system’s distinguishing feature is its incremental and decremental operation, which is enabled by employing dynamic single-source shortest-path algorithms. We conducted two extensive simulation studies to evaluate its performance. Metrics, including the matching rate, savings in total system-wide vehicle-miles, and total system-wide driving times were measured. In the first study, SRide’s dynamic update algorithms were compared with their non-dynamic versions. Results show that SRide’s algorithms run up to thirteen times faster than their non-dynamic versions. In the second study, we used data from the travel demand model for metropolitan Atlanta in the US state of Georgia, to assess the benefits of multi-hop ridesharing. Results show that matching rates increase up to 68%, saving in total system-wide vehicle-miles of up to 12%, and reduction in the total system-wide driving time of up to 12.86% is achieved. |
| Author | El Affendi, Mohammed Qureshi, Basit Shah, Inayatullah |
| Author_xml | – sequence: 1 givenname: Inayatullah orcidid: 0000-0003-2777-9395 surname: Shah fullname: Shah, Inayatullah – sequence: 2 givenname: Mohammed orcidid: 0000-0001-9349-1985 surname: El Affendi fullname: El Affendi, Mohammed – sequence: 3 givenname: Basit orcidid: 0000-0001-7389-519X surname: Qureshi fullname: Qureshi, Basit |
| BookMark | eNpt0E1LAzEQBuAgFay1F39BwJuwmo9NNvFWilqhUrB6DtndRFO2SU2yh_57t1RQxLnMHJ6ZgfccjHzwBoBLjG4oleg29ZgQIjmlJ2BMUIULjBga_ZrPwDSlDRqKUiwxHwO8fnGtuYMzD1e-c97A9T5ls4U2RPjcd9kVi7CDB5Q-dHT-_QKcWt0lM_3uE_D2cP86XxTL1ePTfLYsGiJZLlpuka2kFri1rNZEU6KxxRRxTqSQmlrOua0EqUtUW2oa0ZastQLXEjFecjoBV8e7uxg-e5Oy2oQ--uGlIiUngolKVIO6PqomhpSisWoX3VbHvcJIHVJRP6kMGP3Bjcs6u-Bz1K77b-ULaSRjiA |
| CitedBy_id | crossref_primary_10_1109_ACCESS_2021_3055507 crossref_primary_10_1109_TITS_2023_3345174 crossref_primary_10_1016_j_heliyon_2024_e37490 |
| Cites_doi | 10.1016/0304-3975(95)00079-8 10.1109/TKDE.2017.2760880 10.1145/2786022 10.1145/3219819.3219824 10.3390/su10082720 10.1016/j.trb.2013.08.012 10.1073/pnas.1611675114 10.1287/trsc.2017.0803 10.1007/s00453-010-9401-5 10.1006/jagm.1999.1048 10.1287/mnsc.17.11.712 10.1016/j.trb.2011.05.017 10.1016/j.jcss.2005.05.005 10.1016/j.ejor.2012.05.028 10.1006/jagm.1996.0046 10.1177/0037549716680025 10.1016/j.ejor.2018.04.037 10.1016/j.ejor.2009.01.022 10.1007/s12599-015-0396-y 10.1016/j.trb.2017.01.004 10.1007/s11116-018-9893-4 10.1109/TMC.2018.2861864 10.1109/IWQoS.2018.8624152 10.1109/TMC.2019.2928808 10.1109/IROS.2014.6943018 10.1590/0101-7438.2017.037.03.0487 10.1016/0196-6774(91)90036-X 10.1016/j.trb.2015.07.025 |
| ContentType | Journal Article |
| Copyright | 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION 4U- ABUWG AFKRA AZQEC BENPR CCPQU DWQXO PHGZM PHGZT PIMPY PKEHL PQEST PQQKQ PQUKI PRINS |
| DOI | 10.3390/su12229633 |
| DatabaseName | CrossRef University Readers ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest One ProQuest Central ProQuest Central Premium ProQuest One Academic (New) ProQuest Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China |
| DatabaseTitle | CrossRef Publicly Available Content Database University Readers ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Economics Environmental Sciences |
| EISSN | 2071-1050 |
| ExternalDocumentID | 10_3390_su12229633 |
| GeographicLocations | Atlanta Georgia United States--US |
| GeographicLocations_xml | – name: Atlanta Georgia – name: United States--US |
| GroupedDBID | 29Q 2WC 4P2 5VS 7XC 8FE 8FH A8Z AAHBH AAYXX ACHQT ADBBV ADMLS AENEX AFFHD AFKRA AFMMW ALMA_UNASSIGNED_HOLDINGS BCNDV BENPR CCPQU CITATION E3Z ECGQY ESTFP FRS GX1 KQ8 ML. MODMG M~E OK1 P2P PHGZM PHGZT PIMPY PROAC TR2 4U- ABUWG AZQEC DWQXO PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c295t-d6f0f79a81df5ba2a32a1f130662989a3f666f782b40bf3ec8d45df81b9056463 |
| IEDL.DBID | PIMPY |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000594571300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2071-1050 |
| IngestDate | Mon Jun 30 07:26:09 EDT 2025 Sat Nov 29 07:10:35 EST 2025 Tue Nov 18 22:11:24 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 22 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c295t-d6f0f79a81df5ba2a32a1f130662989a3f666f782b40bf3ec8d45df81b9056463 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-9349-1985 0000-0001-7389-519X 0000-0003-2777-9395 |
| OpenAccessLink | https://www.proquest.com/publiccontent/docview/2462858787?pq-origsite=%requestingapplication% |
| PQID | 2462858787 |
| PQPubID | 2032327 |
| ParticipantIDs | proquest_journals_2462858787 crossref_primary_10_3390_su12229633 crossref_citationtrail_10_3390_su12229633 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-11-18 |
| PublicationDateYYYYMMDD | 2020-11-18 |
| PublicationDate_xml | – month: 11 year: 2020 text: 2020-11-18 day: 18 |
| PublicationDecade | 2020 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Sustainability |
| PublicationYear | 2020 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | Teubner (ref_11) 2015; 57 Emidio (ref_32) 2015; 20 Agatz (ref_17) 2011; 45 Arslan (ref_26) 2019; 53 Frigioni (ref_33) 2000; 34 ref_14 ref_13 ref_12 ref_34 Ferone (ref_29) 2017; 37 Liu (ref_4) 2019; 18 Wang (ref_2) 2020; 47 Matamala (ref_10) 2010; 200 Ramalingam (ref_16) 1996; 21 Chen (ref_24) 2017; 18 Samaranayake (ref_23) 2017; 114 Ta (ref_28) 2018; 30 Agatz (ref_8) 2012; 223 Masoud (ref_21) 2017; 99 ref_39 ref_38 ref_15 Roditty (ref_35) 2011; 61 Geisberger (ref_36) 2010; Volume 14 Ausiello (ref_31) 1991; 638 Stiglic (ref_18) 2015; 82 ref_25 Tahon (ref_20) 2017; 93 ref_22 Furuhata (ref_19) 2013; 57 ref_1 ref_3 Cleophas (ref_5) 2019; 273 ref_27 Demetrescu (ref_30) 2006; 72 ref_9 Yen (ref_37) 1971; 17 ref_7 ref_6 |
| References_xml | – ident: ref_34 doi: 10.1016/0304-3975(95)00079-8 – ident: ref_9 – volume: 30 start-page: 219 year: 2018 ident: ref_28 article-title: An Efficient Ride-Sharing Framework for Maximizing Shared Route publication-title: IEEE Trans. Knowl. Data Eng. doi: 10.1109/TKDE.2017.2760880 – volume: 20 start-page: 1 year: 2015 ident: ref_32 article-title: Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments publication-title: J. Exp. Algorithms doi: 10.1145/2786022 – ident: ref_7 doi: 10.1145/3219819.3219824 – ident: ref_3 doi: 10.3390/su10082720 – volume: 57 start-page: 28 year: 2013 ident: ref_19 article-title: Ridesharing: The State-of-the-Art and Future Directions publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2013.08.012 – volume: 114 start-page: 462 year: 2017 ident: ref_23 article-title: On-Demand High-Capacity Ride-Sharing via Dynamic Trip-Vehicle Assignment publication-title: Proc. Natl. Acad. Sci. USA doi: 10.1073/pnas.1611675114 – volume: 53 start-page: 222 year: 2019 ident: ref_26 article-title: Crowdsourced Delivery—A Dynamic Pickup and Delivery Problem with Ad Hoc Drivers publication-title: Transp. Sci. doi: 10.1287/trsc.2017.0803 – volume: 61 start-page: 389 year: 2011 ident: ref_35 article-title: On Dynamic Shortest Paths Problems publication-title: Algorithmica doi: 10.1007/s00453-010-9401-5 – volume: 34 start-page: 251 year: 2000 ident: ref_33 article-title: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees 1 publication-title: J. Algorithms doi: 10.1006/jagm.1999.1048 – ident: ref_39 – volume: 17 start-page: 712 year: 1971 ident: ref_37 article-title: Finding the K Shortest Loopless Paths in a Network publication-title: Manage. Sci. doi: 10.1287/mnsc.17.11.712 – ident: ref_14 – volume: 45 start-page: 1450 year: 2011 ident: ref_17 article-title: Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2011.05.017 – volume: 72 start-page: 813 year: 2006 ident: ref_30 article-title: Fully Dynamic All Pairs Shortest Paths with Real Edge Weights publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2005.05.005 – volume: 223 start-page: 295 year: 2012 ident: ref_8 article-title: Optimization for Dynamic Ride-Sharing: A Review publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.05.028 – volume: Volume 14 start-page: 88 year: 2010 ident: ref_36 article-title: Fast Detour Computation for Ride Sharing publication-title: 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’10) – volume: 21 start-page: 267 year: 1996 ident: ref_16 article-title: An Incremental Algorithm for a Generalization of the Shortest-Path Problem publication-title: J. Algorithms doi: 10.1006/jagm.1996.0046 – volume: 93 start-page: 3 year: 2017 ident: ref_20 article-title: An Evolutionary Approach to Solve the Dynamic Multihop Ridematching Problem publication-title: Simulation doi: 10.1177/0037549716680025 – volume: 273 start-page: 801 year: 2019 ident: ref_5 article-title: Collaborative Urban Transportation: Recent Advances in Theory and Practice publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2018.04.037 – ident: ref_6 – volume: 200 start-page: 711 year: 2010 ident: ref_10 article-title: The Pickup and Delivery Problem with Transfers: Formulation and a Branch-and-Cut Solution Method publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2009.01.022 – volume: 57 start-page: 311 year: 2015 ident: ref_11 article-title: The Economics of Multi-Hop Ride Sharing: Creating New Mobility Networks Through IS publication-title: Bus. Inf. Syst. Eng. doi: 10.1007/s12599-015-0396-y – volume: 99 start-page: 1 year: 2017 ident: ref_21 article-title: A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2017.01.004 – volume: 47 start-page: 397 year: 2020 ident: ref_2 article-title: An Empirical Study of Consumers’ Intention to Use Ride-Sharing Services: Using an Extended Technology Acceptance Model publication-title: Transportation doi: 10.1007/s11116-018-9893-4 – volume: 18 start-page: 1288 year: 2019 ident: ref_4 article-title: FooDNet: Toward an Optimized Food Delivery Network Based on Spatial Crowdsourcing publication-title: IEEE Trans. Mob. Comput. doi: 10.1109/TMC.2018.2861864 – ident: ref_27 – ident: ref_1 doi: 10.1109/IWQoS.2018.8624152 – ident: ref_12 – ident: ref_25 doi: 10.1109/TMC.2019.2928808 – ident: ref_22 doi: 10.1109/IROS.2014.6943018 – ident: ref_15 – ident: ref_13 – volume: 37 start-page: 487 year: 2017 ident: ref_29 article-title: Shortest Paths on Dynamic Graphs: A Survey publication-title: Pesqui. Oper. doi: 10.1590/0101-7438.2017.037.03.0487 – ident: ref_38 – volume: 638 start-page: 615 year: 1991 ident: ref_31 article-title: Incremental Algorithms for Minimal Length Paths* publication-title: J. Algorithms doi: 10.1016/0196-6774(91)90036-X – volume: 82 start-page: 36 year: 2015 ident: ref_18 article-title: The Benefits of Meeting Points in Ride-Sharing Systems publication-title: Transp. Res. Part B Methodol. doi: 10.1016/j.trb.2015.07.025 – volume: 18 start-page: 1478 year: 2017 ident: ref_24 article-title: CROWDDELIVER: Planning City-Wide Package Delivery Paths Leveraging the Crowd of Taxis publication-title: IEEE Trans. Intell. Transp. Syst. |
| SSID | ssj0000331916 |
| Score | 2.2566278 |
| Snippet | In the context of smart cities, ridesharing in urban areas is gaining researchers’ interest and is considered to be a sustainable transportation solution. In... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 9633 |
| SubjectTerms | Algorithms Automation Car pools R&D Research & development Simulation Sustainability Traffic congestion Travel Vehicles |
| Title | SRide: An Online System for Multi-Hop Ridesharing |
| URI | https://www.proquest.com/docview/2462858787 |
| Volume | 12 |
| WOSCitedRecordID | wos000594571300001&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: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2071-1050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331916 issn: 2071-1050 databaseCode: M~E dateStart: 20090101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2071-1050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331916 issn: 2071-1050 databaseCode: BENPR dateStart: 20090301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 2071-1050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331916 issn: 2071-1050 databaseCode: PIMPY dateStart: 20090301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8NAEB5sK-jFR7VYrSWgFw9Lk2weGy9SpaUeWkJVqKeQ3WSxIGltqkd_u7PJtqUgnjxnAmFnduabycw3ANeJlEwInxLHtjlxuBuQOOApQWSM6bPPpJWaxbIJfzRik0kQ6vHoXLdVrnxi4ahLtmfVt41OuJPMhKqYd2w1UukytLa7-QdRO6TUv1a9UKMCNUW8ZVahFj4Ow9d1zcWkaHCWV7KUUsz2UduWWmjtUbodl7bdchFr-of_-5VHcKAxp9EtjeQYdtKsDnurkeS8Do3eZtwNBfV9z0_AehpPk_TW6GZGyUlqlAznBkJdo5jdJYPZ3FBC-VusSoSn8NLvPT8MiF6yQIQduEuSeNKUfhAjbpUuj-2Y2rElMbJ5niJnj6nEBEcijuCOySVNBUscN5GIdgPETo5HG1DNZll6BgbD1M_DVz3JqYNSsS8Chwlf-jzgScKacLM64khoBnK1COM9wkxEqSPaqKMJV2vZecm78atUa6WGSN-9PNqc-vnfjy9g31bZs2rqYy2oLhef6SXsiq_lNF-0oXbfG4XjNlSG3722NqUf-gXX0w |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5qK-jFt_h2QT14WEx289gVRMQHLdVSfICeYnaTRUHaaqrin_I3OtskLYJ48-A5k0AyH998M9mZAdhOjBFah5x6jCnqKV_SWKqUojLG9DkUxk2dwbKJsNUSt7eyXYHPshfGHqssOXFA1ElX2xr5HrNNlL5AfB32nqndGmX_rpYrNHJYNNOPd0zZsoPGCfp3h7Gz0-vjOi22ClDNpN-nSWAcE8oYhZrxVcxizmLXIJUHgZ1GHnODit5g4FSeowxPtUg8PzEo7ySKBS_g-NwxqHkIdqcKtXbjon03rOo4HCHtBvkcVM6lg3hy7crsgPPvke878Q-i2dn0f_sOMzBV6GZylAN9FippZw4myrbqbA4WT0cte2hYcFY2D-7V5WOS7pOjDsnnqpJ8SjtBuU4G_ce03u0Ra5Q9xLbMuQA3f_Iqi1DtdDvpEhCB6WuAtwZGcQ-t4lBLT-jQhEqqJBHLsFs6MdLFFHW7zOMpwmzKOjwaOXwZtoa2vXx2yI9Wa6Wjo4I_smjk5ZXfL2_CRP364jw6b7SaqzDJbDXAHlIUa1Dtv7ym6zCu3_qP2ctGAVUC93-Nii_yQyXl |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5qFfXiW3xUXVAPHhaT3Tx2BREfLYpSig_wFrObLArS1qYq_jV_nbNN0iKINw-eOw0k35eZbyY7MwA7iTFC65BTjzFFPeVLGkuVUlTGmD6HwripM1g2ETab4v5etirwWfbC2GOVpU8cOOqko22NfJ_ZJkpfIL_2TXEsonXWOOq-ULtByn5pLddp5BS5TD_eMX3LDi_OEOtdxhr129NzWmwYoJpJv0-TwDgmlDGKNuOrmMWcxa5Btx4EdjJ5zA2qe4NBVHmOMjzVIvH8xKDUkygcvIDjdcdgPOSY9FRh_KTebF0PKzwOR3q7QT4TlXPpILdcuz474Px7FPweBAaRrTH7n5_JHMwUepoc5y_APFTS9gJMle3W2QIs10etfGhY-LJsEdyb66ckPSDHbZLPWyX59HaCMp4M-pLpeadLrFH2GNvy5xLc_cmtLEO13WmnK0AEIhzgXwOjuIdWcailJ3RoQiVVkohV2CsBjXQxXd0u-XiOMMuy4Ecj8Fdhe2jbzWeK_GhVK0GPCr-SRSPE137_eQsmkQrR1UXzch2mmS0S2LOLogbVfu813YAJ_dZ_ynqbBWsJPPw1Kb4AWdIufw |
| 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=SRide%3A+An+Online+System+for+Multi-Hop+Ridesharing&rft.jtitle=Sustainability&rft.au=Mohammed+El+Affendi&rft.au=Qureshi%2C+Basit&rft.date=2020-11-18&rft.pub=MDPI+AG&rft.eissn=2071-1050&rft.volume=12&rft.issue=22&rft.spage=9633&rft_id=info:doi/10.3390%2Fsu12229633&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2071-1050&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2071-1050&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2071-1050&client=summon |