An ellipsoidal distance-based search strategy of ants for nonlinear single and multiple response optimization problems
AbstractVarious continuous ant colony optimization (CACO) strategies are proposed by researchers to resolve continuous single response optimization problems. However, no such work is reported which also verifies suitability of CACO in case of both single and multiple response situations. In addition, as per literature survey, no variant of CACO can balance simultaneously all the three important aspects of an efficient search strategy, viz. escaping local optima, balancing between intensification and diversification scheme, and handling correlated variable search space structure. In this paper, a variant of CACO, so-called ‘CACO-MDS’ is proposed, which attempts to address all these three aspects. CACO-MDS strategy is based on a Mahalanobis distance-based diversification, and Nelder–Mead simplex-based intensification search scheme. Mahalanobis distance-based diversification search ensures exact measure of multivariate distance for correlated structured search space. The proposed CACO-MDS strategy is verified using fourteen single and multiple response multimodal function optimization test problems. A comparative analysis of CACO-MDS, with three different metaheuristic strategies, viz. ant colony optimization in real space (ACOR), a variant of local-best particle swarm optimization (SPSO) and simplex-simulated annealing (SIMPSA), also indicates its superiority in most of the test situations.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 223 (2012)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Metaheuristics; Continuous ant colony optimization; Multiple response; Mahalanobis distance;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Akbar Karimi & Hadi Nobahari & Patrick Siarry, 2010. "Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions," Computational Optimization and Applications, Springer, vol. 45(3), pages 639-661, April.
- Socha, Krzysztof & Dorigo, Marco, 2008. "Ant colony optimization for continuous domains," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1155-1173, March.
- Kwang-Jae Kim & Dennis K. J. Lin, 2000. "Simultaneous optimization of mechanical properties of steel by maximizing exponential desirability functions," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 49(3), pages 311-325.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.