—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Abstract— Multi-parent crossover allows more than two parents participating in crossover. The increase of parents in crossover intensifies exploitation or exploration or both; h...
— Recent large scale experiments have shown that the Normalized Information Distance, an algorithmic information measure, is among the best similarity metrics for melody classi...
— This paper presents a new method to generalize strategies in order to control parameters of Evolutionary Algorithms (EAs). A learning process establishes the relationship betwe...
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
— It is often believed that biological organisms have an inherent tolerance to environmental changes. This is a seductive concept if transferred to artificial organisms. An expe...
— This paper describes the so-called Differential Ant-Stigmergy Algorithm (DASA), which is an extension of the Ant-Colony Optimization for a continuous domain. An experimental ev...
Peter Korosec, Jurij Silc, Klemen Oblak, Franc Kos...
Abstract— For solving multimodal problems by means of evolutionary algorithms, one often resorts to multistarts or niching methods. The latter approach the question: ‘What is e...
— This paper presents a single-objective and a multiobjective stochastic optimization algorithms for global training of neural networks based on simulated annealing. The algorith...