Algoritma Carian Di Dalam Perancangan Pelancungan

AMIRUDDIN, SATRIA G (1998) Algoritma Carian Di Dalam Perancangan Pelancungan. Other thesis, Universiti Teknologi Malaysia.

[img]
Preview
PDF
satria_g.PDF

Download (2547Kb) | Preview

Abstract

The probem that this project is trying to solve is the creation of a route that optimize the number of stops in the path. This is important for a traveller that wishes to visit as many tourist spot as he can given the allocation of,time that he have. The constrain in that this project into consideration are the time it takes to travel the path, the time to visit each spots and the kos to travel the path. These constrains are calculated using a formula that uses a contant value. The search technique that is invistigated are algorithm and hopfield network

Item Type: Thesis (Other)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Computer Science and Information System > Software Engineering
Depositing User: Unnamed user with email knizam@utm.my
Date Deposited: 04 Jul 2013 07:20
Last Modified: 04 Jul 2013 07:20
URI: http://ir.fsksm.utm.my/id/eprint/2858

Actions (login required)

View Item View Item