Results 1 to 10 of about 34,005 (136)
Computing Minimum Cuts by Randomized Search Heuristics [PDF]
Algorithmica, 2008 Reihe CI; 242 ...
Neumann, Frank +2 more
openaire +9 more sources
Theory of randomized search heuristics in combinatorial optimization [PDF]
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation, 2010 The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS), the Metropolis Algorithm (MA), Simulated Annealing (SA), and ...
Witt, Carsten
openaire +4 more sources
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem [PDF]
Evolutionary Computation, 2017 Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget.
Nallaperuma, S. +2 more
openaire +7 more sources
The Impact of Parametrization on Randomized Search Heuristics [PDF]
, 2018 In this work we present runtime analyses of randomized search heuristics (RSH) in various settings that are determined by parameters of the problems, the algorithms and also exogenous parameters like noise. In the process we provide new techniques for the theoretical analysis of RSH as well as new optimization algorithms.
Gießen, Christian
openaire +3 more sources
Error analysis of elitist randomized search heuristics [PDF]
Swarm and Evolutionary Computation, 2021 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 ...
Wang, C, Chen, Y, He, J, Xie, C
openaire +3 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
Theory of Randomized Search Heuristics [PDF]
Algorithmica, 2012 Randomized search heuristics such as evolutionary algorithms, evolution strategies, ant colony optimizers etc. are optimization algorithms that can be applied to a wide class of problems ranging from combinatorial to continuous optimization. They are popular in practice because they are generally easy to implement, their application requires little ...
Anne Auger, Carsten Witt
openaire +1 more source
Solving the mixed-model assembly line balancing problem type-I using a Hybrid Reactive GRASP
Production and Manufacturing Research: An Open Access Journal, 2022 One of the most recent challenges that manufacturers confront is to respond on time to the variety of customers’ demands for different products. The Assembly line is the main element responsible for assembling products in manufacturing systems, and it ...
Lakhdar Belkharroubi, Khadidja Yahyaoui
doaj +1 more source