Miner ants colony: a new approach to solve a mine planning problem

Authors:
María-Cristina Riff;Michael Moossen;Xavier Bonnaire
Affiliations:
Departamento de Informática, Universidad Técnica Federico, Santa María, Valparaíso, Chile;Departamento de Informática, Universidad Técnica Federico, Santa María, Valparaíso, Chile;Departamento de Informática, Universidad Técnica Federico, Santa María, Valparaíso, Chile
Venue:
IDA'05 Proceedings of the 6th international conference on Advances in Intelligent Data Analysis
Year:
2005

Citing 6
Cited 0

Metaheuristics for High School Timetabling

Computational Optimization and Applications
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

New ideas in optimization
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
The Many Paths to Satisfaction

Constraint Processing, Selected Papers
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ants can solve constraint satisfaction problems

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a simple ant-based algorithm for solving a copper mine planning problem. In the last 10 years this real-world problem has been tackled using linear integer programming and constraint programming. However, because it is a large scale problem, the model must be simplified by relaxing many constraints in order to obtain a near-optimal solution in a reasonable time. We now present an algorithm which takes into account most of the problem constraints and it is able to find better feasible solutions than the approach that has been used until now.