A comparative performance analysis of intelligence-based algorithms for optimizing competitive facility location problems
نویسندگان
چکیده
Most companies operate to maximize profits and increase their market shares in competitive environments. Since the proper location of facilities conditions profits, facility problem (CFLP) has been extensively applied literature. This generally falls within class NP-hard problems, which are difficult solve. Therefore, choosing a solution method optimize is key factor. Even though CFLPs have consistently solved investigated, an important question that keeps being neglected how choose appropriate technique. there no specific criteria for method, reasons behind selection approach mostly unclear. These models using several optimization techniques. As harder-to-solve problems usually meta-heuristics, we apply different meta-heuristic techniques new version CFLP incorporates reliability congestion. We divide algorithms into four categories based on nature meta-heuristics: evolution-based, swarm intelligence-based, physics-based, human-based. GAMS software also solve smaller-size CFLPs. The genetic algorithm differential evolution first category, particle artificial bee colony second, Tabu search harmony third, simulated annealing vibration damping fourth our model. Statistical analyses implemented evaluate compare relative performances. results show third perform better than others.
منابع مشابه
Distributed Approximation Algorithms for Facility Location Problems
In this paper, some distributed approximation algorithms for uncapacitated facility location problem and fault-tolerant facility location problem are summarized, respectively. The worst-case run time of the distributed version of the uncapacitated facility location problem is ( ) O n , where n is the number of network nodes. In addition, the approximation approach for the fault-tolerant facilit...
متن کاملApproximation Algorithms for Facility Location Problems
This paper surveys approximation algorithms for various facility location problems, mostly with detailed proofs. It resulted from lecture notes of a course held at the University of Bonn in the winter term 2004/2005.
متن کاملApproximation algorithms for facility location problems
We present new approximation algorithms for several facility location problems. In each facility location problem that we study, there is a set of locations at which we may build a facility (such as a warehouse), where the cost of building at location i is fi; furthermore, there is a set of client locations (such as stores) that require to be serviced by a facility, and if a client at location ...
متن کاملApproximation Algorithms for Bounded Facility Location Problems
The bounded k-median problem is to select in an undirected graph G = (V, E) a set S of k vertices such that the distance from any vertex v ∈ V to S is at most a given bound d and the average distance from vertices V\S to S is minimized. We present randomized algorithms for several versions of this problem and we prove some inapproximability results. We also study the bounded version of the unca...
متن کاملLP-rounding algorithms for facility-location problems
We study LP-rounding approximation algorithms for metric uncapacitated facility-location problems. We first give a new analysis for the algorithm of Chudak and Shmoys, which differs from the analysis of Byrka and Aardal in that now we do not need any bound based on the solution to the dual LP program. Besides obtaining the optimal bifactor approximation as do Byrka and Aardal, we can now also s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine learning with applications
سال: 2023
ISSN: ['2666-8270']
DOI: https://doi.org/10.1016/j.mlwa.2022.100443