Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic
This paper considers a ridesharing problem on how to match riders to drivers and how to choose the best routes for vehicles. Unlike the others in the literature, we are concerned with the maximization of the average loading ratio of the entire system. Moreover, we develop a flow-dependent version of...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Default Article |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/34111 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|