The mobile facility routing problem

Transportation Science

Volumn 45, Issue 3, 2011, Pages 413-434

  Halper, Russell ^a   Raghavan, S ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Heuristics; Mobile facility location; Vehicle routing

Indexed keywords

CONTINUOUS TIME SYSTEMS; POLYNOMIAL APPROXIMATION; VEHICLE ROUTING;

DISCRETE EVENTS; DISCRETE LOCATION; HEURISTICS; HIGH QUALITY ROUTES; HUMANITARIAN RELIEF; MOBILE FACILITY; PLANNING HORIZONS; ROUTING PROBLEMS;

LOCATION;

EID: 80051924862     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1100.0335     Document Type: Article

References (30)

1. Alexy, B. B., C. A. Elnitsky. 1996. Community outreach: Rural mobile health unit. J. Nursing Admin. 26(12) 38-42. (Pubitemid 26424291)
2. Ballou, R. H. 1968. Dynamic warehouse location analysis. J. Marketing Res. 5(3) 271-276.
3. Bespamyatnikh, S., B. Bhattacharya, D. Kirkpatrick, M. Segal. 2000. Mobile facility location. Proc. 4th Internat. Workshop Discrete Algorithms Methods Mobile Comput. Comm. ACM, New York, 46-53.
4. Brotcorne, L., G. Laporte, F. Semet. 2003. Ambulance location and relocation models. Eur. J. Oper. Res. 147(3) 451-463.
5. Canel, C., B. M. Khumawala, J. Law, A. Loh. 2001. An algorithm for the capacitated, multi-commodity multi-period facility location problem. Comput. Oper. Res. 28(5) 411-427.
6. Church, R. L., D. M. Stoms, F. W. Davis. 1996. Reserve selection as a maximal covering location problem. Biol. Conservation 76(2) 105-112.
7. Current, J. R., D. A. Schilling. 1989. The covering salesman problem. Transportation Sci. 23(3) 208-213.
8. Current, J. R., D. A. Schilling. 1994. The median tour and maximal covering tour problems: Formulations and heuristics. Eur. J. Oper. Res. 73 114-126.
9. Current, J. R., J. E. Storbeck. 1988. Capacitated covering models. Environ. Planning B: Planning Design 15(2) 153-163.
10. Current, J., H. Pirkul, E. Rolland. 1994. Efficient algorithms for solving the shortest covering path problem. Transportation Sci. 28(4) 317-327.
11. Current, J. R., C. ReVelle, J. Cohon. 1984. The shortest covering path problem: An application of locational constraints to network design. J. Regional Sci. 24(2) 161-183.
12. Current, J. R., C. S. ReVelle, J. L. Cohon. 1985. The maximum covering/ shortest path problem: A multiobjective network design and routing formulation. Eur. J. Oper. Res. 21 189-199. (Pubitemid 15541765)
13. Daskin, M. 1995. Network and Discrete Location. John Wiley & Sons, Inc., New York.
14. Durocher, S., D. Kirkpatrick. 2006. The Steiner centre of a set of points: Stability, eccentricity, and applications to mobile facility location. Internat. J. Comput. Geometry Appl. 16(4) 345-371. (Pubitemid 44197493)
15. Erlenkotter, D. 1981. A comparative study of approaches to dynamic location problems. Eur. J. Oper. Res. 6(2) 133-143. (Pubitemid 11466212)
16. Gendreau, M., G. Laporte, F. Semet. 2001. A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput. 27(12) 1641-1653. (Pubitemid 32749951)
17. Ghiani, G., F. Guerriero, G. Laporte, R. Musmanno. 2003. Realtime vehicle routing: Solution concepts, algorithms and parallel computing strategies. Eur. J. Oper. Res. 151(1) 1-11.
18. Hong Kong Post. 2008. Mobile post office locations. Accessed January 21, 2009, http://www.hongkongpost.com/eng/locations/ mobile/index.htm.
19. Jay, M. L. 2006. Katrina leaves wireless industry better prepared for next disaster. http://www.ctia.org/content/index.cfm/AID/ 10410.
20. Karasakal, O., E. K. Karasakal. 2004. A maximal covering location model in the presence of partial coverage. Comput. Oper. Res. 31(9) 1515-1526. (Pubitemid 38427647)
21. Megiddo, N., E. Zemel, S. L. Hakimi. 1983. The maximum coverage location problem. SIAM J. Algebraic Discrete Methods 4(2) 253-261.
22. Mirchandani, P. B., R. L. Francis. 1990. Discrete Location Theory. Wiley-Interscience, New York.
23. Moss, M., B. Alan, J. Farren. 2008. COLTs and COWs to help with cell phone demand. WTOP Radio. Accessed December 10, http://www.wtop.com/?nid= 25&sid=1544462.
24. Pirkul, H., D. A. Schilling. 1991. The maximum covering location problem with capacities on total workload. Management Sci. 37(2) 233-248.
25. United Kingdom Department of Transportation. 2009. Mobile post office. Accessed January 21, 2009, http://www.dft.gov.uk/pgr/ regional/ltp/ accessibility/knowledgepool/aos/mobilepostoffice.
26. Van Roy, T. J., D. Erlenkotter. 1982. A dual-based procedure for dynamic facility location. Management Sci. 28(10) 1091-1105.
27. Wendland, M. 2006. Cell capacity will be super during the big game in Detroit. Detroit Free Press (February 1).
28. Wesolowsky, G. O. 1973. Dynamic facility location. Management Sci. 19(11) 1241-1248.
29. Wesolowsky, G. O., W. G. Truscott. 1975. The multiperiod locationallocation problem with relocation of facilties. Management Sci. 22(1) 57-65.
30. Wilcoxon, F. 1945. Individual comparisons by ranking methods. Biometrics 1 80-83.