On performance of binary flower pollination algorithm for rectangular packing problem

被引：0

作者：

Virk A.K. ^{[1
]}

Singh K. ^{[2
]}

机构：

[1] Department of Computer Science, Faculty of Computer Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib

[2] Department of Computer Science, University Computer Centre, Punjabi University, Patiala

来源：

Recent Advances in Computer Science and Communications | 2020年 / 13卷 / 01期

关键词：

BLF; Flower pollination algorithm; Heuristic; Non-guillotine cutting; Rectangle packing; Utilization factor;

D O I：

10.2174/2213275911666181114143239

中图分类号：

学科分类号：

摘要：

Background: Metaheuristic algorithms are optimization algorithms capable of finding near-optimal solutions for real world problems. Rectangle Packing Problem is a widely used industrial problem in which a number of small rectangles are placed into a large rectangular sheet to max-imize the total area usage of the rectangular sheet. Metaheuristics have been widely used to solve the Rectangle Packing Problem. Objective: A recent metaheuristic approach, Binary Flower Pollination Algorithm, has been used to solve for rectangle packing optimization problem and its performance has been assessed. Methods: A heuristic placement strategy has been used for rectangle placement. Then, the Binary Flower Pollination Algorithm searches the optimal placement order and optimal layout. Result: Benchmark datasets have been used for experimentation to test the efficacy of Binary Flower Pollination Algorithm on the basis of utilization factor and number of bins used. The simulation results obtained show that the Binary Flower Pollination Algorithm outperforms in comparison to the other well-known algorithms. Conclusion: BFPA gave superior results and outperformed the existing state-of-the-art algorithms in many instances. Thus, the potential of a new nature based metaheuristic technique has been discovered. © 2020 Bentham Science Publishers.

引用

页码：22 / 34

页数：12

共 62 条

[1]

Kennedy J., Eberhart R.C., A discrete binary version of the particle swarm algorithm”, In IEEE International Conference on Systems, Man, Computational Cybernetics and, Simulation, 5, pp. 4104-4108, (1997)

[2]

Pampara G., Engelbrecht A.P., Binary artificial bee colony optimization, In IEEE Symposium on Swarm Intelligence (SIS), pp. 1-8, (2011)

[3]

Falcon R., Almeida M., Nayak A., Fault identification with binary adaptive fireflies in parallel and distributed systems, In IEEE Congress on Evolutionary Computation (CEC), pp. 1359-1366, (2011)

[4]

Rodrigues D., Et al., BCS: A binary cuckoo search algorithm for feature selection, Circuits and Systems (ISCAS), 2013 IEEE International Symposium On, pp. 465-468, (2013)

[5]

Sabba S., Chikhi S., A discrete binary version of bat algorithm for multidimensional knapsack problem, Int. J. Bio-Inspired Com-Put, 6, 2, pp. 140-152, (2014)

[6]

Yang X.-S., Flower pollination algorithm for global optimiza-tion, In International Conference on Unconventional Computing and Natural Computation, pp. 240-249, (2012)

[7]

Lodi A., Martello S., Vigo D., Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems, Inf. J. Comput, 11, 4, pp. 345-357, (1999)

[8]

Yang X.-S., Karamanoglu M., He X., Flower pollination algorithm: A novel approach for multiobjective optimization, Eng. Optim, 46, 9, pp. 1222-1237, (2014)

[9]

Alam D.F., Yousri D.A., Eteiba M.B., Flower pollination algorithm based solar PV parameter estimation, Energy Convers. Manag, 101, pp. 410-422, (2015)

[10]

Prathiba R., Moses M.B., Sakthivel S., Flower pollination algorithm applied for different economic load dispatch problems, Int. J. Eng. Technol, 6, 2, pp. 1009-1016, (2014)

← 1 2 3 4 5 6 7 →