Search Results - (( solution using ((path algorithm) OR (search algorithm)) ) OR ( java application bee algorithm ))

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…BST has been used to store the paths that Dijkstra algorithm initialled. …”
Get full text
Get full text
Get full text

Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group by Azali Saudi, Jumat Sulaiman

“…Consequently, the gradient of the potential functions would be used by the searching algorithm to generate path from starting to goal location. …”
Get full text
Get full text
Get full text

Optimal robot path planning using enhanced particle swarm optimization algorithm by Mohammed, Athraa Jasim, Ghathwan, Khalil Ibrahim, Yusof, Yuhanis

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

Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms by Shen, Jiazheng, Tang, Saihong, Zhao, Ruixin, Fan, Luxin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

“…The VFSMRCTP model is solved using the TLDW-JS algorithm and a number of comparison algorithms in order to analyze the algorithm’s performance. …”
Get full text
Get full text
Get full text

Providing wireless coverage in massively crowded events using UAVs by Sawalmeh A., Othman N.S., Shakhatreh H., Khreishah A.

Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

“…This paper proposed a solution to the MCP problem using genetic algorithm (GA). …”

Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

Get full text
Get full text

Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.] by Nasrudin, Nur Hasni, Nasaruddin, Siti Hajar, Syed Abdul Halim, Syarifah Syafiqah Wafa, Ahmad Junid, Rosida

“…The results from the survey have led to the development of ProSearch application system. ProSearch is a system that is developed by applying a graph search algorithm called Dijkstra Algorithm so as to find and identify the shortest path to reach the product. …”
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

“…This mechanism is restricted to search the possible solutions in a critical path. …”
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

Reducing Iteration Using Candidate List by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

“…Traveling Salesman Problem (TSP) was used as a case study to show the capability of the algorithm in order to find the best solution in terms of the shortest distance. …”
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 objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
Get full text
Get full text
Get full text

Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP). by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

“…Traveling Salesman Problem (TSP) was used as a case study to show the capability of the algorithm in order to find the best solution in terms of the shortest distance. …”
Get full text
Get full text

A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

“…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
Get full text
Get full text
Get full text

Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar, Weria, Tang, Sai Hong, Mohamed Sahari, Khairul Salleh, Khaksar, Mansoor, Toressen, Jim

“…In this paper, a novel sampling-based algorithm is proposed which is able to plan in an unknown environment and provides solutions with lower cost in terms of path length, runtime and stability of the results. …”
Get full text
Get full text

An Application of Differential Search Algorithm in Solving Non-Convex Economic Dispatch Problems with Valve-Point Effects by M. H., Sulaiman

“…This paper presents an application of Differential Search (DS) algorithm for solving non-convex economic dispatch (ED) problems with the valve loading effects. …”
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

Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

“…The chapter also carries out an analytical review of three main searching algorithms namely, generate and test, uninformed search, and hill climbing search algorithms. …”
Get full text
Get full text

An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment by Suwoyo, Heru, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

“…The use of sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text