Evaluation of usability of dial-a-ride systems by social simulation

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

Volumn 2927, Issue , 2003, Pages 167-181

  Noda, Itsuki ^a,b   Ohta, Masayuki ^a   Shinoda, Kosuke ^a,b   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)

Author keywords

[No Author keywords available]

Indexed keywords

BUSES; PROFITABILITY; URBAN TRANSPORTATION; USABILITY ENGINEERING; COMPUTER SIMULATION; HANDICAPPED PERSONS; SOCIAL ASPECTS; URBAN PLANNING;

BUS SYSTEMS; DIAL-A-RIDE; DIAL-A-RIDE SYSTEMS; FIXED NUMBERS; SMALL TOWNS; SOCIAL SIMULATIONS; TRANSPORTATION SYSTEM; URBAN AREAS; BUS ROUTES; TRAFFIC JAMS;

MULTI AGENT SYSTEMS; TRANSPORTATION;

EID: 79960013475     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24613-8_12     Document Type: Conference Paper

References (22)

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