1 research outputs found

    A meta-heuristic algorithm for the strip rectangular packing problem

    No full text
    A new meta-heuristic algorithm to find the minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter time
    corecore