2. Modélisation and . Fig, 5.2 Diagramme d'états-transitions d'une tournée inter-hôpitaux 5.2. MODÉLISATION DU SYSTÈME Fig

S. De-la-même-façon-que-pour-le and L. Gure, 3 présente un diagramme d'activité représentant synthétiquement le comportement de la Centrale lorsqu'une nouvelle demande arrive. A la réception d'un appel, la Centrale des Ambulanciers doit faire face à deux types de demandes

S. Du, S. , and L. Centrale, doit trouver des ambulanciers le plus rapidement possible (un ou deux) Dans ce cas, l'ambulance AR du SAMU est utilisée. S'il s'agit d'un SAMU d'un autre département (SAMU 41 par exemple), une ambulance appartenant à la Centrale est utilisée. Dans ce cas, s'il n'y a pas deux ambulanciers disponibles à la centrale

L. Comme-pour and . Samu, arbre de la gure 8.3 induit un coût pour la Centrale des Ambulanciers en plus du coût xe de fonctionnement : (0) : aucun coût supplémentaire hormis le coût du kilométrage

. Neurologiques, de plus il faut noter qu'étant donné le petit stock de linge sale qu'il possède, il doit être récolté deux fois par jours. Ophtalmologiques, linge en vrac

A. 7. La-pharmacie-a-]-r, T. L. Ahuja, J. B. Magnanti, and . Orlin, 7 La Pharmacie A.12. ANNEXES A.12 Annexes Bibliographie, Network Flows: Theory, Algorithms, and Applications, 1993.

O. I. Alsalloum and G. K. Rand, Extensions to emergency vehicle location models, Computers & Operations Research, vol.33, issue.9, p.27252743, 2006.
DOI : 10.1016/j.cor.2005.02.025

E. Angelelli and M. G. Speranza, The periodic vehicle routing problem with intermediate facilities, European Journal of Operational Research, vol.137, issue.2, p.233247, 2002.
DOI : 10.1016/S0377-2217(01)00206-5

S. Anily, The vehicle routing problem with delivery and back-haul options, Naval Research Logistics, vol.43, p.415434, 1992.

S. Anily and R. Hassin, The swapping problem, Networks, vol.117, issue.4, p.419433, 1992.
DOI : 10.1002/net.3230220408

C. Araz, H. Selim, and I. Ozkarahan, A fuzzy multi-objective covering-based vehicle location model for emergency services, Computers & Operations Research, vol.34, issue.3, pp.705-726, 2007.
DOI : 10.1016/j.cor.2005.03.021

A. Attanasio, J. F. Cordeau, G. Ghiani, and G. Laporte, Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem, Parallel Computing, vol.30, issue.3, pp.377-387, 2003.
DOI : 10.1016/j.parco.2003.12.001

V. Augusto, X. Xie, and V. Perdomo, Operating theatre scheduling with patient recovery in both operating rooms and recovery beds, Computers & Industrial Engineering, vol.58, issue.2, 2009.
DOI : 10.1016/j.cie.2009.04.019
URL : https://hal.archives-ouvertes.fr/hal-00510507

P. Badeau, M. Gendreau, F. Guertin, J. Y. Potvin, and E. Taillard, A parallel tabu search heuristic for the vehicle routing problem with time windows, Transportation Research Part C: Emerging Technologies, vol.5, issue.2, p.109122, 1997.
DOI : 10.1016/S0968-090X(97)00005-3

E. Balas, M. Fischetti, and W. R. Pulleyblank, The precedence-constrained asymmetric traveling salesman polytope, Mathematical Programming, vol.22, issue.1-3, p.241265, 1995.
DOI : 10.1007/BF01585767

M. Banerjea-brodeur, J. F. Cordeau, G. Laporte, and A. Lasry, Scheduling linen deliveries in a large hospital, Journal of the Operational Research Society, vol.49, issue.8, pp.777-780, 1998.
DOI : 10.1057/palgrave.jors.2600581

P. Bardu, Projet de n d'étude : simulation de la logistique du chru de tours, 2009.

A. Beaudry, G. Laporte, T. Melo, and S. Nickel, Dynamic transportation of patients in hospitals, OR Spectrum, vol.5, issue.1, p.131, 2008.
DOI : 10.1007/s00291-008-0135-6

J. M. Belenguer, E. Benavent, P. Lacomme, and C. Prins, Lower and upper bounds for the mixed capacitated arc routing problem, Computers & Operations Research, vol.33, issue.12, p.33633383, 2006.
DOI : 10.1016/j.cor.2005.02.009
URL : https://hal.archives-ouvertes.fr/hal-00119777

]. J. Beliën, Exact and heuristic methodologies for scheduling in hospitals: problems, formulations and algorithms, 4OR, vol.6, issue.2, 2006.
DOI : 10.1007/s10288-006-0006-4

E. Beltrami and L. Bodin, Networks and vehicle routing for municipal waste collection, Networks, vol.1, issue.1, p.568581, 1974.
DOI : 10.1002/net.3230040106

G. Berbeglia, J. F. Cordeau, I. Gribkovskaia, and G. Laporte, Static pickup and delivery problems: a??classification scheme and survey, TOP, vol.41, issue.2, p.9011059, 2007.
DOI : 10.1007/s11750-007-0009-0

