Taxis, passengers and stable marriage-stable simultaneous assignment of taxis to passenger booking re-quests
This thesis deals with the challenge of dispatching taxis to passenger booking requests. The main contribution is the methodology which assigns and re-assigns groups of taxis to groups of passenger booking requests and reflects the interest of not just taxis but also passengers, and which produces s...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Theses and Dissertations |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/88418 http://hdl.handle.net/10220/45961 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | This thesis deals with the challenge of dispatching taxis to passenger booking requests. The main contribution is the methodology which assigns and re-assigns groups of taxis to groups of passenger booking requests and reflects the interest of not just taxis but also passengers, and which produces stable assignments. The proposed methodology is de-signed for a centralized system that assigns and re-assigns the bookings simultaneously in decision epochs in real-time. The solution to the stable marriage algorithm, originally designed for matching men and women according to their preferences, is applied to dis-patching taxis to passenger booking requests. The proposed methodology is evaluated in a custom-made taxi simulation model. The results indicate that the proposed taxi dis-patching strategies outperform a commonly used first-come, first-served dispatching strategy in a number of performance indicators (e.g. passenger waiting time and taxi distance) as well as for various combinations of advance and immediate booking requests. |
|---|