Abstract
The solution of bi-objective bin packing problems with many constraints is of fundamental importance for a wide range of engineering applications such as wireless communication, logistics, or automobile sheet metal forming processes. When the bi-objective bin packing problem is single-constrained, state-of-the-art multi-objective genetic algorithms such as NSGA-II combined with standard constraint handling techniques can be used. In the case of many-constraint bin packing problems, problems with thousand of additional constraints, it is not easy to solve this kind of problem accurately and fast with classical methods. Our approach relies on two key ingredients, NSGA-II and a clustering algorithm in order to generate always feasible solutions independent of the number of constraints. The method allows to tackle bi-objective many-constraint bin packing problems. We will present results for challenging artificial bin packing problems which model typical bi-objective bin packing problems with many constraints arising in the automobile industry.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anily, S., Bramel, J., Simchi-Levi, D.: Worst-case analysis of heuristics for the bin packing problem with general cost structures. Operations Research 42(2), 287–298 (1994)
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35(3), 268–308 (2003)
Coello Coello, C.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering 191(11–12), 1245–1287 (2002)
Coffman Jr., Garey, E.G., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Approximation Algorithms for NP-hard Problems, pp. 46–93. PWS (1997)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA–II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Durillo, J.J., Nebro, A.J., Luna, F., Dorronsoro, B., Alba, E.: jMetal: A Java Framework for Developing Multi-Objective Optimization Metaheuristics. Technical Report ITI-2006-10, Departamento de Lenguajes y Ciencias de la Computación, University of Málaga, E.T.S.I. Informática, Campus de Teatinos (2006)
Ehrgott, M., Gandibleux, X.: Approximative solution methods for multiobjective combinatorial optimization. TOP: An Official Journal of the Spanish Society of Statistics and Operations Research 12(1), 1–63 (2004)
Everitt, B.S., Landau, S., Leese, M.: Cluster Analysis. Arnold, London (2001)
Falkenauer, E.: A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation 2(2), 123–144 (1994)
Geiger, M.J.: Bin packing under multiple objectives - a heuristic approximation approach. In: The Fourth International Conference on Evolutionary Multi-Criterion Optimization: Late Breaking Papers, Matsushima, Japan, pp. 53–56 (2007)
Goldberg, D.E., Lingle Jr., R.: Alleles loci and the traveling salesman problem. In: Grefenstette, J.J. (ed.) Proceedings of the International Conference on Genetic Algorithms, Pittsburgh, pp. 154–159. Lawrence Erlbaum Associates, Mahwah (1985)
Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Mathematical programming 79, 191–215 (1997)
Liu, D.S., Tan, K.C., Goh, C.K., Ho, W.K.: On solving multiobjective bin packing problems using particle swarm optimization. In: Yen, G.G., et al. (eds.) Proceedings of the 2006 IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada, pp. 2095–2102. IEEE Press, Los Alamitos (2006)
Mezura-Montes, E., Coello Coello, C.: A survey of constraint-handling techniques based on evolutionary multiobjective optimization. In: Workshop paper at PPSN 2006, Iceland (2006)
Neumann, F., Witt, C.: Computational complexity of evolutionary computation in combinatorial optimization. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199. Springer, Heidelberg (2008)
Reeves, C.: Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research 63, 371–396 (1996)
Sathe, M.: Interactive Evolutionary Algorithms for Multi-Objective Optimization: Design and Validation of a Hybrid Interactive Reference Point Method. VDM-Verlag Dr. Müller (2008)
Stawowy, A.: Evolutionary based heuristic for bin packing problem. Computers & Industrial Engineering 55(2), 465–474 (2008)
Wäscher, G., Hauner, H., Schumann, H.: An improved typology of cutting and packing problems. European Journal of Operational Research 183(3), 1109–1130 (2007)
Williams, H.P.: Model Building in Mathematical Programming. Wiley, Chichester (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sathe, M., Schenk, O., Burkhart, H. (2009). Solving Bi-objective Many-Constraint Bin Packing Problems in Automobile Sheet Metal Forming Processes. In: Ehrgott, M., Fonseca, C.M., Gandibleux, X., Hao, JK., Sevaux, M. (eds) Evolutionary Multi-Criterion Optimization. EMO 2009. Lecture Notes in Computer Science, vol 5467. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01020-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-01020-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01019-4
Online ISBN: 978-3-642-01020-0
eBook Packages: Computer ScienceComputer Science (R0)