Our latest work, titled “Solving the Equity-Aware Dial-a-Ride Problem using a Branch-Cut-and-Price Algorithm ”, has been acccepted for publication in Transportation Research Part B: Methodological.
In this study, we developed a new BPC algorithm that can be applied to solve a range of min-max DARP problem, and we demonstrate the effectiveness of the algorithm for solving equity-oriented passenegr transportation applications.
The preprint version of the journal paper can be found at the following link；
https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4725776
