Simple local search problems that are hard to solve
SIAM Journal on Computing
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
New ideas in optimization
Future Generation Computer Systems
An Heuristic Method for GPS Surveying Problem
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Ant Colony Optimization(ACO) has been used successfully to solve hard combinatorial optimization problems This metaheuristic method is inspired by the foraging behavior of ants, which manage to establish the shortest routes from their nest to feeding sources and back In this paper, we propose hybrid ACO approach to solve the Global Positioning System (GPS) surveying problem In designing GPS surveying network, a given set of earth points must be observed consecutively (schedule) The cost of the schedule is the sum of the time needed to go from one point to another The problem is to search for the best order in which this observation is executed Minimizing the cost of this schedule is the goal of this work Our results outperform those achieved by the best-so-far algorithms in the literature, and represent a new state of the art in this problem.