首页/论文/2001.05120

arXiv 2001.051202020-01-15cs.NE

Parameterized Complexity Analysis of Randomized Search Heuristics

Frank Neumann, Andrew M. Sutton

备注：: This is a preliminary version of a chapter in the book "Theory of Evolutionary Computation: Recent Developments in Discrete Optimization", edited by Benjamin Doerr and Frank Neumann, published by Springer
DOI：: 10.1007/978-3-030-29414-4_4

英文摘要：

This chapter compiles a number of results that apply the theory of parameterized algorithmics to the running-time analysis of randomized search heuristics such as evolutionary algorithms. The parameterized approach articulates the running time of algorithms solving combinatorial problems in finer detail than traditional approaches from classical complexity theory. We outline the main results and proof techniques for a collection of randomized search heuristics tasked to solve NP-hard combinatorial optimization problems such as finding a minimum vertex cover in a graph, finding a maximum leaf spanning tree in a graph, and the traveling salesperson problem.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Error Analysis of Elitist Randomized Search Heuristics

When globally optimal solutions of complicated optimization problems cannot be located by evolutionary algorithms (EAs) in polynomial expected running time, the hitting time/running time analysis is not flexible enough to accommodate the requirement of theoretical study, because sometimes we have no idea on what approximation ratio is available in polynomial expected running time. Thus, it is necessary to propose an alternative routine for the theoretical analysis of EAs. To bridge the gap between theoretical analysis and algorithm implementation, in this paper we perform an error analysis whe…

2020-11-30cs.NE

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem

We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. The (1+1)~Evolutionary Algorithm and RLS operate in a setting where the number of colors is bounded and we are minimizing the number of conflicts. Iterated local search algorithms use an unbounded color palette and aim to use the smallest colors and, cons…

2021-05-26cs.NE

Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem

Randomized search heuristics such as evolutionary algorithms are frequently applied to dynamic combinatorial optimization problems. Within this paper, we present a dynamic model of the classic Weighted Vertex Cover problem and analyze the runtime performances of the well-studied algorithms Randomized Local Search and (1+1) EA adapted to it, to contribute to the theoretical understanding of evolutionary computing for problems with dynamic changes. In our investigations, we use an edge-based representation based on the dual form of the Linear Programming formulation for the problem and study the…

2020-01-24cs.NE

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics

Several important optimization problems in the area of vehicle routing can be seen as a variant of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the traveling thief problem (TTP) has gained increasing interest over the last 5 years. In this paper, we investigate the effect of weights on such problems, in the sense that the cost of traveling increases with respect to the weights of nodes already visited during a tour. This provides abstractions of important TSP variants such as the Traveling Thief Problem and time dependent TSP variants, and allows …

2020-02-04cs.NE

Exponential Upper Bounds for the Runtime of Randomized Search Heuristics

We argue that proven exponential upper bounds on runtimes, an established area in classic algorithms, are interesting also in heuristic search and we prove several such results. We show that any of the algorithms randomized local search, Metropolis algorithm, simulated annealing, and (1+1) evolutionary algorithm can optimize any pseudo-Boolean weakly monotonic function under a large set of noise assumptions in a runtime that is at most exponential in the problem dimension~$n$. This drastically extends a previous such result, limited to the (1+1) EA, the LeadingOnes function, and one-bit or bit…

2021-10-09cs.NE

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics

This chapter collects several probabilistic tools that proved to be useful in the analysis of randomized search heuristics. This includes classic material like Markov, Chebyshev and Chernoff inequalities, but also lesser known topics like stochastic domination and coupling or Chernoff bounds for geometrically distributed random variables and for negatively correlated random variables. Most of the results presented here have appeared previously, some, however, only in recent conference publications. While the focus is on collecting tools for the analysis of randomized search heuristics, many of…

2021-09-21cs.DMcs.DScs.NE

更多相关论文收起更多论文

More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization

Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that EAs can solve the graph coloring problem for bipartite graphs more efficiently by using dynamic optimization. In our approach the graph instance is given incrementally such that the EA can reoptimize its coloring when a new edge introduces a conflict. We show that, when edges are inserted in a way that preserves graph connectivity, Randomized Local Search (RLS) efficiently finds a proper 2-coloring for all bipartite…

2020-05-28cs.NE

大规模多维背包问题的随机化启发式修复

Randomized heuristic repair for large-scale multidimensional knapsack problem

Ericsson Research（爱立信研究院）

针对大规模多维背包问题，提出基于效率的随机化启发式修复策略，增加修复后解的多样性而不降低质量，从而改善元启发式算法的整体求解结果。

2024-05-24cs.AIcs.NE

基于幂律参数选择与简单贪心启发式的目标集选择问题的优越遗传算法

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics

针对目标集选择问题，提出通过幂律分布随机选择参数并添加丢弃非必要小度顶点的贪心启发式，改进BRKGA算法，使其在无参数调优下优于现有最先进算法。

2024-04-05cs.NE

用于随机搜索启发式算法分析的扩展跳跃函数基准

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics

École Polytechnique, Institut Polytechnique de Paris（巴黎综合理工学院，巴黎理工学院）；Laboratoire d’Informatique (LIX), CNRS, École Polytechnique, Institut Polytechnique de Paris（法国国家科学研究中心信息学实验室（LIX），巴黎综合理工学院，巴黎理工学院）

针对传统跳跃函数基准结构特殊、结果代表性存疑的问题，提出含低适应度谷的扩展跳跃函数类$\textsc{Jump}_{k,δ}$，证明部分进化算法相关结果可推广，也发现部分结果不通用，支持更宽适应度谷的计算实验。

2022-04-28cs.AIcs.NE

The Fitness Level Method with Tail Bounds

The fitness-level method, also called the method of f-based partitions, is an intuitive and widely used technique for the running time analysis of randomized search heuristics. It was originally defined to prove upper and lower bounds on the expected running time. Recently, upper tail bounds were added to the technique; however, these tail bounds only apply to running times that are at least twice as large as the expectation. We remove this restriction and supplement the fitness-level method with sharp tail bounds, including lower tails. As an exemplary application, we prove that the running t…

2013-07-16cs.NE

无界整数空间中多目标进化算法的运行时分析

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces

针对无界整数域随机搜索启发式算法理论分析缺失的问题，本文启动多目标进化算法的运行时分析，研究三种变异强度在自然基准问题上的性能，发现幂律变异在所有参数和起始点上表现良好，建议优先使用。

2024-12-17cs.NE

Collecting Coupons with Random Initial Stake

Motivated by a problem in the theory of randomized search heuristics, we give a very precise analysis for the coupon collector problem where the collector starts with a random set of coupons (chosen uniformly from all sets). We show that the expected number of rounds until we have a coupon of each type is $nH_{n/2} - 1/2 \pm o(1)$, where $H_{n/2}$ denotes the $(n/2)$th harmonic number when $n$ is even, and $H_{n/2}:= (1/2) H_{\lfloor n/2 \rfloor} + (1/2) H_{\lceil n/2 \rceil}$ when $n$ is odd. Consequently, the coupon collector with random initial stake is by half a round faster than the one s…

2013-08-29cs.DMcs.DScs.NE