A memetic algorithm for the patient transportation problem
暂无分享,去创建一个
[1] San Nah Sze,et al. Multi-trip vehicle routing and scheduling problem with time window in real life , 2012 .
[2] Gerrit K. Janssens,et al. Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots , 2014 .
[3] Richard F. Hartl,et al. Variable neighborhood search for the dial-a-ride problem , 2010, Comput. Oper. Res..
[4] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..
[5] Andrew Lim,et al. Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals , 2017, Transp. Sci..
[6] Stefan Irnich,et al. Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem , 2015, Transp. Sci..
[7] Shigenobu Kobayashi,et al. A Memetic Algorithm for the Pickup and Delivery Problem with Time Windows Using Selective Route Exchange Crossover , 2010, PPSN.
[8] Paolo Toth,et al. An Exact Algorithm for the Multitrip Vehicle Routing Problem , 2013, INFORMS J. Comput..
[9] Richard F. Hartl,et al. Dynamic programming based metaheuristics for the dial-a-ride problem , 2016, Ann. Oper. Res..
[10] Jonathan F. Bard,et al. Integrating commercial and residential pickup and delivery networks: A case study , 2013 .
[11] F. Altiparmak,et al. The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach , 2012 .
[12] Michel Gendreau,et al. A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..
[13] Brian Kallehauge,et al. The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.
[14] Maria Elena Bruni,et al. A Hybrid Greedy Randomized Adaptive Search Heuristic to Solve the Dial-a-Ride Problem , 2013, Asia Pac. J. Oper. Res..
[15] Roberto Baldacci,et al. An Exact Algorithm for the Pickup and Delivery Problem with Time Windows , 2011, Oper. Res..
[16] Saïd Salhi,et al. A multi-phase constructive heuristic for the vehicle routing problem with multiple trips , 2003, Discret. Appl. Math..
[17] Michel Gendreau,et al. A unified solution framework for multi-attribute vehicle routing problems , 2014, Eur. J. Oper. Res..
[18] R M Jorgensen,et al. Solving the Dial-a-Ride problem using genetic algorithms , 2007, J. Oper. Res. Soc..
[19] Jean-François Cordeau,et al. Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints , 2012, OR Spectr..
[20] Pablo Moscato,et al. A Modern Introduction to Memetic Algorithms , 2010 .
[21] Cassius Tadeu Scarpin,et al. Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil , 2015 .
[22] Hussain Aziz Saleh,et al. Handicapped Person Transportation: An application of the Grouping Genetic Algorithm , 2006, Eng. Appl. Artif. Intell..
[23] Yi Zhu,et al. An investigation into the vehicle routing problem with time windows and link capacity constraints , 2012 .
[24] Gilbert Laporte,et al. Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .
[25] Alfredo Olivera,et al. Adaptive memory programming for the vehicle routing problem with multiple trips , 2007, Comput. Oper. Res..
[26] Alberto Colorni,et al. An effective and fast heuristic for the Dial-a-Ride problem , 2007, 4OR.
[27] Alan Mercer,et al. The multi-trip vehicle routing problem , 1998, J. Oper. Res. Soc..
[28] R. W. Calvo,et al. A Granular Tabu Search algorithm for the Dial-a-Ride Problem , 2013 .
[29] Thibaut Vidal,et al. A memetic algorithm for the Multi Trip Vehicle Routing Problem , 2014, Eur. J. Oper. Res..
[30] Dominique Feillet,et al. A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration , 2013, 4OR.
[31] Verena Schmid,et al. Hybrid column generation and large neighborhood search for the dial-a-ride problem , 2013, Comput. Oper. Res..
[32] Daniele Vigo,et al. An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem , 2009, Comput. Oper. Res..
[33] Kerem Bülbül,et al. A SURVEY ON MULTI TRIP VEHICLE ROUTING PROBLEM , 2008 .
[34] Michel Gendreau,et al. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..
[35] Maged M. Dessouky,et al. An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..
[36] Gilbert Laporte,et al. A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .
[37] Jean-François Cordeau,et al. A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..
[38] Sophie N. Parragh. Ambulance routing problems with rich constraints and multiple objectives , 2009 .
[39] Cláudio Alves,et al. Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model , 2011, Eur. J. Oper. Res..
[40] Michel Gendreau,et al. Production , Manufacturing and Logistics An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles , 2009 .
[41] Pascal Van Hentenryck,et al. Large Neighborhood Search for Dial-a-Ride Problems , 2011, CP.
[42] Saïd Salhi,et al. A GA Based Heuristic for the Vehicle Routing Problem with Multiple Trips , 2007, J. Math. Model. Algorithms.
[43] David Pisinger,et al. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..
[44] Hokey Min,et al. A dial-a-ride problem for client transportation in a health-care organization , 2007, Comput. Oper. Res..
[45] Paolo Toth,et al. Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..
[46] Alan Mercer,et al. A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..
[47] Gilbert Laporte,et al. Dynamic transportation of patients in hospitals , 2010, OR Spectr..
[48] Andrew Lim,et al. A Metaheuristic for the Pickup and Delivery Problem with Time Windows , 2003, Int. J. Artif. Intell. Tools.
[49] Michel Gendreau,et al. Vehicle Routeing with Multiple Use of Vehicles , 1996 .
[50] John E. Beasley,et al. A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions , 2008, J. Oper. Res. Soc..
[51] Thomas Hanne,et al. Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals , 2009, Interfaces.
[52] David Pisinger,et al. Synchronized dial-a-ride transportation of disabled passengers at airports , 2013, Eur. J. Oper. Res..
[53] Martin W. P. Savelsbergh,et al. The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..
[54] Maged Dessouky,et al. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .
[55] Jean-Yves Potvin,et al. State-of-the Art Review - Evolutionary Algorithms for Vehicle Routing , 2009, INFORMS J. Comput..
[56] Michel Gendreau,et al. An exact algorithm for a single-vehicle routing problem with time windows and multiple routes , 2007, Eur. J. Oper. Res..
[57] Jean-Yves Potvin,et al. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .
[58] Ran Liu,et al. Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics , 2014 .