[1] | Jones PK, Jones SL, Yoder L, "Hospital location as a determinant of emergency room utilization patterns", Public Health Rep, 97, pp. 445-451, 1982. |
[2] | Flint LS, Hammett WH, Martens K, "Quality assurance in the emergency department", Annals of Emergency Medicine, 14, 12, pp. 1199-1204, 1985. |
[3] | Goldberg JB. "Operations research models for the deployment of emergency services vehicles", EMS Management Journal, 1(1), pp.20–39, 2004. |
[4] | Psaraftis, H.N, "A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem", Operations Research, 23, No.6, pp.1347-1359, 1980. |
[5] | Taylor IDS, Templeton JGC, "Waiting time in a multi-server cutoff-priority queue, and its application to an urban ambulance service", Operations Research, 28(5), pp.1168–88, 1980. |
[6] | Brandeau M, Larson RC, "Extending and applying the hypercube queueing model to deploy ambulances in Boston. In: Swersey A, Ignall E, editors. Delivery of urban services", NewYork: North Holland, pp. 121–53, 1986. |
[7] | Mendonça FC, Morabito R, "Analysing emergency medical service ambulance deployment on a Brazilian highway using the hypercube model", Journal of the Operational Research Society, 52(3), pp. 261–70, 2001. |
[8] | Takeda RA, Widmer JA, Morabito R, "Analysis of ambulance decentralization in an urban emergency medical service using the hypercube queueing model", Computers & Operations Research, 34, 3, pp.727-741, 2007. |
[9] | Green LV, Kolesar P, "Testing the validity of a queueing model of police patrol", Management Science, 35(2), pp.127–48, 1989. |
[10] | Singer M, Donoso P, Jara S, "Fleet configuration subject to stochastic demand: an application in the distribution of liquefied petroleum gas", Journal of the Operations Research Society, 53(9), pp.961–71, 2002. |
[11] | Dethloff, J, "Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pickup", OR Spectrum 23, 79–96, 2001. |
[12] | Cordeau, J.F., Laporte, G, "A tabu search heuristic for the static multi-vehicle dial-a-ride problem", Transportation Research Part B: Methodological, 37 (6), pp. 579–594, 2003. |
[13] | Euchi J., Chabchoub H. "Hybrid metaheuristics for the profitable arc tour problem", Journal of the Operational Research Society, 62, pp. 2013-2022, 2011. |
[14] | Euchi J., Chabchoub H. "A Hybrid Tabu Search to Solve the Heterogeneous Fixed Fleet Vehicle Routing Problem", Logistics Research, vol 2 (1), pp. 3-11, 2010. |
[15] | Euchi J., Chabchoub H, Yassine A. "New evolutionary algorithm to solve the vehicle routing problem with private fleet and common carrier", International Journal of Applied Metaheuristic Computing, 2(1), pp. 58-82, 2011. |
[16] | Bodin, L.D., Golden, B., Assad, A., Ball, M, "Routing and scheduling of vehicles and crews: the state of the art", Computers and Operations Research 10 (2), 63–211, 1983. |
[17] | Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F., "Time constrained routing and scheduling", In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (Eds.), . In: Network Routing, Handbooks in Operations Research and Management Science, Elsevier Science, Amsterdam, vol. 8, pp. 35–139, 1995. |
[18] | Solomon, M.M, "Algorithms for the vehicle routing and scheduling problems with time window constraints", Operations Research, 35 (2), pp.254–265, 1987. |
[19] | Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F, "VRP with pickup and delivery. In: Toth, P., Vigo, D. (Eds.), The Vehicle Routing Problem", SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp. 225–242, 2002. |
[20] | Mitrovic-Minic S, "The dynamic pickup and delivery problem with time windows", Ph.D. Dissertation, School of Computing Science, Simon Fraser University, Burnaby, Canada, 2001. |
[21] | Savelsbergh, M.W.P., Sol, M, "The general pickup and delivery problem", Transportation Science, 29 (1), pp.17–29, 1995. |
[22] | Psaraftis, H, "A dynamic programming approach to the single-vehicle, manyto- many immediate request dial-a-ride problem", Transportation Science, 14, pp. 130–154, 1980. |
[23] | Psaraftis, H.N, "An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows", Transportation Science, 17, pp.351–357, 1983. |
[24] | Desrosiers, J., Dumas, Y., Soumis, F., "A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows", American Journal of Mathematical and Management Sciences, 6, pp. 301–325, 1986. |
[25] | Sexton, T., Bodin, L.D, "Optimizing single vehicle many-to-many operations with desired delivery times: I. scheduling", Transportation Science, 19, pp. 378–410, 1985. |
[26] | Jaw, J.J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.M, "A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows", Transportation Research Part B, 20 (3), pp. 243–257, 1986. |
[27] | Madsen, O.B.G., Ravn, H.F., Rygaard, J.M, "A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives", Annals of Operations Research, 60, pp.193–208, 1995. |
[28] | Potvin, J.Y., Rousseau, J.M, "Constraint-directed search for the advanced request dial-a-ride problem with service quality constraint", In: Balci, O., Sharda, R., Zenios, S.A. (Eds.), Computer Science and Operations Research: New Developments in Their Interfaces. Pergamon Press, Oxford, England, pp. 457–474, 1992. |
[29] | Diana, M., Dessouky, M.M, "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows", Transportation Research Part B, 38 (6), pp. 539–557, 2004. |
[30] | Dessouky, M., Rahimi, M., Weidner, M, "Jointly optimizing cost, service, and environmental performance in demand-responsive transit scheduling", Transportation Research Part D, 8, pp. 433–465, 2003. |
[31] | Fu, L, "Scheduling dial-a-ride paratransit under time-varying, stochastic congestion", Transportation Research Part B, 36, pp. 485–506, 2002. |
[32] | Fu, L, "Analytical model for paratransit capacity and quality-of-service analysis", Transportation Research Record, 18, pp.81–89, 2003. |
[33] | Desrosiers, J., Dumas, Y., Soumis, F, "The multiple vehicle dial-a-ride problem. Computer-Aided Transit Scheduling", In: Lecture Notes in Economics and Mathematical System,. Springer, Berlin, vol. 308, pp. 15–27, 1988. |
[34] | Ioachim, I., Desrosiers, J., Dumas, Y., Solomon, M.M., Villeneuve, D, "A request clustering algorithm for door-to-door handicapped transportation", Transportation Science 29 (1), pp. 63–78, 1995. |
[35] | Borndorfer, R., Grotschel, M., Klostermeier, F., Kuttner, C, Telebus Berlin, "vehicle scheduling in a dial-a-ride system. Computer- Aided Transit Scheduling", In: Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, vol. 471, pp. 391–422, 1997. |
[36] | Baugh, J.W., Kakivaya, G.K.R., Stone, J.R, "Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing", Engineering Optimization, 30, pp. 91–123, 1998. |
[37] | Attanasio, A., Cordeau, J.F., Ghiani, G., Laporte, G, "Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem", Parallel Computing, 30, pp.377–387, 2004. |
[38] | Toth, P., Vigo, D, "Heuristic algorithms for the handicapped persons transportation problem", Transportation Science, 31 (1), pp. 60–71, 1997. |
[39] | Hart, S.M, "The modeling and solution of a class of dial-a-ride problems using simulated annealing", Control and Cybernetics, 25 (1), pp.131–157,1996. |
[40] | Van Der Bruggen, L.J.J., Lenstra, J.K., Schuur, P.C., "Variable-depth search for the single-vehicle pickup and delivery problem with time windows", Transportation Science 27 (3), 298–311, 1993. |
[41] | Toth, P., Vigo, D, "Fast local search algorithms for the handicapped persons transportation problem", In: Osman, I.H., Kelly, J.P. (Eds.), Meta-Heuristics: Theory and Applications. Kluwer, Boston, pp. 677–690, 1996. |
[42] | Campbell, A.M., Savelsbergh, M, "Efficient insertion heuristics for vehicle routing and scheduling problems", Transportation Science, 38 (3), pp. 369–378, 2004. |
[43] | I. Kara, B. Tolga, "Integer linear programming formulations of multiple salesman problems and its variations", European Journal of Operational Research, 174, pp.1449-1458, 2006. |