Anton V. Eremeev
YOU?
Author Swipe
On runtime of non-elitist evolutionary algorithms optimizing fitness functions with a plateau Open
The expected runtime of non-elitist evolutionary algorithms (EAs), when they are applied to a family of fitness functions Plateaur on the search space of binary strings of length n is considered asymptotically with unbounded n. The functio…
Fast non-elitist evolutionary algorithms with power-law ranking selection Open
Theoretical evidence suggests that non-elitist evolutionary algorithms (EAs) with non-linear selection mechanisms can efficiently overcome broad classes of local optima where elitist EAs fail. However, the analysis assumes a weak selective…
Experimental Evaluation of Algorithms for Packet Routing in Software Defined Network Open
The packet routing problem in a software defined network is formulated and a greedy algorithm is proposed. An alternative approach to approximately solve this problem by means of reduction to a special case of the fractional length-bounded…
On Local Optima Distribution in Buffer Allocation Problem for Production Line with Unreliable Machines Open
International audience
Differential evolution for directivity optimization of short-wave phased antenna arrays Open
The problem of optimization of the directivity of phased antenna arrays for shortwave radio communication is formulated as a nonconvex quadratic programming problem. Taking into account the specifics of the problem under consideration, a h…
Optimal recombination and adaptive restarts improve GA performance on the asymmetric TSP Open
We propose a new genetic algorithm (GA) with optimal recombination and adaptive restarts for the asymmetric travelling salesman problem (ATSP). The optimal recombination problem (ORP) is solved in a crossover operator based on a new exact …
Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys Open
It is largely unknown how the runtime of evolutionary algorithms depends on fitness landscape characteristics for broad classes of problems. Runtime guarantees for complex and multi-modal problems where EAs are typically applied are rarely…
Escaping Local Optima with Non-Elitist Evolutionary Algorithms Open
Most discrete evolutionary algorithms (EAs) implement elitism, meaning that they make the biologically implausible assumption that the fittest individuals never die. While elitism favours exploitation and ensures that the best seen solutio…
ESTIMATES FROM EVOLUTIONARY ALGORITHMS THEORY APPLIEDTO DIRECTED EVOLUTION Open
The field of evolutionary computation emerged in the area of computer science due to transfer of ideas from biology and developed independently for several decades, enriched with techniques from probability theory, complexity theory and op…
Runtime Analysis of Fitness-Proportionate Selection on Linear Functions Open
This paper extends the runtime analysis of non-elitist evolutionary algorithms (EAs) with fitness-proportionate selection from the simple OneMax function to the linear functions. Not only does our analysis cover a larger class of fitness f…
Applying Principles of Memetics to Solving the Traveling Salesman Problem Open
We consider a population-based algorithm for the asymmetric travelling salesman problem, based on the principles of the memetics. The initial population of tentative solutions is built by means of greedy constructive heuristics. The 3-opt …
THE RESEARCH OF ONE PROBLEM NONCONVEX QUADRATIC PROGRAMMING IN SHORTWAVE ANTENNA ARRAY OPTIMIZATION Open
Институт математики им.С.Л.Соболева (филиал) СО РАН
On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths Open
The paper presents a comparison between three approaches to solving the length-bounded maximum multicommodity flow problem with unit edge-lengths. Following the first approach, Garg and K?nemann?s, we developed an improved fully polynomial…
Modularity in biological evolution and evolutionary computation Open
One of the main properties of biological systems is modularity, which manifests itself at all levels of their organization, starting with the level of molecular genetics, ending with the level of whole organisms and their communities. In a…
Single product lot-sizing on unrelated parallel machines with non-decreasing processing times Open
We consider a problem in which at least a given quantity of a single product has to be partitioned into lots, and lots have to be assigned to unrelated parallel machines for processing. In one version of the problem, the maximum machine co…
Level-Based Analysis of Genetic Algorithms and Other Search Processes Open
Understanding how the time complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation. Most rigorous results were derived us…
Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths Open
An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are proposed. Computational experiments are carried out on benchmark…
On Finding Maximum Cardinality Subset of Vectors with a Constraint on\n Normalized Squared Length of Vectors Sum Open
In this paper, we consider the problem of finding a maximum cardinality\nsubset of vectors, given a constraint on the normalized squared length of\nvectors sum. This problem is closely related to Problem 1 from (Eremeev,\nKel'manov, Pyatki…
Analysis of a multicriterial buffer capacity optimization problem for a production line Open
We consider a multicriterial optimization problem for volumes of buffers in a production line. We assume that the line has a series-parallel structure, and during its operation equipment stops occur due to failures, stops that are random i…
On Solving Travelling Salesman Problem with Vertex Requisitions Open
We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard. The proposed algorithm for this problem ha…
On solving Travelling Salesman Problem with Vertex Requisitions Open
We consider the Travelling Salesman Problem with Vertex Requisitions where, for each position of the tour, at most two possible vertices are given. It is known that the problem is strongly NP-hard. The algorithm, we propose for this proble…
Hitting times of local and global optima in genetic algorithms with very high selection pressure Open
The paper is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure. The results of this paper extend the range of situations w…
Hitting times of local and global optima in genetic algorithms with very high selection pressure Open
The paper is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure. The results of this paper extend the range of situations w…
Level-Based Analysis of Genetic Algorithms and Other Search Processes Open
Understanding how the time-complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation. Most rigorous results were derived us…