G. Berbeglia, J. F. Cordeau, and G. Laporte, Dynamic pickup and delivery problems, European Journal of Operational Research, vol.202, issue.1, p.815, 2010.
DOI : 10.1016/j.ejor.2009.04.024

]. D. Boldy, The relationship between decision support systems and operational research: Health care examples, European Journal of Operational Research, vol.29, issue.2, pp.128-134, 1987.
DOI : 10.1016/0377-2217(87)90102-0

D. Boldy and P. C. O-'kane, Health operational research ??? A selective overview, European Journal of Operational Research, vol.10, issue.1, p.19, 1982.
DOI : 10.1016/0377-2217(82)90124-2

R. Borndörfer, F. Klostermeier, M. Grötschel, and C. Küttner, Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride System, 1997.
DOI : 10.1007/978-3-642-85970-0_19

S. C. Brailsford, P. R. Harper, B. Patel, and M. Pitt, An analysis of the academic literature on simulation and modelling in health care, Journal of Simulation, vol.32, issue.9, pp.130-140, 2009.
DOI : 10.1057/jors.1981.161

O. Bräysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms, Transportation Science, vol.39, issue.1, p.104118, 2005.
DOI : 10.1287/trsc.1030.0056

O. Bräysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part II: Metaheuristics, Transportation Science, vol.39, issue.1, p.119139, 2005.
DOI : 10.1287/trsc.1030.0057

E. K. Burke, P. De-causmaecker, G. V. Berghe, and H. V. Landeghem, The State of the Art of Nurse Rostering, Journal of Scheduling, vol.7, issue.6, p.10946136, 2004.
DOI : 10.1023/B:JOSH.0000046076.75950.0b

E. K. Burke, J. Li, and R. Qu, The nurse rostering problem: a critical appraisal of the problem structure, European Journal of Operational Research, vol.202, p.379389, 2010.

B. Cardoen and E. Demeulemeester, Capacity of Clinical Pathways???A Strategic Multi-level Evaluation Tool, Journal of Medical Systems, vol.6, issue.6, p.443452, 2010.
DOI : 10.1007/s10916-008-9150-z

B. Cardoen, E. Demeulemeester, and J. Beliën, Operating room planning and scheduling: A literature review, European Journal of Operational Research, vol.201, issue.3, pp.921-932, 2010.
DOI : 10.1016/j.ejor.2009.04.011

M. Carter, Health care: mismanagement of resources, ORMS Today, vol.19, p.2632, 2002.

M. Chabrol, D. Gallot, M. Gourgand, and S. Rodier, Health care: mismanagement of resources, Communications in Computer and Information Science, vol.14, p.5968, 2008.

]. S. Chahed, E. Marcon, E. Sahin, D. Feillet, and Y. Dallery, Exploring new operational research opportunities within the home care context : the chemotherapy at home. Health Care Management, BIBLIOGRAPHIE, vol.12, p.179191, 2009.
URL : https://hal.archives-ouvertes.fr/emse-00429472

N. Christodes, The optimum traversal of a graph, Omega, vol.1, p.719732, 1973.

N. Christodes, V. Campos, A. Corberán, and E. Mota, An algorithm for the Rural Postman problem on a directed graph, Mathematical Programming Study, vol.26, pp.155-166, 1986.
DOI : 10.1007/BFb0121091

F. Chu, N. Labadi, and C. Prins, A Scatter Search for the periodic capacitated arc routing problem, European Journal of Operational Research, vol.169, issue.2, p.586605, 2006.
DOI : 10.1016/j.ejor.2004.08.017

A. Coja-oghlan, S. O. Krumkeb, and T. Nierho, A heuristic for the Stacker Crane Problem on trees which is almost surely exact, Journal of Algorithms, vol.61, issue.1, p.119, 2006.
DOI : 10.1016/j.jalgor.2004.07.007

D. Conforti, F. Guerriero, and R. Guido, Non-block scheduling with priority for radiotherapy treatments, European Journal of Operational Research, vol.201, issue.1, p.289296, 2010.
DOI : 10.1016/j.ejor.2009.02.016

A. Corberán, R. Marti, E. Martinez, and D. Soler, The Rural Postman Problem on mixed graphs with turn penalties, Computers & Operations Research, vol.29, issue.7, p.887903, 2002.
DOI : 10.1016/S0305-0548(00)00091-5

A. Corberán, R. Marti, and A. Romero, Heuristics for the Mixed Rural Postman Problem, Computers & Operations Research, vol.27, issue.2, p.183203, 2000.
DOI : 10.1016/S0305-0548(99)00031-3

A. Corberán, A. Romero, and J. M. Sanchis, The general routing problem on a mixed graph, 1999.

J. F. Cordeau, A Branch-and-Cut Algorithm for the Dial-a-Ride Problem, Operations Research, vol.54, issue.3, p.573586, 2006.
DOI : 10.1287/opre.1060.0283

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, vol.37, issue.6, p.579594, 2003.
DOI : 10.1016/S0191-2615(02)00045-0

J. F. Cordeau and G. Laporte, The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol.174, issue.1, p.2946, 2007.
DOI : 10.1007/s10479-007-0170-8

