It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
Learning Classifier Systems differ from many other classification techniques, in that new rules are constantly discovered and evaluated. This feature of LCS gives rise to an im...