Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 4628501, 9 pages
https://doi.org/10.1155/2017/4628501
Research Article

Location of Facility Based on Simulated Annealing and “ZKW” Algorithms

1College of Information Science and Technology, Jinan University, Tianhe, Guangzhou 510632, China
2Big Data Decision Institute, Jinan University, Tianhe, Guangzhou 510632, China
3Institute of Fundamental and Frontier Science, University of Electronic Science and Technology of China, Chengdu 610054, China
4School of Computer and Information Science, Southwest University, Chongqing 400715, China

Correspondence should be addressed to Yong Deng

Received 13 June 2017; Revised 8 August 2017; Accepted 14 August 2017; Published 28 September 2017

Academic Editor: Erik Cuevas

Copyright © 2017 Yukun Dong 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 and C. J. Friedrich, Theory of the Location of Industries, University of Chicago Press, Chicago, Ill, USA, 1962. View at Publisher · View at Google Scholar
  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 Publisher · View at Google Scholar
  3. O. Kariv and S. L. Hakimi, “An algorithmic approach to network location problems. ii: The p-medians,” SIAM Journal on Applied Mathematics, vol. 37, no. 3, pp. 539–560, 1979. View at Publisher · View at Google Scholar · View at MathSciNet
  4. S. H. Owen and M. S. Daskin, “Strategic facility location: a review,” European Journal of Operational Research, vol. 111, no. 3, pp. 423–447, 1998. View at Publisher · View at Google Scholar · View at Scopus
  5. O. Berman, J. Kalcsics, and D. Krass, “On covering location problems on networks with edge demand,” Computers and Operations Research, vol. 74, pp. 214–227, 2016. View at Publisher · View at Google Scholar · View at Scopus
  6. O. Berman, I. Hajizadeh, and D. Krass, “The maximum covering problem with travel time uncertainty,” IIE Transactions (Institute of Industrial Engineers), vol. 45, no. 1, pp. 81–96, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. I. Averbakh, O. Berman, D. Krass, J. Kalcsics, and S. Nickel, “Cooperative covering problems on networks,” Networks. An International Journal, vol. 63, no. 4, pp. 334–349, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. S. M. Hedetniemi, E. J. Cockayne, and S. . Hedetniemi, “Linear algorithms for finding the Jordan center and path center of a tree,” Operations Research Society of America. Transportation Science Section. Transportation Science, vol. 15, no. 2, pp. 98–114, 1981. View at Publisher · View at Google Scholar · View at MathSciNet
  9. J. Brimberg, N. Mladenović, R. Todosijević, and D. Urošević, “General variable neighborhood search for the uncapacitated single allocation p-hub center problem,” Optimization Letters, vol. 11, no. 2, pp. 377–388, 2017. View at Publisher · View at Google Scholar · View at Scopus
  10. O. Berman, N. Sanajian, and J. Wang, “Location choice and risk attitude of a decision maker,” Omega (United Kingdom), vol. 66, pp. 170–181, 2017. View at Publisher · View at Google Scholar · View at Scopus
  11. A. M. Geoffrion and G. W. Graves, “Multicommodity distribution system design by benders decomposition,” Management Science, vol. 20, no. 5, pp. 822–844, 1974. View at Publisher · View at Google Scholar · View at Scopus
  12. H. Pirkul and V. Jayaraman, “A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution,” Computers & Operations Research, vol. 25, no. 10, pp. 869–878, 1998. View at Publisher · View at Google Scholar · View at Scopus
  13. Z. Drezner and G. O. Wesolowsky, “Facility location when demand is time dependent,” Naval Research Logistics, vol. 38, no. 5, pp. 763–777, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  14. W. Takahagi, Y. Sumitani, H. Takahashi, Y. Omae, and K. Sakai, “Method of determining future facility location with maintaining present accessibility,” Industrial Engineering and Management Systems, vol. 15, no. 3, pp. 197–205, 2016. View at Publisher · View at Google Scholar · View at Scopus
  15. C. S. Revelle and G. Laporte, “The plant location problem: new models and research prospects,” Operations Research, vol. 44, no. 6, pp. 864–874, 1996. View at Publisher · View at Google Scholar · View at Scopus
  16. C. Araz, H. Selim, and I. Ozkarahan, “A fuzzy multi-objective covering-based vehicle location model for emergency services,” Computers and Operations Research, vol. 34, no. 3, pp. 705–726, 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. A. Ghodratnama, R. Tavakkoli-Moghaddam, and A. Azaron, “Robust and fuzzy goal programming optimization approaches for a novel multi-objective hub location-allocation problem: a supply chain overview,” Applied Soft Computing Journal, vol. 37, pp. 255–276, 2015. View at Publisher · View at Google Scholar · View at Scopus
  18. T. Drezner, Z. Drezner, and P. J. Kalczynski, “The multiple markets competitive location problem,” Kybernetes. The International Journal of Cybernetics, Systems and Management Sciences, vol. 45, no. 6, pp. 854–865, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. Y. Zhang, L. V. Snyder, T. K. Ralphs, and Z. Xue, “The competitive facility location problem under disruption risks,” Transportation Research Part E: Logistics and Transportation Review, vol. 93, pp. 453–473, 2016. View at Publisher · View at Google Scholar · View at Scopus
  20. Y. Du, X. Lu, X. Su, Y. Hu, and Y. Deng, “New failure mode and effects analysis: an evidential downscaling method,” Quality and Reliability Engineering International, vol. 32, no. 2, pp. 737–746, 2016. View at Publisher · View at Google Scholar · View at Scopus
  21. R. Zhang, X. Ran, C. Wang, and Y. Deng, “Fuzzy evaluation of network vulnerability,” Quality and Reliability Engineering International, vol. 32, no. 5, pp. 1715–1730, 2016. View at Publisher · View at Google Scholar · View at Scopus
  22. J. G. Klincewicz, “A dual algorithm for the uncapacitated hub location problem,” Location Science, vol. 4, no. 3, pp. 173–184, 1996. View at Publisher · View at Google Scholar · View at Scopus
  23. A. T. Ernst and M. Krishnamoorthy, “An exact solution approach based on shortest-paths for p-hub median problems,” INFORMS Journal on Computing, vol. 10, no. 2, pp. 149–162, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  24. D. Valinsky, “Symposium on applications of operations research to urban services—a determination of the optimum location of fire-fighting units in New York City,” Journal of the Operations Research Society of America, vol. 3, no. 4, pp. 494–512, 1955. View at Publisher · View at Google Scholar
  25. R. C. Larson, “A hypercube queuing model for facility location and redistricting in urban emergency services,” Computers & Operations Research, vol. 1, no. 1, pp. 67–95, 1974. View at Publisher · View at Google Scholar · View at Scopus
  26. Z. Drezner, V. Marianov, and G. O. Wesolowsky, “Maximizing the minimum cover probability by emergency facilities,” Annals of Operations Research, vol. 246, no. 1-2, pp. 349–362, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. A. Ahmadi-Javid, P. Seyedi, and S. S. Syam, “A survey of healthcare facility location,” Computers and Operations Research, vol. 79, pp. 223–263, 2017. View at Publisher · View at Google Scholar · View at Scopus
  28. D. R. Dott, S. C. Wirasinghe, and A. Chakma, “Optimal hub location in pipeline networks,” in Proceedings of the 1996 1st International Pipeline Conference, IPC. Part 1 (of 2), pp. 79–83, June 1996. View at Scopus
  29. F. ÇEbi and İ. Otay, “Multi-Criteria and Multi-Stage Facility Location Selection under Interval Type-2 Fuzzy Environment: A Case Study for a Cement Factory,” International Journal of Computational Intelligence Systems, vol. 8, no. 2, pp. 330–344, 2015. View at Publisher · View at Google Scholar · View at Scopus
  30. R. Tavakkoli-Moghaddam, S. Sadri, N. Pourmohammad-Zia, and M. Mohammadi, “A hybrid fuzzy approach for the closed-loop supply chain network design under uncertainty,” Journal of Intelligent and Fuzzy Systems, vol. 28, no. 6, pp. 2811–2826, 2015. View at Publisher · View at Google Scholar · View at Scopus
  31. X. Zhang, A. Adamatzky, X.-S. Yang, H. Yang, S. Mahadevan, and Y. Deng, “A Physarum-inspired approach to supply chain network design,” Science China. Information Sciences, vol. 59, no. 5, Article ID 052203, 052203, 14 pages, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. M. Eskandarpour, P. Dejax, and O. Péton, “A large neighborhood search heuristic for supply chain network design,” Computers and Operations Research, vol. 80, pp. 23–37, 2017. View at Publisher · View at Google Scholar · View at Scopus
  33. J. Liu, F. Lian, and M. Mallick, “Distributed compressed sensing based joint detection and tracking for multistatic radar system,” Information Sciences. An International Journal, vol. 369, pp. 100–118, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. S. Kirkpatrick, J. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” American Association for the Advancement of Science. Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  35. S. Kirkpatrick, “Optimization by simulated annealing: quantitative studies,” Journal of Statistical Physics, vol. 34, no. 5-6, pp. 975–986, 1984. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. P. Carnevali, L. Coletti, and S. Patarnello, “Image processing by simulated annealing,” Journal of Research and Development, vol. 29, no. 6, pp. 569–579, 1985. View at Publisher · View at Google Scholar · View at Scopus
  37. M. Zhao, X. Yin, and H. Yue, “Genetic simulated annealing-based kernel vector quantization algorithm,” International Journal of Pattern Recognition and Artificial Intelligence, vol. 31, no. 5, Article ID 1758002, 2017. View at Publisher · View at Google Scholar · View at Scopus
  38. I. H. Osman, “Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,” Annals of Operations Research, vol. 41, no. 4, pp. 421–451, 1993. View at Publisher · View at Google Scholar · View at Scopus
  39. V. F. Yu, A. A. N. P. Redi, Y. A. Hidayat, and O. J. Wibowo, “A simulated annealing heuristic for the hybrid vehicle routing problem,” Applied Soft Computing Journal, vol. 53, pp. 119–132, 2017. View at Publisher · View at Google Scholar · View at Scopus
  40. T. Loukil, J. Teghem, and P. Fortemps, “A multi-objective production scheduling case study solved by simulated annealing,” European Journal of Operational Research, vol. 179, no. 3, pp. 709–722, 2007. View at Publisher · View at Google Scholar · View at Scopus
  41. L. M. R. Rere, M. I. Fanany, and A. M. Arymurthy, “Simulated annealing algorithm for deep learning,” Procedia Computer Science, vol. 72, pp. 137–144, 2015. View at Publisher · View at Google Scholar
  42. ZKW, “From point to cover: The minimum cost flow, ZKW algorithm,” https://artofproblemsolving.com/community/c1368h1020435.
  43. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  44. R. W. Floyd, “Algorithm 97: shortest path,” Communications of the ACM, vol. 5, no. 6, p. 345, 1962. View at Publisher · View at Google Scholar
  45. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of state calculations by fast computing machines,” The Journal of Chemical Physics, vol. 21, no. 6, pp. 1087–1092, 1953. View at Publisher · View at Google Scholar · View at Scopus
  46. H. W. Kuhn, “The Hungarian method for the assignment problem,” Naval Research Logistics Quarterly, vol. 2, pp. 83–97, 1955. View at Publisher · View at Google Scholar · View at MathSciNet
  47. H. W. Kuhn, “Variants of the Hungarian method for assignment problems,” Naval Research Logistics Quarterly, vol. 3, pp. 253–258 (1957), 1956. View at Publisher · View at Google Scholar · View at MathSciNet
  48. J. Munkres, “Algorithms for the assignment and transportation problems,” Journal of the Society for Industrial and Applied Mathematics, vol. 5, no. 1, pp. 32–38, 1957. View at Publisher · View at Google Scholar · View at MathSciNet
  49. HUAWEI, “Code craft,” http://codecraft.huawei.com/.
  50. H. Zhang, D. Wei, Y. Hu, X. Lan, and Y. Deng, “Modeling the self-similarity in complex networks based on Coulomb's law,” Communications in Nonlinear Science and Numerical Simulation, vol. 35, pp. 97–104, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  51. W. Jiang, B. Wei, J. Zhan, C. Xie, and D. Zhou, “A visibility graph power averaging aggregation operator: a methodology based on network analysis,” Computers Industrial Engineering, vol. 101, pp. 260–268, 2016. View at Publisher · View at Google Scholar
  52. W. Jiang, B. Wei, Y. Tang, and D. Zhou, “Ordered visibility graph average aggregation operator: an application in produced water management,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 27, no. 2, p. 023117, 2017. View at Publisher · View at Google Scholar
  53. Y. Hu, F. Du, and H. L. Zhang, “Investigation of unsteady aerodynamics effects in cycloidal rotor using RANS solver,” Aeronautical Journal, vol. 120, no. 1228, pp. 956–970, 2016. View at Publisher · View at Google Scholar · View at Scopus
  54. S. Wang, Y. Du, and Y. Deng, “A new measure of identifying influential nodes: efficiency centrality,” Communications in Nonlinear Science and Numerical Simulation, vol. 47, pp. 151–163, 2017. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  55. P. Amorim, E. Curcio, B. Almada-Lobo, A. P. Barbosa-Póvoa, and I. E. Grossmann, “Supplier selection in the processed food industry under uncertainty,” European Journal of Operational Research, vol. 252, no. 3, pp. 801–814, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  56. X. Zhang, Y. Deng, F. T. S. Chan, P. Xu, S. Mahadevan, and Y. Hu, “IFSJSP: a novel methodology for the Job-Shop Scheduling Problem based on intuitionistic fuzzy sets,” International Journal of Production Research, vol. 51, no. 17, pp. 5100–5119, 2013. View at Publisher · View at Google Scholar · View at Scopus
  57. H. Zheng, Y. Deng, and Y. Hu, “Fuzzy evidential influence diagram and its evaluation algorithm,” Knowledge-Based Systems, vol. 131, pp. 28–45, 2017. View at Publisher · View at Google Scholar
  58. H. Akyar, “Fuzzy risk analysis for a production system based on the Nagel point of a triangle,” Mathematical Problems in Engineering, Article ID 3080679, Art. ID 3080679, 9 pages, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  59. W. Jiang and J. Zhan, “A modified combination rule in generalized evidence theory,” Applied Intelligence, vol. 46, no. 3, pp. 630–640, 2017. View at Publisher · View at Google Scholar · View at Scopus
  60. X. Zhou, X. Deng, Y. Deng, and S. Mahadevan, “Dependence assessment in human reliability analysis based on D numbers and AHP,” Nuclear Engineering and Design, vol. 313, pp. 243–252, 2017. View at Publisher · View at Google Scholar · View at Scopus
  61. X. Zhou, Y. Shi, X. Deng, and Y. Deng, “D-DEMATEL: A new method to identify critical success factors in emergency management,” Safety Science, vol. 91, pp. 93–104, 2017. View at Publisher · View at Google Scholar · View at Scopus
  62. H. Mo and Y. Deng, “A new aggregating operator for linguistic information based on D numbers,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 24, no. 6, pp. 831–846, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  63. X. Zhang, Y. Deng, F. T. Chan, and S. Mahadevan, “A fuzzy extended analytic network process-based approach for global supplier selection,” Applied Intelligence, vol. 43, no. 4, pp. 760–772, 2015. View at Publisher · View at Google Scholar
  64. X. Zhang, Y. Deng, F. T. Chan, A. Adamatzky, and S. Mahadevan, “Supplier selection based on evidence theory and analytic network process,” Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2015. View at Publisher · View at Google Scholar
  65. M. Lundy and A. Mees, “Convergence of an annealing algorithm,” Mathematical Programming, vol. 34, no. 1, pp. 111–124, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus