基于对标学习的智能优化算法

谢安世

doi:10.11959/j.issn.1000-0801.2018144

您当前的位置：

首页 >

文章列表页 >

基于对标学习的智能优化算法

研究与开发 | 更新时间：2024-06-05

- 基于对标学习的智能优化算法
- Intelligent optimization algorithm based on benchmarking
- 电信科学 2018年34卷第7期页码：92-101
- 作者机构：
- 作者简介：
  
  [ "谢安世（1983–），男，博士，浙江工业大学助理研究员，主要研究方向为管理与决策的认识论与方法论。" ]
- 基金信息：
  
  浙江省哲学社会科学重点研究基地技术创新与企业国际化研究中心项目;Research Fund from “Zhejiang Provincial Key Research Base of Philosophy and Social Sciences-Research Centre for Technology Innovation and Enterprise Internationalization”;浙江工业大学中小微企业转型升级协同创新中心项目;Research Fund from “Collaborative Innovation Center for Transformation and Upgrading of Micro,Small and Medium Enterprises,Zhejiang University of Technology”;教育部人文社会科学基金资助项目;The Ministry of Education of Humanities and Social Science Project(17YJC630011)
- DOI：10.11959/j.issn.1000-0801.2018144
  中图分类号： N940，TP202
- 网络出版日期：2018-07，
  
  纸质出版日期：2018-07-20
- 稿件说明：
移动端阅览
谢安世. 基于对标学习的智能优化算法[J]. 电信科学, 2018,34(7):92-101.

Anshi XIE. Intelligent optimization algorithm based on benchmarking[J]. Telecommunications science, 2018, 34(7): 92-101.
谢安世. 基于对标学习的智能优化算法[J]. 电信科学, 2018,34(7):92-101. DOI： 10.11959/j.issn.1000-0801.2018144.

Anshi XIE. Intelligent optimization algorithm based on benchmarking[J]. Telecommunications science, 2018, 34(7): 92-101. DOI： 10.11959/j.issn.1000-0801.2018144.

摘要

科研、工程和管理中的很多问题都可以转化为优化问题。应用于这些优化问题的各种方法本身就是各种模型，设计不同的方法即设计不同的模型。将标杆管理理念建模成为一种用于单目标优化问题的元启发式搜索方法。基于奥卡姆剃刀原则，摒弃了复杂的操作算子的概率调优规则，用一个简单的框架来组织核心算子，从而达到许多组合算法的搜索效果。

Abstract

Many of the issues in scientific research

engineeringand management can be transformed into optimization problems.The various methods applied to these problems were a variety of models.Designing different methods was designing different models.The theme was to model the benchmarking philosophy in business management as a meta-heuristic search method for single objective bound-constrained real-parameter optimization problems.According to the principle of Occam’s Razor

many complicated operators and their probability tuning rules were abandoned and a simple framework was used to organize the core operators to achieve the effect of many composition algorithms.

关键词

Keywords

references

SÖRENSEN K . Metaheuristic-the metaphor exposed [J ] . International Transactions in Operational Research , 2015 , 22 ( 1 ): 3 - 18 .

PIOTROWSKI A P , NAPIORKOWSKIJ J , ROWINSKIP M . How novel is the “novel” black hole optimization approach? [J ] . Information Sciences , 2014 ( 267 ): 191 - 200 .

FONG S , WANG X , XU Q , et al . Recent advances in metaheuristic algorithms:does the Makara dragon exist? [J ] . The Journal of Supercomputing , 2016 , 72 ( 10 ): 3764 - 3786 .

BREST J , MAUČEC M S , BOŠKOVIĆ B , . Single objective real-parameter optimization:algorithm jSO [C ] // 2017 IEEE Congress onEvolutionary Computation (CEC),June 5-8,2017,San Sebastian,Spain . Piscataway:IEEE Press , 2017 : 1311 - 1318 .

AWAD N H , ALI M Z , SUGANTHAN P N . Ensemble sinusoidal differential covariance matrix adaptation with Euclidean neighborhood for solving CEC2017 benchmark problems [C ] // 2017 IEEE Congress on Evolutionary Computation (CEC),June 5-8,2017,San Sebastian,Spain . Piscataway:IEEE Press , 2017 : 372 - 379 .

MOHAMED A W , HADI A A , FATTOUH A M , et al . LSHADE with semi-parameter adaptation hybrid with CMA-ES for solving CEC 2017 benchmark problems [C ] // 2017 IEEE Congress on Evolutionary Computation (CEC),June 5-8,2017,San Sebastian,Spain . Piscataway:IEEE Press , 2017 : 145 - 152 .

JAGODZIŃSKI D , ARABAS J . A differential evolution strategy [C ] // 2017 IEEE Congress on Evolutionary Computation (CEC),June 5-8,2017,San Sebastian,Spain . Piscataway:IEEE Press , 2017 : 1872 - 1876 .

MICHALEWICZ Z . Quo vadis,evolutionary computation? On a growing gap between theory andpractice [J ] . Lecture Notes in Computer Science , 2012 : 98 - 121 .

MICHALEWICZ Z . The emperor is naked:evolutionary algorithms for real-world applications [J ] . Association for Computing Machinery Inc , 2012 ( 3 ): 1 - 13 .

浏览量

424

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据