The Relationship between Metaheuristics Stopping Criteria and Performances: Cases of NSGA-II and MOPSO-CD for Sustainable Peach Fruit Design

Mohamed-Mahmoud Ould Sidi, Bénédicte Quilot-Turion, Abdeslam Kadrani, Michel Génard and Françoise Lescourret
Additional contact information
Mohamed-Mahmoud Ould Sidi: UR 1115 Plantes et Systèmes de Culture Horticoles, Institut National de la Recherche Agronomique (INRA), Avignon, France
Bénédicte Quilot-Turion: UR 1052 Génétique et Amélioration des Fruits et Légumes, Institut National de la Recherche Agronomique (INRA), Montfavet, France
Abdeslam Kadrani: Mathematics and Operation Research, Institut National de Statistique et Economie Appliquée (INSEA), Rabat, Morocco
Michel Génard: UR 1115 Plantes et Systèmes de Culture Horticoles, Institut National de la Recherche Agronomique (INRA), Avignon, France
Françoise Lescourret: UR 1115 Plantes et Systèmes de Culture Horticoles, Institut National de la Recherche Agronomique (INRA), Avignon, France

International Journal of Applied Metaheuristic Computing (IJAMC), 2014, vol. 5, issue 3, 44-70

Abstract: A major difficulty in the use of metaheuristics (i.e. evolutionary and particle swarm algorithms) to deal with multi-objective optimization problems is the choice of a convenient point at which to stop computation. Indeed, it is difficult to find the best compromise between the stopping criterion and the algorithm performance. This paper addresses this issue using the Non-dominated Sorting Genetic Algorithm (NSGA-II) and the Multi-Objective Particle Swarm Optimization with Crowding Distance (MOPSO-CD) for the model-based design of sustainable peach fruits. The optimization problem of interest contains three objectives: maximize fruit fresh mass, maximize fruit sugar content, and minimize the crack density on the fruit skin. This last objective targets a reduction in the use of fungicides and can thus enhance preservation of the environment and human health. Two versions of the NSGA-II and two of the MOPSO-CD were applied to tackle this difficult optimization problem: the original versions with a maximum number of generations used as stopping criterion and modified versions using the stopping criterion proposed by the authors of (Roudenko & Schoenauer, 2004). This second stopping criterion is based on the stabilization of the maximal crowding distance and aims to stop computation when many generations are performed without further improvement in the quality of the solutions. A benchmark consisting of four plant management scenarios has been used to compare the performances of the original versions (OV) and the modified versions (MV) of the NSGA-II and the MOPSO-CD. Twelve independent simulations were performed for each version and for each scenario, and a high number of generations were generated for the OV (e.g., 1500 for the NSGA-II and 200 for the MOPSO-CD). This paper compares the performances of the two versions of both algorithms using four standard metrics and statistical tests. For both algorithms, the MV obtained solutions similar in quality to those of the OV but after significantly fewer generations. The resulting reduction in computational time for the optimization step will provide opportunities for further studies on the sustainability of peach ideotypes.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/ijamc.2014070104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:5:y:2014:i:3:p:44-70

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().