A data-driven matching algorithm for ride pooling problem

DOI10.1016/J.COR.2021.105666MaRDI QIDQ2669782zbMATH OpenOpenAlexFDO

Authors Ahmet Z. Şahin, İsmail Sevim, M. Güray Güler, Erinc Albey

Publication date 9 March 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2021.105666

zbMATH Keywords

machine learningrank aggregationbinary programmingnonlinear bilevel programmingride matching

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A note on solving DiDi's driver-order matching problem
• A dynamic tree algorithm for peer-to-peer ridesharing matching
• Dynamic and stochastic rematching for ridesharing systems: formulations and reductions
• Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach
• Dynamic matching for real-time ride sharing

Cites work

• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• A polyhedral branch-and-cut approach to global optimization
• A survey of network interdiction models and algorithms
• Aggregating inconsistent information: ranking and clustering
• Bilevel programming and applications
• Efficient algorithms using subiterative convergence for Kemeny ranking problem
• Optimization for dynamic ride-sharing: a review
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• Partial evaluation in rank aggregation problems
• Rank aggregation: together we're strong
• Ride solo or pool: designing price-service menus for a ride-sharing platform
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• Tackling the rank aggregation problem with evolutionary algorithms
• The dial-a-ride problem: Models and algorithms
• The share-a-ride problem: people and parcels sharing taxis

Cited in

(5)

• A note on solving DiDi's driver-order matching problem
• A dynamic tree algorithm for peer-to-peer ridesharing matching
• Event-based MILP models for ridepooling applications
• Approximate Condorcet partitioning: solving large-scale rank aggregation problems
• Online generalized assignment problem with historical information

Describes a project that uses

Uses Software

• GAMS
• CPLEX

This page was built for publication: A data-driven matching algorithm for ride pooling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669782)