Applying shuffled frog leaping algorithm and bottom left fill algorithm in rectangular packing problem
| Autor: | Trasapong Thaiupathump, Kanchana Daoden |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Mathematical optimization
021103 operations research Cuboid Computer science Bin packing problem 0211 other engineering and technologies Process (computing) 02 engineering and technology Euclidean distance Set (abstract data type) Packing problems Convergence (routing) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Algorithm design Algorithm |
| Zdroj: | 2017 7th IEEE International Conference on Electronics Information and Emergency Communication (ICEIEC). |
| Popis: | Modern industry has been applying various optimization methods in solving problems and increasing productivity. The bin packing problem is one of the well-known problems in many industries, such as, glass manufacturing industry, paper packaging industry and garment industry that commonly require optimization techniques to improve the productivity. This paper introduces the use of the shuffled frog leaping algorithm (SFLA), a meta-heuristic approach for optimization, combined with the bottom left fill algorithm (BLF) as an approach for optimizing the arrangement of the 2D shapes in limited space. The objective is to arrange the set of rectangular box items in a given 2D space as efficiently as possible in order to minimize the waste from the process. The algorithm performance in converging to the optimal solution is presented. The proposed approach could be applied to various related manufacturing problems. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|