A comparative performance analysis of evolutionary algorithms on \(k\)-median and facility location problems
From MaRDI portal
Publication:1626279
DOI10.1007/S00500-018-3462-9zbMath1402.90216OpenAlexW2886457509MaRDI QIDQ1626279
Rong Zhu, Lei Lin, Xue Peng, Xiaoyun Xia, Huimin Gao, Pei He
Publication date: 27 November 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-018-3462-9
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Unnamed Item
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing different variants of immune inspired somatic contiguous hypermutations
- On the effectiveness of immune inspired mutation operators in some discrete optimization problems
- A comparative runtime analysis of heuristic algorithms for satisfiability problems
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Runtime analysis of the \((1+1)\) EA on computing unique input output sequences
- On the analysis of the \((1+1)\) evolutionary algorithm
- Design and theoretical analysis of virtual machine placement algorithm based on peak workload characteristics
- Model approach to grammatical evolution: deep-structured analyzing of model and representation
- Location-Allocation Problems
- Analysis of a Local Search Heuristic for Facility Location Problems
- Local search heuristic for k-median and facility location problems
- Computing and Combinatorics
This page was built for publication: A comparative performance analysis of evolutionary algorithms on \(k\)-median and facility location problems
