A branch-and-bound method for the fixed charge transportation problem
Management Science
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial
Journal of Heuristics
Ant Colony System with Extremal Dynamics for Point Matching and Pose Estimation
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
Ant Colony Optimization
A Branch-and-Bound Algorithm for Concave Network Flow Problems
Journal of Global Optimization
Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems
Journal of Global Optimization
Ant colony optimization theory: a survey
Theoretical Computer Science
An ant-based algorithm for finding degree-constrained minimum spanning tree
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
Computational Optimization and Applications
Review: A review of ant algorithms
Expert Systems with Applications: An International Journal
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Ant colony optimization for the cell assignment problem in PCS networks
Computers and Operations Research
Savings based ant colony optimization for the capacitated minimum spanning tree problem
Computers and Operations Research
Proceedings of the 13th annual conference on Genetic and evolutionary computation
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
An adaptive search heuristic for the capacitated fixed charge location problem
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Data mining with an ant colony optimization algorithm
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
In this work we address the Single-Source Uncapacitated Minimum Cost Network Flow Problem with concave cost functions. This problem is NP-Hard, therefore we propose a hybrid heuristic to solve it. Our goal is not only to apply an ant colony optimization (ACO) algorithm to such a problem, but also to provide an insight on the behaviour of the parameters in the performance of the algorithm. The performance of the ACO algorithm is improved with the hybridization of a local search (LS) procedure. The core ACO procedure is used to mainly deal with the exploration of the search space, while the LS is incorporated to further cope with the exploitation of the best solutions found. The method we have developed has proven to be very efficient while solving both small and large size problem instances. The problems we have used to test the algorithm were previously solved by other authors using other population based heuristics. Our algorithm was able to improve upon some of their results in terms of solution quality, proving that the HACO algorithm is a very good alternative approach to solve these problems. In addition, our algorithm is substantially faster at achieving these improved solutions. Furthermore, the magnitude of the reduction of the computational requirements grows with problem size.