Is dial-a-ride bus reasonable in large scale towns? Evaluation of usability of dial-a-ride systems by simulation

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3012, Issue , 2004, Pages 105-119

  Shinoda, Kousuke ^a,b   Noda, Itsuki ^a,b,c   Ohta, Masayuki ^a   Kumada, Yoichiro ^a,b   Nakashima, Hideyuki ^a,b  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BUS TRANSPORTATION; BUSES; COMPUTER SIMULATION; HIGHWAY TRAFFIC CONTROL; TRANSPORTATION ROUTES; TRAVELING SALESMAN PROBLEM; MULTI AGENT SYSTEMS; PROFITABILITY; URBAN TRANSPORTATION;

DEMANDS; PROFITABILITY; PUBLIC TRANSPORT SYSTEMS; VEHICLE ROUTING PROBLEM; BUS SYSTEMS; DIAL-A-RIDE; DIAL-A-RIDE SYSTEMS; FIXED NUMBERS; SMALL TOWNS; TRANSPORTATION SYSTEM; URBAN AREAS;

PROBLEM SOLVING; USABILITY ENGINEERING;

EID: 23144464868     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24666-4_7     Document Type: Conference Paper

References (23)

1. Krumke, S.O., de Paepe, W.E., Poensgen, D., Stougie, L.: News from the online traveling repairman. Lecture Notes in Computer Science 2136 (2001) 487-496
2. Bianco, L., Mingozzi, A., Riccaiardelli, S., Spadoni, M.: Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming. In: INFOR. Volume 32. (1994) 19-31
3. William A. Bailey, J., Thomas D. Clark, J.: A simulation analysis of demand and fleet size effects on taxicab service rates. In: Proceedings of the 19th conference on Winter simulation, ACM Press (1987) 838-844
4. Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery program. Transportation Science 29 (1995) 17-29
5. Bodin, L.D., Golden, B.L., Assad, A., Ball, M.O.: Routing and scheduling of vehicles and crews: the state of the art. Computers and Operation Research 10 (1983) 63-211
6. Ruland, K.S., Rodin, E.Y.: The pickup and delivery problem: faces and branch-and-cut algorithm. Computers Math. Applic 33 (1997) 1-13
7. Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: IEEE International Conference on Tools with Artificial Intelligence. Volume 13. (2001) 160-167
8. Healy, P., Moll, R.: A new extension of local search applied to the dial-a-ride problem. European Journal of Operations Research 83 (1995) 83-104
9. Cordeau, J.F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological (2003)
10. Silesia, Z.C.: Parallel simulated annealing for the delivery problem. In: The 9th Euromicro Workshop on Parallel and Distributed Processing. (2001) 219-226
11. Silesia, Z.C.: Parallel simulated annealing for the set-partitioning problem. In: The 8th Euromicro Workshop on Parallel and Distributed Processing. (2000) 343-350
12. Hauptmeier, D., Krumke, S.O., Rambau, J., Wirth, H.C.: Euler is standing in line dial-a-ride problems with precedence-constraints. Discrete Applied Mathematics 113 (2001) 87-107
13. Feuerstein, E., Stougie, L.: On-line single-server dial-a-ride problems. Theoretical Computer Science 268 (2001) 91-105
14. 2) heuristic for the single vehicle many-to-many euclidean dial-a-ride problem. Transportation Research 17B (1983) 133-145
15. Psarfaits, H.N.: A exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. In: Transportation Science. Volume 17. (1983) 315-357
16. Psarfaits, H.N.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. In: Transportation Science. Volume 14. (1980) 135-154
17. Grotschel, M., Hauptmeier, D., Krumke, S., Rambau, J.: Simulation studies for the online dial-a-ride-problem (1999)
18. Hauptmeier, D., Krumke, S.O., Rambau, J.: The online dial-a-ride problem under reasonable load. Lecture Notes in Computer Science 1767 (2000) 125-133
19. Ascheuer, N., Krumke, S.O., Rambau, J.: Online dial-a-ride problems: Minimizing the completion time. Lecture Notes in Computer Science 1770 (2000) 639-650
20. Grotschel, M., Krumke, S.O., Rambau, J.: Online optimization of complex transportation systems (2001)
21. Horn, M.E.T.: Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems. Transportation Research Part A: Policy and Practice 36 (2002) 167-188
22. Haghani, A., Banihashemi, M.: Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints. Transportation Research Part A: Policy and Practice 36 (2002) 309-333
23. Lipmann, M., Lu, X., de Paepe, W.E., Sitters, R.A., Stougie, L.: On-line dial-a-ride problems under a restricted information model. Lecture Notes in Computer Science 2461 (2002) 674-685