A comparison between simulated annealing, genetic algorithm and tabu search methods for the unconstrained quadratic Pseudo-Boolean function

A comparison between simulated annealing, genetic algorithm and tabu search methods for the unconstrained quadratic Pseudo-Boolean function

0.00 Avg rating0 Votes
Article ID: iaor20014132
Country: Netherlands
Volume: 38
Issue: 3
Start Page Number: 323
End Page Number: 340
Publication Date: Oct 2000
Journal: Computers & Industrial Engineering
Authors: , ,
Keywords: optimization: simulated annealing, programming: quadratic
Abstract:

In this paper we developed three meta-heuristics procedures: simulated annealing, genetic algorithm and tabu search, for the unconstrained quadratic Pseudo-Boolean function. Several benchmark test problems, which were considered difficult to solve by other procedures, were generated for comparison. Several parameters were tested for each method to observe its final performance. Computational results demonstrate some differences among the three methods' final solutions and their computational time. Computational results also show that the proposed heuristics are capable of solving hard instance problems with a new quality solution in less computational time.

Reviews

Required fields are marked *. Your email address will not be published.