A data-driven matching algorithm for ride pooling problem

DOI10.1016/j.cor.2021.105666OpenAlexW4200548705MaRDI QIDQ2669782

İsmail Sevim, M. Güray Güler, Ahmet Z. Şahin, 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 learningnonlinear bilevel programmingrank aggregationbinary programmingride matching

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ Online generalized assignment problem with historical information

Uses Software

• CPLEX
• GAMS

Cites Work

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

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