J. F. Cordeau, M. Gendreau, and G. Laporte, A tabu search heuristic for periodic and multi???depot vehicle routing problems, Networks, vol.30, issue.2, p.105119, 1998.
DOI : 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.3.CO;2-N

L. Coslovich, R. Pesenti, and W. Ukovich, A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem, European Journal of Operational Research, vol.175, issue.3, p.16051615, 2005.
DOI : 10.1016/j.ejor.2005.02.038

T. G. Crainic and G. Laporte, Planning models for freight transportation, European Journal of Operational Research, vol.97, issue.3, p.409438, 1997.
DOI : 10.1016/S0377-2217(96)00298-6

T. G. Crainic, M. Toulouse, and M. Gendreau, Towards a taxonomy of parallel tabu search algorithms, INFORMS Journal on Computing, vol.9, p.6172, 1997.

C. Cubillos, N. Rodriguez, and B. Crawford, A Study on Genetic Algorithms for the DARP Problem, IWINAC, p.498507, 2007.
DOI : 10.1007/978-3-540-73053-8_50

G. B. Dantzig, R. Fulkerson, and S. Johnson, Solution of a Large-Scale Traveling-Salesman Problem, Journal of the Operations Research Society of America, vol.2, issue.4, pp.393-410, 1954.
DOI : 10.1287/opre.2.4.393

G. B. Dantzig, J. H. Ramser, and S. Johnson, The Truck Dispatching Problem, Management Science, vol.6, issue.1, p.8091, 1959.
DOI : 10.1287/mnsc.6.1.80

S. Datta, Applications of O.R. in health in developing countries: A review, Social Science & Medicine, vol.37, issue.12, p.14411450, 1993.
DOI : 10.1016/0277-9536(93)90178-7

J. B. De-kort, Upper and Lower Bounds for the Symmetric 2-Peripatetic Salesman Problem, Optimization, vol.23, p.357367, 1992.
DOI : 10.1007/978-3-642-77254-2_34

I. Deif and L. Bodin, Extension of the clarke and wright algorithm for solving the vehicle routing problem with backhauling, Proceedings of the Babson conference on software uses in transportation and logistic management, p.7596, 1984.

P. Demeester, W. Souriau, P. De-causmaecker, and G. V. Berghe, A hybrid tabu search algorithm for automatically assigning patients to beds, Artificial Intelligence in Medicine, vol.48, issue.1, 2009.
DOI : 10.1016/j.artmed.2009.09.001

G. Desaulniers, J. Desrosiers, A. Erdmann, M. M. Solomon, and F. Soumis, 9. VRP with Pickup and Delivery, The vehicle routing problem , SIAM Monographs on Discrete Mathematics and Applications, p.225242, 2002.
DOI : 10.1137/1.9780898718515.ch9

J. Desrosiers, Y. Dumas, F. Soumis, S. Taillefer, and D. Villeneuve, An algorithm for mini-clustering in handicapped transport, pp.91-93, 1991.

K. F. Doerner and R. F. Hartl, Vehicle Routing: Latest Advances and Challenges, chapter Health Care Logistics, Emergency Preparedness, and Disaster Relief : New Challenges for Routing Problems with a Focus on the Austrian Situation, p.527

M. Dror and M. Haouari, Generalized steiner problems and other variants, Journal of Combinatorial Optimization, vol.4, p.415436, 2000.

M. Dror and A. Langevin, A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem, Transportation Science, vol.31, issue.2, p.187192, 1997.
DOI : 10.1287/trsc.31.2.187

M. Dror, H. Stern, and P. Trudeau, Postman tour on a graph with precedence relation on arcs, Networks, vol.6, issue.3, p.283294, 1987.
DOI : 10.1002/net.3230170304

M. Dror and P. Trudeau, Savings by Split Delivery Routing, Transportation Science, vol.23, issue.2, p.141145, 1989.
DOI : 10.1287/trsc.23.2.141

M. Dror and P. Trudeau, Split delivery routing, Naval Research Logistics (NRL), vol.11, issue.1, pp.383-402, 1990.
DOI : 10.1002/nav.3800370304

Y. Dumas, J. Desrosiers, and F. Soumis, Large scale multi-vehicle dial-a-ride problems, 1989.

]. Y. Dumas, J. Desrosiers, and F. Soumis, The pickup and delivery problem with time windows, European Journal of Operational Research, vol.54, issue.1, p.722, 1991.
DOI : 10.1016/0377-2217(91)90319-Q

J. Edmonds and E. L. Johnson, Matching, Euler tours and the Chinese postman, Mathematical Programming, p.88124, 1973.
DOI : 10.1007/BF01580113

H. Fei, N. Meskens, and C. Chu, A planning and scheduling problem for an operating theatre using an open scheduling strategy, Computers & Industrial Engineering, vol.58, issue.2, 2009.
DOI : 10.1016/j.cie.2009.02.012

D. Feillet, P. Dejax, and M. Gendreau, Traveling salesman problems with prots, Transportation science, vol.39, p.188205, 2005.

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, Vehicle routing with time windows and split deliveries, Proceedings of Odysseus 2003, 2003.

