Flexible services for people transportation: a simulation model in a discrete events environment
暂无分享,去创建一个
Pasquale Carotenuto | Giovanni Storchi | Artem Serebriany | Giovanni Storchi | P. Carotenuto | Artem Serebriany
[1] Keiichi Uchimura,et al. The dial‐a‐ride problem in a public transit system , 1999 .
[2] H. Psaraftis. An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .
[3] Michel Gendreau,et al. A dynamic model and parallel tabu search heuristic for real-time ambulance relocation , 2001, Parallel Comput..
[4] S. Pallottino,et al. Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .
[5] Oli B. G. Madsen,et al. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..
[6] Gilbert Laporte,et al. A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..
[7] Lawrence Bodin,et al. Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling , 1985, Transp. Sci..
[8] Maged M. Dessouky,et al. Hybrid scheduling methods for paratransit operations , 2003, Comput. Ind. Eng..
[9] Harilaos N. Psaraftis,et al. A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .
[10] Jane Yung-jen Hsu,et al. Dynamic vehicle routing using hybrid genetic algorithms , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[11] Thomas R. Sexton,et al. The single vehicle many to many routing and scheduling problem , 1979 .
[12] Martin Grötschel,et al. Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride System , 1999 .
[13] Giovanni Righini,et al. Modelling and optimizing dynamical dial-a-ride problems , 2001 .
[14] R M Jorgensen,et al. Solving the Dial-a-Ride problem using genetic algorithms , 2007, J. Oper. Res. Soc..
[15] Paolo Toth,et al. Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..
[16] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..
[17] Jacques Desrosiers,et al. A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .
[18] Gilbert Laporte,et al. A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .
[19] Gilbert Laporte,et al. Ambulance location and relocation models , 2000, Eur. J. Oper. Res..
[20] Harilaos N. Psaraftis,et al. Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..
[21] Pasquale Carotenuto,et al. HYBRID GENETIC ALGORITHM TO APPROACH THE DARP IN A DEMAND RESPONSIVE PASSENGER SERVICE , 2006 .
[22] Paolo Toth,et al. Fast Local Search Algorithms for the Handicapped Persons Transportation Problem , 1996 .
[23] Chengbin Chu,et al. A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints , 2006, Eur. J. Oper. Res..
[24] I H Osman,et al. Meta-Heuristics Theory and Applications , 2011 .
[25] Hussain Aziz Saleh,et al. Handicapped Person Transportation: An application of the Grouping Genetic Algorithm , 2006, Eng. Appl. Artif. Intell..
[26] Jacques Desrosiers,et al. Technical Note - Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs , 1989, Transp. Sci..
[27] Liping Fu,et al. Scheduling dial-a-ride paratransit under time-varying, stochastic congestion , 2002 .
[28] Michael G. H. Bell,et al. Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints , 2006, Int. Trans. Oper. Res..
[29] Martin W. P. Savelsbergh,et al. The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..
[30] Jacques Desrosiers,et al. An Algorithm for Mini-Clustering in Handicapped Transport , 1991 .
[31] Maged Dessouky,et al. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .
[32] Martin W. P. Savelsbergh,et al. Efficient feasibility testing for dial-a-ride problems , 2002, Oper. Res. Lett..
[33] Gilbert Laporte,et al. Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .
[34] Alberto Colorni,et al. An effective and fast heuristic for the Dial-a-Ride problem , 2007, 4OR.
[35] Walter Ukovich,et al. A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem , 2006, Eur. J. Oper. Res..
[36] Gilbert Laporte,et al. The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.
[37] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[38] Martin W. P. Savelsbergh,et al. The General Pickup and Delivery Problem , 1995, Transp. Sci..
[39] Dusan Teodorovic,et al. A fuzzy logic approach to dynamic Dial-A-Ride problem , 2000, Fuzzy Sets Syst..
[40] G. Laporte,et al. Transportation Demand , 2019, Energy: Supply and Demand.
[41] Jacques Desrosiers,et al. Large Scale Multi-Vehicle Dial-a-Ride Problems , 1989 .
[42] Nigel H. M. Wilson,et al. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .
[43] Gilbert Laporte,et al. A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .
[44] Jean-François Cordeau,et al. A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..
[45] Jacques Desrosiers,et al. A Request Clustering Algorithm for Door-to-Door Handicapped Transportation , 1991, Transp. Sci..
[46] Hokey Min,et al. A dial-a-ride problem for client transportation in a health-care organization , 2007, Comput. Oper. Res..
[47] Gilbert Laporte,et al. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .