Search Results - (( problem solving max algorithm ) OR ( java implementation path algorithm ))

A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems by Phen, Chiak See

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.

“…This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). …”
Get full text
Get full text
Get full text

A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

“…In recent years, various metaheuristic approaches have been created to solve quadratic assignment problems (QAPs). Among others is the ant colony optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. …”
Get full text
Get full text

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

“…Many algorithms have been implemented to solve the grid scheduling problem. …”
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

“…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
Get full text
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

“…Ant colony optimization (ACO) is a stochastic search method for solving NP-hard problems. 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

Reactive max-min ant system with recursive local search and its application to TSP and QAP by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

Get full text
Get full text
Get full text

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Ant colony optimization in dynamic environments by Chen, Fei Huang

“…In order to achieve this objective, six ant algorithms namely Ant System (AS), Ant Colony System (ACS), Best-Worst Ant System (BWAS), Elitist Ant System (EAS), Max-Min Ant System (MMAS) and Rank-Based Ant System (RBAS) were implemented to solve a dynamic optimization problem in the form of the dynamic Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

Modern fuzzy min max neural networks for pattern classification by Al Sayaydeh, Osama Nayel Ahmad

“…To build an efficient classifier model, researchers have introduced hybrid models that combine both fuzzy logic and artificial neural networks. Among these algorithms, Fuzzy Min Max (FMM) neural network algorithm has been proven to be one of the premier neural networks for undertaking the pattern classification problems. …”
Get full text
Get full text

Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

“…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
Get full text
Get full text
Get full text

A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function by Mahdi, F.P., Vasant, P., Abdullah-Al-Wadud, M., Watada, J., Kallimani, V.

“…The obtained results demonstrate and verify the effectiveness and robustness of QPSO to solve many-objective EED problems. This also shows that QPSO can effectively be implemented in such power dispatch problems. …”
Get full text
Get full text

A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function by Mahdi, F.P., Vasant, P., Abdullah-Al-Wadud, M., Watada, J., Kallimani, V.

“…The obtained results demonstrate and verify the effectiveness and robustness of QPSO to solve many-objective EED problems. This also shows that QPSO can effectively be implemented in such power dispatch problems. …”
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby A., Ku-Mahamud K.R., Norwawi N.Md.

Performance comparison of differential evolution and particle swarm optimization in constrained optimization by Iwan, Mahmud, Akmeliawati, Rini, Faisal, Tarig, Al-Assadi, Hayder M.A.A.

“…Optimization appears in many aspects of engineering problems. There are quite numbers of modern optimization algorithms proposed in the last two decades to solve optimization problems. …”
Get full text
Get full text
Get full text

Hybrid ant colony optimization for grid computing by Abdul Nasir, Husna Jamal, Ku-Mahamud, Ku Ruhana

“…A hybrid ant colony optimization technique to solve the stagnation problem in grid computing is proposed in this paper.The proposed algorithm combines the techniques from Ant Colony System and Max – Min Ant System and focused on local pheromone trail update and trail limit.The agent concept is also integrated in this proposed technique for the purpose of updating the grid resource table.This facilitates the hybrid ant colony optimization technique in solving the stagnation problem in two ways within one cycle, thus minimize the total computational time of the jobs.…”
Get full text
Get full text
Get full text

An Exploration Technique for the Interacted Multiple Ant Colonies Optimization Framework by Aljanaby, A, Ku-Mahamud, KR, Norwawi, NM

“…These colonies are working cooperatively to solve an optimization problem using some interaction technique. …”