A BINARY SPACE PARTITIONED ANT COLONY OPTIMIZATION ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
A common type of problems that exist in both industrial and scientific spaces are optimization problems. These problems can be found in among other things manufacturing, pathfinding, network routing and more. Because of the wide area of application, optimization is well a studied area. One solution...
Main Author: | Ståhlbom, Niclas |
---|---|
Format: | Others |
Language: | English |
Published: |
Mälardalens högskola, Akademin för innovation, design och teknik
2021
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-55049 |
Similar Items
-
Ant Colony Optimization Algorithms : Pheromone Techniques for TSP
by: Kollin, Felix, et al.
Published: (2017) -
Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
by: Fadl Dahan, et al.
Published: (2019-04-01) -
Binary space partition-based anomaly detection algorithm in wireless sensor networks
by: Zhou Wanli, et al.
Published: (2021-03-01) -
Heuristic Ant Colony Optimization with Applications in Communication Systems
by: Mateus de P. Marques, et al.
Published: (2014-05-01) -
Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem
by: Mohi El Din, Hatem
Published: (2021)