Implementasi Algoritma Genetika pada Masalah Transportasi

Adhyatma Ananda, Pratama (2024) Implementasi Algoritma Genetika pada Masalah Transportasi. S1 thesis, Universitas Mataram.

	Text SKRIPSI FINAL_Adhyatma Ananda Pratama.pdf Restricted to Repository staff only Download (7MB)
	Text ARTIKEL_Adhyatma Ananda Pratama.pdf Download (630kB)

Abstract

The transportation problem is a variation of linear programming problem that has many applications with its characteristics in the form of allocation of goods from the place of origin to the place of destination. The methods used to solve transportation problems include the deterministic method and the heuristic method. The deterministic method is a standard algorithm for transportation problems, and one example of heuristic methods is the genetic algorithm which was used in this research. The genetic algorithm is used because the local optimization is applied to each new offspring, so that the solutions found are close to optimal. The goal of this research is to determine the minimal distribution costs for transportation problems using a genetic algorithm. The results obtained indicate that the solution given by the genetic algorithm always close to the one given by the simplex method in solving transportation problems.

Item Type:	Thesis (S1)
Keywords (Kata Kunci):	Operations research, transportation, genetic algorithm
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Fakultas Matematika dan ilmu Pengetahuan Alam
Depositing User:	Meike Megawati
Date Deposited:	18 Apr 2024 00:15
Last Modified:	18 Apr 2024 00:15
URI:	http://eprints.unram.ac.id/id/eprint/44874

Actions (login required)

View Item