A case study on using evolutionary algorithms to optimize bakery production planning

The production of bakery goods is strictly time sensitive due to the complex biochemical processes during dough fermentation, which leads to special requirements for production planning and scheduling. Instead of mathematical methods scheduling is often completely based on the practical experience of the responsible employees in bakeries. This sometimes inconsiderate scheduling approach often leads to sub-optimal performance of companies. This paper presents the modeling of the production in bakeries as a kind of no-wait hybrid flow-shop following the definitions in Scheduling Theory, concerning the constraints and frame conditions given by the employed processes properties. Particle Swarm Optimization and Ant Colony Optimization, two widely used evolutionary algorithms for solving scheduling problems, were adapted and used to analyse and optimize the production planning of an example bakery. In combination with the created model both algorithms proved capable to provide optimized results for the scheduling operation within a predefined runtime of 15min.

[1]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[2]  Ying Liu,et al.  An effective hybrid particle swarm optimization for batch scheduling of polypropylene processes , 2010, Comput. Chem. Eng..

[3]  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..

[4]  Yupu Yang,et al.  Particle swarm with equilibrium strategy of selection for multi-objective optimization , 2010, Eur. J. Oper. Res..

[5]  Yeu-Ruey Tzeng,et al.  A hybrid EDA with ACS for solving permutation flow shop scheduling , 2012 .

[6]  M. Collado-Fernández BREAD | Dough Fermentation , 2003 .

[7]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[8]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[9]  Mehmet Mutlu Yenisey,et al.  A multi-objective ant colony system algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..

[10]  Qi Tang,et al.  Heuristic Particle Swarm Optimization for Batching and Scheduling Flowshop with Sequence-Independent Setup Time , 2011 .

[11]  Paul Finglas,et al.  Encyclopedia of food sciences and nutrition , 2003 .

[12]  Fariborz Jolai,et al.  Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration , 2012, Adv. Eng. Softw..

[13]  Fardin Ahmadizar,et al.  A new ant colony algorithm for makespan minimization in permutation flow shops , 2012, Comput. Ind. Eng..

[14]  Yash P. Aneja,et al.  Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic , 2011, Comput. Oper. Res..

[15]  ZhangWei,et al.  Hybrid flow shop scheduling , 1999 .

[16]  Jose M. Framiñan,et al.  Setting a common due date in a constrained flowshop: A variable neighbourhood search approach , 2010, Comput. Oper. Res..

[17]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[18]  Ching-Jong Liao,et al.  An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem , 2012, Appl. Soft Comput..

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

[20]  Xingsheng Gu,et al.  A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan ☆ , 2008 .

[21]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[22]  Desheng Li,et al.  Solving Permutation Flow Shop Scheduling Problem with a Cooperative Multi-swarm PSO Algorithm ⋆ , 2012 .