Name
Abstract | ||
|---|---|---|
Taxi service is an indispensable part of public transport in modern cities. However, due to its decentralized operation mode, taxi services in many cities are inefficient. Besides, the decentralized nature also poses significant challenges to analyzing and regulating taxi services. State of the art computational methods for optimizing taxi market efficiency suffer from two important limitations: 1) they cannot be scaled up efficiently; and 2) they cannot address complex real-world market situations where additional scheduling constraints need to be handled. In this paper, we propose two novel algorithms--FLORA and FLORA-A--to address the inadequacies. Using convex polytope representation techniques, FLORA provides a fully compact representation for taxi drivers' strategy space and scales up more efficiently than existing algorithms. FLORA-A avoids enumerating the entire exponentially large pure strategy space by gradually expanding the strategy space. It is the first known method capable of handling arbitrary scheduling constraints for optimizing taxi system efficiency. Experimental results show orders of magnitude improvement in speed FLORA provides, and the necessity of using FLORA-A as suggested by changes in the taxi drivers' operation strategy under different market conditions. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.5555/2772879.2772946 | Autonomous Agents and Multi-Agent Systems |
Keywords | Field | DocType |
Taxi System, Game Theory, Optimization | Mathematical optimization,Strategy,Computer science,Scheduling (computing),Simulation,Market efficiency,Operation mode,Public transport,Convex polytope,Game theory,Scaling,Distributed computing | Conference |
Citations | PageRank | References |
4 | 0.60 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiarui Gan | 1 | 39 | 9.05 |
| Bo An | 2 | 892 | 106.05 |
| Chunyan Miao | 3 | 2307 | 195.72 |