Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 36, Issue 7, Pages 2217-2229Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2008.08.015
Keywords
Ant colony optimization; MINLP; Global optimization; Hybrid metaheuristics; Constrained optimization; Oracle penalty method
Categories
Funding
- Spanish Ministry of Education and Science
Ask authors/readers for more resources
Two novel extensions for the well known ant colony optimization (ACO) framework are introduced here, which allow the solution of mixed integer nonlinear programs (MINLPs). Furthermore, a hybrid implementation (ACOmi) based on this extended ACO framework, specially developed for complex non-convex MINLPs, is presented together with numerical results. These extensions on the ACO framework have been developed to serve the needs of practitioners who face highly non-convex and computationally costly MINLPs. The performance of this new method is evaluated considering several non-convex MINLP benchmark problems and one real-world application. The results obtained by our implementation substantiate the success of this new approach. (C) 2008 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available