Browsing Undergraduate Theses by Title
Now showing items 1-10 of 1407
-
0-1 Programming Menentukan Shortest Path yang Memenuhi Kendala
(Universitas Sumatera Utara, 2009)This article studies about applying of 0-1 Programmings in looking for a shortest path constraint which is problem knapsack in the network. Problem that is often emerges in this network for example to look for shortest ... -
2 Eksponen dari 2-Digraph dengan Loop
(Universitas Sumatera Utara, 2007)On 2-digraph D, 2-exponent being defined as smallest integer h+k therefore for every pairs of vertex u and v in D there is walk from u to v with legth h + k consist of h red arc and b blue arc. 2-exponent from 2-digraph ... -
2-Eksponen Digraph Dwiwarna Asimetrik dengan Dua Cycle yang Bersinggungan
(Universitas Sumatera Utara, 2009)Let D be a asymmetric two-colored digraph on n = 2m, m 4 vertices which have a common vertex and the length of each cycles is m and m + 1. Since D is asymmetric, there exists two cycles of length m are denoted by γ1 and ... -
Algoritma Clarke and Wright Savings untuk Optimasi Rute Pendistribusian Air Minum dalam Kemasan (Studi Kasus: PT Tirta Sumber Menaralestari)
(Universitas Sumatera Utara, 2019)Distribution is the most important part of a company. Distribution refers to customer satisfaction. The condition of the scattered customers causes the vehicle to travel far. Companies must be able to determine the ... -
Algoritma dan Implementasi Alat Bantu Pemecahan Masalah Matematika
(Universitas Sumatera Utara, 2009)Pada Jurusan Informatika semester awal, kita mendapatkan mata kuliah Logika dan Algoritma. Dalam mata kuliah ini kita akan mempelajari tentang algoritma beserta penerapannya dalam pemrograman. Dari permasalahan diatas ... -
Algoritma Djikstra untuk Menentukan Rute Terpendek Objek Wisata di Kota Jambi
(Universitas Sumatera Utara, 2023)Searching for the shortest route is a search for a route from one path to another to minimize the distance on a particular interconnected path. The Djikstra algorithm is an algorithm used to determine the shortest path ... -
Algoritma Genetika pada Penyelesaian Multiple Travelling Salesmen Problem (M-TSP) (Studi Kasus: Jasa Pengangkutan CPO (Crude Palm Oil) PT. Miduk Arta Medan)
(Universitas Sumatera Utara, 2024)This research employs a Genetic Algorithm to solve the Multiple Traveling Salesmen Problem (M-TSP) in the context of Crude Palm Oil (CPO) distribution by PT. Miduk Arta Medan to three CPO processing plants in North Sumatra: ... -
Algoritma Genetika untuk Penyelesaian Travelling Salesman Problem pada Rute Pendistribusian Barang Sicepat Ekspres
(Universitas Sumatera Utara, 2024)The genetic algorithm is a form of random search that mimics the principles of natural biological evolution to find optimal solutions. The optimal solution search problem to be discussed is how to determine the shortest ... -
Algoritma Hill Cipher untuk Enkripsi Data Teks yang Digunakan untuk Steganografi Gambar dengan Metode LSB (Least Significant Bit)
(Universitas Sumatera Utara, 2010)The development of current advances in information technology, the ease with which the perpetrators of computer crime (cyber crime), or which often referred to as crackers, script kiddies, carder, lamers terms or other ... -
Algoritma Semut untuk Mencari Jalur Terpendek
(Universitas Sumatera Utara, 2012)In general, the search for the shortest path can be divided into two methods, namely conventional methods and heuristic methods. Conventional methods tend to be more easily understood than the heuristic method, but ...