Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 716534, 11 pages
http://dx.doi.org/10.1155/2013/716534
Research Article

Congestion Service Facilities Location Problem with Promise of Response Time

1School of Management, South-Central University for Nationalities, Wuhan 430074, China
2Department of Automation, Wuhan University, Wuhan 430072, China

Received 19 July 2013; Revised 15 September 2013; Accepted 10 October 2013

Academic Editor: Pui-Sze Chow

Copyright © 2013 Dandan Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Weber, Über den Standort der Industrien, JCB Mohr, 1909.
  2. S. L. Hakimi, “Optimum locations of switching centers and the absolute centers and medians of a graph,” Operations Research, vol. 12, no. 3, pp. 450–459, 1964. View at Google Scholar
  3. C. Toregas, R. Swain, C. ReVelle, and L. Bergman, “The location of emergency service facilities,” Operations Research, vol. 19, no. 6, pp. 1363–1373, 1971. View at Google Scholar
  4. R. Church and C. ReVelle, “The maximal covering location problem,” Papers of the Regional Science Association, vol. 32, no. 1, pp. 101–118, 1974. View at Publisher · View at Google Scholar · View at Scopus
  5. J. Yang and M. Zhang, “Chain stores location problem with bounded linear consumption expansion function on paths,” in Proceedings of the 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM '08), October 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. H. Yu, L. Gao, and Y. Lei, “Model and solution for capacitated facility location problem,” in Proceedings of the 24th Chinese Control and Decision Conference, pp. 1773–1776, 2012.
  7. Y. Ma, L. Li, and J. Yang, “A gravitational facility location problem based on prize-collecting traveling salesman problem,” in Proceedings of the IEEE International Conference on Automation and Logistics, pp. 511–516, 2012.
  8. K. Liu, Y. Zhou, and Z. Zhang, “Capacitated location model with online demand pooling in a multi-channel supply chain,” European Journal of Operational Research, vol. 207, no. 1, pp. 218–231, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. M. S. Daskin, Network and Discrete Location: Models, Algorithms, and Applications, John Wiley & Sons, New York, NY, USA, 2005. View at MathSciNet
  10. C. S. ReVelle, H. A. Eiselt, and M. S. Daskin, “A bibliography for some fundamental problem categories in discrete location science,” European Journal of Operational Research, vol. 184, no. 3, pp. 817–848, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. M. S. Daskin, “A maximum expected covering location model: formulation, properties and heuristic solution,” Transportation Science, vol. 17, no. 1, pp. 48–70, 1983. View at Google Scholar · View at Scopus
  12. V. Marianov and D. Serra, “Probabilistic, maximal covering location-allocation models from congested systems,” Journal of Regional Science, vol. 38, no. 3, pp. 401–424, 1998. View at Google Scholar · View at Scopus
  13. S. Huang, R. Batta, and R. Nagi, “Distribution network design: selection and sizing of congested connections,” Naval Research Logistics, vol. 52, no. 8, pp. 701–712, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. D. Hu, C. Yang, and J. Yang, “Budget constrained flow interception location model for congested systems,” Journal of Systems Engineering and Electronics, vol. 20, no. 6, pp. 1255–1262, 2009. View at Google Scholar · View at Scopus
  15. T. Drezner and Z. Drezner, “The gravity multiple server location problem,” Computers & Operations Research, vol. 38, no. 3, pp. 694–701, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. R. D. Galvão, L. G. A. Espejo, B. Boffey, and D. Yates, “Load balancing and capacity constraints in a hierarchical location model,” European Journal of Operational Research, vol. 172, no. 2, pp. 631–646, 2006. View at Publisher · View at Google Scholar · View at Scopus
  17. H. K. Rajagopalan and C. Saydam, “A minimum expected response model: formulation, heuristic solution, and application,” Socio-Economic Planning Sciences, vol. 43, no. 4, pp. 253–262, 2009. View at Publisher · View at Google Scholar · View at Scopus
  18. R. Aboolian, O. Berman, and Z. Drezner, “The multiple server center location problem,” Annals of Operations Research, vol. 167, pp. 337–352, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. O. Berman and Z. Drezner, “The multiple server location problem,” Journal of the Operational Research Society, vol. 58, no. 1, pp. 91–99, 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. Z. K. Guo, L. S. Chang, J. Yin, and J. F. Liu, “Distribution of waiting time in a class of queuing systems,” Journal of Inner Mongolia University, vol. 39, no. 4, pp. 375–379, 2008. View at Google Scholar · View at MathSciNet
  21. A. Jagers and E. Van Doorn, “Convexity of functions which are generalizations of the erlang loss function and the erlang delay function,” SIAM Review, vol. 33, no. 2, pp. 281–282, 1991. View at Google Scholar
  22. K. Holmberg, “Exact solution methods for uncapacitated location problems with convex transportation costs,” European Journal of Operational Research, vol. 114, no. 1, pp. 127–140, 1999. View at Google Scholar · View at Scopus
  23. M. Sasaki, T. Furuta, and A. Suzuki, “Exact optimal solutions of the minisum facility and transfer points location problems on a network,” International Transactions in Operational Research, vol. 15, no. 3, pp. 295–306, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. R. S. de Camargo, G. Miranda Jr., and H. P. Luna, “Benders decomposition for the uncapacitated multiple allocation hub location problem,” Computers and Operations Research, vol. 35, no. 4, pp. 1047–1064, 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. Y. Wang and Z. Cai, “A dynamic hybrid framework for constrained evolutionary optimization,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 42, no. 1, pp. 203–217, 2012. View at Publisher · View at Google Scholar · View at Scopus
  26. V. Maniezzo, T. Stèutzle, and S. Voss, Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, vol. 10, Springer, 2009.
  27. R. A. Whitaker, “A fast algorithm for the greedy interchange for large-scale clustering and median location problems,” INFOR Journal, vol. 21, no. 2, pp. 95–108, 1983. View at Google Scholar · View at Scopus
  28. S. Guha and S. Khuller, “Greedy strikes back: improved facility location algorithms,” in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 649–657, Society for Industrial and Applied Mathematics, New York, NY, USA, 1998. View at MathSciNet
  29. K. Jain, M. Mahdian, and A. Saberi, “A new greedy approach for facility location problems,” in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 731–740, ACM, New York, NY, USA, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  30. G. Cornuejols and J. M. Thizy, “Location problems, set covering problems and the greedy algorithm,” Working Paper 25-80-81, Graduate School of Industrial Administration, Carnegie-Mellon University, 1981, Available as Working Paper 02-51, School of Management, University of Ottawa, 2002. View at Google Scholar
  31. C. M. Hosage and M. F. Goodchild, “Discrete space location-allocation solutions from genetic algorithms,” Annals of Operations Research, vol. 6, no. 2, pp. 35–46, 1986. View at Publisher · View at Google Scholar · View at Scopus
  32. E. S. Correa, M. T. A. Steiner, A. A. Freitas, and C. Carnieri, “A genetic algorithm for solving a capacitated p-median problem,” Numerical Algorithms, vol. 35, no. 2–4, pp. 373–388, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  33. J. H. Jaramillo, J. Bhadury, and R. Batta, “On the use of genetic algorithms to solve location problems,” Computers & Operations Research, vol. 29, no. 6, pp. 761–779, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  34. J. Balakrishnan, C. H. Cheng, D. G. Conway, and C. M. Lau, “A hybrid genetic algorithm for the dynamic plant layout problem,” International Journal of Production Economics, vol. 86, no. 2, pp. 107–120, 2003. View at Publisher · View at Google Scholar · View at Scopus
  35. H. Shavandi and H. Mahlooji, “A fuzzy queuing location model with a genetic algorithm for congested systems,” Applied Mathematics and Computation, vol. 181, no. 1, pp. 440–456, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet