Running Time Analysis of MOEA/D with Crossover on Discrete Optimization Problem
نویسندگان
چکیده
منابع مشابه
Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem
For the first time, a running time analysis of populationbased multi-objective evolutionary algorithms for a discrete optimization problem is given. To this end, we define a simple pseudo-Boolean bi-objective problem (Lotz: leading ones trailing zeroes) and investigate time required to find the entire set of Pareto-optimal solutions. It is shown that different multi-objective generalizations of...
متن کاملRunning time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem
For the first time, a running time analysis of a multi-objective evolutionary algorithm for a discrete optimization problem is given. To this end, a simple pseudo-Boolean problem (Lotz: leading ones trailing zeroes) is defined and a population-based optimization algorithm (FEMO). We show, that the algorithm performs a black box optimization in Θ(n log n) function evaluations where n is the numb...
متن کاملANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY
This paper analyzes a controllable discrete-time machine repair problem withL operating machines and two repairmen. The number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. Analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the system a...
متن کاملanalysis of discrete-time machine repair problem with two removable servers under triadic policy
this paper analyzes a controllable discrete-time machine repair problem withl operating machines and two repairmen. the number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the sys...
متن کاملMulti-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm
The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33012296