TY - GEN
T1 - A multiobjective approach for optimization of the multihead weighing process
AU - Pulido-Rojano, Alexander
AU - García-Díaz, J. Carlos
AU - Giner-Bosch, Vicent
N1 - Publisher Copyright:
© 2015 International Institute for Innovation, Industrial Engineering and Entrepreneurship - I4e2.
PY - 2016/1/12
Y1 - 2016/1/12
N2 - Packaging technology can be of strategic importance to a company, as it can be a key to competitive advantage in the modern food industry. A multihead weighing process is a packaging process based on the sum of weights from several individual hoppers. The final quality of the packaged product in a modern automated food packing system should fulfill mo objectives -the quality of the packaging process itself and the sensory qualiry of the packaged food. The first one is often related to the proximity of the total weight to a nominal value of sale and to the variability of the packaging process, and the second one can be achieved by minimizing the total residence time of the food in the packing system. In this paper, we jointly address both objectives through multi objective programming. More precisely, a biobjective algorithm is developed, in which a subset of hoppers is selected from the set of available ones at each packing operation, in such a way that the relative importance of both aforementioned objectives is dynamically managed and adjusted. We conduct numerical experiments to examine the quality of the solutions being produced.
AB - Packaging technology can be of strategic importance to a company, as it can be a key to competitive advantage in the modern food industry. A multihead weighing process is a packaging process based on the sum of weights from several individual hoppers. The final quality of the packaged product in a modern automated food packing system should fulfill mo objectives -the quality of the packaging process itself and the sensory qualiry of the packaged food. The first one is often related to the proximity of the total weight to a nominal value of sale and to the variability of the packaging process, and the second one can be achieved by minimizing the total residence time of the food in the packing system. In this paper, we jointly address both objectives through multi objective programming. More precisely, a biobjective algorithm is developed, in which a subset of hoppers is selected from the set of available ones at each packing operation, in such a way that the relative importance of both aforementioned objectives is dynamically managed and adjusted. We conduct numerical experiments to examine the quality of the solutions being produced.
KW - Combinatorial optimization
KW - Compromise programing
KW - Multihead weighers
KW - Packaging processes
KW - Quality control
KW - Reduction of variability
UR - https://www.scopus.com/pages/publications/84971635746
U2 - 10.1109/IESM.2015.7380192
DO - 10.1109/IESM.2015.7380192
M3 - Conference contribution
AN - SCOPUS:84971635746
T3 - Proceedings of 2015 International Conference on Industrial Engineering and Systems Management, IEEE IESM 2015
SP - 426
EP - 434
BT - Proceedings of 2015 International Conference on Industrial Engineering and Systems Management, IEEE IESM 2015
A2 - Framinan, J.M.
A2 - Perez Gonzalez, P.
A2 - Artiba, A.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - International Conference on Industrial Engineering and Systems Management, IEEE IESM 2015
Y2 - 21 October 2015 through 23 October 2015
ER -