Search Results - (( _ application ((method algorithm) OR (path algorithm)) ) OR ( using solution using algorithm ))

An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

“…Shortest path is one of the optimization problems that are difficult to solve. There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
Get full text
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
Get full text
Get full text

Design of radix-4 single path delay fast fourier transform processor with genetic algorithms optimization by Pang, Jia Hong

“…In this research, the Genetic Algorithms (GA) is used to optimize the word length of FFT coefficients to maintain the SNR value and reduce the SA at the same time. …”
Get full text
Get full text

Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation by Hasan, Talib Hashim, Chowdhury, Md. Sazzad Hossien, Prayoto, .

“…An ordinary differential equation based on Newton homotopy is used for following the solution path. Our homotop algorithm is much more efficient than the conventional iterations type algorithms. …”
Get full text
Get full text
Get full text

Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

“…Although this problem can be solved by GA, other methods also exist. Dijkstra's Algorithm is one of them. …”
Get full text
Get full text

Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

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

“…Thus, this thesis aims to develop a mobile robot for industrial applications by leveraging a genetic algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text

The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

“…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
Get full text
Get full text

An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

Subjects: Get full text
Get full text

Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

“…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
Get full text
Get full text
Get full text

Vehicle routing problem using genetic algorithm / Shamini Nagaratnam by Shamini , Nagaratnam

“…This dissertation studies and explores the potential of using Genetic Algorithms to find the shortest path in Vehicle Routing Problem. …”
Get full text
Get full text
Get full text

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

“…This increases the complexity to route later nets and makes routing longer than optimal, or sometimes impossible to complete. The solution is further refined by re-routing all nets in different orders using simulated annealing method. …”
Get full text
Get full text
Get full text

Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

“…Objectives: Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). To achieve an optimal solution for VRP with the accompanying targets: (1) To reduce the distance and the time for all paths this leads to speedy the transportation of customers to their locations, (2) To implement the capacitated vehicle routing problem (CVRP) model for optimizing the solutions. …”
Get full text
Get full text
Get full text

Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

“…Their performances were compared and the appropriate algorithm for solving TSPs was then identified. The solution quality was evaluated using empirical testing, benchmark solutions and probabilistic analyses. …”
Get full text
Get full text
Get full text

Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

“…A MPSO algorithm, without path smoothening, is used for comparison. …”
Get full text
Get full text

Finding the shortest route using Dijkstra’s algorithm with application to ride hailing in UiTM Cawangan Negeri Sembilan Kampus Seremban / Nur Husnina Hassan, Nurin Hadrah Syahira M... by Hassan, Nur Husnina, Muhamad Bakri, Nurin Hadrah Syahira, Sazeli, Alya Batrisyia

“…Therefore, to find the shortest route with minimum time, Dijkstra's Algorithm will be used. Apart from that, the Dijkstra’s Algorithm used in this study will allow us to find the smallest weight path for all permanently labelled Nod once it has been run. …”
Get full text
Get full text

A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

“…The implementations of the three methods to solve TSP show that the RTS algorithm provides a better solution in terms of minimizing the objective function while SA algorithm is less time consuming in solving problem with large number of cities.In conclusion, RTS is more effective in producing good quality solution and on the other hand, SA may be used to obtain instant results.…”
Get full text
Get full text
Get full text

Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

“…The new proposed hybrid GA is able to produce 10 better or comparable solutions when compared to similar GA algorithms that employ two-parent crossover. …”
Get full text
Get full text
Get full text

Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm by Arezoumand, Reza

“…On the other hand, precise deployment of nodes in large area is very time consuming and even impossible in hazardous environment. One of the solutions to this problem is by using mobile robots with concern on exploration algorithm for mobile robot. …”
Get full text
Get full text

Improvement and application of particle swarm optimization algorithm by Deevi, Durga Praveen, Kodadi, Sharadha, Allur, Naga Sushma, Dondapati, Koteswararao, Chetlapalli, Himabindu, Perumal, Thinagaran

“…This method combines CPTD with the Genetic Algorithm and PSO (GAPSO), resulting in an effective strategy for dynamic formation reconfiguration and path optimization. …”
Get full text
Get full text