Skip to Main content Skip to Navigation
Conference papers

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%.
Document type :
Conference papers
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/hal-01451751
Contributor : Estelle Nivault <>
Submitted on : Wednesday, February 1, 2017 - 2:15:13 PM
Last modification on : Friday, June 21, 2019 - 10:52:02 AM

File

978-3-642-41263-9_1_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Takashi Tanizaki. Optimum Allocation Method of Standby Taxi Vehicles at Taxi Stands. 20th Advances in Production Management Systems (APMS), Sep 2013, State College, PA, United States. pp.3-10, ⟨10.1007/978-3-642-41263-9_1⟩. ⟨hal-01451751⟩

Share

Metrics

Record views

122

Files downloads

556