A Meta-heuristic Algorithm for the Strip Rectangular Packing Problem

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 th...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Natural Computation pp. 1235 - 1241
Main Authors Zhang, Defu, Liu, Yanjuan, Chen, Shengda, Xie, Xiaogang
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Artificial intelligence
Circle Packing
Computer science; control theory; systems
Exact sciences and technology
Hybrid Heuristic Algorithm
Packing Problem
Rectangle Packing
Strip Packing Problem
Layout problem
Heuristic method
Simulated annealing
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783540283201
354028320X
3540283234
9783540283232
ISSN:0302-9743
1611-3349
DOI:10.1007/11539902_157