Search Results - (( java implementation path algorithm ) OR ( based associate problem algorithm ))

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

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
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

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

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

Joint optimization of resources allocation for quality of service aware next-generation heterogeneous cellular networks / Hayder Faeq Rasool Alhashimi by Hayder Faeq Rasool , Alhashimi

“…The proposed optimization problem is divided into three subproblems. First, a greedy-based user association algorithm is proposed to allocate multiple users to MBS or SBSs to maximize the total sum rate. …”
Get full text
Get full text
Get full text

Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA) by Alamri, Hammoudeh S., Zamli, Kamal Z., Ahmad Firdaus, Zainal Abidin, Mohd Faizal, Ab Razak

Get full text
Get full text
Get full text

On Newton-Raphson formulation and algorithm for displacement based structural dynamics problem with quadratic damping nonlinearity by Koh, K.J., Yasreen, A.Y.M.

“…Quadratic damping nonlinearity is challenging for displacement based structural dynamics problem as the problem is nonlinear in time derivative of the primitive variable. …”
Get full text
Get full text

Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text

Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

“…This work is focused on the implementation of evolutionary based computer algorithms, genetic algorithms (GAs), on microcontrollers. …”

Solving multi-task optimization problems using the sine cosine algorithm by Kamal Z., Zamli, Kader, Md. Abdul

Get full text
Get full text
Get full text
Get full text

A population division based multi-task sine cosine algorithm for test redundancy reduction optimization by Kamal Z., Zamli, Kader, Md Abdul, Mekeng, Ambros Magnus Rudolf

Get full text
Get full text
Get full text

A new algorithm for normal and large-scale optimization problems: Nomadic People Optimizer by Alsewari, Abdul Rahman Ahmed, Sinan, Q. Salih

“…The proposed and the benchmark algorithms are tested for large-scale optimization problems which are associated with high-dimensional variability. …”
Get full text
Get full text
Get full text
Get full text

A Rough-Apriori Technique in Mining Linguistic Association Rules by Choo, Yun Huoy, Abu Bakar, Azuraliza, Hamdan, Abdul Razak

“…This paper has proposed a rough-Apriori based mining technique in mining linguistic association rules focusing on the problem of capturing the numerical interval with linguistic terms in quantitative association rules mining. …”
Get full text
Get full text
Get full text

Renovation explicit dynamic procedures by application of Trujillo algorithm by Hashamdar, H., Ibrahim, Z., Jameel, M., Mahmud, H.B.

“…In this paper, a Trujillo algorithm method for the exact solution of nonlinear explicit dynamic problems is developed. …”
Get full text

Distributed learning based energy-efficient operations in small cell networks by Mughees, Amna

“…Several solutions proposed in the literature are limited to addressing the cooperation problem and resource management issues. The joint optimisation problem of user association and power allocation has been studied extensively; however, conventional optimisation techniques still have room for improvement in distributed resource management strategies that evolve based on network dynamics. …”
Get full text
Get full text

An efficient likelihood-based modulation classification algorithm for multiple-input multiple-output systems by Bahloul, M.R., Yusoff, M.Z., Abdel-Aty, A.-H., Saad, M.N.M.

“…To overcome the problems associated with the existing likelihood-based MC algorithms, a new algorithm is developed in this paper. …”
Get full text
Get full text

Cuckoo Search Approach for Cutting Stock Problem by Shair, Ezreen Farina, Khor, Shen Young, Abdullah, Abdul Rahim, Jaafar, Hazriq Izzuan, Saharuddin, Nur Zawani, Zainal Abidin, Amar Faiz

Get full text
Get full text
Get full text

Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

“…So far, limited genetic-based clustering ensemble algorithms have been developed. …”
Get full text
Get full text

Modified archive update mechanism of multi-objective particle swarm optimization in fuzzy classification and clustering by Rashed, Alwatben Batoul

“…Evolutionary algorithms have been extensively used to resolve problems associated with multiple and often conflicting objectives. …”
Get full text
Get full text