Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar
Nowadays, the route management is very important to make sure the user can arrive to the destination much fastest. In the transportation industry, the route that been generated should consider the cost and time constraint which is dependently on the distance of the route. Although from human logi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2006
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/1000/1/TB_TENGKU%20SALMAN%20FATHI%20TENGKU%20JAAFAR%20CS%2006_5%20P01.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Nowadays, the route management is very important to make sure the user can
arrive to the destination much fastest. In the transportation industry, the route that
been generated should consider the cost and time constraint which is dependently
on the distance of the route. Although from human logical thinking, the route can be
generated easily but the calculation of checking the route whether it is optimal route
or not is difficult and will take long time to be implemented. This research study with
the development of the Optimal Route Checking Using Genetic Algorithm system
should solve this scenario. By taking the bus services in Universiti Teknologi MARA
as sample, the research has used the genetic algorithm approach to solve the
problem which is similar to the Travel Salesman Problem. The genetic algorithm
approach that been used in this research has been proven by other research study
before that it will easily handle this types of problem where the optimal solution will
be generated. But the GA will not generate the best solution. The objective of this
research is to develop the system that will check the route according to two criteria
which is distance and time. Beside that, this research also has to fulfill the objective
of find the comparison of the three types of selection methods which roulette wheel
selection, tournament selection and rank selection. The GA operators that involved
in this development are two-point crossover and fix mutation for reproduction
phase. For the development of the prototype, the Active Server Page and Java
script programming language with Microsoft Access database has been chosen in
order to make the system can be publish online and easily retrieve by the user
anywhere. This research has achieved the result that meets the objective and
found the best selection method that can be used to handle the similar problem with
this research. |
|---|