Error analysis of elitist randomized search heuristics [PDF]
Swarm and Evolutionary Computation, 2021 For complicated problems that cannot be solved in polynomial first hitting time (FHT)/running time(RT), a remedy is to perform approximate FHT/TH analysis for given approximation ratio. However, approximate FHT/RT analysis of randomized search heuristics
Cong Wang, Jun He
exaly +6 more sources
Fitness levels with tail bounds for the analysis of randomized search heuristics
Information Processing Letters, 2014 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.
Carsten Witt
exaly +4 more sources
A fixed budget analysis of randomized search heuristics for the traveling salesperson problem
Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014 Randomized Search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to their theoretical understanding.
Frank Neumann, Dirk Sudholt
exaly +3 more sources
Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
Lecture Notes in Computer Science, 2014 Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing etc.
Per KRISTIAN Lehre +2 more
exaly +3 more sources
Optimizing the Classic and the Energy-Efficient Permutation Flowshop Scheduling Problem with a Hybrid Tyrannosaurus Rex Optimization Algorithm [PDF]
BiomimeticsThis paper introduces a Hybrid Tyrannosaurus Rex Optimization Algorithm (Hybrid TROA) combined with Variable Neighborhood Search (VNS), two variations of the Path Relinking strategy, and a randomized Nawaz–Enscore–Ham (NEH) heuristic to address the ...
Maria Tsiftsoglou +2 more
doaj +2 more sources
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
Lecture Notes in Computer Science, 2011 Randomized search heuristics are a broadly used class of general-purpose algorithms. Analyzing them via classical methods of theoretical computer science is a growing field.
Benjamin Doerr +2 more
exaly +2 more sources
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
Evolutionary Computation, 2010 The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, there are only a few theoretical explorations on this subject.
Tobias Friedrich +2 more
exaly +2 more sources
A randomized heuristics for the mapping problem: The genetic approach
Parallel Computing, 1992 The combinatorial optimization problem of assigning parallel tasks onto a multiprocessor so as to minimize the execution time is termed as the mapping problem. This problem even in its simplest form is known to be NP-hard.
CHOCKALINGAM, T, ARUNKUMAR, S
exaly +2 more sources
Metals, 2021 An innovative trajectory strategy was proposed and accessed for wire arc additive manufacturing (WAAM), applicable to different and more complex geometries, rather than being a single solution.
Rafael Pereira Ferreira, Américo Scotti
doaj +1 more source
Modeling Multi-Plant Capacitated Lot Sizing Problem with Interplant Transfer [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2021 Lot sizing models involve operational and tactical decisions. These decisions may entail multi-level production processes such as assembly operations with multiple plants and limited capacities.
Amitkumar Patil +3 more
doaj +1 more source