… eling salesman problem, a colored traveling salesman problem (CTSP… method based on
particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman …

… of the popular traveling salesman problem with multiple salesmen. In … Problem definition
and literature review In this section, we first introduce the colored traveling salesmen problem …

… several optimization problems, we hypothesize its promising performance also for the TSP.
To this end, we have developed different versions of well-known swarm intelligence methods…

… [6] proposed a population-based incremental learning (PBIL) algorithm for a serial
colored traveling salesman problem (S-CTSP). To enhance its search ability, a 2-opt was …

… traveling salesman problem. In it, each city has one to multiple colors and allows a salesman
in the same color … borhood search with particle swarm optimization for solving sustainable …

… colored balanced traveling salesman problem (CBTSP), it is utilized to model optimization
problems with … NGA is valid swarm intelligence algorithm for the optimization problems. By the …

… The colored traveling salesmen problem is a node routing problem with multiple salesmen,
… The objective is to minimize the total traveling distance of m Hamiltonian circuits (routes) …

… colored traveling salesman problem (WB-CTSP), as shown in Section V. The salesmen of
… interests include combinational optimization, operations research, and artificial intelligence. …

… the classic combinatorial optimization problems. Colored traveling salesman problem (CTSP…
provided a new consensus-based particle swarm optimization method for large scale global …

… MTSP: a new variant introduced by [39] called colored traveling salesman problem (CTSP), …
PSO based approaches. The particle swarm optimization approach is one of the best-known …