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

Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

“…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
Get full text
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

Max-average: an extended max-min scheduling algorithm for Grid computing environtment by Maipan-uku, J. Y., Muhammed, Abdullah, Abdullah, Azizol, Hussin, Masnida

“…This paper presents a new proposed grid based scheduling algorithm called Max-Average, inspired from Max-Min algorithm. …”
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

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

A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

“…However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. …”

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

Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

“…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
Get full text
Get full text
Get full text

An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

“…It is noticed that the AdamSE algorithm has the smallest iteration number. ,e results show that the rate of convergence of the Adam algorithm is significantly enhanced by using the AdamSE algorithm. …”
Get full text
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

Finding multi-constrained path using genetic algorithm by Yussof S., See O.H.

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

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

Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

“…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text

Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

“…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text

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

“…In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.…”
Get full text
Get full text

Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

“…The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
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

Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

“…One way to improve the multi-hole drilling is by optimising the tool path in the process. This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
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

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). …”