The multi-target path planning problem is a universal problem to mobile robots and mobile
manipulators. The two movement modes of forward movement and rotation are universally …

Facility location models involve identifying locations for facilities that provide services to the
customers which are also called demand points. The p-median problem is a facility location …

In this paper, a novel graph model to figure Collision-Free Multiple Traveling Salesman
Problem (CFMTSP) is proposed. In this problem, a group of vehicles start from different …

This paper deals with an NP-hard problem called the colored balanced traveling salesman
problem (CBTSP), which is a variation of colored traveling salesman problem (CTSP) which …

A colored traveling salesman problem (CTSP) is an important variant of the well-known
multiple traveling salesman problem, which uses colors to differentiate salesmen's …

Firefly Algorithm (FA) mimics the flashing light characteristic of fireflies to solve optimization
problems. An area where its utilization is limited is Travelling Salesman Problem (TSP) …

The quadratic assignment problem (QAP) is a well-known challenging combinational
optimization problem that has received many researchers' attention with varied real-world …

着色旅行商问题是多旅行商问题的一个重要变种, 它被广泛地应用于带有重叠区域的多机工程
系统. 现有的着色旅行商问题难以有效应对带冲突的场景, 这种冲突通常表现为两个城市不允许 …

The max–min ant system (MMAS) is a modified ant colony optimization (ACO) algorithm. Its
convergence speed is effectively improved by setting the upper and lower bounds of the …

This thesis presents hybrid genetic algorithms for four routing problems: colored traveling
salesmen problem (CTSP), minmax multiple traveling salesmen problem (minmax mTSP) …