Implementation of an Ant Colony Optimization Algorithm with Constraint Handling for Continuous and Mixed Variable Domains


The Ant Colony Optimization algorithm was originally conceptualized as an algorithm for solving combinatorial optimization problems. In recent years, it has shown that the ACO metaheuristic can be extended such that it can handle both continuous and mixed variable optimization problems. In this paper we present an constraint-capable extension of Socha and… (More)


8 Figures and Tables

Slides referencing similar topics