This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
Eduardo Alberto Avello, Felipe F. Baesler, Reinald...
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
—Over the last two decades, many Differential Evolution (DE) strategies have been introduced for solving Optimization Problems. Due to the variability of the characteristics in o...