Search Results - (( using addressing problem algorithm ) OR ( java simulation optimization algorithm ))

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

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

“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text

Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text

Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem by Anniza, Hamdan, San Nah, Sze, Say Leng, Goh, Kang Leng, Chiew, Wei King, Tiong

“…The mechanisms and strategies used in evolutionary algorithms to address different types of combinatorial optimization problems are discovered. …”
Get full text
Get full text
Get full text
Get full text

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text

Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text

Hybrid harmony search algorithm for continuous optimization problems by Ala’a Atallah, Hamad Alomoush

“…Taken together, the proposed hybrid algorithm, called IHS-GWO, aims to address continuous optimization problems. …”
Get full text
Get full text

Comparison of anonymous tracker algorithms / Nur Shafikah Mat Daud by Mat Daud, Nur Shafikah

“…The outcomes of the end results of the IP Address are presented. By using the IP Address, can help easily to track location of anonymous. …”
Get full text
Get full text

New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems by Nor Shuhada, Ibrahim

“…This PhD thesis introduces an extended version of MABSA aimed at addressing constrained multi objective optimization problems by incorporating innovative random approaches, focusing to solves reservoir optimization problems. …”
Get full text
Get full text

Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

“…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
Get full text
Get full text

An improved self organizing map using jaccard new measure for textual bugs data clustering by Ahmed, Attika

“…Thus, the research introduced the improved SOM algorithm by using a Jaccard NM (SOM-JNM). The SOM-JNM produced significantly better results therefore; it can be consider a challenging approach to address the sparse data problems.…”
Get full text
Get full text
Get full text
Get full text

An improved self organizing map using jaccard new measure for textual bugs data clustering by Ahmed, Attika

“…Thus, the research introduced the improved SOM algorithm by using a Jaccard NM (SOM-JNM). The SOM-JNM produced significantly better results therefore; it can be consider a challenging approach to address the sparse data problems.…”
Get full text
Get full text
Get full text
Get full text

Solving the optimal power flow problems using the superiority of feasible solutions-moth flame optimizer by Alam, Mohammad Khurshed

“…The main goal of this study is to use a cuttingedge version of recent metaheuristic algorithm, namely Moth-Flame Optimizer (MFO) algorithm for solving the mentioned OPF problems. …”
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

Multi-objective clustering algorithm using particle swarm optimization with crowding distance (MCPSO-CD) by Rashed, Alwatben Batoul, Hamdan, Hazlina, Mohd Sharef, Nurfadhlina, Sulaiman, Md Nasir, Yaakob, Razali, Abubakar, Mansir

“…Generally, clustering is difficult and complex phenomenon, where the appropriate numbers of clusters are always unknown, comes with a large number of potential solutions, and as well the datasets are unsupervised. These problems can be addressed by the Multi-Objective Particle Swarm Optimization (MOPSO) approach, which is commonly used in addressing optimization problems. …”
Get full text
Get full text
Get full text

A Modified Giffler and Thompson Genetic Algorithm on the Job Shop Scheduling Problem by Lee, Hui Peng, Salim, Sutinah

“…This algorithm is modified to produce better results than the existing algorithm by using Visual Prolog programming language.…”
Get full text
Get full text
Get full text

Bees algorithm for Forest transportation planning optimization in Malaysia by Jamaluddin, Jamhuri, Kamarudin, Norizah, Ismail, Mohd Hasmadi, Ahmad, Siti Azfanizam

“…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
Get full text
Get full text