Hasil Pencarian  ::  Simpan CSV :: Kembali

"Quadratic Assignment Problem (QAP) merupakan masalah optimasi kombinatorial yang pertama kali diperkenalkan oleh Koopmans dan Beckman pada tahun 1957. QAP adalah masalah menempatkan n fasilitas pada n lokasi dengan tujuan meminimalkan total jarak. Pada skripsi ini, QAP diselesaikan dengan algoritma Hybrid Ant System (HAS) yang termasuk dalam Ant Colony Optimization (ACO). ACO merupakan suatu metode metaheuristik yang terinspirasi dari perilaku semut dalam mencari rute terpendek dari sumber makanan sampai kembali ke sarangnya. Pada algoritma HAS ini, terdapat sejumlah agen yang ditugaskan untuk membentuk rute perjalanan. Setiap agen secara acak ditugaskan membuat rute dari simpul awal sampai semua simpul dikunjungi dan menghasilkan solusi untuk QAP.

---

Quadratic assignment problems (QAPs) is one of combinatorial optimization that was introduced by Koopmans and Beckmann in 1957. QAP is assign n facilities to n locations by minimizing the total distance. In this skripsi, QAP problems can be solved by Hybrid Ant System (HAS) algorithm, these algorithm include in Ant Colony Optimization (ACO). ACO is a metaheuristic methods which encouraged from ants behavior in finding the shortest path among the food resources to their cage. By HAS algorithm, there are some agents assigned to create routes randomly from first points until all points visited, then it will result a solution for QAP."

"ABSTRACTThe use of smartphones and handheld devices in our daily activities has sharply increased. The added features of wireless technology and related applications on these devices make it possible to write emails, notes, and long text. Even though the most commonly used electronic input device is a keyboard, very little work has been dedicated for finding an optimal layout for this device. In this research, the aim is to propose a better layout for the single-finger keyboard in terms of rapid typing. The keyboard layout problem can be formulated as a quadratic assignment problem, which is one of the hardest combinatorial optimization problems. Some well-known literary works in English are chosen for estimating the keying-in-time. A variant of genetic algorithm, namely, the estimation of distribution algorithms is used to find a better layout. The new layout is found to be efficient compared with some of the existing prominent keyboard layouts."