Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
暂无分享,去创建一个
[1] Gilbert Laporte,et al. Dynamic transportation of patients in hospitals , 2010, OR Spectr..
[2] Jean-François Cordeau,et al. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..
[3] Paul Shaw,et al. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.
[4] Sophie N. Parragh. Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem , 2011, Transportation research. Part C, Emerging technologies.
[5] Gong Yan-cheng. On Vehicle Routing Problems with Time Windows , 2005 .
[6] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .
[7] Claude Le Pape,et al. Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows , 2005 .
[8] Sophie N. Parragh,et al. A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .
[9] Sophie N. Parragh. Ambulance routing problems with rich constraints and multiple objectives , 2009 .
[10] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..
[11] Gilbert Laporte,et al. A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .
[12] Martin W. P. Savelsbergh,et al. The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..
[13] Jean-François Cordeau,et al. A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..
[14] Alysson M. Costa,et al. Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints , 2009, Networks.
[15] Gilbert Laporte,et al. Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..
[16] Thomas Hanne,et al. Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals , 2009, Interfaces.
[17] Zhi-Long Chen,et al. Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..
[18] Paolo Toth,et al. Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..
[19] Sophie N. Parragh,et al. A survey on pickup and delivery models Part II : Transportation between pickup and delivery locations , 2007 .
[20] Martin W. P. Savelsbergh,et al. Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..
[21] Guy Desaulniers,et al. The Shortest Path Problem with Time Windows and Linear Waiting Costs , 1997, Transp. Sci..
[22] Hokey Min,et al. A dial-a-ride problem for client transportation in a health-care organization , 2007, Comput. Oper. Res..
[23] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[24] Gilbert Laporte,et al. Static pickup and delivery problems: a classification scheme and survey , 2007 .
[25] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[26] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..
[27] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[28] Stefan Irnich. Resource extension functions: properties, inversion, and generalization to segments , 2008, OR Spectr..
[29] Xavier Gandibleux,et al. A heuristic two‐phase solution approach for the multi‐objective dial‐a‐ride problem , 2009, Networks.
[30] Fred W. Glover,et al. Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..
[31] Hussain Aziz Saleh,et al. Handicapped Person Transportation: An application of the Grouping Genetic Algorithm , 2006, Eng. Appl. Artif. Intell..
[32] Richard F. Hartl,et al. Variable neighborhood search for the dial-a-ride problem , 2010, Comput. Oper. Res..
[33] Gilbert Laporte,et al. Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.
[34] Stefan Ropke,et al. Heuristic and exact algorithms for vehicle routing problems , 2006 .