Skip to main navigation Skip to search Skip to main content

A COMPARISON BETWEEN SIMULATED ANNEALING , TABU SEARCH & GENETIC ALGORITHM METHODS FOR THE UNCONSTRAINED QUADRATIC PSEUDO - BOOLEAN FUNCTION.

Project: RESEARCH PROJECT

Project Details

Description

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.

StatusFinished
Effective start/end date1/09/97 → 31/08/98

Keywords

  • Simulated annealing
  • Tabu Search
  • Genetic Algorithm
  • Quadratic funcition
  • Heuristics.

Fingerprint

Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.