OPTIMAL VIABLE PATH SEARCH FOR A CHEESE RIPENING PROCESS USING A MULTI-OBJECTIVE EA

Salma Mesmoudi, Nathalie Perrot, Romain Reuillon, Paul Bourgine, Evelyne Lutton

Abstract

Viability theory is a very attractive theoretical approach for the modeling of complex dynamical systems. However, its scope of application is limited due to the high computational power it necessitates. Evolutionary computation is a convenient way to address some issues related to this theory. In this paper, we present a multiobjective evolutionary approach to address the optimisation problem related to the computation of optimal command profiles of a complex process. The application we address here is a real size problem from dairy industry, the modeling of a Camembert cheese ripening process. We have developed a parallel implementation of a multiobjective EA that has produced a Pareto front of optimal control profiles (or trajectories), with respect to four objectives. The Pareto front was then analysed by an expert who selected a interesting compromise, yielding a new control profile that seems promising for industrial applications.

References

  1. Aubin, J. P. (1991). Viability Theory. Birkhauser, Basel.
  2. Bokanowski, O., Martin, S., Munos, R., and Zidani, H. (2006). An anti-diffusive scheme for viability problems. Applied Numerical Mathematics, 56:1147- 1162.
  3. Coeurjolly, D. and Montanvert, A. (2007). Optimal separable algorithms to compute the reverse euclidean distance transformation and discrete medial axis in arbitrary dimension. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(3):437-448.
  4. Davis, L. (1985). Applying adapting algorithms to epistatic domains. In Proc. int. joint conf. articial intelligence, Quebec, canada.
  5. Deb, K., Agrawal, S., Pratap, A., and Meyarivan, T. (2000). A fast elitist non dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii. In In M. S. et al. (Ed.), Parallel Problem Solving from Nature PPSN VI, Springer, pages 849-858.
  6. Eiben, A. E. and Smith, J. E. (2003). Introduction to Evolutionary Algorithms. Springer, Berlin.
  7. Goldberg, D. (1989). Genetic algorithm in search, optimization and machine learning, Machine Learning. Addison-Wesley, New York26.
  8. Helias, A., Mirade, P., and Corrieu, G. (2007). Modeling of camembert-type cheese mass loss in a ripening chamber. Main biological and physical phenomena Journal of Dairy Science, 90:5324-5333.
  9. Horn, J., Nafpliotis, N., and Goldberg, D. E. (1994). A niched pareto genetic algorithm for multiobjective optimization. In In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Computation, Volume 1, Piscataway, NJ, IEEE Press, pages 82-87.
  10. Mesmoudi, S. P., Alvarez, I., Martin, S., Perrot, N., and Wuillemin, P.-H. (2009). Geometric analysis of a capture basin. application to cheese rippening process. In Proceeding of the European Conference on Complex Systems (ECCS).
  11. Oliver, I., Smith, D., and Holland, J. (1987). A study of permutation crossover operators on the traveling salesman problem. In Second int. conf. genetic algorithms, volume 5, pages 224-230.
  12. Reuillon, R., Chuffart, V., Leclaire, M., Faure, T., Dumoulin, N., and Hill, D. (2010). Declarative task delegation in openmole. In proceedings of International Conference on High Performance Computing and Simulation (HPCS 2010).
  13. Sicard, M., Martin, S., Rouillon, R., Mesmoudi, S., Alvarez, I., and Perrot, N. (2010). Development of a viability approach for reverse engineering in complex food processes: Application to a camembert cheese ripening process. geometric analysis for a reverse engineering approach - part i. Food Engineering, submitted.
  14. Sicard, M., Perrot, N., Baudrit, C., Reuillon, R., Bourgine, P., Alvarez, I., and Martin, S. (2009). The viability theory to control complex food processes. In Proceeding of the European Conference on Complex Systems (ECCS).
  15. Syswerda, G. (1989). Uniform crossover in genetic algorithms. In Schaffer, J. D. Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, California, USA: Morgan, pages 2-9. Kaufmann Publishers.
  16. Tsai, C., Tsai, C., and Yang, T. (2002). A modied multiplesearching method to genetic algorithms for solving traveling salesman problem. In In: IEEE int conf systems, Man and cybernetics, volume 3, pages 6-9.
Download


Paper Citation


in Harvard Style

Mesmoudi S., Perrot N., Reuillon R., Bourgine P. and Lutton E. (2010). OPTIMAL VIABLE PATH SEARCH FOR A CHEESE RIPENING PROCESS USING A MULTI-OBJECTIVE EA . In Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010) ISBN 978-989-8425-31-7, pages 225-230. DOI: 10.5220/0003083902250230


in Bibtex Style

@conference{icec10,
author={Salma Mesmoudi and Nathalie Perrot and Romain Reuillon and Paul Bourgine and Evelyne Lutton},
title={OPTIMAL VIABLE PATH SEARCH FOR A CHEESE RIPENING PROCESS USING A MULTI-OBJECTIVE EA},
booktitle={Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)},
year={2010},
pages={225-230},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003083902250230},
isbn={978-989-8425-31-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)
TI - OPTIMAL VIABLE PATH SEARCH FOR A CHEESE RIPENING PROCESS USING A MULTI-OBJECTIVE EA
SN - 978-989-8425-31-7
AU - Mesmoudi S.
AU - Perrot N.
AU - Reuillon R.
AU - Bourgine P.
AU - Lutton E.
PY - 2010
SP - 225
EP - 230
DO - 10.5220/0003083902250230