Extended ant colony optimization for non-convex mixed integer nonlinear programming

DOI10.1016/j.cor.2008.08.015zbMath1158.90391OpenAlexW2028715997WikidataQ59343602 ScholiaQ59343602MaRDI QIDQ1013399

Julio R. Banga, Martin Schlüter, Jose A. Egea

Publication date: 17 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.015

zbMATH Keywords

global optimizationconstrained optimizationant colony optimizationhybrid metaheuristicsMINLPoracle penalty method

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (17)

Enhanced ant colony optimization for multiscale problems ⋮ A numerical study of MIDACO on 100 MINLP benchmarks ⋮ Finding all global optima of engineering design problems with discrete signomial terms ⋮ Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning ⋮ Scheduled penalty variable neighborhood search ⋮ PyOpt: a python-based object-oriented framework for nonlinear constrained optimization ⋮ Optimization and analysis of three-part tariff pricing strategies ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ Developing a new approach for (biological) optimal control problems: application to optimization of laccase production with a comparison between response surface methodology and novel geometric procedure ⋮ A multi-objective decision model for investment in energy savings and emission reductions in coal mining ⋮ A dynamic convexized method for nonconvex mixed integer nonlinear programming ⋮ The oracle penalty method ⋮ An efficient imperialist competitive algorithm for solving the QFD decision problem ⋮ Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems ⋮ A novel dynamic generalized opposition-based grey wolf optimization algorithm ⋮ Memory and Learning in Metaheuristics ⋮ Review and comparison of algorithms and software for mixed-integer derivative-free optimization

Uses Software

• NOMADm
• AlphaECP
• MISQP
• MacMINLP

Cites Work

• Unnamed Item
• Unnamed Item
• Ant colony optimization for continuous domains
• A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
• Scatter search for chemical and bio-process optimization
• An ant colony algorithm aimed at dynamic continuous optimization
• Test example for nonlinear programming codes
• Handbook of test problems in local and global optimization
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• A trust region SQP algorithm for mixed-integer nonlinear programming
• Mixed variable optimization of a load-bearing thermal insulation system using a filter pattern search algorithm
• A Note on the Generation of Random Normal Deviates
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• A computational comparison of some non-linear programs
• Handbook of metaheuristics
• Mixed variable optimization of the number and composition of heat intercepts in a thermal insulation system

This page was built for publication: Extended ant colony optimization for non-convex mixed integer nonlinear programming