C. Fiegl and C. Pontow, Online scheduling of pick-up and delivery tasks in hospitals, Journal of Biomedical Informatics, vol.42, issue.4, p.624632, 2009.
DOI : 10.1016/j.jbi.2009.02.003

M. Fischetti, S. Martello, and P. Toth, The xed job schedule problem with spreadtime constraints, Operations Research, vol.35, p.849858, 1987.

G. Fleury, P. Lacomme, and A. Tanguy, Simulation à événements discrets : Modèles déterministes et stochastiques ; Exemples d'applications implémentées en Delphi et en C++, Eyrolles, 2006.

D. C. Florez, S. Aguirre, C. A. Amaya, and N. Velasco, Optimization of the laundry service in a public hospital in bogotá d.c., colombia : A case of vehicle routing with split delivery. Systems and Information Engineering Design Symposium, p.2525, 2008.

R. Floyd, Algorithm 97: Shortest path, Communications of the ACM, vol.5, issue.6, p.345, 1962.
DOI : 10.1145/367766.368168

P. Féniès, M. Gourgand, and S. Rodier, Interoperable and multi-ow software environment : Application to health care supply chain, Lecture Notes in Computer Science, vol.4103, p.311322, 2005.

G. N. Frederickson, M. S. Hecht, and C. E. Kim, Approximation algorithms for some routing problems, SIAM Journal on Computing, vol.7, p.178193, 1978.

B. E. Fries, Bibliography of Operations Research in Health-Care Systems, Operations Research, vol.24, issue.5, p.801804, 1976.
DOI : 10.1287/opre.24.5.801

P. W. Frizzell and J. W. Gin, The split delivery vehicle scheduling problem with time windows and grid network distances, Computers & Operations Research, vol.22, issue.6, p.655667, 1995.
DOI : 10.1016/0305-0548(94)00040-F

V. Gascon and P. Michelon, Scheduling the carriers of a hospital delivery service, Socio-Economic Planning Sciences, vol.31, issue.1, p.5767, 1997.
DOI : 10.1016/S0038-0121(96)00019-5

M. Gendreau, F. Guertin, J. Y. Potvin, and R. Séguin, Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries, Transportation Research Part C: Emerging Technologies, vol.14, issue.3, p.157174, 2006.
DOI : 10.1016/j.trc.2006.03.002

M. Gendreau, F. Guertin, J. Y. Potvin, and E. Taillard, Parallel tabu search for realtime vehicle routing and dispatching, Transportation Science, vol.33, p.381390, 1999.

M. Gendreau, A. Hertz, and G. Laporte, The Traveling Salesman Problem with Backhauls, Computers & Operations Research, vol.23, issue.5, p.501508, 1996.
DOI : 10.1016/0305-0548(95)00036-4

M. Gendreau, G. Laporte, and F. Semet, A branch-and-cut algorithm for the undirected selective traveling salesman problem, BIBLIOGRAPHIE Networks, vol.32, p.263273, 1998.

M. Gendreau, G. Laporte, and R. Séguin, Stochastic vehicle routing, European Journal of Operational Research, vol.88, issue.1, p.312, 1996.
DOI : 10.1016/0377-2217(95)00050-X

G. Ghiani, F. Guerriero, G. Laporte, and R. Musmanno, Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies, European Journal of Operational Research, vol.151, issue.1, p.111, 2003.
DOI : 10.1016/S0377-2217(02)00915-3

C. A. Glass and R. A. Knight, The nurse rostering problem: A critical appraisal of the problem structure, European Journal of Operational Research, vol.202, issue.2, p.379389, 2010.
DOI : 10.1016/j.ejor.2009.05.046

F. Glover, Future paths for integer programming and links to articial intelligence, Computers and Operations Research, vol.13, pp.55-533549, 1986.

D. E. Goldberg, Genetic algorithms in search, optimization, and machine learning, 1989.

B. L. Golden and R. T. Wong, Capacitated arc routing problems. Networks, pp.305-315, 1981.
DOI : 10.1002/net.3230110308

R. Graham, E. Lawler, J. Lenstra, and A. R. Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, vol.5, p.287326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

M. Guan, Graphic programming using odd and even points, Chinese Mathematics, vol.1, p.273277, 1962.

G. Gutin and P. Abraham, The Traveling Salesman Problem and Its Variation, 2007.
DOI : 10.1007/b101971

T. Hannes, T. Melo, and S. Nickel, Bringing robustness to patient ow management through optimized patient transports in hospitals, Interfaces, vol.39, p.241255, 2009.

P. Hansen, The steepest ascent mildest descent heuristic for combinatorial programming, Congress on Numerical Methods in Combinatorial Optimization, Capri, 1986.

J. M. Harrold and R. S. Parker, Clinically relevant cancer chemotherapy dose schedulingnext term via mixed-integer optimization, Computers & Chemical Engineering, vol.33, p.20422054, 2009.
DOI : 10.1016/j.compchemeng.2009.06.005

H. Hernández-pérez and J. J. Salazar-gonzález, The one-commodity pickup-anddelivery travelling salesman problem. Combinatorial optimization -Eureka, you shrink !, p.89104, 2003.

S. C. Ho and D. Haugland, A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Computers & Operations Research, vol.31, issue.12, 2004.
DOI : 10.1016/S0305-0548(03)00155-2

