Location of Facility Based on Simulated Annealing and "ZKW" Algorithms

29Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

To cope with the facility location problem, a method based on simulated annealing and "ZKW" algorithm is proposed in this article. The method is applied to some real cases, which aims to deploy video content server at appropriate nodes in an undirected graph to satisfy the requirements of the consumption nodes with the least cost. Simulated annealing can easily find the optimum with less reliance on the initial solution. "ZKW" algorithm can find the shortest path and calculate the least cost from the server node to consumption node quickly. The results of three kinds of cases illustrate the efficiency of our method, which can obtain the optimum within 90 s. A comparison with Dijkstra and Floyd algorithms shows that, by using "ZKW" algorithm, the method can have large iteration with limited time. Therefore, the proposed method is able to solve this video content server location problem.

Cite

CITATION STYLE

APA

Dong, Y., Wang, J., Chen, F., Hu, Y., & Deng, Y. (2017). Location of Facility Based on Simulated Annealing and “ZKW” Algorithms. Mathematical Problems in Engineering, 2017. https://doi.org/10.1155/2017/4628501

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free