Threshold accepting framework for discrete and continuous search spaces. (14th June 2010)

• Record Type: Journal Article
• Authors: Dhouib, Souhail
• Is Part Of: International journal of innovative computing and applications. Volume 2:Number 3(2010)
• Page Start: 178
• Page End: 187
• Publication Date: 2010-06-14
• Subjects: metaheuristics -- simulated annealing algorithm -- threshold accepting algorithms -- discrete optimisation -- continuous optimisation -- discrete search spaces -- continuous search spaces -- multi-agent systems -- MAS -- agent-based systems -- taboo central memory -- total weighted tardiness -- engineering design optimisation; Evolutionary computation -- Periodicals; Neural networks (Computer science) -- Periodicals; Genetic programming (Computer science) -- Periodicals; Biologically-inspired computing -- Periodicals; Swarm intelligence -- Periodicals; Quantum computers -- Periodicals; 006.3
• Languages: English
• ISSNs: 1751-648X

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.