J. H. Holland, Adaptation in natural and artical systems. The university of, 1975.

B. L. Hollis, M. A. Forbes, and B. E. Douglas, Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post, European Journal of Operational Research, vol.173, issue.1, p.133150, 2006.
DOI : 10.1016/j.ejor.2005.01.005

M. Horn, Fleet scheduling and dispatching for demand-responsive passenger services, Transportation Research Part C: Emerging Technologies, vol.10, issue.1, p.3563, 2002.
DOI : 10.1016/S0968-090X(01)00003-1

S. Ichoua, M. Gendreau, and J. Y. Potvin, Diversion Issues in Real-Time Vehicle Dispatching, Transportation Science, vol.34, issue.4, p.426438, 2000.
DOI : 10.1287/trsc.34.4.426.12325

I. Ioachim, J. Desrosiers, Y. Dumas, and M. M. Solomon, A Request Clustering Algorithm for Door-to-Door Handicapped Transportation, Transportation Science, vol.29, issue.1, p.6378, 1995.
DOI : 10.1287/trsc.29.1.63

S. H. Jacobson, S. N. Hall, and J. R. Swisher, Patient Flow : Reducing Delay in Healthcare Delivery, International Series in Operations Research and Management Science, chapter Discrete-event simulation of health care systems, p.211252, 2006.

J. J. Jaw, A. R. Odoni, H. N. Psaraftis, and N. H. Wilson, A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows, Transportation Research Part B: Methodological, vol.20, issue.3, p.243257, 2003.
DOI : 10.1016/0191-2615(86)90020-2

D. S. Johnson and C. H. Papadimitriou, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, chapter Computational complexity

K. Jongens and T. Volgenant, The symmetric clustered traveling salesman problem, European Journal of Operational Research, vol.19, issue.1, p.6875, 1985.
DOI : 10.1016/0377-2217(85)90309-1

J. B. Jun, S. H. Jacobson, and J. R. Swishe, Application of discrete-event simulation in health care clinics: A survey, Journal of the Operational Research Society, vol.50, issue.2, p.109123, 1999.
DOI : 10.1057/palgrave.jors.2600669

I. Kara and T. Bektas, Integer linear programming formulations of multiple salesman problems and its variations, European Journal of Operational Research, vol.174, issue.3, pp.1449-1458, 2006.
DOI : 10.1016/j.ejor.2005.03.008

