BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODS
This paper analyses the use of exact offline optimization methods for benchmarking online taxi dispatching strategies where the objective is to minimize the total passenger waiting time. First, a general framework for simulating dynamic transport services in MATSim (Multi-Agent Transport Simulation)...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Transport, Warsaw University of Technology
2014-06-01
|
| Series: | Archives of Transport |
| Subjects: | |
| Online Access: | http://publisherspanel.com/gicid/01.3001.0003.9666 |
| _version_ | 1818864900755161088 |
|---|---|
| author | Michał Maciejewski |
| author_facet | Michał Maciejewski |
| author_sort | Michał Maciejewski |
| collection | DOAJ |
| description | This paper analyses the use of exact offline optimization methods for benchmarking online taxi dispatching strategies where the objective is to minimize the total passenger waiting time. First, a general framework for simulating dynamic transport services in MATSim (Multi-Agent Transport Simulation) is described. Next, the model of online taxi dispatching is defined, followed by a formulation of the offline problem as a mixed integer programming problem. Three benchmarks based on the offline problem are presented and compared to two simple heuristic strategies and a hypothetical simulation with teleportation of idle taxis. The benchmarks are evaluated and compared using the simulation scenario of taxi services in the city of Mielec. The obtained (approximate) lower and upper bounds for the minimum total passenger waiting time indicate directions for further research. |
| first_indexed | 2024-12-19T10:39:00Z |
| format | Article |
| id | doaj.art-e725e79493df422b9007a762c117e0d8 |
| institution | Directory Open Access Journal |
| issn | 0866-9546 2300-8830 |
| language | English |
| last_indexed | 2024-12-19T10:39:00Z |
| publishDate | 2014-06-01 |
| publisher | Faculty of Transport, Warsaw University of Technology |
| record_format | Article |
| series | Archives of Transport |
| spelling | doaj.art-e725e79493df422b9007a762c117e0d82022-12-21T20:25:31ZengFaculty of Transport, Warsaw University of TechnologyArchives of Transport0866-95462300-88302014-06-01302657510.5604/08669546.114697801.3001.0003.9666BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODSMichał Maciejewski0TU Berlin, Faculty of Mechanical Engineering and Transport Systems, Transport Systems Planning and Transport Telematics (VSP), Berlin, Germany; Poznan University of Technology, Faculty of Machines and Transport, Division of Transport Systems, Poznan, PolandThis paper analyses the use of exact offline optimization methods for benchmarking online taxi dispatching strategies where the objective is to minimize the total passenger waiting time. First, a general framework for simulating dynamic transport services in MATSim (Multi-Agent Transport Simulation) is described. Next, the model of online taxi dispatching is defined, followed by a formulation of the offline problem as a mixed integer programming problem. Three benchmarks based on the offline problem are presented and compared to two simple heuristic strategies and a hypothetical simulation with teleportation of idle taxis. The benchmarks are evaluated and compared using the simulation scenario of taxi services in the city of Mielec. The obtained (approximate) lower and upper bounds for the minimum total passenger waiting time indicate directions for further research.http://publisherspanel.com/gicid/01.3001.0003.9666online taxi dispatchingdynamic vehicle routingmulti-agent simulationMATSim |
| spellingShingle | Michał Maciejewski BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODS Archives of Transport online taxi dispatching dynamic vehicle routing multi-agent simulation MATSim |
| title | BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODS |
| title_full | BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODS |
| title_fullStr | BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODS |
| title_full_unstemmed | BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODS |
| title_short | BENCHMARKING MINIMUM PASSENGER WAITING TIME IN ONLINE TAXI DISPATCHING WITH EXACT OFFLINE OPTIMIZATION METHODS |
| title_sort | benchmarking minimum passenger waiting time in online taxi dispatching with exact offline optimization methods |
| topic | online taxi dispatching dynamic vehicle routing multi-agent simulation MATSim |
| url | http://publisherspanel.com/gicid/01.3001.0003.9666 |
| work_keys_str_mv | AT michałmaciejewski benchmarkingminimumpassengerwaitingtimeinonlinetaxidispatchingwithexactofflineoptimizationmethods |