A Study on Solving Single Stage Batch Process Scheduling Problems with an Evolutionary Algorithm Featuring Bacterial Mutations

  • Máté HegyhátiEmail author
  • Olivér Ősz
  • Miklós Hatwágner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10841)


The short term scheduling of batch processes is an active research field of chemical engineering, that has been addressed by many different techniques over the last decades. These approaches, however, are unable to solve long-term scheduling problems due their size, and the vast number of discrete decisions they entail. Evolutionary algorithms already proved to be efficient for some classes of large scheduling problems, and recently, the utilization of bacterial mutations has shown promising results on other fields.

In this paper, an evolutionary algorithm featuring bacterial mutation is introduced to solve a case study of a single stage product scheduling problem. The solution performance of the algorithm was compared to a method from the literature. The results indicate that the proposed approach can find the optimal solution under relatively short execution times.


Single stage product scheduling Bacterial Evolutionary Algorithm 



This research was supported by the ÚNKP-17-4 New National Excellence Program of the Ministry of Human Capacities. This research was supported by the EFOP-3.6.1-16-2016-00017; “Internationalization, initiatives to establish a new source of researchers and graduates, and development of knowledge and technological transfer as instruments of intelligent specializations at Szechenyi University” grant.


  1. 1.
    Balázs, K., Horváth, Z., Kóczy, L.T.: Different chromosome-based evolutionary approaches for the permutation flow shop problem. Acta Polytech. Hung. 9(2), 115–138 (2012)Google Scholar
  2. 2.
    Ferrer-Nadal, S., Capón-García, E., Méndez, C.A., Puigjaner, L.: Material transfer operations in batch scheduling. A critical modeling issue. Ind. Eng. Chem. Res. 47, 7721–7732 (2008)CrossRefGoogle Scholar
  3. 3.
    Floudas, C.A., Lin, X.: Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review. Comput. Chem. Eng. 28(11), 2109–2129 (2004)CrossRefGoogle Scholar
  4. 4.
    Földesi, P., Botzheim, J., Kóczy, L.T.: Eugenic bacterial memetic algorithm for fuzzy road transport traveling salesman problem. Int. J. Innov. Comput. Inf. Control 7(5), 2775–2798 (2011)Google Scholar
  5. 5.
    Ghaeli, M., Bahri, P.A., Lee, P., Gu, T.: Petri-net based formulation and algorithm for short-term scheduling of batch plants. Comput. Chem. Eng. 29(2), 249–259 (2005)CrossRefGoogle Scholar
  6. 6.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Boston (1989)zbMATHGoogle Scholar
  7. 7.
    Hegyhati, M., Friedler, F.: Overview of Industrial Batch Process Scheduling. Chem. Eng. Trans. 21, 895–900 (2010)Google Scholar
  8. 8.
    Hegyháti, M., Majozi, T., Holczinger, T., Friedler, F.: Practical infeasibility of cross-transfer in batch plants with complex recipes: S-graph vs MILP methods. Chem. Eng. Sci. 64(3), 605–610 (2009)CrossRefGoogle Scholar
  9. 9.
    Kopanos, G.M., Lainez, J.M., Puigjaner, L.: An efficient mixed-integer linear programming scheduling framework for addressing sequence-dependent setup issues in batch plants. Ind. Eng. Chem. Res. 48(13), 6346–6357 (2009)CrossRefGoogle Scholar
  10. 10.
    Levner, E., Kats, V., De Pablo, D.A.L., Cheng, T.C.: Complexity of cyclic scheduling problems: a state-of-the-art survey. Comput. Ind. Eng. 59(2), 352–361 (2010)CrossRefGoogle Scholar
  11. 11.
    Mendez, C.A., Cerda, J., Grossmann, I.E., Harjunkoski, I., Fahl, M.: State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput. Chem. Eng. 30(6–7), 913–946 (2006)CrossRefGoogle Scholar
  12. 12.
    Nawa, N.E., Furuhashi, T.: A study on the effect of transfer of genes for the bacterial evolutionary algorithm. In: 1998 Proceedings of the Second International Conference on Knowledge-Based Intelligent Electronic Systems, KES 1998, vol. 3, pp. 585–590. IEEE (1998)Google Scholar
  13. 13.
    Nawa, N.E., Furuhashi, T.: Fuzzy system parameters discovery by bacterial evolutionary algorithm. IEEE Trans. Fuzzy Syst. 7(5), 608–616 (1999)CrossRefGoogle Scholar
  14. 14.
    Nawa, N.E., Hashiyama, T., Furuhashi, T., Uchikawa, Y.: A study on fuzzy rules discovery using pseudo-bacterial genetic algorithm with adaptive operator. In: 1997 IEEE International Conference on Evolutionary Computation, pp. 589–593. IEEE (1997)Google Scholar
  15. 15.
    Panek, S., Engell, S., Subbiah, S., Stursberg, O.: Scheduling of multi-product batch plants based upon timed automata models. Comput. Chem. Eng. 32(1–2), 275–291 (2008)CrossRefGoogle Scholar
  16. 16.
    Ralphs, T., Shinano, Y., Berthold, T., Koch, T.: Parallel solvers for mixed integer linear optimization. Technical report 16T–014-R3, 16–74, ISE, Lehigh University and Zuse Institute Berlin (ZIB) (2016)Google Scholar
  17. 17.
    Sanmarti, E., Holczinger, T., Puigjaner, L.L., Friedler, F., Sanmartí, E., Puigjaner, L.L., Holczinger, T., Friedler, F.: Combinatorial framework for effective scheduling of multipurpose batch plants. AIChE J. 48(11), 2557–2570 (2002)CrossRefGoogle Scholar
  18. 18.
    Shaik, M.A., Floudas, C.A.: Novel unified modeling approach for short-term scheduling. Ind. Eng. Chem. Res. 48(6), 2947–2964 (2009)CrossRefGoogle Scholar
  19. 19.
    Smidla, J., Heckl, I.: S-graph based parallel algorithm to the scheduling of multipurpose batch plants. Chem. Eng. Trans. 21(1994), 937–942 (2010)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Széchenyi István UniversityGyőrHungary

Personalised recommendations