SOLVING IRREGULAR STRIP PACKING PROBLEMS WITH FREE ROTATIONS USING SEPARATION LINES
نویسندگان
چکیده
منابع مشابه
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
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 while linear programming models are solved to generate neighbourhoods during the search process. These linear programming models, which are used to locally optimise the layouts, derive from the application of compactio...
متن کاملA Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem
This paper presents a packing algorithm to solve an irregular shape strip packing problem. The polygons are packed in strip material, which limits a bin width but not limits a bin length. The objective of a packing algorithm is to minimize a bin length. This paper proposes a hybrid method of genetic algorithms and tabu search to solve a packing problem. Initially, a hybrid method behaves like r...
متن کاملSolving Irregular Problems through Parallel Irregular Trees
This paper presents PIT, a library for the parallelization of irregular problems on distributed memory architectures. All the strategies underlying the definition of the library can be expressed in terms of operations on a PITree, a parallel version of the tree data structure oriented to irregular problems. We consider the application of PIT to two well known irregular problems: adaptive multig...
متن کاملAn Efficient Hyperheuristic for Strip-Packing Problems
In this paper we introduce a hyperheuristic to solve hard strip packing problems. The hyperheuristic manages a sequence of greedy low-level heuristics, each element of the sequence placing a given number of objects. A low-level solution is built by placing the objects following the sequence of low-level heuristics. The hyperheuristic performs a hill-climbing algorithm on this sequence by testin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pesquisa Operacional
سال: 2018
ISSN: 1678-5142,0101-7438
DOI: 10.1590/0101-7438.2018.038.02.0195