A decision support system for the bimodal dial-a-ride problem
暂无分享,去创建一个
[1] Nigel H. M. Wilson,et al. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .
[2] Jacques Desrosiers,et al. A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .
[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[4] R. Prim. Shortest connection networks and some generalizations , 1957 .
[5] Jacques Desrosiers,et al. THE MULTIPLE VEHICLE DIAL-A-RIDE PROBLEM , 1988 .
[6] Chelsea C. White,et al. A heuristic search approach for solving a minimum path problem requiring arc cost determination , 1996, IEEE Trans. Syst. Man Cybern. Part A.
[7] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .
[8] Lawrence Bodin,et al. Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling , 1985, Transp. Sci..
[9] H. Psaraftis. An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .