Threshold accepting framework for discrete and continuous search spaces
by Souhail Dhouib
International Journal of Innovative Computing and Applications (IJICA), Vol. 2, No. 3, 2010

Abstract: In this paper, a threshold accepting multi-agents (TA-MA) framework is proposed to optimise discrete and continuous problems. The TA-MA framework uses two agents, in each one a threshold accepting (TA) metaheuristic is started with different initial parameters. The cooperation between these agents is assured by an adaptive memory named taboo central memory (TCM). Computational experiments, on the single machine total weighted tardiness (SMTWT) problems and on two engineering design optimisation problems (the supported I-beam and the machine tool spindle), show that the proposed TA-MA algorithm can obtain the optimal solution or much better than the best known one for all standard benchmark problems instances from the literature.

Online publication date: Sun, 13-Jun-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com