Search Results - (( problem using search algorithm ) OR ( java application need algorithm ))
Search alternatives:
- java application »
- application need »
- need algorithm »
- using search »
-
1
Direct approach for mining association rules from structured XML data
Published 2012“…The thesis outlines the two different implementation techniques of the existing FLEX algorithm using java based parsers and using a query language for XML. …”
Get full text
Get full text
Thesis -
2
Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem
Published 2015“…Later, binary gravitational search algorithm (BGSA) is designed to solve discrete optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
3
Using artificial intelligence search in solving the camera placement problem
Published 2022“…Two case studies are used to evaluate those algorithms, and the camera placement problem is formulated as a coverage maximization problem. …”
Get full text
Get full text
Book -
4
Comparative analysis of line search methods in the Steepest Descent algorithm for unconstrained optimization problems / Ahmad Zikri Shukeri, Puteri Qurratu Ain Megat Sulzamzamendi...
Published 2024“…The result from this study is choosing FMRI algorithm using exact line search to get faster convergence rate which means that the algorithm achieves a high level of accuracy in fewer iterations compared to using other algorithms and inexact line search.…”
Get full text
Get full text
Student Project -
5
Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions
Published 2018“…Later, this algorithm was used to solve bi-objective Production Planning (PP) and Scheduling Problem (Sch.P). …”
Get full text
Get full text
Thesis -
6
Dual level searching approach for solving multi objective optimisation problems using hybrid particle swarm optimisation and bats echolocation-inspired algorithms
Published 2019“…A dual level searching approach for multi objective optimisation problems using particle swarm optimisation and modified adaptive bats sonar algorithm is presented. …”
Get full text
Get full text
Get full text
Get full text
Article -
7
A Hybrid Method Based on Cuckoo Search Algorithm for Global Optimization Problems
Published 2018“…Cuckoo search algorithm is considered one of the promising metaheuristic algorithms applied to solve numerous problems in different fields. …”
Get full text
Get full text
Get full text
Article -
8
Symbiotic organisms search optimization algorithm in cloud computing: a nature-inspired meta-heuristic
Published 2022“…In the past few years nature-inspired algorithms are experiencing rapid growth where most optimisation problems in different domains are addressed using it. …”
Get full text
Get full text
Article -
9
Multiple Objective Optimization of Green Logistics Using Cuckoo Searching Algorithm
Published 2016“…In this paper, a modified Cuckoo searching algorithm is proposed to solve the multiple objective Green Logistics optimization problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm
Published 2010“…In this approach, suitable fuzzy matrices are used to illustrate the details of the problem. A new optimization algorithm, called the Gravitational Search Algorithm (GSA) is applied to solve TSP as precise as possible, and finally the Genetic Algorithm (GA) finds the final answer in an acceptable amount of time. …”
Get full text
Get full text
Thesis -
11
Cuckoo Search Approach for Cutting Stock Problem
Published 2015“…Cuckoo Search Algorithm is selected because it is a new algorithm and outperforms many algorithms. …”
Get full text
Get full text
Get full text
Article -
12
Vector Evaluated Gravitational Search Algorithm (VEGSA) for multi-objective optimization problems
Published 2012“…This paper presents a novel algorithm, which is based on Gravitational Search Algorithm (GSA), for multiobjective optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Hybridizing Invasive Weed Optimization with Firefly Algorithm for Unconstrained and Constrained Optimization Problems
Published 2017“…This study presents a hybrid invasive weed firefly optimization (HIWFO) algorithm for global optimization problems. Unconstrained and constrained optimization problems with continuous design variables are used to illustrate the effectiveness and robustness of the proposed algorithm. …”
Get full text
Get full text
Get full text
Article -
14
Mathematical formulation of tabu search in combinatorial optimization
Published 2008“…The main advantage of TS with respect to other conventional search is in the intelligent use of past history of the search to influence its future search procedures. …”
Get full text
Get full text
Monograph -
15
Harmony search for multi-depot vehicle routing problem
Published 2019“…We proposed an improved harmony search algorithm for solving this problem. Firstly, the Clarke & Wright saving algorithm is used for the initialisation of a solution vector in harmony search. …”
Get full text
Get full text
Article -
16
A Modified Symbiotic Organism Search Algorithm with Lévy Flight for Software Module Clustering Problem
Published 2020“…In this paper, we investigate the use of Lévy flight to enhance the exploration of a parameter free meta-heuristic algorithm, called Modified Symbiotic Organism Search Algorithm (MSOS), via its population initialization. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
Published 2018“…In this research, a new hybrid algorithm of Harmony search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
Hybrid harmony search algorithm for continuous optimization problems
Published 2020“…Harmony Search (HS) algorithm has been extensively adopted in the literature to address optimization problems in many different fields, such as industrial design, civil engineering, electrical and mechanical engineering problems. …”
Get full text
Get full text
Thesis -
19
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
Thesis -
20
Performance evaluation of chaos-enhanced stochastic fractal search algorithm using constrained engineering design problems
Published 2017“…This paper presents the performance evaluation of Chaos-enhanced Stochastic Fractal Search (CFS) algorithms for solving three different constrained engineering design optimization problems which extensively were used in the literature as a benchmarking task. …”
Get full text
Get full text
Conference or Workshop Item
