00000ctmaa22000003a 4500 UP-1685675941123923274 Buklod 20151013114020.0 aa rb |||1 u| ta 151013s xx d r |||| u| (iLib)UPTAC-00017720381 UPVTC eng LG 993.5 2011 C66 H67 Horca, Romie B. author. Harmomap using Harmony Search Algorithm to solve the N-Region Four Color Map Problem Romie B. Horca; John Paul T. Yusiong, adviser. 2011. [4], 60 leaves illustrations. Undergraduate thesis (B.S. Computer Science) -- University of the Philippines, Tacloban. Harmony Search (HS) Algorithm, an optimization algorithm that imitates the behavior of musicians such as random playing of notes, previous composition based play, and pitch adjusted play when they perform improvisation, was used in solving the Four Color Map Problem. The problem is a classic NP-complete graph optimization problem, which has many real world applications. This problem is sometimes also called Guthrie's problem after F. Guthrie, who first speculated the theorem in 1852. Its objective is to shade each region of the map using only a maximum of four colors in such a way that no neighboring regions share the same color. Neighboring regions mean two regions sharing a common boundary, not just a point. Simulation results proved the feasibility of HS as the primary optimization technique in solving sample test cases as 48-regions USA map with best run of almost 2000 cycles. The algorithm was also successful on the experiments in solving random maps with varying number of regions. Harmony Search Algorithm. Four Color Map Theorem. Map Coloring. Yusiong, John Paul T. adviser. FI UP UPTAC UPTAC LG 993.5 2011 C66 H67 Thesis