Y. Kergosien, C. Lenté, and J. C. Billaut, A dynamic transportation problem of patients between care units, 4th International Conference on Operational Research Applied to Health Services (ORAHS'2008) 28 Juillet -1er Aout, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01025623

Y. Kergosien, C. Lenté, and J. C. Billaut, Planication de transports de patients entre unités de soin, Gestion et Engénierie des Systèmes Hospitaliers (GISEH'08), pp.551-558, 2008.

Y. Kergosien, C. Lenté, and J. C. Billaut, A tabu search algorithm for solving a transportation problem of patients between care units In International Workshop on Scheduling in Healthcare systems (SCHEALS'08, Proceedings of the 1st International Conference on Applied Operational Research, pp.18-31, 2008.

Y. Kergosien, C. Lenté, and J. C. Billaut, A genetic algorithm and a simulation tool for the design of hospital material ows, 35th International Conference on Operational Research Applied to Health Services (ORAHS'2009), pp.12-17, 2009.

Y. Kergosien, C. Lenté, and J. C. Billaut, Home health care problem : An extended multiple traveling salesman problem, 4th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA'09), pp.10-12
URL : https://hal.archives-ouvertes.fr/hal-01025660

Y. Kergosien, C. Lenté, and J. C. Billaut, Management of material ows within a hospital : a two interconnected vehicle routing problem, Joint International Meeting of the Canadian Operational Research Society and the Institute for Operations Research & the Management Sciences (CORS-INFORMS'09), pp.90-104, 2009.

Y. Kergosien, C. Lenté, and J. C. Billaut, Planication de ux logistiques hospitaliers , dimensionnement d'équipes de manutention et synchronisation de tournées, Workshop International : Logistique et Transport (LT'09) mars, pp.22-24, 2009.

Y. Kergosien, C. Lenté, and J. C. Billaut, Problème de tournée de personnel de soin pour l'hospitalisation à domicile, 10ème congrès de la Société de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'09) février, pp.10-12, 2009.

Y. Kergosien, C. Lenté, and J. C. Billaut, A memetic algorithm for the design of hospital material ows, 36th International Conference on Operational Research Applied to Health Services (ORAHS'2010), Soumission en cours, pp.18-23, 2010.

Y. Kergosien, C. Lenté, and J. C. Billaut, Planication de ux logistiques hospitaliers, dimensionnement d'équipes de manutention et synchronisation de tournées, 8ème Conférence Internationale de Modélisation et Simulation (MOSIM'10), pp.10-12, 2010.

Y. Kergosien, C. Lenté, and J. C. Billaut, Problème dynamique de transport de patients, 11ème congrès de la Société de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'10), pp.24-26, 2010.

Y. Kergosien, C. Lenté, and J. C. Billaut, A tabu search heuristic for the dynamic transportation of patients between care units, European Journal of Operational Research, vol.214, issue.2, 2010.
DOI : 10.1016/j.ejor.2011.04.033
URL : https://hal.archives-ouvertes.fr/hal-00638250

Y. Kergosien, C. Lenté, and J. C. Billaut, A tabu search heuristic for the design of hospital material ows, 12th International Workshop on Project Management and Scheduling (PMS'10), pp.26-28, 2010.

G. Kiechle, K. F. Doerner, M. Gendreau, and R. F. Hartl, Waiting Strategies for Regular and Emergency Patient Transportation, Operations Research Proceedings, vol.6, p.271276, 2008.
DOI : 10.1007/978-3-642-00142-0_44

K. King and J. Muckstadt, Evaluating planned capacities for public health emergency supply chain models, 2009.

P. Lacomme, C. Prins, and W. Ramdane-chérif, Evolutionary algorithms for periodic arc routing problems, European Journal of Operational Research, vol.165, issue.2, p.535553, 2005.
DOI : 10.1016/j.ejor.2004.04.021
URL : https://hal.archives-ouvertes.fr/inria-00104119

S. Landry and R. Philippe, How logistics can service healthcare, Supply Chain Forum, vol.5, p.2430, 2004.

S. D. Lapierre and A. B. Ruiz, Scheduling logistic activities to improve hospital supply systems, Computers & Operations Research, vol.34, issue.3, p.624641, 2007.
DOI : 10.1016/j.cor.2005.03.017

G. Laporte, The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research, vol.59, issue.3, p.345358, 1992.
DOI : 10.1016/0377-2217(92)90192-C

G. Laporte, Modeling and solving several classes of arc routing problems as traveling salesman problems, Computers & Operations Research, vol.24, issue.11, p.10571061, 1997.
DOI : 10.1016/S0305-0548(97)00013-0

G. Laporte, What you should know about the vehicle routing problem, Naval Research Logistics, vol.45, issue.8, p.811819, 2007.
DOI : 10.1002/nav.20261

A. Larsen, The dynamic vehicle routing problem, 2001.

A. M. Law and W. D. Kelton, Simulation Modeling and Analysis, 1997.

J. K. Lenstra and A. H. Rinnooy-kan, On general routing problems, Networks, vol.36, issue.3, p.273280, 1976.
DOI : 10.1002/net.3230060305

A. N. Letchford and R. W. Eglese, The rural postman problem with deadline classes, European Journal of Operational Research, vol.105, issue.3, p.390400, 1998.
DOI : 10.1016/S0377-2217(97)00090-8

L. X. Li and W. C. Benton, Performance measurement criteria in health care organizations: Review and future research directions, European Journal of Operational Research, vol.93, issue.3, p.449468, 1996.
DOI : 10.1016/0377-2217(95)00375-4

M. J. Liberatore and R. L. Nydick, The analytic hierarchy process in medical and health care decision making: A literature review, European Journal of Operational Research, vol.189, issue.1, 2008.
DOI : 10.1016/j.ejor.2007.05.001

Y. Luo and P. Schonfeld, A rejected-reinsertion heuristic for the static Dial-A-Ride Problem, Transportation Research Part B: Methodological, vol.41, issue.7, p.736755, 2007.
DOI : 10.1016/j.trb.2007.02.003

O. B. Madsen, H. F. Ravn, and J. M. Rygaard, A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Annals of Operations Research, vol.12, issue.1, 1995.
DOI : 10.1007/BF02031946

E. Marcon, S. Kharraja, N. Smolski, B. Luquet, and J. P. Viale, Determining the Number of Beds in the Postanesthesia Care Unit: A Computer Simulation Flow Approach, Anesthesia & Analgesia, vol.96, p.14151423, 2003.
DOI : 10.1213/01.ANE.0000056701.08350.B9

E. Melachrinoudis, A. B. Ilhan, and H. Min, A dial-a-ride problem for client transportation in a health-care organization, Computers & Operations Research, vol.34, issue.3, p.742759, 2007.
DOI : 10.1016/j.cor.2005.03.024

J. E. Mendoza, B. Castanier, C. Guéret, A. L. Medaglia, and N. Velasco, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, Computers & Operations Research, vol.37, issue.11
DOI : 10.1016/j.cor.2009.06.015
URL : https://hal.archives-ouvertes.fr/hal-00408729

C. E. Miller, A. W. Tucker, and R. A. Zemlin, Integer programming formulation of travelling salesman problems, Journal of the ACM, vol.7, p.326329, 1960.

D. Min and Y. Yih, An elective surgery scheduling problem considering patient priority, Computers & Operations Research, vol.37, issue.6, p.10911099, 2010.
DOI : 10.1016/j.cor.2009.09.016

E. Minieka, The Chinese Postman Problem for Mixed Networks, Management Science, vol.25, issue.7, p.643648, 1979.
DOI : 10.1287/mnsc.25.7.643

S. Mitrovi¢-mini¢ and R. Krishnamurti, The multiple TSP with time windows: vehicle bounds based on precedence graphs, Operations Research Letters, vol.34, issue.1, p.111120, 2006.
DOI : 10.1016/j.orl.2005.01.009

S. Mitrovi¢-mini¢ and G. Laporte, The Pickup And Delivery Problem With Time Windows And Transshipment, INFOR: Information Systems and Operational Research, vol.44, issue.3, p.217227, 2006.
DOI : 10.1080/03155986.2006.11732749

P. Moscato, Memetic algorithms : a short introduction, New Ideas in Optimization, p.219234, 1999.

G. Mosheiov, The traveling salesman problem with pick-up and delivery, European Journal of Operational Research, vol.79, p.299310, 1994.

P. A. Mullaseril, M. Dror, and J. Leung, Split-delivery routeing heuristics in livestock feed distribution, Operational Research Society, vol.48, p.107116, 1997.

C. E. Noon, The Generalized Traveling Salesman Problem, 1988.

C. E. Noon and J. C. Bean, An ecient transformation of the generalized traveling salesman problem, INFOR, vol.31, p.3944, 1993.

J. P. Oddoye, D. F. Jones, M. Tamiz, and P. Schmidt, Combining simulation and goal programming for healthcare planning in a medical assessment unit, European Journal of Operational Research, vol.193, issue.1, p.250261, 2009.
DOI : 10.1016/j.ejor.2007.10.029

C. S. Orlo, A fundamental problem in vehicle routing. Networks, p.3564, 1974.

C. H. Papadimitriou, On the complexity of edge traversing, Journal of the ACM, vol.23, issue.3, p.544554, 1976.
DOI : 10.1145/321958.321974

S. Parragh, K. Doerner, and R. Hartl, A survey on pickup and delivery problems : Part 1 : Transportation between customers and depot and part 2 : Transportation between pickup and delivery locations, Journal für Betriebswirtschaft, vol.58, p.81117, 2008.

W. L. Pearn, Solvable cases of the k-person Chinese postman problem, Operations Research Letters, vol.16, issue.4, p.241244, 1994.
DOI : 10.1016/0167-6377(94)90073-6

M. C. Pedroso and D. Nakano, Knowledge and information ows in supply chains: a study on pharmaceutical companies, International Journal of Production Economics, vol.122, p.376384, 2009.

M. Persson and J. A. Persson, Health economic modeling to support surgery management at a Swedish hospital, Omega, vol.37, issue.4, p.853863, 2009.
DOI : 10.1016/j.omega.2008.05.007

C. Prins, C. Prodhon, and R. W. Calvo, A memetic algorithm with population management (ma|pm) for the capacitated location-routing problem, Evolutionary Computation in Combinatorial Optimization, p.183194, 2006.

H. N. Psaraftis, A dynamic programming approach to the single-vehicle, many-tomany immediate request dial-a-ride problem, Transportation Science, vol.14, p.130154, 1980.

J. Puente, A. Gòmez, I. Fernàndez, and P. Priore, Medical doctor rostering problem in a hospital emergency department by means of genetic algorithms, Computers & Industrial Engineering, vol.56, issue.4, p.12321242, 2009.
DOI : 10.1016/j.cie.2008.07.016

H. K. Rajagopalan, C. Saydam, and J. Xiao, A multiperiod set covering location model for dynamic redeployment of ambulances, Computers & Operations Research, vol.35, issue.3, p.814826, 2008.
DOI : 10.1016/j.cor.2006.04.003

M. R. Rao, A note on the multiple traveling salesman problem, Operations Research, vol.28, p.628632, 1980.

B. Rekiek, A. Delchambre, and H. A. Saleh, Handicapped Person Transportation: An application of the Grouping Genetic Algorithm, Engineering Applications of Artificial Intelligence, vol.19, issue.5, p.511520, 2006.
DOI : 10.1016/j.engappai.2005.12.013

G. Righini and M. Trubian, Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems, Discrete Applied Mathematics, vol.91, issue.1-3, p.235242, 1999.
DOI : 10.1016/S0166-218X(98)00104-8

B. Roland, C. Di-martinelly, F. Riane, and Y. Pochet, Scheduling an operating theatre under human resource constraints, Computers & Industrial Engineering, vol.58, issue.2, 2009.
DOI : 10.1016/j.cie.2009.01.005
URL : https://hal.archives-ouvertes.fr/hal-00787093

A. Romero, On Mixed Rural Postman Problem (in spanish), 1997.

S. Ropke, J. Cordeau, and G. Laporte, Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks, vol.46, issue.4, p.258272, 2007.
DOI : 10.1002/net.20177

J. Rosenhead, Operational research in health services planning, European Journal of Operational Research, vol.2, issue.2, p.7585, 1978.
DOI : 10.1016/0377-2217(78)90103-0

R. W. Hall, Patient Flow : Reducing Delay in Healthcare Delivery, 2006.
DOI : 10.1007/978-0-387-33636-7

M. W. Savelsbergh, Local search in routing problems with time windows, Annals of Operations Research, vol.1, issue.1, p.285305, 1985.
DOI : 10.1007/BF02022044

M. W. Savelsbergh, The Vehicle Routing Problem with Time Windows: Minimizing Route Duration, ORSA Journal on Computing, vol.4, issue.2, p.146154, 1992.
DOI : 10.1287/ijoc.4.2.146

J. S. Shang and K. C. Carolyn, Multicriteria pickup and delivery problem with transfer opportunity, Computers & Industrial Engineering, vol.30, issue.4, p.631645, 1996.
DOI : 10.1016/0360-8352(95)00181-6

H. M. Sheng, J. C. Wang, H. H. Huang, and D. C. Yen, Fuzzy measure on vehicle routing problem of hospital materials, Expert Systems with Applications, vol.30, issue.2, p.367377, 2006.
DOI : 10.1016/j.eswa.2005.07.028

L. H. Shih and H. C. Chang, A routing and scheduling system for infectious waste collection, Environmental Modeling and Assessment, vol.6, p.261269, 2004.

K. K. Sinha and E. J. Kohnke, Health Care Supply Chain Design: Toward Linking the Development and Delivery of Care Globally, Decision Sciences, vol.354, issue.7, 2009.
DOI : 10.1111/j.1540-5915.2009.00229.x

M. M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, vol.35, issue.2, p.254265, 1987.
DOI : 10.1287/opre.35.2.254

M. M. Solomon and J. Desrosiers, Time window constrained routing and scheduling problems, Transportation Science, vol.22, p.113, 1988.

K. Sorensen and M. Sevaux, MAPM: memetic algorithms with population management, Computers & Operations Research, vol.33, issue.5, p.12141225, 2004.
DOI : 10.1016/j.cor.2004.09.011
URL : https://hal.archives-ouvertes.fr/hal-00069401

D. Stein, An Asymptotic, Probabilistic Analysis of a Routing Problem, Mathematics of Operations Research, vol.3, issue.2, p.89101, 1978.
DOI : 10.1287/moor.3.2.89

R. E. Steuer, Multiple criteria optimization : theory, computation and application

J. A. Svetska and V. E. Huckfeldt, Computational experience with an m-salesman travelling salesman algorithm, Management Science, vol.19, p.790799, 1973.

E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J. Y. Potvin, A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows, Transportation Science, vol.31, issue.2, p.170186, 1997.
DOI : 10.1287/trsc.31.2.170

K. C. Tan, Y. H. Chew, and L. H. Lee, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, European Journal of Operational Research, vol.172, issue.3, p.855885, 2006.
DOI : 10.1016/j.ejor.2004.11.019

D. Teodorovic and G. Radivojevic, A fuzzy logic approach to dynamic dial-a-ride problem. Fuzzy Sets and Systems, p.2333, 1998.

B. Tolga, The multiple traveling salesman problem : an overview of formulations and solution procedures, Omega, vol.34, p.209219, 2006.

S. Topaloglu, A shift scheduling model for employees with dierent seniority levels and an application in healthcare, European Journal of Operational Research, vol.198, p.943957, 2009.

P. Toth and D. Vigo, The vehicle routing problem. SIAM Monographs on discrete mathematics and applications, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01223571

A. Touet, Projet de n d'étude : simulation de transports de patients au samu et à la centrale des ambulanciers, 2009.

J. F. Tournamille, C. Bousquet, R. Respaud, V. Andre, P. Jaulin et al., Outil de traçabilité complet d'une unité de préparation de chimiothérapies anticancereuses. développement et plus-value pharmaceutique, 7èmes Journées de la Société Française de Pharmacie Oncologique (SFPO'09), Mandelieu, pp.15-16, 2009.

X. Wang and A. C. Regan, Local truckload pickup and delivery with hard time window constraints, Transportation Research Part B: Methodological, vol.36, issue.2, p.97112, 2002.
DOI : 10.1016/S0965-8564(00)00037-9

V. C. Wiers, A review of the applicability of OR and AI scheduling techniques in practice, Omega, vol.25, issue.2, p.145153, 1997.
DOI : 10.1016/S0305-0483(96)00050-3

K. I. Wong and M. G. Bell, Solution of the dial-a-ride problem with multidimensional capacity constraints, International Transactions in Operational Research, vol.13, 2006.

Z. Xiang, C. Chu, and H. Chen, A fast heuristic for solving a large-scale static dial-aride problem under complex constraints, European Journal of Operational Research, vol.174, p.11171139, 2006.

Z. Xiang, C. Chu, and H. Chen, The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments, European Journal of Operational Research, vol.185, issue.2, p.534551, 2007.
DOI : 10.1016/j.ejor.2007.01.007

F. M. Yang and H. J. Xiao, Models and algorithms for vehicle routing problem with transshipment centers. Systems Engineering -Theory & Practice, p.2835, 2007.

G. Zäpfel and M. Bögl, Multi-period vehicle routing and crew scheduling with outsourcing options, International Journal of Production Economics, vol.113, issue.2, p.980996, 2008.
DOI : 10.1016/j.ijpe.2007.11.011

L. Zhang, Polynomial algorithms for the k-chinese postman problem, p.430435, 1992.

Q. H. Zhao, S. Y. Wang, K. K. Lai, and G. P. Xia, Dynamic multi period transportation model for vehicle composition with transshipment points. Advanced Modeling and Optimization, 2001.

G. Vsav, Véhicule de Secours et d'Assistance aux Victimes VSL : Véhicule Sanitaire Léger 1-M-1 : One-to-Many-to-One 1-1 : One-to-One