.png){kind=icon}
返回
A Fast Efficient Local Search-Based Algorithm for Multi-Objective Supply Chain Configuration Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2983473.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Supply chain configuration (SCC) plays an important role in supply chain management. This paper focuses on a multi-objective SCC (MOSCC) problem for minimizing both the cost of goods sold and the lead time simultaneously. Some existing population-based methods use the evolution of a population to obtain the optimal Pareto set, but they are time-consuming. In this paper, an Efficient Local Search-based algorithm with rank (ELSrank) is designed to solve the MOSCC problem. Firstly, instead of use of population, two solutions (x(A) and x(B)) are generated by the greedy strategy, which have the minimal cost and the minimal time, respectively. They approximately locate in two sides of the Pareto front (PF). Secondly, with the consideration of the problem characteristics, a local search (LS) is proposed to find competitive solutions among the common neighborhood of two given solutions. If x(A) and x(B) are chosen to execute the proposed LS, solutions along the link path (the approximate PF) of x(A) and x(B) can be found. This way, the solutions along the whole PF can be found. The comparative experiments are conducted on six instances from the real-life MOSCC problems, and the results show that ELSrank performs better than other start-of-the-art algorithms, especially on the large scale problem instances.
Keyword:
Supply chain configuration
multi-objective optimization
Pareto front
local search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏Influence Maximization-Cost Minimization in Social Networks Based on a Multiobjective Discrete Particle Swarm Optimization Algorithm.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容