Dynamic transportation of patients in hospitals
暂无分享,去创建一个
Gilbert Laporte | Stefan Nickel | M. T. Melo | M. Teresa Melo | Alexandre Beaudry | G. Laporte | S. Nickel | T. Melo | A. Beaudry
[1] Horst W. Hamacher,et al. Inverse Radiation Therapy Planning: A Multiple Objective Optimisation Approach , 1999 .
[2] Maged M. Dessouky,et al. Hybrid scheduling methods for paratransit operations , 2003, Comput. Ind. Eng..
[3] Gilbert Laporte,et al. The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.
[4] G Laporte,et al. Scheduling linen deliveries in a large hospital , 1998, J. Oper. Res. Soc..
[5] Paolo Toth,et al. Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..
[6] Martin Grötschel,et al. Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride System , 1999 .
[7] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .
[8] Frank-Thomas Lentes,et al. Three-dimensional radiative heat transfer in glass cooling processes , 1998 .
[9] Nigel H. M. Wilson,et al. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .
[10] Russell Bent,et al. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2003, Comput. Oper. Res..
[11] Gilbert Laporte,et al. Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic , 2006, Transp. Sci..
[12] M. Schröder,et al. Optimization of Transfer Quality in Regional Public Transit , 2006 .
[13] Éric D. Taillard,et al. Parallel iterative search methods for vehicle routing problems , 1993, Networks.
[14] Walter Ukovich,et al. A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem , 2006, Eur. J. Oper. Res..
[15] Maged Dessouky,et al. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .
[16] Gilbert Laporte,et al. A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems , 2007, Networks.
[17] Liping Fu,et al. Scheduling dial-a-ride paratransit under time-varying, stochastic congestion , 2002 .
[18] 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..
[19] CordeauJean-François,et al. Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004 .
[20] I H Osman,et al. Meta-Heuristics Theory and Applications , 2011 .
[21] Harilaos N. Psaraftis,et al. A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .
[22] Paolo Toth,et al. Fast Local Search Algorithms for the Handicapped Persons Transportation Problem , 1996 .
[23] O. Iliev,et al. ON THE PERFORMANCE OF CERTAIN ITERATIVE SOLVERS FOR COUPLED SYSTEMS ARISING IN DISCRETIZATION OF NON-NEWTONIAN FLOW EQUATIONS , 2004 .
[24] Thomas R. Sexton,et al. Pickup and Delivery of Partial Loads with “Soft” Time Windows , 1986 .
[25] H. W. Hamacher,et al. Mathematical Modelling of Evacuation Problems: A State of Art , 2001 .
[26] Axel Klar,et al. A Hierarchy of Models for Multilane Vehicular Traffic I: Modeling , 1998, SIAM J. Appl. Math..
[27] Michel Gendreau,et al. Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries , 2006 .
[28] Alberto Colorni,et al. An effective and fast heuristic for the Dial-a-Ride problem , 2007, 4OR.
[29] A. Klar,et al. A hierarchy of models for multilane vehicular traffic PART II: Numerical and stochastic investigations , 1998 .
[30] Jacques Desrosiers. The Multiple Vehicle DIALA-RIDE Problem , .
[31] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..
[32] R M Jorgensen,et al. Solving the Dial-a-Ride problem using genetic algorithms , 2007, J. Oper. Res. Soc..
[33] H. Knaf,et al. Diagnosis aiding in Regulation Thermography using Fuzzy Logic , 2003 .
[34] Richard Philippe,et al. How Logistics Can Service Healthcare , 2004 .
[35] M. Junk,et al. The Finite-Volume-Particle Method for Conservation Laws , 2001 .
[36] Jacques Desrosiers,et al. Large Scale Multi-Vehicle Dial-a-Ride Problems , 1989 .
[37] Hokey Min,et al. A dial-a-ride problem for client transportation in a health-care organization , 2007, Comput. Oper. Res..
[38] Jean-François Cordeau,et al. A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..
[39] A. Sarishvili,et al. Blocked neural networks for knowledge extraction in the software development process , 2003 .
[40] Gilbert Laporte,et al. A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .
[41] Martin Desrochers,et al. Computer-Aided Transit Scheduling , 1992 .
[42] Axel Klar,et al. A Stochastic Model for the Fiber Lay-down Process in the Nonwoven , 2006 .
[43] Thomas Hanne,et al. Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals , 2009, Interfaces.
[44] Gopala Krishna Reddy Kakivaya,et al. INTRACTABILITY OF THE DIAL-A-RIDE PROBLEM AND A MULTIOBJECTIVE SOLUTION USING SIMULATED ANNEALING , 1998 .
[45] Gilbert Laporte,et al. Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..
[46] J. Wesley Barnes,et al. Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .
[47] Jacques Desrosiers,et al. A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .
[48] Jacques Desrosiers,et al. THE MULTIPLE VEHICLE DIAL-A-RIDE PROBLEM , 1988 .
[49] David Pisinger,et al. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..
[50] Andreas Wiegmann,et al. Explicit jump immersed interface method for virtual material design of the effective elastic moduli of composite materials , 2007, Numerical Algorithms.
[51] Gilbert Laporte,et al. Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.
[52] Michel Gendreau,et al. A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows , 1998, Oper. Res..
[53] H. Psaraftis. An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .
[54] Gilbert Laporte,et al. Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .
[55] Gilbert Laporte,et al. Waiting strategies for the dynamic pickup and delivery problem with time windows , 2004 .