Combinatorial optimization problems (COPs) are a class of NP-hard problems with great
practical significance. Traditional approaches for COPs suffer from high computational time …

Abstract The Asymmetric Traveling Salesman Problem (ATSP), as a branch of the traveling
salesman problem, aims to find a group of circuits when a salesman travels all cities at the …

Methanation is the core process of synthetic natural gas, the performance of the entire
reaction system depends on precise values of the reaction condition parameters. Accurate …

The slime mould algorithm (SMA) is a metaheuristic algorithm recently proposed, which is
inspired by the oscillations of slime mould. Similar to other algorithms, SMA also has some …

For spot-welding process, rational path planning of weld points can improve productivity for
welding robot. In basic ant colony optimization, at the beginning of the iteration, the …

Multiple traveling salesperson problems (m TSP) are a collection of problems that
generalize the classical traveling salesperson problem (TSP). In a nutshell, an m TSP …

This paper addresses a MinMax variant of the Dubins multiple traveling salesman problem
(mTSP). This routing problem arises naturally in mission planning applications involving …

In order to solve the cooperative search problem of multiple unmanned aerial vehicles (multi-
UAVs) in a large-scale area, we propose a genetic algorithm (GA) incorporating simulated …

摘要多旅行商问题在实际生活中有着较为广泛的应用价值, 该问题的求解受到越来越多学者的
关注. 信息传播算法是一类求解组合优化问题最为有效的方法, 基于K-means 聚类技术 …

To improve the inspection efficiency of free-form surfaces using coordinate measuring
machines (CMMs), this paper proposes a free-form CMM inspection path optimization …