A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy
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 because it is widely adopted in real-life applications …
A review: machine learning for combinatorial optimization problems in energy areas
Combinatorial optimization problems (COPs) are a class of NP-hard problems with great
practical significance. Traditional approaches for COPs suffer from high computational time …
practical significance. Traditional approaches for COPs suffer from high computational time …
Dec-MCTS: Decentralized planning for multi-robot active perception
We propose a decentralized variant of Monte Carlo tree search (MCTS) that is suitable for a
variety of tasks in multi-robot active perception. Our algorithm allows each robot to optimize …
variety of tasks in multi-robot active perception. Our algorithm allows each robot to optimize …
[HTML][HTML] A multi-agent approach to the truck multi-drone routing problem
In this work, we address the Truck-multi-Drone Team Logistics Problem (TmDTL), devoted to
visit a set of points with a truck helped by a team of unmanned aerial vehicles (UAVs) or …
visit a set of points with a truck helped by a team of unmanned aerial vehicles (UAVs) or …
Socio evolution & learning optimization algorithm: A socio-inspired optimization methodology
The paper proposes a novel metaheuristic Socio Evolution & Learning Optimization
Algorithm (SELO) inspired by the social learning behaviour of humans organized as families …
Algorithm (SELO) inspired by the social learning behaviour of humans organized as families …
A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
This paper proposes a new crossover operator called two-part chromosome crossover
(TCX) for solving the multiple travelling salesmen problem (MTSP) using a genetic algorithm …
(TCX) for solving the multiple travelling salesmen problem (MTSP) using a genetic algorithm …
Cohort intelligence: a self supervised learning behavior
By virtue of the collective and interdependent behavior of its candidates, a swarm organizes
itself to achieve a particular task. Similarly, inspired from the natural and social tendency of …
itself to achieve a particular task. Similarly, inspired from the natural and social tendency of …
An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem
J Yang, Y Zhuang - Applied soft computing, 2010 - Elsevier
This paper presents an improved ant colony optimization algorithm (IACO) for solving mobile
agent routing problem. The ants cooperate using an indirect form of communication …
agent routing problem. The ants cooperate using an indirect form of communication …
An elitist self-adaptive step-size search for structural design optimization
This paper presents a method for optimal sizing of truss structures based on a refined self-
adaptive step-size search (SASS) algorithm. An elitist self-adaptive step-size search …
adaptive step-size search (SASS) algorithm. An elitist self-adaptive step-size search …
Cohort intelligence with self-adaptive penalty function approach hybridized with colliding bodies optimization algorithm for discrete and mixed variable constrained …
Abstract Recently, several socio-/bio-inspired algorithms have been proposed for solving a
variety of problems. Generally, they perform well when applied for solving unconstrained …
variety of problems. Generally, they perform well when applied for solving unconstrained …