Providing a closed two-dimensional BinPacking problem using an approach based on improved particle swarm optimization algorithms
Providing a closed two-dimensional BinPacking problem using an approach based on improved particle swarm optimization algorithms
SHima SHafiee1 Homayun Motameni2 Farhad Ramezani3
1) Masters Student in Computer Science, Tabari Univercity Of Higher Education,Babol, Mazandaran,IRAN
2) Assistant Prof. Faculty Member Of Computer Engineering Department, Islamic Azad University Sari Branch,Sari,Mazandaran,IRAN
3) Faculty Member Of Computer Engineering Department, Islamic Azad University Sari Branch,Sari,Mazandaran,IRAN
IOI Code
:
XYEZ-AHDHE
Publication :
International Conference On Research Science And Technology(rstconf.com)
Abstract :
Combinatorial optimization plays an important role in applied research, management, science and even plays industry with the aim of solving optimization problems is a combination of hardware, such as 2 Dimension BinPacking Problem. This is one of the classic problems of multiple optimization, basic computer science combined with optimized structure, special kinds of binary knapsack problem and a Hard-NP is famous combinatorial optimization problem that has functional areas such as industry, Applied Mathematics, loading, transporting, testing business plan for the allocation of work to the car with a parallel packing, production planning, increased efficiency in integrated circuits, resource management, and so on. In recent years, various techniques have been proposed to find the optimal solution. In fact, this is due to the nature of their nonlinear discrete optimization can be considered in various fields. The aim of this study was to provide optimum configuration for the closed two-dimensional packing analogy-based algorithm based on particle swarm optimization and improved versions of it.that will achieve the optimal time is to increase the size of the issue. In order for survey research methods, the closed two-dimensional packing algorithm based on particle swarm optimization and improved versions of its implementation were evaluated in the MATLAB environment. The experimental results show the effectiveness and success of the proposed algorithm, the improved particle swarm optimization algorithm to achieve optimal packing 1 in reducing time and recovery is optimal. Finally, the implementation of the proposed algorithm based on benchmark functions, performance improved particle swarm optimization algorithm 1 proposed algorithm was confirmed as the most efficient
Keywords : 2dimension binpacking particle swarm optimization algorithm particle swarm optimization algorithm improved optimized packing