A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry

This paper presents a computation tool for the multi-level capacitated lot-sizing and scheduling problem in hen egg production planning with the aim of minimizing the total cost. A mixed-integer programming model was developed to solve small-size problems. For large-size problems, particle swarm optimization (PSO) was firstly applied. However, the component of traditional PSO for social learning behavior includes only personal and global best positions. Therefore, a variant of PSO such as the particle swarm optimization with combined gbest, lbest and nbest social structures (GLNPSO) which considers multiple social learning terms was proposed. The local search procedure was applied to decide the new sequence of chick and pullet allocation to rapidly converge to a better solution. Moreover, the re-initialization and the re-order strategy were used to improve the possibility of finding an optimal solution in the search space. To test the performance of the algorithm, the two criteria used to measure and evaluate the effectiveness of the proposed algorithm were the performance of the heuristic algorithm (P) obtained by comparing their solutions to optimal solutions, and the relative improvement of the solution (RI) obtained by the firm's current practice with respect to those of traditional PSO and the GLNPSO algorithms. The results demonstrate that the GLNPSO is not only useful for reducing cost compared to the traditional PSO, but also for efficient management of the poultry production system. Furthermore, the method used in this research should prove beneficial to other similar agro-food industries in Thailand and around the world.

[1]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[2]  Ming-Feng Yeh,et al.  A modified particle swarm optimization for aggregate production planning , 2014, Expert Syst. Appl..

[3]  S. M. Seyedhoseini,et al.  Multi-level lot sizing and job shop scheduling with compressible process times: A cutting plane approach , 2013, Eur. J. Oper. Res..

[4]  Regina Berretta,et al.  A memetic algorithm for a multistage capacitated lot-sizing problem , 2004 .

[5]  Andreas C. Nearchou,et al.  Maximizing production rate and workload smoothing in assembly lines using particle swarm optimization , 2011 .

[6]  Irina Gribkovskaia,et al.  Optimization model for a livestock collection problem , 2006 .

[7]  Voratas Kachitvichyanukul,et al.  Dispersion and velocity indices for observing dynamic behavior of particle swarm optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[8]  Diego Klabjan,et al.  Pricing, relaxing and fixing under lot sizing and scheduling , 2013, Eur. J. Oper. Res..

[9]  Kalyan Veeramachaneni,et al.  Optimization Using Particle Swarms with Near Neighbor Interactions , 2003, GECCO.

[10]  Voratas Kachitvichyanukul,et al.  Particle Swarm Optimization algorithm with multiple social learning structures , 2009 .

[11]  V. Kachitvichyanukul,et al.  A NON-HOMOGENOUS PARTICLE SWARM OPTIMIZATION WITH MULTIPLE SOCIAL STRUCTURES , 2005 .

[12]  Yuchun Xu,et al.  A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems , 2014, Eur. J. Oper. Res..

[13]  Luis Puigjaner,et al.  Optimal Production Scheduling and Lot-Sizing in Dairy Plants: The Yogurt Production Line , 2010 .

[14]  Alistair Clark,et al.  Simultaneous Lot Sizing and Scheduling in a Flexible Flow Line , 2011 .

[15]  Shengli Song,et al.  Hybrid particle swarm cooperative optimization algorithm and its application to MBC in alumina production , 2008 .

[16]  Vinícius Amaral Armentano,et al.  A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines , 2006, Eur. J. Oper. Res..

[17]  Albert P. M. Wagelmans,et al.  Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems , 2001, Math. Oper. Res..

[18]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[19]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[20]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[21]  Chiun-Chieh Hsu,et al.  Optimization by Ant Colony Hybrid Local Search for Online Class Constrained Bin Packing Problem , 2013 .

[22]  Ching-Jung Ting,et al.  A simulated annealing heuristic for the capacitated location routing problem , 2010, Comput. Ind. Eng..

[23]  Herbert Meyr,et al.  Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems , 2013, Comput. Oper. Res..

[24]  Zeger Degraeve,et al.  Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches , 2004, Eur. J. Oper. Res..

[25]  Zeger Degraeve,et al.  Modeling industrial lot sizing problems: a review , 2008 .

[26]  Klaus Neumann,et al.  A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods , 1997 .

[27]  Luis Puigjaner,et al.  Resource-constrained production planning in semicontinuous food industries , 2011, Comput. Chem. Eng..

[28]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[29]  Claudio Fabiano Motta Toledo,et al.  Glass container production scheduling through hybrid multi-population based evolutionary algorithm , 2013, Appl. Soft Comput..

[30]  PingSun Leung,et al.  Optimal production schedule in commercial shrimp culture , 2006 .

[31]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[32]  Liang-Yuh Ouyang,et al.  A particle swarm optimization for solving joint pricing and lot-sizing problem with fluctuating demand and trade credit financing , 2011, Comput. Ind. Eng..

[33]  Claudio Fabiano Motta Toledo,et al.  A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging , 2013, Comput. Oper. Res..

[34]  Luis Puigjaner,et al.  An Efficient Mathematical Framework for Detailed Production Scheduling in Food Industries: The Icecream Production Line , 2011 .

[35]  José Arnaldo Barra Montevechi,et al.  Multi-choice mixed integer goal programming optimization for real problems in a sugar and ethanol milling company , 2013 .

[36]  Ford W. Harris,et al.  How Many Parts to Make at Once , 1990, Oper. Res..

[37]  Tsu-Pang Hsieh,et al.  A particle swarm optimization for solving joint pricing and lot-sizing problem with fluctuating demand and unit purchasing cost , 2010, Comput. Math. Appl..

[38]  Bernardo Almada-Lobo,et al.  Lot sizing and scheduling: industrial extensions and research opportunities , 2011 .

[39]  Mohammad Saidi-Mehrabad,et al.  MIP formulation and heuristics for multi-stage capacitated lot-sizing and scheduling problem with availability constraints , 2013 .

[40]  M. Clerc,et al.  Particle Swarm Optimization , 2006 .

[41]  Reinaldo Morabito,et al.  A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem , 2014, Comput. Oper. Res..

[42]  Albert R. Meyer,et al.  Cosmological lower bound on the circuit complexity of a small problem in logic , 2002, JACM.

[43]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .