Advertisement

Measuring Spatial Separation: Distance, Time, Routing, and Accessibility

Keywords

Data Envelopment Analysis Facility Location Spatial Separation Data Envelopment Analysis Model Demand Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bach, L. (1981). "The problem of aggregation and distance for analysis of accessibility and access opportunity in location-allocation models." Environment and Planning A, Vol. 13, pp. 955–978.Google Scholar
  2. Bartholdi III, J. J.; Platzman, L. K. (1988). "Heuristics based on spacefilling curves for combinatorial problems in Euclidean space." Management Science, Vol. 34, No. 3, pp. 291–305.MathSciNetMATHGoogle Scholar
  3. Bertsekas, D.; Tsitsiklis, J. (1988). "An analysis of stochastic shortest path problems," Working paper, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology." Cambridge, Massachusetts.Google Scholar
  4. Brimberg, J.; Love, R. F. (1992). "A new distance function for modeling travel distances in a transportation network." Transportation Science, Vol. 26, No. 2.Google Scholar
  5. Brimberg, J.; Wesolowsky, G. O. (1992) "Probabilistic l p distances in location models" Annals of Operations Research, Vol. 40, pp. 67–75.CrossRefMathSciNetMATHGoogle Scholar
  6. Campbell, J. F. (1992). "Continuous and discrete demand hub location problems." Working paper CBIS 92-06-01, Center for Business and Industrial Studies, School of Business Administration, University of Missouri, St. Louis, Missouri.Google Scholar
  7. Chan, Y. (1979). "A graph-theoretic method to quantify the airline route authority." Transportation, Vol. 8, pp. 275–291.CrossRefGoogle Scholar
  8. Carrizosa, E.; Romero-Morales, D. (2001). “Combining minsum and minmax: A goal programming approach.” Operations Research, Vol. 49. No. 1. pp. 169–174.CrossRefMathSciNetGoogle Scholar
  9. Charnes, A.; Cooper, W. W.; Rhodes, E. (1978) "Measuring the efficiency of decision making unit" European Journal of Operational Research, Vol. 2, pp. 429–444.CrossRefMathSciNetMATHGoogle Scholar
  10. Dalvi, M. Q.; Martin, K. M. (1976). "The measurement of accessibility: some preliminary results." Transportation, Vol. 5, pp. 17–42.CrossRefGoogle Scholar
  11. Deo, N.; Pang, C. (1984). "Shortest path algorithms: taxonomy and annotation." Networks, Vol. 14, pp. 275–323.MathSciNetMATHGoogle Scholar
  12. Dreyfus, S. (1969). "An appraisal of some shortest path algorithms." Operations Research, Vol. 17, pp. 395–412.MATHGoogle Scholar
  13. Fukuyama, H.; Weber, W. L. (2002). “Estimating output gains by means of Luenberger efficiency measure.” Working Paper, Faculty of Commerce, Fukuoka University, Fukuoka, Japan.Google Scholar
  14. Grosskopf, S.; Hayes, K. (1993) "Local public sector bureaucrats and their input choices" Journal of Urban Economics, Vol. 33, pp. 151–166.CrossRefGoogle Scholar
  15. Grosskopf, S.; Hayes, K.; Porter-Hudak, S. (1993) "A computationally efficient method for estimating distance functions" Working paper, Department of Economics, Southern Illinois University, Carbondale, Illinois.Google Scholar
  16. Grosskopf, S.; Magaritis, D.; Valdmanis, V. (1995) "Estimating output substitutability of hospital services: a distance function approach" European Journal of Operational Research, Vol. 80, pp. 575–587.CrossRefMATHGoogle Scholar
  17. Hall, R. W. (1991). "Characteristics of multi-stop multi-terminal delivery routes, with backhauls and unique items." Transportation Research B, Vol. 25B, No. 6, pp. 391–403.CrossRefGoogle Scholar
  18. Hsu, C-I; Hsieh, Y-P (1993) "The development of individual accessibility measure models" Transportation Planning Journal, Vol. 22, pp. 203–230, Ministry of Transportation and Communication, Taiwan (in Chinese).Google Scholar
  19. Jin, H.; Batta, R.; Karwan, M. H. (1996) "On the analysis of two new models for transporting hazardous materials" Operations Research, Vol. 44, pp. 710–723.MATHGoogle Scholar
  20. Kim, S-I; Choi, I-C (1994) "A simple variational problem for a moving vehicle" Operations Research Letters, Vol. 16, pp. 231–239.CrossRefMathSciNetMATHGoogle Scholar
  21. Love, R. F.; Morris, J. G.; Wesolowsky, G. O. (1988). "Mathematical models of travel distances." Chapter 10 of Facilities Location: Models and Methods, North-Holland, New York, New York.Google Scholar
  22. Love, R. F; Walker, J.H.; Tiku, M. L. (1995) "Confidence intervals for lk,p,θ distances" Transportation Science, Vol. 29, pp. 93–100.MATHGoogle Scholar
  23. Martins, E. (1984). "On a multicriteria shortest path problem." European Journal of Operational Research, Vol. 16, pp. 236–245.CrossRefMATHMathSciNetGoogle Scholar
  24. Miller-Hooks, E.; Mahmassani, H. S. (1997). "Optimal routing of hazardous materials in stochastic, time-varying transportation networks." Working paper, Department of Civil and Environmental Engineering, Duke University, Durham, North Carolina.Google Scholar
  25. Robuste, F. (1901). "Centralized hub-terminal geometric concepts I: Walking distance." Journal of Transportation Engineering, Vol. 117, No. 2, pp. 143–177.Google Scholar
  26. Sathisan, S. K.; Srinivasan, N. (1997). "A framework for evaluating accessibility of urban transportation networks." Working paper, Transportation Research Center, University of Nevada, Las Vegas, Nevada.Google Scholar
  27. Stone, R. E. (1991). "Some average distance results." Technical notes, Transportation Science, Vol. 25, No. 1, pp. 83–90.MathSciNetGoogle Scholar
  28. Tassiulas, L. (1996) "Adaptive routing on the plane" Operations Research, Vol. 44, pp. 823–832.MATHGoogle Scholar
  29. Thomas, P. C. (1995) "Using Locational and Data Envelopment Analysis Models to Site Municipal Solid Waste Facilities" Master's Thesis, Department of Environmental Engineering and Management, Report AFIT/GEE/ENS/950-09, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  30. Xue, G.; Ye, Y. (1997). "An efficient algorithm for minimizing a sum of Euclidean norms with applications." SIAM Journal of Optimization, Vol. 7, No. 4, pp. 1017–1036.CrossRefMathSciNetMATHGoogle Scholar
  31. Anily, S.; Mosheiov, G. (1994) "The traveling salesman problem with delivery and backhauls" Operations Research Letters, Vol. 16, pp. 11–18.CrossRefMathSciNetMATHGoogle Scholar
  32. Baker, S. F. (1991). "Location and Routing of the Defense Courier Service Aerial Network." Master's Thesis, AFIT/GOR/ENS/91M-1, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  33. Baker, E. (1983). "An exact algorithm for the time-constrained traveling salesman problem." Operations Research, Vol. 31, No. 5, pp. 938–945.MATHGoogle Scholar
  34. Butt, S. E.; Ryan, D. M. (1999). "An optimal solution procedure for the multiple tour maximum collection problem using column generation." Computers & Operations Research, Vol. 26, pp. 427–441.CrossRefMathSciNetMATHGoogle Scholar
  35. Balas, E.; Fischetti, M. (1989). "A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets." Working paper 88-89-83, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania.Google Scholar
  36. Berman, O.; Simchi-Levi, D. (1988). "A heuristic algorithm for the travelling salesman location problem on networks." Operations Research, Vol. 36, pp. 478–484.MathSciNetMATHGoogle Scholar
  37. Berman, O.; Simchi-Levi, D. (1988a). "Finding the optimal a priori tour and location of a travelling salesman with non-homogeneous customers." Transportation Science, Vol. 22, pp. 148–154.MathSciNetMATHGoogle Scholar
  38. Bertsimas, D. (1989). "Travelling salesman facility location problems." Transportation Science, Vol. 23, pp. 184–191.MATHMathSciNetGoogle Scholar
  39. Bertsimas, D. J; Simchi-Levi, D. (1996) "A new generation of vehicle routing research: robust algorithms addressing uncertainty" Operations Research, Vol. 44, pp. 286–304.MATHGoogle Scholar
  40. Bienstock, D.; Goemans, M. X.; Simchi-Levi, D.; Williamson, D. (1990). "A note on the prize collecting travelling salesman problem." Working paper, Bellcore, Morristown, New Jersey.Google Scholar
  41. Burkhard, R. (1990). "Locations with spatial interactions: The quadratic assignment problem." Discrete Location Theory (edited by P. Mirchandani and R. Francis), pp. 387–438.Google Scholar
  42. Cao, B.; Glover, F. (9194) "Tabu search and ejection chains-application to a node weighted version of the cardinality-constrained TSP" Working paper, University of the Federal Armed Forces at Munich, Neubiberg, Germany.Google Scholar
  43. Chan, Y.; Merrill, D. L. (1997). "The probabilistic multiple-travelling-salesmen-facility-location problem: space-filling curve and asymptotic Euclidean analyses." Military Operations Research, Vol. 3, No. 2, pp. 37–53.Google Scholar
  44. Current, J.; Schilling, D. (1989). "The covering salesman problem." Transportation Science, Vol. 23, pp. 208–213.MathSciNetMATHGoogle Scholar
  45. Desrosiers, J.; Sauve, M.; Soumis, F. (1988). "Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows." Management Science, Vol. 34, pp. 1005–1022.MathSciNetMATHGoogle Scholar
  46. Dumas, Y.; Desrosiers, J.; Gelinas, E. (1995) "An optimal algorithm for the traveling salesman problem with time windows" Operations Research, Vol. 43, pp. 367–371.MathSciNetMATHGoogle Scholar
  47. Eiselt, H. A.; Gendreau, M.; Laporte, G. (1995) "Arc routing problems, Part I: the Chinese Postman Problem" Operations Research, Vol. 43, pp. 231–242.MathSciNetMATHGoogle Scholar
  48. Eiselt, H. A.; Gendreau, M.; Laporte, G. (1995) "Arc routing problems, Part II: the Rural Postman Problem" Operations Research, Vol. 43, pp. 399–414.MathSciNetMATHGoogle Scholar
  49. Fischetti, M.; Gonzalez, J. J. S., Toth, P. (1994) "A branch-and-cut algorithm for the symmetric generalized travelling salesman problem" Working paper, Department of Electronic Information and Systems, University of Bologna, Italy.Google Scholar
  50. Fischetti, M.; Gonzalez, J. J. S., Toth, P. (1994) "The symmetric generalized travelling salesman polytope" Working paper, Department of Electronic Information and Systems, University of Bologna, Italy.Google Scholar
  51. Franca, P.; Gendreau, M; Laporte, G.; Muller, F. M. (1995) "The m-traveling salesman problem with minmax objective" Transportation Science, Vol. 29, 267–275.MATHGoogle Scholar
  52. Gendreau, M; Hertz, M.; Laporte, G. (1996) "The traveling salesman problem with backhauls" Computers and Operations Research, Vol. 23, pp. 501–508.CrossRefMathSciNetMATHGoogle Scholar
  53. Gendreau, M.; Hertz, A.; Laporte, G. (1992). "New insertion and post-optimization procedures for the traveling salesman problem." Operations Research, Vol. 40, No. 6, pp. 1086–1094.MathSciNetMATHGoogle Scholar
  54. Gendreau, M.; Laporte, G.; Potvin, J-Y. (1994) "Heuristics for the clustered traveling salesman problem" Publication CRT-94-54, Centre de Recherche sur les Transports, Universite de Montreal, Montreal, Canada.Google Scholar
  55. Gendreau, M.; Laporte, G.; Semet, F. (1997). "The covering tour problem." Operations Research, Vol. 45, No. 4, pp. 568–576.MathSciNetMATHGoogle Scholar
  56. Gendreau, M.; Laporte, G.; Semet, F. (1998). "A branch-and-cut algorithm for the undirected select traveling salesman problem." Networks, Vol. 32, pp. 262–273.CrossRefMathSciNetGoogle Scholar
  57. Gendreau, M.; Laporte, G.; Simchi-Levi, D. (1991). "A degree relaxation algorithm for the asymmetric generalized travelling salesman problem." Working paper CRT-800, Centre de Researche sur les Transports, Universite de Montreal, Montreal, Canada.Google Scholar
  58. Gillett, B.; Miller, L. (1974). "A heuristic algorithm for the vehicle dispatch problem." Operations Research, Vol. 22, pp. 340–349.MATHGoogle Scholar
  59. Hoffman, A.; Wolfe, P. (1985). "History." in the Traveling Salesman Problem, edited by E. Lawler et al., Chichester, G. B., Wiley, New York, New York.Google Scholar
  60. Jaillet, P. (1988). "A prior solution of a traveling salesman problem in which a random subset of the customers are visited." Operations Research, Vol. 36, p. 929.MATHMathSciNetGoogle Scholar
  61. Jonker, R.; Volgenaut, T. (1989). "Nonoptimal edges for the symmetric traveling salesman problem." Operations Research, Vol. 32, pp. 837–846.Google Scholar
  62. Junger, M.; Kaibel, V. (1996) "A basic study of the QAP-polytope" Working paper, Institut fur Informatik, Universitat zu Koln, Denmark.Google Scholar
  63. Kikuchi, S.; Rhee, J-H. (1989). "Scheduling method for demand-responsive transportation system." Journal of Transportation Engineering, Vol. 115, pp. 630–645.CrossRefGoogle Scholar
  64. Laporte, G. (1997). "Modeling and solving several classes of arc routing problems as traveling salesman problems." Computers & Operations Research, Vol. 24, No. 11, pp. 1057–1061.CrossRefMATHMathSciNetGoogle Scholar
  65. Laporte, G.; Louveaux, F. V.; Mercure, H. (1994) "A priori optimization of the probabilistic traveling salesman problem" Operations Research, Vol. 42, pp. 543–549.MathSciNetMATHGoogle Scholar
  66. Lawler, E. L.; Lenstra, J. K.; Kan, A. H. G.; Shmoys, D. B. (1985) The Traveling Salesman Problem, Wiley-Interscience, New York, New York.MATHGoogle Scholar
  67. Merrill, D. (1989). "Facility Location and Routing to Minimize the en route Distance of Flight Inspection Missions." Master's thesis submitted to the Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  68. Minieka, E. (1989) "The delivery man problem on a tree network" Annals of Operations Research, Vol. 18, pp. 261–266.CrossRefMATHMathSciNetGoogle Scholar
  69. Moore, R. S.; Pushek, P.; Chan, Y. (1991). "A travelling salesman/facility location problem." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  70. Mullen, D. (1989). "A Dynamic Programming approach to the Daily Routing of Aeromedical Evacuation System Missions." Master's thesis (AFIT/GST/ENS/89J-5), Dept. of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  71. Noon, C; Bean, J. (1989). "An efficient transformation of the generalized traveling salesman problem." Working paper, Dept. of Management Science, University of Tennessee, Knoxville, Tennessee.Google Scholar
  72. Padberg, M.; Rinaldi, G. (1991). "A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems." SIAM Review, Vol. 33, No. 1, pp. 60–100.CrossRefMathSciNetMATHGoogle Scholar
  73. Padberg, M.; Rinaldi, G. (1989). "A branch-and-cut approach to a traveling salesman problem with side constraints." Management Science, Vol. 35, pp. 1393–1412.MathSciNetMATHGoogle Scholar
  74. Renaud, J.; Boctor, F. F. (1996) "An efficient composite heuristic for the symmetric Generalized Traveling Salesman Problem" Working paper, Tele-universite, Saint Foy, Quebec, Canada.Google Scholar
  75. Reynolds, J.; Baker, S.; Chan, Y. (1990). "Multiple travelling salesman problem: integer programming, subtour breaking and time constraints." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  76. Rosenkrantz, D. J.; Stearns, R. E.; Lewis, P. M. (1974). "Approximate algorithms for the traveling salesman problem." Proc. 15th Ann IEEE Symp on Switching and Automata Theory, pp. 33–42.Google Scholar
  77. Sexton, T.; Choi, Y-M. (1986). "Pickup and delivery of partial loads with "soft" time windows." American Journal of Mathematical and Management Sciences, Vol. 6, pp. 369–398.MATHGoogle Scholar
  78. Shirley, M.; Sosebee, B.; Chan, Y. (1992). "Facility location study." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  79. Stephens, A.; Habash, N.; Chan, Y. (1991). "Alternate depot: Altus Air Force Base." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  80. Tillman, F. (1969). "The multiple terminal delivery problem with stochastic demands." Transportation Science, Vol. 3, pp. 192–204.Google Scholar
  81. Tsitsiklis, J. N. (1992). "Special cases of traveling salesman and repairman problems with time windows." Networks, Vol. 22, pp. 263–282.MATHMathSciNetGoogle Scholar
  82. Tzeng, G-H.; Wang, J-C; Hwang, M-J. (1996) "Using genetic algorithms and the template path concept to solve the traveling salesman problem" Transportation Planning Journal, Vol. 25, pp. 493–516. Institute of Transportation, Taiwan. (In Chinese).Google Scholar
  83. Vander Wiel, R. J.; Sahinidis, N. V. (1995) "Heuristic bounds and test problem generation for the time-dependent traveling salesman problem" Transportation Science, Vol. 29, pp. 167–184.MATHGoogle Scholar
  84. Warburton, A. R. (1993) "Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem" Operations Research Letters, Vol. 13, pp. 37–42.CrossRefMATHMathSciNetGoogle Scholar
  85. Yang, J.; Jaillet, P.; Mahmassani, H. S. (1998). "On-line algorithms for truck-fleet assignment and scheduling under real-time information." Working paper, Department of Management Science and Information Systems, University of Texas at Austin, Austin, Texas.Google Scholar
  86. Zografos, K.; Davis, C. (1989). "Multi-objective programming approach for routing hazardous materials." Journal of Transportation Engineering, Vol. 115, pp. 661–673.Google Scholar
  87. Zweig, G. (1995) "An effective tour construction and improvement procedure for the traveling salesman problem" Operations Research, Vol. 43, pp. 1049–1057.MATHMathSciNetGoogle Scholar
  88. Achutan, N. R.; Caccetta, L. (1991). Integer linear programming formulation for a vehicle-routing problem." European Journal of Operational Research, Vol. 52, pp. 86–89.CrossRefGoogle Scholar
  89. Agarwal, Y.; Mathur, K.; Salkin, H. (1989). "A set-partitioning-based exact algorithm for the vehicle routing problem." Networks, Vol. 19, pp. 731–749.MathSciNetMATHGoogle Scholar
  90. Altman, S. M.; Bhagat, N.; Bodin, L. D. (1971). "Algorithm for routing garbage trucks over multiple planning periods." Report of the Urban Science and Engineering Program, State University of New York, Stony Brook, New York.Google Scholar
  91. Anily, S.; Bramel, J. (1999). "Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries." Naval Research Logistics, Vol. 46, pp. 654–670.CrossRefMathSciNetMATHGoogle Scholar
  92. Assad, A. (1988). "Modeling and implementation issues in vehicle routing." in Vehicle Routing Methods and Studies, (B. Golden and A. Assad, editors), Elsevier Science Publishers.Google Scholar
  93. Baker, S. F.; Chan, Y. (1996). "The multiple depot multiple travelling salesmen problem: vehicle range and servicing frequency implementations." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  94. Bauer, M.; Blythe, R.; Chan, Y. (1992). "Multiple vehicle travelling salesman problem" Working paper, Dept. of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  95. Baugh Jr, J. W.; Kakivaya, G. K. R.; Stone, J. R. (1996) "Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing" Working paper, Department of Civil Engineering, North Carolina State University, Raleigh, North Carolina.Google Scholar
  96. Beltrami, E.; Bhagat, N.; Bodin, L. (1971). "A randomized routing algorithm with application to barge dispatching in New York City."USE Technical Report #71-15, November 1971, The State University of New York, Stony Brook, New York.Google Scholar
  97. Beltrami, E.; Bhagat, N.; Bodin, L. (1971). "Refuse disposal in New York City; an analysis of barge dispatching." SE Technical Report #71-10, July 1971, The State University of New York, Stony Brook, New York.Google Scholar
  98. Benavent, E.; Campos, V.; Corberan, A.; Mota, E. (1992) "The capacitated arc routing problem: lower bounds" Networks, Vol. 22, pp. 669–690.MathSciNetMATHGoogle Scholar
  99. Bergevin, R.; Pflieger, C; Chan, Y. (1992). "The medical evacuation problem: using traveling salesmanand vehicle routing formulations." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  100. Beroggi, G. E. G. (1994) "A real time routing model for hazardous materials" European Journal of Operational Research, Vol. 75, pp. 505–520.CrossRefGoogle Scholar
  101. Bertsimas, D. J. (1992). "A vehicle routing problem with stochastic demand." Operations Research, Vol. 40, No. 3, pp. 574–585.MATHMathSciNetGoogle Scholar
  102. Bodin, L.; Godin, B. (1981). "Classification in vehicle routing and scheduling." Networks, Vol. 11, pp. 77–108.MathSciNetGoogle Scholar
  103. Bowerman, R. L; Calamai, P. H. (1994) "The space filling curve with optimal partitioning heuristic for the vehicle routing problem" European Journal of Operational Research, Vol. 76, pp. 128–142.CrossRefMATHGoogle Scholar
  104. Bramel, J.; Coffman Jr., E. G.; Shor, P. W.; Simchi-Levi, D. (1992). "Probabilistic analysis of the capacitated vehicle routing problem with unsplit demands." Operations Research, Vol. 40, No. 6, pp. 1095–1106.MathSciNetMATHGoogle Scholar
  105. Bramel, J.; Simchi-Levi (1994) "On the effectiveness of set partitioning formulations for the vehicle routing problem" Working paper, Graduate School of Business, Columbia University, New York, New York.Google Scholar
  106. Bramel, J.; Simchi-Levi (forthcoming) "Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows" Operations Research.Google Scholar
  107. Brodie, G. R.; Waters, C. D. (1988). "Integer linear programming formulation for vehicle routing problems." European Journal of Operational Research, Vol. 34, pp. 403–404.CrossRefMathSciNetMATHGoogle Scholar
  108. Burnes, M. D. (1990). "Application of Vehicle Routing Heuristics to an Aeromedical Airlift Problem." Master's thesis, AFIT/GST/ENS/90M-3, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  109. Burnes, M; Chan, Y. (1989). "Solution of a classic vehicle routing problem." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio. Carter, W.B. (1990). "Allocation and Routing of CRAF MD80 Aircraft." Master's thesis, AFIT/GST/ENS/90M-4, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  110. Clarke, G.; Wright, J. W. (1964). "Scheduling of vehicles from a central depot to a number of delivery points." Operations Research, Vol. 12, pp. 568–581.Google Scholar
  111. Daganzo, C. F.; Hall, R. W. (1993) "A routing model for pickups and deliveries: no capacity restrictions on the secondary items" Transportation Science, Vol. 27, pp. 315–340.MATHGoogle Scholar
  112. Desorchers, M.; Desrosiers, J.; Solomon, M. (1992). "A new optimization algorithm for the vehicle routing problem with time windows." Operations Research, Vol. 40, No. 2, pp. 342–354.MathSciNetGoogle Scholar
  113. Desrosiers, J.; Dumas, Y.; Soumis, F. (1986). "A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows." American Journal of Mathematical and Management Sciences, Vol. 6, pp. 301–325.MATHGoogle Scholar
  114. Desrosiers, J.; Laporte, G. (1991). "Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints." Operations Research Letters, Vol. 10, pp. 27–36.CrossRefMathSciNetGoogle Scholar
  115. Dror, M.; Laporte, G.; Trudeau, P. (1989). "Vehicle routing with stochastic demands: properties and solution frameworks." Transportation Science, Vol. 23, No. 3, pp. 166–176.MathSciNetMATHGoogle Scholar
  116. Duhamel, C.; Potvin, J. Y.; Rousseau, J.M. (1997). "A tabu search heuristic for the vehicle routing problem with backhauls and time windows." Transportation Science, Vol. 31, No. 1, pp. 49–59.MATHGoogle Scholar
  117. Fischetti, M.; Gonzalez, J. J. S.; Toth, P. (1997). "A branch-and-cut algorithm for the symmetric generalized traveling salesman problem." Operations Research, Vol. 45, No. 3, pp. 378–394.MathSciNetCrossRefMATHGoogle Scholar
  118. Fischetti, M.; Toth, P.; Vigo, D. (1994) "A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs" Operations Research, Vol. 42, pp. 846–859.MathSciNetMATHGoogle Scholar
  119. Fisher, M.; Jaikumar, R. (1981). "A generalized assignment heuristic for vehicle routing." Networks, Vol. 11, pp. 109–124.MathSciNetGoogle Scholar
  120. Fisher, M. L.; Jornsten, K. O.; Madsen, O. B. G. (1997). "Vehicle routing with time windows: two optimization algorithms." Operations Research, Vol. 45, No. 3, pp. 488–492.MathSciNetMATHGoogle Scholar
  121. Gendreau, M.; Laporte, G.; Seguin, R. (1995) "An exact algorithm for the vehicle routing problem with stochastic demands and customers" Transportation Science, Vol. 29, pp. 143–155.MATHGoogle Scholar
  122. Gendreau, M.; Hertz, A.; Laporte, G. (1991). "A tabu search heuristic for the vehicle routing problem." Working paper CRT-777, Center de Researche sur les Transports, Universite de Montreal, Montreal, Canada.Google Scholar
  123. Golden, B. L. (1984). "Introduction to and recent advances in vehicle routing methods." in Transportation Planning Models (M. Florian, Editor), Elsevier Science publishers, pp. 383–418.Google Scholar
  124. Golden, B.; Assad, A. (1986). "Perspective on vehicle routing: exciting new developments." Operations Research, Vol. 34, No. 5, pp. 803–810.MathSciNetGoogle Scholar
  125. Haimovich, M.; Rinnooy Kan, A. H. G.; Storigie, L. (1988). "Analysis of heuristics for vehicle routing problems." in Vehicle Routing: Methods and Studies (B. Golden and A. Assad, editors).Google Scholar
  126. Hall, R. W.; Du Y.; Lin, J. (1994) "Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation" Networks, Vol. 24, pp. 43–56.MATHGoogle Scholar
  127. Haouair, M.; Dejax, P.; Desrochers, M. (1990). "Modelling and solving complex vehicle routing problems using column generation." GERAD, 5255 Ave Decelles, Montreal, Quebec, Canada.Google Scholar
  128. Harche, F.; Raghavan, P. (1991). "A generalized exchange heuristic for the capacitated vehicle routing problem." Working paper, Department of Statistics and Operations Research, Stern School of Business, New York University, New York, New York.Google Scholar
  129. Hooker, J. N.; Natraj, N. R. (1995) "Solving a general routing and scheduling problem by chain decomposition and tabu search," Transportation Science, Vol. 29, pp. 30–44.MATHGoogle Scholar
  130. Jacobs-Blecha, C; Goetschalckx, M.; Desrochers, M.; Gelinas, S. (1992). "The vehicle routing problem with backhauls: properties and solution algorithms." Working paper, Georgia Tech Research Corporation, Atlanta, Georgia.Google Scholar
  131. Jacob-Blecha, C; Goetschalckx, M. (1992) "The vehicle routing problem with backhauls: properties and solution algorithms" Working paper, Georgia Tech Research Corporation, Atlanta, Georgia.Google Scholar
  132. Jansen, K. (1993) "Bounds for the general capacitated routing problem" Networks, Vol. 23, pp. 165–173.MATHMathSciNetGoogle Scholar
  133. Kohl, N.; Desrosiers, J.; Madsen, O. B. G.; Solomon, M. M.; Soumis, F. (1999). "2-path cuts for the vehicle routing problem with time windows." Transportation Science, Vol. 33, No. 1, pp. 101–116.MATHGoogle Scholar
  134. Kohl, N.; Madsen, O. B. G. (1997). "An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation." Operations Research, Vol. 45, No. 3, pp. 395–406.MathSciNetMATHGoogle Scholar
  135. Koskosidis, Y. A.; Powell, W. B.; Solomon, M. M. (1992). "An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints." Transportation Science, Vol. 26, No. 2, pp. 69–85.MATHGoogle Scholar
  136. Kulkarni, R.; Bhave, P. (1985). "Integer programming formulations of vehicle routing problems." European Journal of Operational Research, Vol. 20, pp. 58–67.CrossRefMathSciNetGoogle Scholar
  137. Laporte, G.; Nobert, Y.; Desrochers, M. (1985). "Optimal routing under capacity and distance restriction." Operations Research, Vol. 32, No. 5, pp. 1050–1065.MathSciNetGoogle Scholar
  138. Li, C-L.; Simchi-Levi, D.; Desrochers, M. (1992). "On the distance constrained vehicle routing problems." Operations Research, Vol. 40, No. 4, pp. 790–799.MathSciNetMATHGoogle Scholar
  139. Li, C-L.; Simchi-Levi, D. (1990). "Worst-case analysis of heuristics for multidepot capacitated vehicle routing problem." ORSA Journal on Computing, Vol. 2, No. 1, pp. 64–74.MathSciNetMATHGoogle Scholar
  140. Li, C-L.; Simchi-Levi, D. (1989). "On the distance constrained vehicle routing problem." Dept. of Industrial Engineering and Operation Research, Columbia University, New York, New York.Google Scholar
  141. Mingozzi, A.; Giorgi, S.; Baldacci, R. (1999). "An exact method for the vehicle routing problem with backhauls." Transportation Science, Vol. 33, No. 3, pp. 315–329.MATHGoogle Scholar
  142. Mosheiov, G. (1994) "The travelling salesman problem with pick-up and delivery" European Journal of Operational Research, Vol. 79, pp. 299–310.CrossRefMATHGoogle Scholar
  143. Orloff, C. (1974). "A fundamental problem in vehicle routing." Networks, Vol. 4, pp. 35–64.MATHMathSciNetGoogle Scholar
  144. Rana, K.; Vickson, R. (1988). "A model and solution algorithm for optimal routing of a time-constrained containership." Transportation Science, Vol. 22, pp. 83–95.MathSciNetMATHGoogle Scholar
  145. Ribeiro, C. C; Soumis, F. (1994) "A column generation approach to the multiple-depot vehicle scheduling problem" Operations Research, Vol. 42, pp. 41–52.MATHGoogle Scholar
  146. Rodriguez, P.; Nussbaum, M.; Baeza, R.; Leon, G., Sepulveda, M., Cobian, A. (1998). "Using global search heuristics for the capacity vehicle routing problem." Computers & Operations Research, Vol. 25, No. 5, pp. 407–417.CrossRefMathSciNetMATHGoogle Scholar
  147. Russell, R. A. (1995) "Hybrid heuristics for the vehicle routing problem with time windows" Transportation Science, Vol. 29, pp. 156–166.MATHGoogle Scholar
  148. Savelsbergh, M. W. P.; Sol, M. (1995) "The general pickup and delivery problem" Transportation Science, Vol. 29, pp. 17–29.MATHGoogle Scholar
  149. Savelsbergh, M. W. P.; Sol, M. (1998). "DRIVE: dynamic routng of independent vehicles." Operations Research, Vol. 46, No. 4, pp. 474–490.MATHGoogle Scholar
  150. Sexton, T. (1979). "The single vehicle many to many routing and scheduling problem with desired delivery times." Ph.D. thesis, Applied Mathematics and Statistics Dept., State University of New York at Stony Brook.Google Scholar
  151. Sexton, T.; Bodin, L. (1985). "Optimizing single vehicle many-to-many operations with desired delivery times: Part I—scheduling, and Part II—routing." Transportation Science, Vol. 19, No. 4.Google Scholar
  152. Simchi-Levi, D.; Bramel, J. (1990). "On the optimal solution value of the capacitated vehicle routing problem with unsplit demands." Working paper, Department of Industrial Engineering and Operations Research, Columbia University, New York, New York.Google Scholar
  153. Simchi-Levi, D.; Bramel, J. (1990). "Probabilistic analysis of heuristics for the capacitated vehicle routing problem with unsplit demands." Working paper, Department of Industrial Engineering and Operations Research, Columbia University, New York, New York.Google Scholar
  154. Solomon, M. M; Desrosiers, J. (1988). "Time window constrained routing and scheduling problems." Transportation Science, Vol. 22, No. 1, pp. 1–13.MathSciNetMATHGoogle Scholar
  155. Taillard, E.; Badelau, P.; Gendreau, M.; Guertin, F.; Potvin, J.Y. (1996) "A tabu search heuristic for the vehicle routing problem with soft time windows" Publication CRT-95-66, Centre de Recherche sur les Transports, Universite de Montreal, Montreal, Canada.Google Scholar
  156. Teodorovic, D.; Kikuchi, S. (1989). "Application of fuzzy sets theory to the savings based vehicle routing algorithm." Working paper, Civil Engineering Department, University of Delaware, Newark, Delaware.Google Scholar
  157. Thangiah, S. R.; Potvin, J.-Y.; Sun, T. (1996). "Heuristic approaches to vehicle routing with backhauls and time windows." Computers & Operations Research, Vol. 23, No. 11, pp. 1043–1057.CrossRefMATHGoogle Scholar
  158. Toth, P.; Vigo, D. (1995) "A heuristic algorithm for the vehicle routing problem with backhauls" Working paper, Dipartmento di Electtronica Informatica e Sistemistica, Universita degli Studi di Bologna, Italy.Google Scholar
  159. Wei, H.; Li, Q.; Kurt, C.E. (1998). "Heuristic-optimization models for service-request vehicle routing with time windows in a GIS environment." Working paper, Transportation Center, The University of Kansas, Lawrence, Kansas.Google Scholar
  160. Wiley, V. D.; Chan, Y. (1995) "A look at the vehicle routing problem with multiple depots and the windows." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  161. Yan, S.; Yang, Hwei-Fwa (1995) "Multiple fleet routing and flight scheduling" Transportation Planning Journal, Vol. 24, pp. 195–220 Institute of Transportation, Taiwan. (in Chinese).Google Scholar
  162. Ahituv, N.; Berman, O. (1988). Operations Management of Distributed Service Networks: A practical quantitative approach, Plenum Press.Google Scholar
  163. Batta, R.; Berman, O. (1989). "Allocation model for a facility operating as an M/G/k queue." Networks, Vol. 19, pp. 717–728.MathSciNetMATHGoogle Scholar
  164. Batta, R.; Larson, R.; Odoni, A. (1988). "A single-server priority queuing-location model." Networks, Vol. 8, pp. 87–103.MathSciNetGoogle Scholar
  165. Berman, O.; Chiu, S. S.; Larson, R. C; Odoni, A. R.; Batta, R. (1990). "Location of mobile units in a stochastic environment." in Discrete Location Theory (Edited by P. Mirchandani and R. Francis), Wiley-Interscience, New York, New York.Google Scholar
  166. Berman, O.; Krass, D. (2001). “Facility location problems with stochastic demands and congestion.” Working Paper, Rotman School of Management, University of Toronto, Toronto, Canada.Google Scholar
  167. Berman, O.; Larson, R.; Parkan, C. (1987). "The stochastic queue p-median problem." Transportation Science, Vol. 21, pp. 207–216.MathSciNetMATHGoogle Scholar
  168. Berman, O.; Larson, R. (1985). "Optimal 2-facility network districting in the presence of queuing." Transportation Science, Vol. 19, pp. 261–277.MathSciNetMATHGoogle Scholar
  169. Berman, O.; Larson, R.; Chiu, S. (1985). "Optimal server location on a network operating as an M/G/l queue." Operations Research, Vol. 33, pp. 746–771.MathSciNetMATHGoogle Scholar
  170. Berman, O.; Rahnama, M. (1985). "Optimal location-relocation decisions on stochastic Networks." Transportation Science, Vol. 19, pp. 203–221.MATHGoogle Scholar
  171. Berman, O.; LeBlanc, B. (1984). "Location-relocation of mobile facilities on a stochastic network." Transportation Science, Vol. 18, pp. 315–330.MathSciNetGoogle Scholar
  172. Berman, O.; Odoni, A. (1982). "Locating mobile servers on a network with Markovian properties." Networks, Vol. 12, pp. 73–86.MathSciNetMATHGoogle Scholar
  173. Brandeau, M. L.; Chiu, S. S. (1990). "A unified family of single-server queuing location models." Operations Research, Vol. 38, No. 6, pp. 1034–1044.MathSciNetMATHGoogle Scholar
  174. Brandeau, M. L.; Chiu, S. S. (1990). "Trajectory analysis of the stochastic queue median in a plane with rectilinear distances." Transportation Science, Vol. 24, No. 3, pp. 230–243.MathSciNetMATHGoogle Scholar
  175. Brimberg, J.; Mehrez, A. (1993) "Location/allocation of queuing facilities in continuous space using a minisum criterion and arbitrary distance function" Working paper, Department of Engineering Management, Royal Military College of Canada, Kingston, Ontario, Canada.Google Scholar
  176. Brotcore, L.; Laporte, G.; Semet, F. (2003). “Ambulance location and relocation models.” European Journal of Operational Research, Vol. 147, pp. 451–463.CrossRefMathSciNetGoogle Scholar
  177. Chiu, S.; Berman, O.; Larson, R. (1985). "Locating a mobile server queuing facility on a tree network." Transportation Science, Vol. 31, pp. 764–773.MathSciNetMATHGoogle Scholar
  178. Chiu, S.; Larson, R. (1985). "Locating an n-server facility in a stochastic environment." Computers and Operations Research, Vol. 12, pp. 509–516.CrossRefMATHGoogle Scholar
  179. Gendreau, M.; Laporte, G.; Semet, F. (1997). "Solving an ambulance location model by tabu search." Location Science, Vol. 5, No. 2, pp. 75–88.CrossRefMATHGoogle Scholar
  180. Horton, D.; Chan, Y. (1993) "Service facility location in a stochastic demand service model" Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  181. Irish, T.; May, T.; Chan, Y. (1995) "A stochastic facility relocation problem" Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  182. Jamil, M.; Baveja, A.; Batta, R. (1999). "The stochastic queue center problem." Computers & Operations Research, Vol. 26, pp. 1423–1436.CrossRefMathSciNetMATHGoogle Scholar
  183. Louveaux, F. (1986). "Discrete stochastic location models." Annals of Operations Research, Vol. 6, pp. 23–34.CrossRefGoogle Scholar
  184. Mirchandani, P. B. (1975). "Analysis of stochastic Networks in emergency service systems." Technical Report IRP-TR-15-75, MIT Operations Research Center, Cambridge, Massachusetts.Google Scholar
  185. Mirchandani, P. B.; Odoni, A. R. (1979). "Location of medians on stochastic networks." Transportation Science, Vol. 13, pp. 85–97.MathSciNetGoogle Scholar
  186. Mohan, R.; Chan, Y. (1993) "Combat rescue forward operating locations: a stochastic facility location problem" Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  187. Odoni, A. (1987). "Stochastic facility location problems." in Stochastics in combinatorial optimization (G. Andreatta and F. Mason, editors), World Scientific, New Jersey.Google Scholar
  188. Sosebee, B.; Chan, Y. (1993) "Air defense alert facility location in a theater of operations" Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  189. Weaver, J.; Church, R. (1983). "Computational procedures for location problems on stochastic networks." Transportation Science, Vol. 17, No. 2, pp. 168–180.Google Scholar
  190. Anstreicher, K. M. (1999). "Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem." Working paper, Department of Management Sciences, University of Iowa, Iowa City, Iowa.Google Scholar
  191. Balakrishnan, J.; Cheng, C. H. (1998). "Dynamic layout algorithms: a state-of-the-art survey." Omega, Vol. 26, No. 4, pp. 507–521.CrossRefGoogle Scholar
  192. Bartholdi, J.; Platzman, L. (1988). "Heuristics based on spacefilling curves for combinatorial problems in Euclidean space." Management Science, Vol. 34, pp. 291–305.MathSciNetMATHGoogle Scholar
  193. Bazaraa, M. S.; Jarvis, J. J.; Sherali, H. D. (1990). Linear Programming and Network Flows, Second Edition, Wiley, New York, New York.MATHGoogle Scholar
  194. Beckmann, M. J. (1987) "The economic activity equilibrium approach in location theory" in Urban Systems: Contemporary Approaches to Modelling (Edited by C. S. Bertuglia, G. Leonardi, S. Occelli, G. A. Rabino, R. Tadei, and A. G. Wilson) Croom Helm, United Kingdom.Google Scholar
  195. Berlin, G. N.; Revelle, C. S.; Elizinga, D. J. (1976). "Determining ambulance-hospital locations for on-scene & hospital services." Environment & Planning, Vol. 8, pp. 553–561.Google Scholar
  196. Bertsimas, D. J. (1988). "Probabilistic combinatorial optimization problems." Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts.Google Scholar
  197. Bodin, L. D. (1990). "Twenty years of routing and scheduling." OR Forum, Operations Research, Vol. 38, No. 4, pp. 571–579.MathSciNetGoogle Scholar
  198. Bodin, L. D.; Golden, B. L.; Assad, A. A.; Ball, M. O. (1983). "Routing and scheduling of vehicles and crews: the state of the art" Special Issue, Computers and Operations Research, Vol. 10, No. 2.Google Scholar
  199. Cela, E. (1998). The Quadratic Assignment Problem: Theory and Algorithms, Kluwer, Norwell, Massachusetts.MATHGoogle Scholar
  200. Charnes, A.; Cooper, W. W.; Rhodes, E. (1978) "Measuring the efficiency of decision making units" European Journal of Operational Research, Vol. 2, pp. 429–444.CrossRefMathSciNetMATHGoogle Scholar
  201. Combs, T.; Cartlin, A.; Chan, Y. (1996) "The Quadratic Assignment Problem." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  202. Desrosiers, J.; Dumas, Y.; Solomon, M. M.; Soumis, F. (1992) "Time constrained routing and scheduling" forthcoming in Handbooks in Operations Research and Management Science: Networks, North-Holland, Amsterdam, Netherlands.Google Scholar
  203. Evans, J. R.; Minieka, E. (1992). Optimization Algorithms for Networks and Graphs, Second Edition, Dekker.Google Scholar
  204. Fuller, W. (1987) Measurement Error Models, Wiley, New York, New York.MATHGoogle Scholar
  205. Hahn, P.; Grant, T. (1998). "Lower bounds for the quadratic assignment problem based upon a dual formulation." Operations Research, Vol. 46, No. 6, pp. 912–922.MathSciNetMATHGoogle Scholar
  206. Hargrave, W.; Nemhauser, G. (1962). "On the relation between the travelling salesmen problem and the longest path problem." Operations Research, Vol. 10, pp. 647–657.MathSciNetGoogle Scholar
  207. Jaillet, P. (1991). "Rates of convergence for quasi-additive smooth Euclidean functionals and application to combinatorial optimization problems." to appear in Mathematics of Operations Research.Google Scholar
  208. Jaillet, P. (1990). "Cube versus Torus models for combinatorial optimization problems and the Euclidean minimum spanning tree constant." Working paper, Department of Management Science and Information Systems, University of Texas at Austin, Austin, Texas.Google Scholar
  209. Love, R. F.; Morris, J. G.; Wesolowsky, G. O. (1988). Facilities Location: Models and Methods, North-Holland, New York, New York.MATHGoogle Scholar
  210. Mathaisel, D. F. X. (1996). "Decision support for airline system operations control and irregular operations." Computers & Operations Research, Vol. 23, No. 11, pp. 1083–1098.CrossRefMATHGoogle Scholar
  211. Mavridou, T. D.; Pardalos, P. M. (1997). "Simulated annealing and genetic algorithms for the faility layout problem: A survey." Computational Optimization and Applications, Vol. 7, pp. 111–126.CrossRefMathSciNetMATHGoogle Scholar
  212. Meller, R. D.; Narayanan, V.; Vance, P. H. (1999). "Optimal facility layout design." Operations Research Letters, Vol. 23, pp. 117–127.CrossRefMathSciNetGoogle Scholar
  213. Moore, K. R.; Chan, Y. (1990). "Integrated location-and-routing models—part I: model examples." Working paper, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, Ohio.Google Scholar
  214. Parker, R. G.; Rardin, R. L. (1988). Discrete Optimization, Academic Press.Google Scholar
  215. Phillips, K. J.; Beltrami, E. J.; Carroll, T. O.; Kellog, S. R. (1982). "Optimization of areawide wastewater management." Journal WPCF, Vol. 54, No. 1, pp. 87–93.Google Scholar
  216. Teodorovic, D.; Kikuchi, S.; Hohlacov, D. (1990). "A routing and scheduling method in considering trade-off between user's and operator's objectives." Working paper, Faculty of Transport and Traffic Engineering, University of Belgrade, Vojvode stepe 305, 11000 Belgrade, Yugoslavia.Google Scholar
  217. Toregas, C; Swain, R.; Revelle, C; Bergman, L. (1972). "The location of emergency service facilities." Operations Research, Vol. 20, pp. 1363–1373.Google Scholar
  218. Yaman, R.; Balibek, E. (1999). "Decision making for facility layout problem solutions." Computers & Industrial Engineering, Vol. 37, pp. 319–322.CrossRefGoogle Scholar
  219. Zhou, J.; Liu, B. (2003). “New stochastic models for capacitated location-allocation problem.” Computers ⇐p Industrial Engineering, Vol. 45, pp. 111–125.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Personalised recommendations