Abstract Ant Colony Optimization (ACO) is a metaheuristic that is inspired by the pheromone
trail laying and following behavior of some ant species. Artificial ants in ACO are stochastic …

Ant Colony Optimization (ACO) is a Swarm Intelligence technique which inspired from the
foraging behaviour of real ant colonies. The ants deposit pheromone on the ground in order …

Abstract The Traveling Salesman Problem (TSP) is one of the standard test problems used
in performance analysis of discrete optimization algorithms. The Ant Colony Optimization …

Abstract Ant Colony Optimization (ACO) is a family of nature-inspired metaheuristics often
applied to finding approximate solutions to difficult optimization problems. Despite being …

Research in metaheuristics for combinatorial optimization problems has lately experienced
a noteworthy shift towards the hybridization of metaheuristics with other techniques for …

In this paper, a Quantum-inspired Ant Colony Optimization (Qi-ACO) is proposed to solve a
sustainable four-dimensional traveling salesman problem (4DTSP). In 4DTSP, various paths …

Traditional wireless sensor networks (WSNs) with one static sink node suffer from the well-
known hot spot problem, that of sensor nodes near the static sink bear more traffic load than …

The traveling salesman problem (TSP) is a classical problem in discrete or combinatorial
optimization and belongs to the NP-complete classes, which means that it may be require an …

In this research paper, Artificial Bee Colony algorithm is modified with multiple update rules
and K-opt operation to solve the Traveling Salesman Problem. Here the features of swap …

To minimize greenhouse gas emissions, the logistic field has seen an increasing usage of
electric vehicles. The resulting distribution planning problems present new computational …