Evaluation of Usability of Dial-a-Ride Systems by Social Simulation
暂无分享,去创建一个
Hideyuki Nakashima | Itsuki Noda | Kousuke Shinoda | Masayuki Ohta | Yoichiro Kumada | I. Noda | M. Ohta | H. Nakashima | K. Shinoda | Yoichiro Kumada
[1] Leen Stougie,et al. On-line single-server dial-a-ride problems , 2001, Theor. Comput. Sci..
[2] Martin Grötschel,et al. Online Optimization of Complex Transportation Systems , 2001 .
[3] L. Bianco,et al. Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming , 1994 .
[4] Mohamadreza Banihashemi,et al. HEURISTIC APPROACHES FOR SOLVING LARGE-SCALE BUS TRANSIT VEHICLE SCHEDULING PROBLEM WITH ROUTE TIME CONSTRAINTS , 2002 .
[5] Rajeev Raman,et al. Algorithms — ESA 2002 , 2002, Lecture Notes in Computer Science.
[6] Peter Bro Miltersen,et al. On Pseudorandom Generators in NC , 2001, MFCS.
[7] K. Ruland,et al. The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .
[8] Martin Grötschel,et al. Simulation Studies for the Online-Dial-a-Ride Problem , 1999 .
[9] Leen Stougie,et al. On-Line Dial-a-Ride Problems under a Restricted Information Model , 2002, ESA.
[10] P. Healy,et al. A new extension of local search applied to the Dial-A-Ride Problem , 1995 .
[11] Sven Oliver Krumke,et al. The Online Dial-a-Ride Problem under Reasonable Load , 2000, CIAC.
[12] Sven Oliver Krumke,et al. Online Dial-a-Ride Problems: Minimizing the Completion Time , 2000, STACS.
[13] Thomas D. Clark,et al. A simulation analysis of demand and fleet size effects on taxicab service rates , 1987, WSC '87.
[14] Zbigniew J. Czech. Parallel simulated annealing for the set-partitioning problem , 2000, Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing.
[15] Samuel J. Raff,et al. Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..
[16] Harilaos N. Psaraftis,et al. A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .
[17] Andrew Lim,et al. A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.
[18] Martin W. P. Savelsbergh,et al. The General Pickup and Delivery Problem , 1995, Transp. Sci..
[19] Zbigniew J. Czech. Parallel simulated annealing for the delivery problem , 2001, Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing.
[20] Leen Stougie,et al. On-Line Dial-a-Ride Problems Under a Restricted Information Model , 2004, Algorithmica.
[21] Harilaos N. Psaraftis. Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem , 1983 .
[22] Leen Stougie,et al. News from the online traveling repairman , 2003, Theor. Comput. Sci..
[23] H. Psaraftis. An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .
[24] Sven Oliver Krumke,et al. Euler is standing in line dial-a-ride problems with precedence-constraints , 2001, Discret. Appl. Math..
[25] M.E.T Horn,et al. Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems , 2002 .