返回
An algorithm based on particle swarm optimization for multiobjective bilevel linear problems
DOI:10.1016/j.amc.2014.09.013.png)
摘要
En 中文
This paper presents an improved multiple objective particle swarm optimization (MOPSO) algorithm to solve bilevel linear programming problems with multiple objective functions at the upper level. The algorithm aims to produce a good approximation of the entire Pareto front of the problem. We have previously designed a MOPSO algorithm for the same class of problems, in which several techniques for the global best selection were tested, including a new one. The algorithm revealed a good convergence towards the Pareto front but the diversity of the solutions was a drawback. The algorithm we propose herein uses a hybrid strategy for the global best selection and an adaptive mutation operator. The incorporation of these mechanisms led to an improved algorithm, which also showed better overall performance than considering alternative options usually employed in MOPSO algorithms. The algorithm and computational results are presented. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Multiobjective optimization
Bilevel linear programming
Particle swarm optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
A probabilistic bi-level linear multi-objective programming problem to supply chain planning供应链计划的概率双层线性多目标规划问题
Intermittent fasting, a possible priming tool for host defense against SARS-CoV-2 infection: crosstalk among calorie restriction, autophagy and immune response间歇性禁食:宿主防御SARS-CoV-2感染的一种可能预调理工具:热量限制、自噬和免疫反应之间的串扰

