Abstract
The bin packing problem aims to pack a set of items in a minimum number of bins, with respect to the size of the items and capacity of the bins. This is an NP-hard problem. Several approach methods have been developed to solve this problem. In this paper, we propose a new encoding scheme which is used in a hybrid resolution: a metaheuristic is matched with a list algorithm (Next Fit, First Fit, Best Fit) to solve the bin packing problem. Any metaheuristic can be used but in this paper, our proposition is implemented on a single solution based metaheuristic (stochastic descent, simulated annealing, kangaroo algorithm). This hybrid method is tested on literature instances to ensure its good results.
Chapter PDF
Similar content being viewed by others
Keywords
- Encode Scheme
- Assembly Line Balance
- Iterate Local Search
- Neighborhood System
- Assembly Line Balance Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Johnson, D.S.: Near-optimalbin packing algorithms. PhD thesis, Massachusetts Instituteof Technology (1973)
Chandra, A., Hirschberg, D., Wong, C.: Bin packing with geometric constraintsin computer network design. Operations Research 26, 760–772 (1978)
Bortfeldt, A., Wäscher, G.: Container loading problems: Astate-of-the-artreview. Univ., Faculty of Economics and Management (2012)
Wee, T., Magazine, M.J.: Assembly line balancingas generalized bin packing. Operations Research Letters 1, 56–58 (1982)
Coffman Jr, E.G., Garey, M.R., Johnson, D.S.: An application of bin-packingto multiprocessor scheduling. SIAM Journal on Computing 7, 1–17 (1978)
Gourgand, M., Grangeon, N., Klement, N.: Activities planning and resource assign- menton multi-place hospital system: Exactand approach methods adapted from the bin packing problem. In: 7th International Conference on Health Informatics, Angers, France, pp. 117–124 (2014)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. WH Freeman and Company, NewYork (1979)
Alvim, A.C., Ribeiro, C.C., Glover, F., Aloise, D.J.: A hybrid improvement heuris- tic for the one-dimensional bin packing problem. Journal of Heuristic 10, 205–229 (2004)
Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristic 2, 5–30 (1996)
Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 28, 59–70 (1990)
Loh, K.H., Golden, B., Wasil, E.: Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research 35, 2283–2291 (2008)
Levine, J., Ducatelle, F.: Ant colony optimization and local search for bin packing and cutting stock problems. Journal of the Operational Research Society 55, 705–716 (2004)
Reeves, C.: Hybrid genetical gorithms for bin-packing and related problems. Annals of Operations Research 63, 371–396 (1996)
Stawowy, A.: Evolutionary based heuristic for bin packing problem. Computers & Industrial Engineering 55, 465–474 (2008)
Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: International Conference on Robotics and Automation, pp. 1186–1192. IEEE (1992)
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. The Journal of Chemical Physics 21, 1087–1092 (1953)
Aarts, E.H., van Laarhoven, P.J.: Simulated Annealing: Theory and Applications. Kluwer Academic Publishers (1987)
Fleury, G.: Méthodes stochastiques etdéterministes pour les problémes NP- difficiles. Ph.D.thesis, Université Blaise Pascal, Clermont-FerrandII (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Gourgand, M., Grangeon, N., Klement, N. (2014). An Analogy between Bin Packing Problem and Permutation Problem: A New Encoding Scheme. In: Grabot, B., Vallespir, B., Gomes, S., Bouras, A., Kiritsis, D. (eds) Advances in Production Management Systems. Innovative and Knowledge-Based Production Management in a Global-Local World. APMS 2014. IFIP Advances in Information and Communication Technology, vol 438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44739-0_70
Download citation
DOI: https://doi.org/10.1007/978-3-662-44739-0_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44738-3
Online ISBN: 978-3-662-44739-0
eBook Packages: Computer ScienceComputer Science (R0)