Abstract The Multiple Traveling Salesman Problem (MTSP) is among the most interesting
combinatorial optimization problems because it is widely adopted in real-life applications …

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 evolutionary algorithms (EAs) have been shown favorable performance for feature
selection. However, a large number of evaluations are required through the EAs. Thus, they …

Truck-drone hybrid delivery is a hybrid one combining the advantages including large
capacity of truck and high travel speed of drone together. Vehicle routing problem with …

A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …

Abstract The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial
optimization problem with many practical variants. The Lin–Kernighan–Helsgaun (LKH) …

The foremost objective of this article is to develop a novel hybrid powerful meta-heuristic that
integrates the salp swarm algorithm with sine cosine algorithm (called HSSASCA) for …

Trackless rubber-tyerd vehicles are the core equipment for auxiliary transportation in
inclined-shaft coal mines, and the rationality of their routes plays the direct impact on …

A bottleneck-minimized colored traveling salesman problem is an important variant of
colored traveling salesman problems. It is useful in handling the planning problems with …

The colored traveling salesmen problem is a node routing problem with multiple salesmen,
where the cities are divided into m exclusive city sets and one shared city set. The objective …