Concave Minimum Cost Network Flow Problems Solved with a Colony of Ants

• Author(s): Marta R. Monteiro ; Dalila Fontes ; Fernando A. C. C. Fontes
• Date: 2013
• Persistent ID: http://hdl.handle.net/10216/66930
• Origin: Repositório Aberto da Universidade do Porto
• Subject(s): Ciências Tecnológicas
• Document Type: Article
• Language: English

Description

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 procedure. The core ACO procedure is used to mainly deal with the exploration of the search space, while the Local Search 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. Keywords Ant Colony Optimization · Concave Costs · Hybrid · Local Search · Network Flow