Ride-pool assignment algorithms: swapping heuristics and efficient implementation

DOI10.1016/J.COR.2026.107464MaRDI QIDQ7255893zbMATH OpenFDO

Authors Matthew Zalesak, Hins Hu, Samitha Samaranayake

Publication date 1 June 2026

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

Full work available at URL https://doi.org/10.1016/J.COR.2026.107464

zbMATH Keywords

combinatorial optimizationlocal search heuristicsride-pooling systems

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions
• Branch-and-price: Column generation for solving huge integer programs
• Column generation for real-time ride-sharing operations
• Very large-scale neighborhood search

This page was built for publication: Ride-pool assignment algorithms: swapping heuristics and efficient implementation

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