返回
Simple Probabilistic Population-Based Optimization
DOI:10.1109/TEVC.2015.2451701.png)
摘要
En 中文
A generic scheme is proposed for designing and classifying simple probabilistic population-based optimization (SPPBO) algorithms that use principles from population-based ant colony optimization (PACO) and simplified swarm optimization (SSO) for solving combinatorial optimization problems. The scheme, called SPPBO, identifies different types of populations (or archives) and their influence on the construction of new solutions. The scheme is used to show how SSO can be adapted for solving combinatorial optimization problems and how it is related to PACO. Moreover, several new variants and combinations of these two metaheuristics are generated with the proposed scheme. An experimental study is done to evaluate and compare the influence of different population types on the optimization behavior of SPPBO algorithms, when applied to the traveling salesperson problem and the quadratic assignment problem.
Keyword:
Algorithms
computer science
operations research
population-based ant colony optimization (PACO)
population-based metaheuristics
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
<p><strong><em>Burmannia munnarensis</em> (Burmanniaceae) a new species and rediscovery of <em>B. indica</em> after 110 years from southern Western Ghats, Kerala, India</strong></p>
Phytotaxa
IF0

