Search Results - (( _ destination case algorithm ) OR ( spider notification based algorithm ))

Destination prediction based on past movement history by Waheed, Mihsaan

“…The results are promising and we also look at the combination of variables to use for such a use case.…”
Get full text

Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri by Mashuri, Mohd Faizulhayad

“…The connection or paths between each RP can be created to create the best route to the destination. The algorithm used for this route planning is Dijkstra's algorithm. …”
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

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

The effect of fuel price increase on transport cost of container transport vehicles by Gohari, A., Matori, A.N., Yusof, K.W., Toloue, I., Sholagberu, A.T.

“…ArcGIS was used to build the transport network while MATLAB software was used to develop Dijkstra's shortest path algorithm and coding the transport cost equation. In this study, two case studies were analyzed with Johor Port as the origin and, the Port Klang and top-north-point were considered as destinations for cases 1 and 2. …”
Get full text
Get full text

The effect of fuel price increase on transport cost of container transport vehicles by Gohari, A., Matori, A.N., Yusof, K.W., Toloue, I., Sholagberu, A.T.

“…ArcGIS was used to build the transport network while MATLAB software was used to develop Dijkstra's shortest path algorithm and coding the transport cost equation. In this study, two case studies were analyzed with Johor Port as the origin and, the Port Klang and top-north-point were considered as destinations for cases 1 and 2. …”
Get full text
Get full text

Early detection and mitigation of DDoS attacks in software defined networks by Al-Saadi, Mustafa Yahya Zakariya

“…Then the algorithm was tested with attack on one host and a sub net of six hosts with attack rates of25%, 50% and 75% for the first case and 50%, 75% attack rate for the subnet case. …”
Get full text
Get full text

Just queueing (JQ): Scheduling algorithm for the internet by Miaji, Yaser, Hassan, Suhaidi

Get full text
Get full text
Get full text

Optimized topology control in mobile IP networks using a new parametric routing algorithm by Gholizadeh, Somayyeh, Abdullah, Azizol, Othman, Mohamed, Mohd Hanapi, Zurina

“…Simulation results show that OPTCR algorithm is superior to some algorithms appeared in the recent literature.…”
Get full text
Get full text
Get full text

Boolean routing on high degree chordal ring networks by Matroud Bashi, Atheer Abbas

“…The chordal ring 0(27;9;3) has been considered as a case to apply BRS.…”
Get full text
Get full text

Development Of A Library Navigation System Using Dijkstra’s Algorithm by A. A. M. Salleh, K. Abdulrahim

Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

“…The main goal of this research is to compare the performances between Genetic Algorithm (GA) and Ant Colony Optimization (ACO) algorithm. …”
Get full text
Get full text

Selective chaotic maps Tiki-Taka algorithm for the S-box generation and optimization by Kamal Z., Zamli, Abdul Kader, ., Fakhrud Din, ., Alhadawi, Hussam S.

“…To address the nonlinear requirement of cryptography (i.e., ensuring the generated S-box is sufficiently robust against linear and differential cryptanalysis attacks), many chaos-based metaheuristic algorithms have been developed in the literature. This paper introduces a new variant of a metaheuristic algorithm based on Tiki-Taka algorithm, called selective chaotic maps Tiki-Taka algorithm (SCMTTA). …”
Get full text
Get full text
Get full text

Route/Modal choice analysis and tradeoffs evaluation of the intermodal transport network of Peninsular Malaysia by Gohari, A., Nasir Matori, A., Yusof, K.W., Toloue, I., Myint, K.C., Sholagberu, A.T.

“…To demonstrate the applicability of the proposed model, two case studies were analyzed. The presented methodology and procedures are applicable not only on any origin-destination pair in the transport network of Malaysia, but also on any other intermodal transport networks. …”
Get full text
Get full text

Route/Modal choice analysis and tradeoffs evaluation of the intermodal transport network of Peninsular Malaysia by Gohari, A., Nasir Matori, A., Yusof, K.W., Toloue, I., Myint, K.C., Sholagberu, A.T.

“…To demonstrate the applicability of the proposed model, two case studies were analyzed. The presented methodology and procedures are applicable not only on any origin-destination pair in the transport network of Malaysia, but also on any other intermodal transport networks. …”
Get full text
Get full text

Investigation Of Ros Based Vehicle State Estimation With Uncertainties by Siti Nuraini, Che Huhaimi

“…Based on different case study ROS play an important role to evaluate mobile robot performance referring to its environment. …”
Get full text
Get full text

Technical report: simulated annealing for vehicle routing problem / Amy Nasuha Johan and Nurul Shahira Jamaludin by Johan, Amy Nasuha, Jamaludin, Nurul Shahira

“…On the other hand, in transportation network, the nodes represent origins and destinations as well as intersections. Travelers or users of the transportation networks seek, in the case of user-optimization, to determine their cost-minimizing routes of travel. …”
Get full text
Get full text

Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

“…The major contribution of this research is to propose MTS method for solving UTSP in both sequential and parallel approach and it is shown that the algorithms are able to produce comparable results for most of the cases from literature and the computational times can be reduced significantly for more than 80% by the parallel execution. …”
Get full text
Get full text

Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

“…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
Get full text
Get full text
Get full text
Get full text

Optimized one-way electric vehicle carsharing system in campus environment using heterogeneous non-dominated sorting genetic algorithm II by Abdulazeez, Omar Saud

Get full text
Get full text

Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

“…The principle of the laser simulator approach with all possibilities and cases that could emerge during path planning is explained to determine the path from initial to destination positions in a two-dimensional map. …”
Get full text
Get full text
Get full text