用绿鹭优化算法处理QAP和KSP——一种新的生物启发式元算法

C. Sur, A. Shukla
{"title":"用绿鹭优化算法处理QAP和KSP——一种新的生物启发式元算法","authors":"C. Sur, A. Shukla","doi":"10.1109/ICCCNT.2013.6726799","DOIUrl":null,"url":null,"abstract":"In this paper a new biological phenomenon following meta-heuristics called Green Heron Optimization Algorithm (GHOA) is being discussed, for the first time, which acquired its inspiration from the Green Heron birds, their intelligence, perception analysis capability and technique for food acquisition. The natural phenomenon of the bird has been capped into some unique operations which favour the graph based and discrete combinatorial optimization problems but with slight modification can also be utilized for other wide variety of problems of the real world which have discrete representation of data and variables having several constraints. In this work we have mainly concentrated on the description, mathematical representations, presentations, features, limitations and performance analysis of the algorithm on the scattered dimensional datasets of the Quadratic Assignment Problem (QAP) & 0/1 Knapsack Problem (KSP) to clearly demarcate its performance with change in dimension that is scalability. The results of the simulation clearly reveal how the algorithm has worked optimally for the various datasets of the problem. GHOA is one of the few members in the discrete domain algorithms of the bio-inspired computation family which favours suitably the graph based problems like path planning, process scheduling etc and has the capability of recombination and local search for global optimization and refinement of the solutions.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"148 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Dealing QAP & KSP with Green Heron optimization algorithm — A new bio-inspired meta-heuristic\",\"authors\":\"C. Sur, A. Shukla\",\"doi\":\"10.1109/ICCCNT.2013.6726799\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a new biological phenomenon following meta-heuristics called Green Heron Optimization Algorithm (GHOA) is being discussed, for the first time, which acquired its inspiration from the Green Heron birds, their intelligence, perception analysis capability and technique for food acquisition. The natural phenomenon of the bird has been capped into some unique operations which favour the graph based and discrete combinatorial optimization problems but with slight modification can also be utilized for other wide variety of problems of the real world which have discrete representation of data and variables having several constraints. In this work we have mainly concentrated on the description, mathematical representations, presentations, features, limitations and performance analysis of the algorithm on the scattered dimensional datasets of the Quadratic Assignment Problem (QAP) & 0/1 Knapsack Problem (KSP) to clearly demarcate its performance with change in dimension that is scalability. The results of the simulation clearly reveal how the algorithm has worked optimally for the various datasets of the problem. GHOA is one of the few members in the discrete domain algorithms of the bio-inspired computation family which favours suitably the graph based problems like path planning, process scheduling etc and has the capability of recombination and local search for global optimization and refinement of the solutions.\",\"PeriodicalId\":6330,\"journal\":{\"name\":\"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)\",\"volume\":\"148 1\",\"pages\":\"1-8\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCNT.2013.6726799\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCNT.2013.6726799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文首次讨论了继元启发式之后的一种新的生物学现象——绿苍鹭优化算法(Green Heron Optimization Algorithm, GHOA),该算法的灵感来源于绿苍鹭的智力、感知分析能力和食物获取技术。鸟的自然现象已经被限定为一些独特的操作,这些操作有利于基于图的离散组合优化问题,但稍加修改,也可以用于现实世界中具有离散数据表示和具有若干约束的变量的其他各种问题。在这项工作中,我们主要集中在二次分配问题(QAP)和0/1背包问题(KSP)的分散维度数据集上对算法的描述,数学表示,演示,特征,局限性和性能分析,以明确区分其性能与维度变化即可扩展性。仿真结果清楚地揭示了该算法如何在问题的各种数据集上实现最佳工作。GHOA算法是生物启发计算族中为数不多的离散域算法之一,它适合于路径规划、过程调度等基于图的问题,并具有重组和局部搜索的能力,以实现解的全局优化和细化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dealing QAP & KSP with Green Heron optimization algorithm — A new bio-inspired meta-heuristic
In this paper a new biological phenomenon following meta-heuristics called Green Heron Optimization Algorithm (GHOA) is being discussed, for the first time, which acquired its inspiration from the Green Heron birds, their intelligence, perception analysis capability and technique for food acquisition. The natural phenomenon of the bird has been capped into some unique operations which favour the graph based and discrete combinatorial optimization problems but with slight modification can also be utilized for other wide variety of problems of the real world which have discrete representation of data and variables having several constraints. In this work we have mainly concentrated on the description, mathematical representations, presentations, features, limitations and performance analysis of the algorithm on the scattered dimensional datasets of the Quadratic Assignment Problem (QAP) & 0/1 Knapsack Problem (KSP) to clearly demarcate its performance with change in dimension that is scalability. The results of the simulation clearly reveal how the algorithm has worked optimally for the various datasets of the problem. GHOA is one of the few members in the discrete domain algorithms of the bio-inspired computation family which favours suitably the graph based problems like path planning, process scheduling etc and has the capability of recombination and local search for global optimization and refinement of the solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信