Location of facility based on simulated annealing and ``ZKW'' algorithms
type: Item
instance of: scholarly article
title: Location of facility based on simulated annealing and ``ZKW'' algorithms
zbMATH Open document ID: 1426.90177
DOI: 10.1155/2017/4628501
author: Yukun Dong
author: Jinyu Wang
author: Fenghua Chen
author: Yong Hu
author: Yong Deng
published in: Mathematical Problems in Engineering
publication date: 2018-11-05T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6972119
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2017/4628501
OpenAlex ID: W2756795579
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Strategic facility location: A review
cites work: On covering location problems on networks with edge demand
cites work: Cooperative covering problems on networks
cites work: General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
cites work: Q3987788
cites work: The Plant Location Problem: New Models and Research Prospects
cites work: A fuzzy multi-objective covering-based vehicle location model for emergency services
cites work: The multiple markets competitive location problem
cites work: A dual algorithm for the uncapacitated hub location problem
cites work: An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
cites work: Maximizing the minimum cover probability by emergency facilities
cites work: A survey of healthcare facility location
cites work: A large neighborhood search heuristic for supply chain network design
cites work: Distributed compressed sensing based joint detection and tracking for multistatic radar system
cites work: Optimization by Simulated Annealing
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: A multi-objective production scheduling case study solved by simulated annealing
cites work: A note on two problems in connexion with graphs
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Q5519710
cites work: Q5519711
cites work: Algorithms for the Assignment and Transportation Problems
cites work: A new measure of identifying influential nodes: efficiency centrality
cites work: Supplier selection in the processed food industry under uncertainty
cites work: Fuzzy risk analysis for a production system based on the Nagel point of a triangle
cites work: A New Aggregating Operator for Linguistic Information Based on D Numbers
cites work: Convergence of an annealing algorithm
Recommended article: A simulated annealing heuristic for the facility location problem
Recommended article: Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
Recommended article: A new simulated annealing algorithm for the facility layout problem
Recommended article: Fuzzy and simulated annealing on site location problems
Recommended article: Simulated annealing heuristics for the dynamic facility layout problem
Recommended article: Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
Recommended article: Simulated annealing and genetic algorithms for the facility layout problem: A survey
Recommended article: Using simulated annealing to solve routing and location problems
description: scientific article; zbMATH DE number 6972119