Title: A Meta-heuristic Algorithm for the Strip Rectangular Packing Problem
Abstract: 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.
Publication Year: 2005
Publication Date: 2005-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 27
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot