Abstract
2D Bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem. Multiobjective versions of this well-known industrial engineering problem can occur frequently in real world application. Recently, Hybrid Evolutionary Algorithms have appear as a new area of research with their ability to combine alternative heuristics and local search mechanisms together for higher quality solutions. In this study, we propose a set of novel multiobjective hybrid genetic and memetic algorithms that make use of the state-of-the-art metaheuristics and local search techniques for minimizing the number of bins while also maintaining the load balance. We analyze the optimization time and the resulting solution quality of the proposed algorithms on an offline 2DBPP benchmark problem set with 500 instances. Using these results of exhaustive experiments, we conclude that the proposed hybrid algorithms are robust with their ability to obtain a high percentage of the optimal solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Johnson, D.S.: Near-optimal bin-packing algorithms. Ph.D. thesis (1973)
Dokeroglu, T., Cosar, A.: Optimization of one-dimensional bin packing problem with island parallel grouping genetic algorithms. Comput. Ind. Eng. 75, 176–186 (2014)
Coffman, E.G., Shor, P.W.: Average-case analysis of cutting and packing in two dimensions. Eur. J. Oper. Res. 44, 134–144 (1990)
Dokeroglu, T.: Hybrid teaching-learning-based optimization algorithms for the Quadratic Assignment Problem. Comput. Ind. Eng. 85, 86–101 (2015)
Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. Eur. J. Oper. Res. 141(2), 241–252 (2002)
Tosun, U., Dokeroglu, T., Cosar, A.: A robust island parallel genetic algorithm for the quadratic assignment problem. Int. J. Prod. Res. 51(14), 4117–4133 (2013)
Blum, C., Schmid, V.: Solving the 2d bin packing problem by means of a hybrid evolutionary algorithm. Procedia Comput. Sci. 18(0), 899–908 (2013). International Conference on Computational Science (2013)
Fernandez, A., Gil, C., Banos, R., Montoya, M.G.: A parallel multiobjective algorithm for two-dimensional bin packing with rotations and load balancing. Expert Syst. Appl. 40(13), 5169–5180 (2013)
Thapatsuwan, P., et al.: Development of a stochastic optimisation tool for solving the multiple container packing problems. Int. J. Prod. Econ. 140(2), 737–748 (2012)
Smith, J.E.: Coevolving memetic algorithms: A review and progress report. Syst., Man, Cybern., Part B: Cybern. 37(1), 6–17 (2007)
Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38, 423–429 (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Beyaz, M., Dokeroglu, T., Cosar, A. (2016). Hybrid Heuristic Algorithms for the Multiobjective Load Balancing of 2D Bin Packing Problems. In: Abdelrahman, O., Gelenbe, E., Gorbil, G., Lent, R. (eds) Information Sciences and Systems 2015. Lecture Notes in Electrical Engineering, vol 363. Springer, Cham. https://doi.org/10.1007/978-3-319-22635-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-22635-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22634-7
Online ISBN: 978-3-319-22635-4
eBook Packages: EngineeringEngineering (R0)