蛋鸡算法:求解连续规划问题的一种新的元启发式方法

E. Hosseini
{"title":"蛋鸡算法:求解连续规划问题的一种新的元启发式方法","authors":"E. Hosseini","doi":"10.4172/2168-9679.1000344","DOIUrl":null,"url":null,"abstract":"A concept for the optimization of continuous programming problems using an approach based on behavior of laying chicken, to produce chicken, is introduced. Laying chicken algorithm (LCA) is used for solving different kinds of linear and non-linear programming problems. The presented approach gives efficient and feasible solutions in an appropriate time which has been evaluated by solving test problems. The comparison between LCA and both of meta-heuristic and classic approaches are proposed.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"3 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"Laying Chicken Algorithm: A New Meta-Heuristic Approach to Solve Continuous Programming Problems\",\"authors\":\"E. Hosseini\",\"doi\":\"10.4172/2168-9679.1000344\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A concept for the optimization of continuous programming problems using an approach based on behavior of laying chicken, to produce chicken, is introduced. Laying chicken algorithm (LCA) is used for solving different kinds of linear and non-linear programming problems. The presented approach gives efficient and feasible solutions in an appropriate time which has been evaluated by solving test problems. The comparison between LCA and both of meta-heuristic and classic approaches are proposed.\",\"PeriodicalId\":15007,\"journal\":{\"name\":\"Journal of Applied and Computational Mathematics\",\"volume\":\"3 1\",\"pages\":\"1-8\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied and Computational Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4172/2168-9679.1000344\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Computational Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4172/2168-9679.1000344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29

摘要

介绍了一种基于蛋鸡行为的连续规划问题优化的概念,提出了一种基于蛋鸡行为的连续规划问题优化方法。蛋鸡算法(LCA)用于求解各种线性和非线性规划问题。该方法在适当的时间内给出了有效可行的解决方案,并通过解决测试问题进行了评价。对LCA与元启发式方法和经典方法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Laying Chicken Algorithm: A New Meta-Heuristic Approach to Solve Continuous Programming Problems
A concept for the optimization of continuous programming problems using an approach based on behavior of laying chicken, to produce chicken, is introduced. Laying chicken algorithm (LCA) is used for solving different kinds of linear and non-linear programming problems. The presented approach gives efficient and feasible solutions in an appropriate time which has been evaluated by solving test problems. The comparison between LCA and both of meta-heuristic and classic approaches are proposed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信