The colored traveling salesmen problem (CTSP) is a generalization of the popular traveling
salesman problem with multiple salesmen. In CTSP, the cities are divided into m exclusive …

Opposition-based learning (OBL) has been widely used to improve many swarm intelligent
optimization (SI) algorithms for continuous problems during the past few decades. When the …

多旅行商问题(MTSP) 作为经典旅行商问题(TSP) 的一种泛化, 是著名的组合优化问题之一.
但多旅行商问题作为经典NP-hard 问题, 其问题规模以及运算复杂度都对求解方法有着极高的 …

A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem, which introduces colors to distinguish the accessibility of its …

Visiting constrained multiple traveling salesmen problem (VCMTSP) is an extension of the
multiple traveling salesmen problem (MTSP). In this problem, each city is restricted to be …

The multiple traveling salesmen problem with visiting constraints (VCMTSP) is an extension
of the multiple traveling salesmen problem (MTSP). In this problem, some cities are …

Abstract Capacitated Multiple Traveling Salesmen Problem (CMTSP) is an extension of the
traditional Multiple Traveling Salesmen Problem (MTSP). In this problem, each city has a …

With the development of science and technology, the accuracy requirements for solving
engineering problems are getting stricter than before. Most structural design optimization …

Presently, the greedy searching strategy has been widely accepted for obtaining reduct in
the field of rough set. In the framework of greedy searching, the evaluation of the candidate …

Quadratic assignment problem (QAP) is an NP-hard problem. Because of this computational
complexity, various search processes have been developed and used in different heuristics …