Maciejewski, Michał2018-02-082018-02-0820140866-9546https://depositonce.tu-berlin.de/handle/11303/7411http://dx.doi.org/10.14279/depositonce-6661This 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.en380 Handel, Kommunikation, Verkehronline taxi dispatchingdynamic vehicle routingmulti-agent simulationMATSimArticle2300-8830