Combinatorial optimization problems are often considered NP-hard problems in the field of
decision science and the industrial revolution. As a successful transformation to tackle …

The applications of both Feed Forward Neural network and Multilayer perceptron are very
diverse and saturated. But the linear threshold unit of feed forward networks causes fast …

This article addresses the m-machine no-wait flowshop scheduling problem with the
objective of minimizing makespan subject to an upper bound on total completion time. An …

The unprecedented rise in the number of COVID-19 cases has drawn global attention, as it
has caused an adverse impact on the lives of people all over the world. As of December 31 …

Production distribution network (PDN) planning problems in multi echelon status are
commonly complex with dynamic relationships that cause several uncertainties in different …

Permutation flowshop scheduling problems (PFSSP) with an objective to minimise the total
elapsed time (makespan), are typically NP-hard in nature. Many heuristics and …

Nature-inspired swarm metaheuristics become one of the most powerful methods for
optimization. In discrete optimization, the efficiency of an algorithm depends on how it is …

针对标准萤火虫算法(FA), 首先, 从数学理论上分析并揭示了其存在的种群过早收敛,
容易陷入局部最优等不足, 然后提出一种基于模拟退火的混合萤火虫Memetic 算法 …

Flow shop scheduling is one of the widely handled problem types of operations research
which generally seen in manufacturing and production environment addressed by several …