Optimum allocation method of standby taxi vehicles at taxi stands

Abstract

There are two ways for a taxi company to get customers. One is to deliver taxi for a telephone request, and the other is to get customers on street. In previous research we researched rearrangement method of the taxi drivers working hours so as to operate many taxis with many telephone requests for the former method. In this paper, we propose optimum allocation method of standby taxi vehicles at taxi stands for the latter method. In order to minimize the total mileage, fulfilling the taxi demand of all the allocation and maximum number restriction of taxi stands, we formulate this problem as Linear Programming problem. As a result of numerical calculation, there are some improving points to change the number of standby taxi vehicles at taxi stands, and it turned out that total mileage may be reducible by 30%.