Search Results - (( model validation study algorithm ) OR ( time destination based algorithm ))

Aeronautical Revenues Optimisation Model (AROM) for regional airports via airside operations stochastic baseline matrix analysis / Wan Mazlina Wan Mohamed by Wan Mohamed, Wan Mazlina

“…Preliminary model was developed based on the determinants and the model was analysed using Bayesian Network theory. …”
Get full text
Get full text

Path planning for constant speed robot by Abdullah @ Idris, Ahmad Takiyuddin

“…A mobile robot (named toward its unique characteristic in this project as constant speed robot) moving at a constant speed and having a constant swerving ability is used in the analysis. The guidance algorithm is formed based on an initial direction and distance of the target location without considering the time taken by the robot to reach the desired destination. …”
Get full text
Get full text

Aeronautical revenues optimisation model (AROM) for regional airports via airside operations stochastic baseline matrix analysis / Wan Mazlina Wan Mohamed by Wan Mohamed, Wan Mazlina

“…Preliminary model was developed based on the determinants and the model was analysed using Bayesian Network theory. …”
Get full text
Get full text

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

“…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. …”
Get full text
Get full text

UiTM Malaysia route planner / Mohamad Yunus Mohamed Nasir by Mohamed Nasir, Mohamad Yunus

“…The shortest route is most appropriate than others because it can save time, cost and effort. The Route Planner's core is Dijkstra's shortest-path-finding algorithm, with extensions for time dependent delays and paths constrained by travel mode. …”
Get full text
Get full text

Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

“…A mobile robot (named toward its unique characteristic in this project as constant speed robot) moving at a constant speed and having a constant swerving ability or no swerving is used in the analysis. The guidance algorithm is formed based on an initial direction and distance of the target location without considering the time taken by the robot to reach the desired destination. …”
Get full text

AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

“…Automatic Route Finder tool for New Visitors is developed to help them to find or plan the shortest and effective way in order to reach their destination without loss of time. This project proposes a new visitor route model that is based on shortest path algorithms for road networks. …”
Get full text
Get full text

Mobile Map-Based Positioning System Using Segmentation Algorithm (MM-BPS) by Migdady, Hazem Moh'd Ali

“…This paper reports steps to build a segmentation positioning algorithm and to implement Mobile Map-Based Positioning System prototype.…”
Get full text
Get full text
Get full text

Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] by Muhammat Pazil, Nur Syuhada, Mahmud, Norwaziah, Jamaluddin, Siti Hafawati, Mustafa, Nur Farasyaqirra

“…The total time taken is 23 minutes (RM8.00), whereas, the cost is based on the shortest path from Bandar Tun Razak to Taman Maluri to Seasons Tower and Berjaya Times Square. …”
Get full text
Get full text
Get full text

Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

“…This study implements the algorithm in visual C++ 2008 and design interface for the algorithms that allow the user to find the shortest path with the search time and the distance by determine the size of map, starting node and the destination node. …”
Get full text
Get full text
Get full text
Get full text

An adaptive routing algorithm: enhanced confidence-based Q routing algorithm in network traffic by Yap, Soon Teck, Othman, Mohamed

“…Confidence-based Q (CQ) Routing Algorithm is an adaptive network routing algorithm. …”
Get full text
Get full text
Get full text

An efficient innovative method to decrease routing table size in packet switched networks by Baygi, Maassoumeh Javadi, Ramli, Abdul Rahman, Zaeri, Bahram, Mohd Ali, Borhanuddin

“…Appropriate routing for supporting the requirements of various high quality applications emerged in current communication networks is a challenging problem that can lead to improved routing algorithms. Taking into consideration the highly distributed character of networks, numerous multi-agent based algorithms, and particularly ant colony based algorithms, have been proposed in recent years. …”
Get full text
Get full text
Get full text

Evolutionary algorithm based network coding for optmization of intelligent vehicular ad hoc network by Lee, Chun Hoe

“…However, the chances to perform NC in wireless network is highly unlikely if the packet is not transmit to the potential NC node. Therefore, GA based network routing (GANeR) is embedded into network to search for shortest path from the source to the destination, and PSO based coding aware routing (CAR) is also proposed to further converge the solutions obtained from GANeR. …”
Get full text
Get full text

Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

“…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
Get full text
Get full text
Get full text
Get full text

Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm by Al-Mayouf, Y.R.B., Abdullah, N.F., Ismail, M., Al-Qaraawi, S.M., Mahdi, O.A., Khan, S.

“…This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). …”
Get full text
Get full text

Efficient and stable routing algorithm based on user mobility and node density in urban vehicular network by Al-Mayouf, Y.R.B., Ismail, M., Abdullah, N.F., Wahab, A.W.A., Mahdi, O.A., Khan, S., Choo, R.K.K.

“…Therefore, this paper proposes a novel routing algorithm called efficient and stable routing algorithm based on user mobility and node density (ESRA-MD). …”
Get full text
Get full text

Malaysia network transit route adviser system by Mohd Syafiq, Bachok

“…The first is to estimate the lowest cost base on time travelling from one station to another and the second function is estimate the lowest cost base on the ticket price. …”
Get full text
Get full text

Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

“…These two adaptive routing algorithms enhance the existing Confidence-based Q (CQ) and Confidence-based Dual Reinforcement Q (CDRQ) Routing Algorithms. …”
Get full text
Get full text

Evolutionary algorithm based network coding for optimization of intelligent vehicular ad hoc network by Lee, Chun Hoe

“…However, the chances to perform NC in wireless network is highly unlikely if the packet is not transmit to the potential NC node. Therefore, GA based network routing (GANeR) is embedded into network to search for shortest path from the source to the destination, and PSO based coding aware routing (CAR) is also proposed to further converge the solutions obtained from GANeR. …”
Get full text
Get full text
Get full text

A Dijkstra’s Mobile Web Application Engine for Generating Integrated Light Rail Transit Route by Haziq Lim, AM, Wan Sazli, NS, Hussin, B., Azlianor, A. A., Suhaizan, SM, Massila, K

“…In previous research we are implemented the mobile web application using rules based algorithm where the destination-oriented routes need to be dynamically generated by determining the nearest station according to the specific places. …”
Get full text
Get full text
Get full text