In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
In this paper we compare Mixed-Integer Evolution Strategies (MI-ES) and standard Evolution Strategies (ES) when applied to find optimal solutions for artificial test problems and ...
Rui Li, Michael Emmerich, Jeroen Eggermont, Ernst ...
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical di...
—Robustness of optimization models for networking problems has been an under-explored area. Yet most existing algorithms for solving robust optimization problems are centralized,...
Kai Yang, Yihong Wu, Jianwei Huang, Xiaodong Wang,...
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...