Immune clone algorithm and mfcTP

Z. Hongwei, Cui Xiaoke, Zou Shu-rong
{"title":"Immune clone algorithm and mfcTP","authors":"Z. Hongwei, Cui Xiaoke, Zou Shu-rong","doi":"10.1109/ICACTE.2010.5578982","DOIUrl":null,"url":null,"abstract":"A new immune clone algorithm is proposed for coping with the multi-objective fixed-charged transportation optimization problem (mfcTP) in the paper. In terms of this new algorithm base on the vector affinity, we firstly make the sum of active and fixed-charged order by ascending and greedy algorithm infused into the antibody decoding, sequentially enhancing the intelligent learning ability of antibody; Then apply the cloning mechanism, balanced the relationship between the global exploration and the local development and enhanced the optimization ability of the algorithm. The experimental results show that the algorithm can find better Pareto front and Pareto optimal solutions in the real-world problems even if nonlinear and discontinuous. So it is more effective than st-GA and m-GA.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTE.2010.5578982","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A new immune clone algorithm is proposed for coping with the multi-objective fixed-charged transportation optimization problem (mfcTP) in the paper. In terms of this new algorithm base on the vector affinity, we firstly make the sum of active and fixed-charged order by ascending and greedy algorithm infused into the antibody decoding, sequentially enhancing the intelligent learning ability of antibody; Then apply the cloning mechanism, balanced the relationship between the global exploration and the local development and enhanced the optimization ability of the algorithm. The experimental results show that the algorithm can find better Pareto front and Pareto optimal solutions in the real-world problems even if nonlinear and discontinuous. So it is more effective than st-GA and m-GA.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
免疫克隆算法与mfcTP
针对多目标固定收费运输优化问题,提出了一种新的免疫克隆算法。该算法基于向量亲和力,首先通过升序和贪心算法将主动和固定电荷顺序之和注入到抗体解码中,依次增强抗体的智能学习能力;然后应用克隆机制,平衡全局探索与局部发展的关系,增强算法的优化能力。实验结果表明,该算法在实际问题中即使是非线性和不连续问题也能找到较好的Pareto前解和Pareto最优解。所以它比st-GA和m-GA更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Title pages Title pages Title pages A new online fault diagnosis algorithm based on likelihood ratio and Tabu search in distribution networks An information extraction of title panel in engineering drawings and automatic generation system of three statistical tables
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1