返回
A Novel Cognitively Inspired State Transition Algorithm for Solving the Linear Bi-Level Programming Problem
DOI:10.1007/s12559-018-9561-1.png)
摘要
En 中文
Linear bi-level programming (LBLP) is a useful tool for modeling decentralized decision-making problems. It has two-level (upper-level and lower-level) objectives. Many studies have shown that the LBLP problem is NP-hard, meaning it is difficult to find a global solution in polynomial time. In this paper, we present a novel cognitively inspired computing method based on the state transition algorithm (STA) to obtain an approximate optimal solution for the LBLP problem in polynomial time. The proposed method is applied to a supply chain model that fits the definition of an LBLP problem. The experimental results indicate that the proposed method is more efficient in terms of solution accuracy through a comparison to other metaheuristic-based methods using four problems from the literature in addition to the supply chain distribution model. In this study, a cognitively inspired STA-based method was proposed for the LBLP problem. In the future, we expect to extent the proposed method for linear multi-level programming problems.
Keyword:
Linear bi-level programming
State transition algorithm
Cognitively inspired computing
Global optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
1.6K
被引数:
3.6K
机构
引用论文
Preliminary investigations into SU-8 as a material for integrated all-optical microwave filters对SU-8作为集成全光微波滤波器材料的初步研究
A dynamic state transition algorithm with application to sensor network localization
NEUROCOMPUTING
IF6.5

