Electric Vehicle Ordered Charging Planning Based on Improved Dual-Population Genetic Moth–Flame Optimization

Algorithms Pub Date : 2024-03-06 DOI:10.3390/a17030110
Shuang Che, Yan Chen, Longda Wang, Chuanfang Xu
{"title":"Electric Vehicle Ordered Charging Planning Based on Improved Dual-Population Genetic Moth–Flame Optimization","authors":"Shuang Che, Yan Chen, Longda Wang, Chuanfang Xu","doi":"10.3390/a17030110","DOIUrl":null,"url":null,"abstract":"This work discusses the electric vehicle (EV) ordered charging planning (OCP) optimization problem. To address this issue, an improved dual-population genetic moth–flame optimization (IDPGMFO) is proposed. Specifically, to obtain an appreciative solution of EV OCP, the design for a dual-population genetic mechanism integrated into moth–flame optimization is provided. To enhance the global optimization performance, the adaptive nonlinear decreasing strategies with selection, crossover and mutation probability, as well as the weight coefficient, are also designed. Additionally, opposition-based learning (OBL) is also introduced simultaneously. The simulation results show that the proposed improvement strategies can effectively improve the global optimization performance. Obviously, more ideal optimization solution of the EV OCP optimization problem can be obtained by using IDPGMFO.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"25 24","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/a17030110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This work discusses the electric vehicle (EV) ordered charging planning (OCP) optimization problem. To address this issue, an improved dual-population genetic moth–flame optimization (IDPGMFO) is proposed. Specifically, to obtain an appreciative solution of EV OCP, the design for a dual-population genetic mechanism integrated into moth–flame optimization is provided. To enhance the global optimization performance, the adaptive nonlinear decreasing strategies with selection, crossover and mutation probability, as well as the weight coefficient, are also designed. Additionally, opposition-based learning (OBL) is also introduced simultaneously. The simulation results show that the proposed improvement strategies can effectively improve the global optimization performance. Obviously, more ideal optimization solution of the EV OCP optimization problem can be obtained by using IDPGMFO.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于改进的双种群遗传飞蛾-火焰优化的电动汽车有序充电规划
本研究讨论了电动汽车(EV)有序充电规划(OCP)优化问题。针对这一问题,提出了一种改进的双种群遗传蛾焰优化(IDPGMFO)。具体来说,为了获得电动汽车 OCP 的优化解,设计了一种集成到蛾焰优化中的双种群遗传机制。为了提高全局优化性能,还设计了具有选择、交叉和变异概率以及权重系数的自适应非线性递减策略。此外,还同时引入了基于对立面的学习(OBL)。仿真结果表明,所提出的改进策略能有效提高全局优化性能。显然,使用 IDPGMFO 可以获得更理想的 EV OCP 优化问题的优化解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Label-Setting Algorithm for Multi-Destination K Simple Shortest Paths Problem and Application A Quantum Approach for Exploring the Numerical Results of the Heat Equation Enhancing Indoor Positioning Accuracy with WLAN and WSN: A QPSO Hybrid Algorithm with Surface Tessellation Trajectory Classification and Recognition of Planar Mechanisms Based on ResNet18 Network Computational Test for Conditional Independence
×
引用
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