Abstract
This paper studies a real case of bin packing problems. The problem is inspired from a car manufacturer that aims at improving logistic activities of its engine assembly line. It is to plan transportations of parts from a warehouse to workstations. The first objective is to find the minimum possible motorized vehicles to conduct all the transportations. The second objective is to smooth the workload of vehickles to the maximum extent possible. To tackle the problem, it is first formulated in form of a mixed integer linear programming model. Then, a local-based greedy heuristic is proposed to solve the problem in large-sized cases.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Chen B., Srivastava B.: An improved lower bound for the bin packing problem. Discret. Appl. Math. 66(1), 81–94 (1996)
Hemmelmayr V., Schmid V., Blum C.: Variable neighbourhood search for the variable sized bin packing problem, Comput. Oper. Res. 39(5), 1097–1108 (2012)
Haouari M., Serairi M.: Heuristics for the variable sized bin-packing problem. Comput. Oper. Res. 36(10), 2877–2884 (2009)
Khanafer A., Clautiaux F., Talbi E.G.: New lower bounds for bin packing problems with conflicts. Eur. J. Oper. Res. 206(2), 281–288 (2010)
Serairi M., Haouari M.: A computational study of lower bounds for the two dimensional bin packing problem. Electron. Notes Discret. Math. 36, 891–897 (2010)
Castro P.M., Oliveira J.F.: Scheduling inspired models for two-dimensional packing problems. Eur. J. Oper. Res. 215(1), 45–56 (2011)
Lewis, J.E.; Ragade, R.K.; Kumar, A.; Biles, W.E.: A distributed chromosome genetic algorithm for bin-packing. Robot. Comput. Integr. Manuf. 21(4–5), 486–495 (2005)
Falkenauer E.: Genetic Algorithms and Grouping Problems. John Wiley, New York (1998)
Chan F.T.S., AuK.C. Chan L.Y., Lau T.L.: Using genetic algorithms to solve quality-related bin packing problem. Robot. Comput. Integr. Manuf. 23(1), 71–81 (2007)
Kang K., Moon I., Wang H.: A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem. Appl. Math. Comput. 219(3), 1287–1299 (2012)
Dowsland K.A.: Some experiments with simulated annealing techniques for packing problems. Eur. J. Oper. Res. 68(3), 389–399 (1993)
Liu D.S., Tan K.C., Huang S.Y., Goh C.K., Ho W.K.: On solving multiobjective bin packing problems using evolutionary particle swarm optimization. Eur. J. Oper. Res. 190(2), 357–382 (2008)
Mandal C.A., Chakrabarti P.P., Ghose S.: Complexity of fragmentable object bin packing and an application. Comput. Math. Appl. 35(11), 91–97 (1998)
Xavier, E.C.; Miyazawa, F.K.: The class constrained bin packing problem with applications to video-on-demand. Theor. Comput. Sci. 393 (1–3), 240–259 (2008)
Boysen N., Fliedner M., Scholl A.: A classification of assembly line balancing problems. Eur. J. Oper. Res. 183(2), 674–693 (2007)
Becker C., Scholl A.: A survey on problems and methods in generalized assembly line balancing. Eur. J. Oper. Res. 168(3), 694–715 (2006)
Chen J.C., Chen C.C., Su L.H., Wu H.B., Sun C.J.: Assembly line balancing in garment industry. Expert Syst. Appl. 39(11), 10073–10081 (2012)
Toksarι, M.D.; İşleyen, S.K.; Güner, E.; Baykoç, Ö.F.: Assembly line balancing problem with deterioration tasks and learning effect. Expert Syst. Appl. 37(2), 1223–1228 (2010)
Yagmahan B.: Mixed-model assembly line balancing using a multi-objective ant colony optimization approach. Expert Syst. Appl. 38(10), 12453–12461 (2011)
Chankong V., Haimes Y.Y.: Multiobjective Decision Making: Theory and Methodology. Dover Publications, New York (2008)
Xia B., Tan Z.: Tighter bounds of the first fit algorithm for the bin-packing problem. Discret. Appl. Math. 158(15), 1668–1675 (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Naderi, B., Yazdani, M. A Real Multi-Objective Bin Packing Problem: A Case Study of an Engine Assembly Line. Arab J Sci Eng 39, 5271–5277 (2014). https://doi.org/10.1007/s13369-014-1052-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13369-014-1052-4