OPTIMAL DESIGN OF WASTE TRANSPORT ROUTE USING GENETIC ALGORITHM

ANDOKO, AURELIA AILYN (2023) OPTIMAL DESIGN OF WASTE TRANSPORT ROUTE USING GENETIC ALGORITHM. Other thesis, Universitas Katholik Soegijapranata Semarang.

	Text 19.K1.0007-AURELIA AILYN ANDOKO-COVER_a.pdf Download (988kB)
	Text 19.K1.0007-AURELIA AILYN ANDOKO-BAB I_a.pdf Download (114kB)
	Text 19.K1.0007-AURELIA AILYN ANDOKO-BAB II_a.pdf Restricted to Registered users only Download (250kB)
	Text 19.K1.0007-AURELIA AILYN ANDOKO-BAB III_a.pdf Download (228kB)
	Text 19.K1.0007-AURELIA AILYN ANDOKO-BAB IV_a.pdf Download (902kB)
	Text 19.K1.0007-AURELIA AILYN ANDOKO-BAB V_a.pdf Download (1MB)
	Text 19.K1.0007-AURELIA AILYN ANDOKO-BAB VI_a.pdf Download (109kB)
	Text 19.K1.0007-AURELIA AILYN ANDOKO-DAPUS_a.pdf Download (322kB)
	Text 19.K1.0007-AURELIA AILYN ANDOKO-LAMP_a.pdf Download (295kB)

Abstract

Wastes are residues of daily human activities or solid natural processes. Over the years the buildup of waste has been gradually increasing, due to the increase of human population / human activities. From the waste that has been produced, the remaining waste usually is placed in a temporary shelters for waste or TPS. This TPS is then later taken to a final processing place for waste or called TPA, there needs to be an optimum route from one TPS to another TPS with the final destination TPA to prevent waste from overflowing in one TPS which can cause harm in the environment. This research uses genetic algorithm to optimizes route between one temporary waste shelters to another, since genetic algorithm is an optimization algorithm, this research will prove whether genetic algorithm can solve the problem or not, the algorithm will be compared with another optimization algorithm, which is brute force to determine is genetic algorithm really a good optimization algorithm. Genetic algorithm has proven to be more optimum from the original path and also from brute force algorithm, but genetic algorithm needs more time to compute and is considered to be more complex and hard to understand compared to the brute force.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions:	Faculty of Computer Science > Department of Informatics Engineering
Depositing User:	mr AM. Pudja Adjie Sudoso
Date Deposited:	05 Apr 2023 01:25
Last Modified:	05 Apr 2023 01:25
URI:	http://repository.unika.ac.id/id/eprint/31407

Actions (login required)

View Item