A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem Article Swipe
Neda Masoud
,
R. Jayakrishnan
·
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1704.06838
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1704.06838
In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and a driver can carry multiple riders. We propose a pre-processing procedure to reduce the size of the problem, and devise a decomposition algorithm to solve the original ride-matching problem to optimality by means of solving multiple smaller problems. We conduct extensive numerical experiments to demonstrate the computational efficiency of the proposed algorithm and show its practical applicability to reasonably-sized dynamic ride-matching contexts. Finally, in the interest of even lower solution times, we propose heuristic solution methods, and investigate the trade-offs between solution time and accuracy.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- http://www.sciencedirect.com/science/article/pii/S019126151730019X
- OA Status
- green
- Cited By
- 2
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W2963477630
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2963477630Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.1704.06838Digital Object Identifier
- Title
-
A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching ProblemWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2017Year of publication
- Publication date
-
2017-04-22Full publication date if available
- Authors
-
Neda Masoud, R. JayakrishnanList of authors in order
- Landing page
-
https://www.sciencedirect.com/science/article/pii/S019126151730019XPublisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://escholarship.org/uc/item/9gz505mqDirect OA link when available
- Concepts
-
Computer science, Matching (statistics), Decomposition, Mathematical optimization, Assignment problem, Peer-to-peer, Decomposition method (queueing theory), Algorithm, Mathematics, Distributed computing, Biology, Statistics, Discrete mathematics, EcologyTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
2Total citation count in OpenAlex
- Citations by year (recent)
-
2017: 2Per-year citation counts (last 5 years)
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2963477630 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.1704.06838 |
| ids.doi | https://doi.org/10.48550/arxiv.1704.06838 |
| ids.mag | 2963477630 |
| ids.openalex | https://openalex.org/W2963477630 |
| fwci | 0.36496299 |
| type | article |
| title | A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T11942 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9998000264167786 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2203 |
| topics[0].subfield.display_name | Automotive Engineering |
| topics[0].display_name | Transportation and Mobility Innovations |
| topics[1].id | https://openalex.org/T10698 |
| topics[1].field.id | https://openalex.org/fields/33 |
| topics[1].field.display_name | Social Sciences |
| topics[1].score | 0.9884999990463257 |
| topics[1].domain.id | https://openalex.org/domains/2 |
| topics[1].domain.display_name | Social Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/3313 |
| topics[1].subfield.display_name | Transportation |
| topics[1].display_name | Transportation Planning and Optimization |
| topics[2].id | https://openalex.org/T10567 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9864000082015991 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2209 |
| topics[2].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[2].display_name | Vehicle Routing Optimization Methods |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.6336064338684082 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C165064840 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6235337853431702 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1321061 |
| concepts[1].display_name | Matching (statistics) |
| concepts[2].id | https://openalex.org/C124681953 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5918909311294556 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q339062 |
| concepts[2].display_name | Decomposition |
| concepts[3].id | https://openalex.org/C126255220 |
| concepts[3].level | 1 |
| concepts[3].score | 0.4936023950576782 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[3].display_name | Mathematical optimization |
| concepts[4].id | https://openalex.org/C85044808 |
| concepts[4].level | 2 |
| concepts[4].score | 0.47910383343696594 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q620614 |
| concepts[4].display_name | Assignment problem |
| concepts[5].id | https://openalex.org/C534932454 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4537392854690552 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q161410 |
| concepts[5].display_name | Peer-to-peer |
| concepts[6].id | https://openalex.org/C2778258933 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4452379047870636 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q16918986 |
| concepts[6].display_name | Decomposition method (queueing theory) |
| concepts[7].id | https://openalex.org/C11413529 |
| concepts[7].level | 1 |
| concepts[7].score | 0.4319094121456146 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[7].display_name | Algorithm |
| concepts[8].id | https://openalex.org/C33923547 |
| concepts[8].level | 0 |
| concepts[8].score | 0.23173204064369202 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[8].display_name | Mathematics |
| concepts[9].id | https://openalex.org/C120314980 |
| concepts[9].level | 1 |
| concepts[9].score | 0.21910524368286133 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[9].display_name | Distributed computing |
| concepts[10].id | https://openalex.org/C86803240 |
| concepts[10].level | 0 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[10].display_name | Biology |
| concepts[11].id | https://openalex.org/C105795698 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q12483 |
| concepts[11].display_name | Statistics |
| concepts[12].id | https://openalex.org/C118615104 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[12].display_name | Discrete mathematics |
| concepts[13].id | https://openalex.org/C18903297 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q7150 |
| concepts[13].display_name | Ecology |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.6336064338684082 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/matching |
| keywords[1].score | 0.6235337853431702 |
| keywords[1].display_name | Matching (statistics) |
| keywords[2].id | https://openalex.org/keywords/decomposition |
| keywords[2].score | 0.5918909311294556 |
| keywords[2].display_name | Decomposition |
| keywords[3].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[3].score | 0.4936023950576782 |
| keywords[3].display_name | Mathematical optimization |
| keywords[4].id | https://openalex.org/keywords/assignment-problem |
| keywords[4].score | 0.47910383343696594 |
| keywords[4].display_name | Assignment problem |
| keywords[5].id | https://openalex.org/keywords/peer-to-peer |
| keywords[5].score | 0.4537392854690552 |
| keywords[5].display_name | Peer-to-peer |
| keywords[6].id | https://openalex.org/keywords/decomposition-method |
| keywords[6].score | 0.4452379047870636 |
| keywords[6].display_name | Decomposition method (queueing theory) |
| keywords[7].id | https://openalex.org/keywords/algorithm |
| keywords[7].score | 0.4319094121456146 |
| keywords[7].display_name | Algorithm |
| keywords[8].id | https://openalex.org/keywords/mathematics |
| keywords[8].score | 0.23173204064369202 |
| keywords[8].display_name | Mathematics |
| keywords[9].id | https://openalex.org/keywords/distributed-computing |
| keywords[9].score | 0.21910524368286133 |
| keywords[9].display_name | Distributed computing |
| language | en |
| locations[0].id | pmh:oai:RePEc:eee:transb:v:99:y:2017:i:c:p:1-29 |
| locations[0].is_oa | False |
| locations[0].source.id | https://openalex.org/S4306401271 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | RePEc: Research Papers in Economics |
| locations[0].source.host_organization | https://openalex.org/I77793887 |
| locations[0].source.host_organization_name | Federal Reserve Bank of St. Louis |
| locations[0].source.host_organization_lineage | https://openalex.org/I77793887 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | submittedVersion |
| locations[0].raw_type | article |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://www.sciencedirect.com/science/article/pii/S019126151730019X |
| locations[1].id | pmh:oai:escholarship.org/ark:/13030/qt9gz505mq |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400115 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | eScholarship (California Digital Library) |
| locations[1].source.host_organization | https://openalex.org/I2801248553 |
| locations[1].source.host_organization_name | California Digital Library |
| locations[1].source.host_organization_lineage | https://openalex.org/I2801248553 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, vol 99, iss C |
| locations[1].landing_page_url | https://escholarship.org/uc/item/9gz505mq |
| locations[2].id | pmh:qt9gz505mq |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306400553 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | Munich Personal RePEc Archive (Ludwig Maximilian University of Munich) |
| locations[2].source.host_organization | https://openalex.org/I8204097 |
| locations[2].source.host_organization_name | Ludwig-Maximilians-Universität München |
| locations[2].source.host_organization_lineage | https://openalex.org/I8204097 |
| locations[2].license | cc-by |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | article |
| locations[2].license_id | https://openalex.org/licenses/cc-by |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | Masoud, N; & Jayakrishnan, R. (2017). A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 99, 1 - 29. doi: 10.1016/j.trb.2017.01.004. UC Irvine: Retrieved from: http://www.escholarship.org/uc/item/9gz505mq |
| locations[2].landing_page_url | http://www.escholarship.org/uc/item/9gz505mq |
| locations[3].id | doi:10.48550/arxiv.1704.06838 |
| locations[3].is_oa | True |
| locations[3].source.id | https://openalex.org/S4306400194 |
| locations[3].source.issn | |
| locations[3].source.type | repository |
| locations[3].source.is_oa | True |
| locations[3].source.issn_l | |
| locations[3].source.is_core | False |
| locations[3].source.is_in_doaj | False |
| locations[3].source.display_name | arXiv (Cornell University) |
| locations[3].source.host_organization | https://openalex.org/I205783295 |
| locations[3].source.host_organization_name | Cornell University |
| locations[3].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[3].license | |
| locations[3].pdf_url | |
| locations[3].version | |
| locations[3].raw_type | article-journal |
| locations[3].license_id | |
| locations[3].is_accepted | False |
| locations[3].is_published | |
| locations[3].raw_source_name | |
| locations[3].landing_page_url | https://doi.org/10.48550/arxiv.1704.06838 |
| locations[4].id | mag:2963477630 |
| locations[4].is_oa | False |
| locations[4].source.id | https://openalex.org/S4306533233 |
| locations[4].source.issn | |
| locations[4].source.type | journal |
| locations[4].source.is_oa | False |
| locations[4].source.issn_l | |
| locations[4].source.is_core | True |
| locations[4].source.is_in_doaj | False |
| locations[4].source.display_name | Transportation Research Board 94th Annual MeetingTransportation Research Board |
| locations[4].source.host_organization | |
| locations[4].source.host_organization_name | |
| locations[4].license | |
| locations[4].pdf_url | |
| locations[4].version | |
| locations[4].raw_type | |
| locations[4].license_id | |
| locations[4].is_accepted | False |
| locations[4].is_published | |
| locations[4].raw_source_name | Transportation Research Board 94th Annual MeetingTransportation Research Board |
| locations[4].landing_page_url | https://trid.trb.org/view/1337764 |
| indexed_in | datacite |
| authorships[0].author.id | https://openalex.org/A5083290583 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-6526-3317 |
| authorships[0].author.display_name | Neda Masoud |
| authorships[0].countries | US |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I27837315 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, MI 48109, USA |
| authorships[0].institutions[0].id | https://openalex.org/I27837315 |
| authorships[0].institutions[0].ror | https://ror.org/00jmfr291 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I27837315 |
| authorships[0].institutions[0].country_code | US |
| authorships[0].institutions[0].display_name | University of Michigan |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Neda Masoud |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, MI 48109, USA |
| authorships[1].author.id | https://openalex.org/A5085499435 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-0155-3622 |
| authorships[1].author.display_name | R. Jayakrishnan |
| authorships[1].countries | US |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I204250578, https://openalex.org/I4210140791 |
| authorships[1].affiliations[0].raw_affiliation_string | Department of Civil and Environmental Engineering , University of California , Irvine, CA, 92697, USA |
| authorships[1].institutions[0].id | https://openalex.org/I4210140791 |
| authorships[1].institutions[0].ror | https://ror.org/04ysmca02 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I4210140791 |
| authorships[1].institutions[0].country_code | US |
| authorships[1].institutions[0].display_name | Irvine University |
| authorships[1].institutions[1].id | https://openalex.org/I204250578 |
| authorships[1].institutions[1].ror | https://ror.org/04gyf1771 |
| authorships[1].institutions[1].type | education |
| authorships[1].institutions[1].lineage | https://openalex.org/I204250578 |
| authorships[1].institutions[1].country_code | US |
| authorships[1].institutions[1].display_name | University of California, Irvine |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | R Jayakrishnan |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Department of Civil and Environmental Engineering , University of California , Irvine, CA, 92697, USA |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://escholarship.org/uc/item/9gz505mq |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T11942 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9998000264167786 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2203 |
| primary_topic.subfield.display_name | Automotive Engineering |
| primary_topic.display_name | Transportation and Mobility Innovations |
| related_works | https://openalex.org/W3165706535, https://openalex.org/W3036869723, https://openalex.org/W2133193911, https://openalex.org/W3109386843, https://openalex.org/W3163667125, https://openalex.org/W2186720891, https://openalex.org/W1985859988, https://openalex.org/W1564363694, https://openalex.org/W3178511247, https://openalex.org/W2550892796, https://openalex.org/W1753967158, https://openalex.org/W2899184533, https://openalex.org/W2079961233, https://openalex.org/W2560230385, https://openalex.org/W2599689448, https://openalex.org/W2914869975, https://openalex.org/W2384389599, https://openalex.org/W3201195753, https://openalex.org/W2738456177, https://openalex.org/W2021195401 |
| cited_by_count | 2 |
| counts_by_year[0].year | 2017 |
| counts_by_year[0].cited_by_count | 2 |
| locations_count | 5 |
| best_oa_location.id | pmh:oai:escholarship.org/ark:/13030/qt9gz505mq |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400115 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | eScholarship (California Digital Library) |
| best_oa_location.source.host_organization | https://openalex.org/I2801248553 |
| best_oa_location.source.host_organization_name | California Digital Library |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I2801248553 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, vol 99, iss C |
| best_oa_location.landing_page_url | https://escholarship.org/uc/item/9gz505mq |
| primary_location.id | pmh:oai:RePEc:eee:transb:v:99:y:2017:i:c:p:1-29 |
| primary_location.is_oa | False |
| primary_location.source.id | https://openalex.org/S4306401271 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | RePEc: Research Papers in Economics |
| primary_location.source.host_organization | https://openalex.org/I77793887 |
| primary_location.source.host_organization_name | Federal Reserve Bank of St. Louis |
| primary_location.source.host_organization_lineage | https://openalex.org/I77793887 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | submittedVersion |
| primary_location.raw_type | article |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://www.sciencedirect.com/science/article/pii/S019126151730019X |
| publication_date | 2017-04-22 |
| publication_year | 2017 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 13, 21, 26, 36, 44, 56 |
| abstract_inverted_index.In | 0 |
| abstract_inverted_index.We | 16, 42, 74 |
| abstract_inverted_index.as | 12, 20 |
| abstract_inverted_index.by | 30, 67 |
| abstract_inverted_index.in | 24, 99 |
| abstract_inverted_index.of | 51, 69, 84, 102 |
| abstract_inverted_index.to | 47, 59, 65, 79, 93 |
| abstract_inverted_index.we | 3, 107 |
| abstract_inverted_index.and | 35, 54, 88, 112, 119 |
| abstract_inverted_index.can | 28, 38 |
| abstract_inverted_index.its | 90 |
| abstract_inverted_index.the | 6, 49, 52, 61, 81, 85, 100, 114 |
| abstract_inverted_index.even | 103 |
| abstract_inverted_index.show | 89 |
| abstract_inverted_index.size | 50 |
| abstract_inverted_index.this | 1, 18 |
| abstract_inverted_index.time | 118 |
| abstract_inverted_index.(P2P) | 9 |
| abstract_inverted_index.carry | 39 |
| abstract_inverted_index.lower | 104 |
| abstract_inverted_index.means | 68 |
| abstract_inverted_index.model | 5 |
| abstract_inverted_index.rider | 27 |
| abstract_inverted_index.solve | 60 |
| abstract_inverted_index.which | 25 |
| abstract_inverted_index.binary | 14 |
| abstract_inverted_index.devise | 55 |
| abstract_inverted_index.driver | 37 |
| abstract_inverted_index.paper, | 2 |
| abstract_inverted_index.reduce | 48 |
| abstract_inverted_index.times, | 106 |
| abstract_inverted_index.travel | 29 |
| abstract_inverted_index.between | 32, 116 |
| abstract_inverted_index.conduct | 75 |
| abstract_inverted_index.dynamic | 95 |
| abstract_inverted_index.problem | 11, 19, 23, 64 |
| abstract_inverted_index.propose | 43, 108 |
| abstract_inverted_index.riders. | 41 |
| abstract_inverted_index.smaller | 72 |
| abstract_inverted_index.solving | 70 |
| abstract_inverted_index.Finally, | 98 |
| abstract_inverted_index.drivers, | 34 |
| abstract_inverted_index.interest | 101 |
| abstract_inverted_index.methods, | 111 |
| abstract_inverted_index.multiple | 33, 40, 71 |
| abstract_inverted_index.original | 62 |
| abstract_inverted_index.problem, | 53 |
| abstract_inverted_index.program. | 15 |
| abstract_inverted_index.proposed | 86 |
| abstract_inverted_index.solution | 105, 110, 117 |
| abstract_inverted_index.accuracy. | 120 |
| abstract_inverted_index.algorithm | 58, 87 |
| abstract_inverted_index.contexts. | 97 |
| abstract_inverted_index.extensive | 76 |
| abstract_inverted_index.formulate | 17 |
| abstract_inverted_index.heuristic | 109 |
| abstract_inverted_index.multi-hop | 7 |
| abstract_inverted_index.numerical | 77 |
| abstract_inverted_index.practical | 91 |
| abstract_inverted_index.problems. | 73 |
| abstract_inverted_index.procedure | 46 |
| abstract_inverted_index.efficiency | 83 |
| abstract_inverted_index.optimality | 66 |
| abstract_inverted_index.trade-offs | 115 |
| abstract_inverted_index.demonstrate | 80 |
| abstract_inverted_index.experiments | 78 |
| abstract_inverted_index.investigate | 113 |
| abstract_inverted_index.Peer-to-Peer | 8 |
| abstract_inverted_index.many-to-many | 22 |
| abstract_inverted_index.transferring | 31 |
| abstract_inverted_index.applicability | 92 |
| abstract_inverted_index.computational | 82 |
| abstract_inverted_index.decomposition | 57 |
| abstract_inverted_index.ride-matching | 10, 63, 96 |
| abstract_inverted_index.mathematically | 4 |
| abstract_inverted_index.pre-processing | 45 |
| abstract_inverted_index.reasonably-sized | 94 |
| cited_by_percentile_year.max | 96 |
| cited_by_percentile_year.min | 94 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.68233972 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |