دورية أكاديمية

Using Harmony Search Algorithm to Solve the N-Region Four Color Map Problem

التفاصيل البيبلوغرافية
العنوان: Using Harmony Search Algorithm to Solve the N-Region Four Color Map Problem
المؤلفون: Romie B. HORCA, John Paul T. YUSIONG
المصدر: Journal of Applied Computer Science & Mathematics, Vol 6, Iss 12, Pp 36-41 (2012)
بيانات النشر: Stefan cel Mare University of Suceava, 2012.
سنة النشر: 2012
المجموعة: LCC:Mathematics
LCC:Electronic computers. Computer science
مصطلحات موضوعية: Optimization, Harmony Search Algorithm, Four Color Map Theorem, Map Coloring, Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95
الوصف: The Harmony Search (HS) algorithm is a relatively recent addition to the family of optimization algorithms. It imitates the behavior of musicians when composing their music such as random playing of notes, previous composition-based play, and pitch-adjusted play. The algorithm was used in solving the Four Color Map Problem. In this problem, it is said one can color the regions of a map using a maximum of four colors only with the constraint that no neighboring regions should share the same color. Neighboring regions mean two regions having a common boundary, not just a common point. Simulation results proved the feasibility of HS as the primary optimization technique in solving sample maps
نوع الوثيقة: article
وصف الملف: electronic resource
اللغة: English
تدمد: 2066-4273
2066-3129
Relation: http://jacs.usv.ro/getpdf.php?paperid=12_6; https://doaj.org/toc/2066-4273; https://doaj.org/toc/2066-3129
URL الوصول: https://doaj.org/article/e4e03f3469dc4abea53711723f5325df
رقم الأكسشن: edsdoj.4e03f3469dc4abea53711723f5325df
قاعدة البيانات: Directory of Open Access Journals