This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem k...
Abstract The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances ...
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz