Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan

Railway system consists of complicated, most often than not, confusing routes. As train networks expand, routes complexity increases thus indirectly affecting accustomed user. Users are left to their own devices in order to figure out the best route based on their requirements. In this paper, users...

Full description

Saved in:
Bibliographic Details
Main Author: Ruslan, Muhammad Hassan Firdaus
Format: Thesis
Language:English
Published: 2017
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/69050/1/69050.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uitm-ir.69050
record_format uketd_dc
spelling my-uitm-ir.690502022-10-23T13:50:03Z Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan 2017-01 Ruslan, Muhammad Hassan Firdaus Instruments and machines Electronic Computers. Computer Science Evolutionary programming (Computer science). Genetic algorithms Computer software Configuration management Expert systems (Computer science). Fuzzy expert systems Algorithms Database management Railway system consists of complicated, most often than not, confusing routes. As train networks expand, routes complexity increases thus indirectly affecting accustomed user. Users are left to their own devices in order to figure out the best route based on their requirements. In this paper, users requirement are determined based on the time taken to reach the destination station. The time taken to reach the destination station was influenced by how many stations that users need to pass through. The research methodology for this project consists of five phases which are, preliminary study, data collection, system design and implementation and result analysis. Project finding are based on the Railway Shortest Path Planner (RSPP) application framework that consists of input module, output module and process module. Users need to input source and destination station and the output will be the proposed shortest path and other train information’s such as train types, train lines and stations involves. For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. The shortest path is determine based on the length of route. This application will be tested using a case study of Malaysia Kuala Lumpur Railway System that integrates three types of different trains known as Light Rail Transit (LRT), Monorail line (KL Monorail) and Commuter Rail System (KTM). Result shows that ACO are suitable to be used in this project as the RSPP’s result shows its accuracy against the manual calculated result. 2017-01 Thesis https://ir.uitm.edu.my/id/eprint/69050/ https://ir.uitm.edu.my/id/eprint/69050/1/69050.pdf text en public degree Universiti Teknologi MARA, Terengganu Faculty of Computer and Mathematical Sciences Nik Daud, Nik Marsyahariani
institution Universiti Teknologi MARA
collection UiTM Institutional Repository
language English
advisor Nik Daud, Nik Marsyahariani
topic Instruments and machines
Instruments and machines
Instruments and machines
Computer software
Configuration management
Instruments and machines
Algorithms
Database management
spellingShingle Instruments and machines
Instruments and machines
Instruments and machines
Computer software
Configuration management
Instruments and machines
Algorithms
Database management
Ruslan, Muhammad Hassan Firdaus
Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan
description Railway system consists of complicated, most often than not, confusing routes. As train networks expand, routes complexity increases thus indirectly affecting accustomed user. Users are left to their own devices in order to figure out the best route based on their requirements. In this paper, users requirement are determined based on the time taken to reach the destination station. The time taken to reach the destination station was influenced by how many stations that users need to pass through. The research methodology for this project consists of five phases which are, preliminary study, data collection, system design and implementation and result analysis. Project finding are based on the Railway Shortest Path Planner (RSPP) application framework that consists of input module, output module and process module. Users need to input source and destination station and the output will be the proposed shortest path and other train information’s such as train types, train lines and stations involves. For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. The shortest path is determine based on the length of route. This application will be tested using a case study of Malaysia Kuala Lumpur Railway System that integrates three types of different trains known as Light Rail Transit (LRT), Monorail line (KL Monorail) and Commuter Rail System (KTM). Result shows that ACO are suitable to be used in this project as the RSPP’s result shows its accuracy against the manual calculated result.
format Thesis
qualification_level Bachelor degree
author Ruslan, Muhammad Hassan Firdaus
author_facet Ruslan, Muhammad Hassan Firdaus
author_sort Ruslan, Muhammad Hassan Firdaus
title Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan
title_short Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan
title_full Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan
title_fullStr Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan
title_full_unstemmed Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan
title_sort railway shortest path planner application using ant colony optimization algorithm / muhammad hassan firdaus ruslan
granting_institution Universiti Teknologi MARA, Terengganu
granting_department Faculty of Computer and Mathematical Sciences
publishDate 2017
url https://ir.uitm.edu.my/id/eprint/69050/1/69050.pdf
_version_ 1783735836543549440