Name
Abstract | ||
|---|---|---|
In this paper, we consider the problem of finding itineraries in bus networks undermultiple independent optimization criteria, namely arrival time at destination and number of transfers. It is also allowed to walk from one stop to another if the two stops are located within a small distance. A time-dependent model is proposed to solve this problem. While focusing on the network where the size of the Pareto set in the multi-criteria shortest path problem might grow exponentially, we develop an efficient algorithm with its speed-up techniques. An evaluation on the qualities of found paths and the empirical results of different implementations are given. The results show that the allowance of walking shortcuts between nearby stops gives a better route planning. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-662-45237-0_49 | COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT, CISIM 2014 |
Keywords | Field | DocType |
Time-dependent model, shortest path problem, public transport system, bus system, labelling algorithm | Mathematical optimization,Bus network,Route planning,Shortest path problem,Simulation,Computer science,Implementation,Artificial intelligence,Machine learning,Pareto principle | Conference |
Volume | ISSN | Citations |
8838 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vo Dang Khoa | 1 | 1 | 0.36 |
| Tran Vu Pham | 2 | 40 | 7.99 |
| Nguyen Huynh Tuong | 3 | 51 | 4.60 |
| Tran Van Hoai | 4 | 9 | 3.73 |