تخطي إلى التنقل الرئيسي تخطي إلى البحث تخطي إلى المحتوى الرئيسي

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

المشروع: RESEARCH PROJECT

تفاصيل المشروع

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.

الحالةمنتهي
تاريخ البدء/النهاية الساري1/09/97 → 31/08/98

بصمة

استكشف موضوعات البحث التي تناولها هذا المشروع. يتم إنشاء هذه الملصقات بناءً على الجوائز/المنح الأساسية. فهما يشكلان معًا بصمة فريدة.