Journals / Electrica / 2009 / Cilt: 9 Sayı: 2

A MODIFIED GENETIC ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEMS

Journal
Electrica
Pages
959–967
Publication Date
2010-10-25
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

A MODIFIED GENETIC ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEMS

📌 3 Key Takeaways

🎯
Objective & Hypothesis:A MODIFIED GENETIC ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEMS
📊
Key Findings & Data:A MODIFIED GENETIC ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEMS
💡
Conclusion & Impact:A MODIFIED GENETIC ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEMS
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

A MODIFIED GENETIC ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEMS

Özet

In this paper, a specialized Genetic Algorithm is proposed and applied for the solution of the Generalized Assignment Problem. Special crossover and the mutation operators called Common Element Crossover (CEX) and In-Pool Mutation (IPM) respectively has been defined by focusing on the special needs and nature of the Generalized Assignment Problem. The performance of the proposed method has been investigated in details via some test cases constructed for the multi-target tracking problems.

🔖

Cite This Article

AKBULUT, M., YILMAZ, A. (2010). A MODIFIED GENETIC ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEMS. Electrica, Cilt: 9 Sayı: 2, 959–967. https://ajindex.com/articles/1017718

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...