乳品系统中饲料资源分配的进化多目标算法

G. Notte, P. Chilibroste, M. Pedemonte, Héctor Cancela
{"title":"乳品系统中饲料资源分配的进化多目标算法","authors":"G. Notte, P. Chilibroste, M. Pedemonte, Héctor Cancela","doi":"10.1109/LA-CCI48322.2021.9769787","DOIUrl":null,"url":null,"abstract":"In grassland-based dairy systems, determining how to rotate the cows among fields for grazing, how much concentrate to supply and the correct stocking rate to be used are important decisions that impact on the efficiency of the system. Considering the presence of conflictive objectives, a multi-objective approach is therefore the natural way of facing the problem. Due to the computational difficulty of finding the full solution set (the Pareto front) of multi-objective models, it is usually necessary to employ algorithms giving a good approximation of this set. In particular, a number of multi-objective evolutionary algorithms with different characteristics have been proposed in the general optimization literature; but there is no current study of which is the most appropriate one for feed resource allocation in dairy systems. In this work, we present the performance evaluation of four multi-objective evolutionary algorithms to generate an approximation of the Pareto front of the feed resource allocation problem in dairy systems. Two classical genetic algorithms (NSGA-II and SPEA-2) and two differential evolution (DE) algorithms (GDE-3 and a Pareto-based DE) were used. To evaluate the algorithms, two experiments based on scenarios constructed from real data were performed. The comparison took into account running times, objective function values attained, Pareto front comparisons, and approximation quality measures based on four different metrics. From the results we conclude that the SPEA-2 is the algorithm that obtains the best quality performance for the problem under study, but also the slowest one, opening a future work opportunity of improving its computational performance.","PeriodicalId":431041,"journal":{"name":"2021 IEEE Latin American Conference on Computational Intelligence (LA-CCI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Evolutionary multi-objective algorithms for feed resource allocation in dairy systems\",\"authors\":\"G. Notte, P. Chilibroste, M. Pedemonte, Héctor Cancela\",\"doi\":\"10.1109/LA-CCI48322.2021.9769787\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In grassland-based dairy systems, determining how to rotate the cows among fields for grazing, how much concentrate to supply and the correct stocking rate to be used are important decisions that impact on the efficiency of the system. Considering the presence of conflictive objectives, a multi-objective approach is therefore the natural way of facing the problem. Due to the computational difficulty of finding the full solution set (the Pareto front) of multi-objective models, it is usually necessary to employ algorithms giving a good approximation of this set. In particular, a number of multi-objective evolutionary algorithms with different characteristics have been proposed in the general optimization literature; but there is no current study of which is the most appropriate one for feed resource allocation in dairy systems. In this work, we present the performance evaluation of four multi-objective evolutionary algorithms to generate an approximation of the Pareto front of the feed resource allocation problem in dairy systems. Two classical genetic algorithms (NSGA-II and SPEA-2) and two differential evolution (DE) algorithms (GDE-3 and a Pareto-based DE) were used. To evaluate the algorithms, two experiments based on scenarios constructed from real data were performed. The comparison took into account running times, objective function values attained, Pareto front comparisons, and approximation quality measures based on four different metrics. From the results we conclude that the SPEA-2 is the algorithm that obtains the best quality performance for the problem under study, but also the slowest one, opening a future work opportunity of improving its computational performance.\",\"PeriodicalId\":431041,\"journal\":{\"name\":\"2021 IEEE Latin American Conference on Computational Intelligence (LA-CCI)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Latin American Conference on Computational Intelligence (LA-CCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LA-CCI48322.2021.9769787\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Latin American Conference on Computational Intelligence (LA-CCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LA-CCI48322.2021.9769787","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在以草原为基础的乳制品系统中,确定如何在不同的田地之间轮换奶牛放牧,提供多少浓缩物以及使用正确的放养率是影响系统效率的重要决策。考虑到存在冲突的目标,因此多目标方法是面对问题的自然方式。由于寻找多目标模型的完整解集(Pareto front)的计算困难,通常有必要采用给出该集的良好近似值的算法。特别是,在一般的优化文献中提出了许多具有不同特征的多目标进化算法;但是目前还没有研究表明哪一种最适合奶牛系统的饲料资源配置。在这项工作中,我们提出了四种多目标进化算法的性能评估,以产生乳制品系统中饲料资源分配问题的帕累托前沿近似。采用两种经典遗传算法(NSGA-II和SPEA-2)和两种差分进化算法(GDE-3和基于pareto的DE)。为了评估这些算法,进行了两个基于真实数据构建场景的实验。该比较考虑了运行时间、达到的目标函数值、帕累托前比较和基于四个不同度量的近似质量度量。结果表明,SPEA-2算法是对所研究的问题获得最优质量性能的算法,但也是最慢的算法,为进一步提高其计算性能开辟了一个工作机会。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Evolutionary multi-objective algorithms for feed resource allocation in dairy systems
In grassland-based dairy systems, determining how to rotate the cows among fields for grazing, how much concentrate to supply and the correct stocking rate to be used are important decisions that impact on the efficiency of the system. Considering the presence of conflictive objectives, a multi-objective approach is therefore the natural way of facing the problem. Due to the computational difficulty of finding the full solution set (the Pareto front) of multi-objective models, it is usually necessary to employ algorithms giving a good approximation of this set. In particular, a number of multi-objective evolutionary algorithms with different characteristics have been proposed in the general optimization literature; but there is no current study of which is the most appropriate one for feed resource allocation in dairy systems. In this work, we present the performance evaluation of four multi-objective evolutionary algorithms to generate an approximation of the Pareto front of the feed resource allocation problem in dairy systems. Two classical genetic algorithms (NSGA-II and SPEA-2) and two differential evolution (DE) algorithms (GDE-3 and a Pareto-based DE) were used. To evaluate the algorithms, two experiments based on scenarios constructed from real data were performed. The comparison took into account running times, objective function values attained, Pareto front comparisons, and approximation quality measures based on four different metrics. From the results we conclude that the SPEA-2 is the algorithm that obtains the best quality performance for the problem under study, but also the slowest one, opening a future work opportunity of improving its computational performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信