Search Results - (( using meta problem algorithm ) OR ( java application using algorithm ))
Search alternatives:
- problem algorithm »
- java application »
- using algorithm »
- meta problem »
- using meta »
-
1
A Modified Symbiotic Organism Search Algorithm with Lévy Flight for Software Module Clustering Problem
Published 2020“…To date, there are much increasing trends on adopting parameter free meta-heuristic algorithms for solving general optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
2
-
3
-
4
Enhancing generality of meta-heuristic algorithms through adaptive selection and hybridization
Published 2018“…Many meta-heuristic algorithms have been developed to date (e.g. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
-
6
-
7
-
8
Multi-state PSO GSA for solving discrete combinatorial optimization problems
Published 2016“…These four algorithms can be used to solve discrete combinatorial optimization problems (COPs). …”
Get full text
Get full text
Thesis -
9
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…Feature Selection in High Dimensional Space is a combinatory optimization problem with an NP-hard nature. Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text
Get full text
Get full text
Article -
10
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…Feature Selection in High Dimensional Space is a combinatory optimization problem with an NP-hard nature. Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text
Get full text
Get full text
Article -
11
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…Feature Selection in High Dimensional Space is a combinatory optimization problem with an NP-hard nature. Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text
Get full text
Get full text
Article -
12
New heuristic function in ant colony system for job scheduling in grid computing
Published 2012“…Job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
Get full text
Get full text
Conference or Workshop Item -
13
Comparative Performance Analysis of Bat Algorithm and Bacterial Foraging Optimization Algorithm using Standard Benchmark Functions
Published 2014“…In order to help engineers make a sound decision on the selection amongst the best meta-heuristic algorithms for the problem at hand, there is a need to assess the performance of each algorithm against common case studies. …”
Get full text
Get full text
Conference or Workshop Item -
14
Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems
Published 2018“…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
Get full text
Thesis -
15
An Improved Jaya Algorithm-Based Strategy for T-Way Test Suite Generation
Published 2020“…In the field of software testing, several meta-heuristics algorithms have been successfully used for finding an optimized t-way test suite (where t refers to covering level). …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
A review of assembly line balancing optimisation with energy consideration using meta-heuristic algorithms
Published 2021“…The selected articles were limited to problems solved using meta-heuristic algorithms. The review mainly focusses on the soft computing aspect such as problem variant, optimisation objectives, energy modelling and optimisation algorithm for ALB with energy consideration. …”
Get full text
Get full text
Get full text
Article -
17
New modified controlled bat algorithm for numerical optimization problem
Published 2022“…Bat algorithm (BA) is an eminent meta-heuristic algorithm that has been widely used to solve diverse kinds of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
18
Meta-heuristic structure for multiobjective optimization case study: Green sand mould system
Published 2014“…Analysis on the solution set produced by these algorithms is carried out using performance metrics. …”
Get full text
Get full text
Book -
19
Component-wise analysis of metaheuristic algorithms for novel fuzzy-meta classifier
Published 2018“…This leaves several critical questions unanswered due to black-box issue that does not reveal why certain metaheuristic algorithms performed better on some problems and not on others. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid
Published 2012“…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text
Monograph
