Search Results - (( its relation problem algorithm ) OR ( java implication based algorithm ))
Search alternatives:
- problem algorithm »
- implication based »
- relation problem »
- java implication »
- its relation »
-
1
Bats echolocation-inspired algorithms for global optimisation problems
Published 2016“…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
Get full text
Get full text
Thesis -
2
Normalized Relational Storage for Extensible Markup Language (XML) Schema
Published 2011“…Approach: In this study we present an algorithm for generating an optimal design for XML in relational setting. …”
Get full text
Get full text
Journal -
3
-
4
A Method For Solving Mult-Objective Optimization Problem: Vector Evaluated Genetic Algorithm (Vega)
Published 2009“…However, it is impractical to solve MOOP by using classical methods due to its complexity. Genetic Algorithms (GAs) are a powerful stochastic search in solving optimization problems. …”
Get full text
Get full text
Final Year Project Report / IMRAD -
5
Comprehensive review of the development of the harmony search algorithm and its applications
Published 2019“…First, we describe the HS algorithm and present how its parameters affect algorithm performance. …”
Get full text
Get full text
Get full text
Article -
6
Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
Published 2015“…The developed algorithm will be compared to the existing Johnson’s algorithm in term of its costs. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm
Published 2023“…These values can be benchmarked in solving multi-objective GMS problems using the multi-objective PACS algorithm and its variants.…”
Get full text
Get full text
Get full text
Article -
8
Adaptive differential evolution algorithm with fitness based selection of parameters and mutation strategies / Rawaa Dawoud Hassan Al-Dabbagh
Published 2015“…The performance of DE algorithm depends heavily on the selected mutation strategy and its associated control parameters. …”
Get full text
Get full text
Thesis -
9
Review on the parameter settings in harmony search algorithm applied to combinatorial optimization problems
Published 2022“…Harmony search algorithm (HSA) is relatively considered as one of the most recent metaheuristic algorithms. …”
Get full text
Get full text
Article -
10
Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search
Published 2008“…Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities resulted…”
Get full text
Get full text
Article -
11
University class timetable tool
Published 2022“…In this project, the newly constraints related to the study modes in the timetable scheduling will be defined, genetic algorithm will be studied and used to solve the timetabling problem. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
12
An experiment on the performance of shortest path algorithm
Published 2016“…The main objective of this paper is to study and experiment the different shortest path algorithm such as Dijkstra’s algorithm, Symmetrical Dijkstra’s algorithm, A* algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm and Genetic algorithm in solving the shortest path problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Suitability Factor on the Capacitated Vehicle Routing Problem
Published 2010“…Finding a good solution for logistics and transportation industries is a continuous effort to maximize the efficiencies especially on problem that relates to the industry such as Vehicle Routing Problem (VRP). …”
Get full text
Get full text
Conference or Workshop Item -
14
-
15
A biogeography-based optimization algorithm hybridized with tabu search for the quadratic assignment problem
Published 2016“…The quadratic assignment problem (QAP) is an NP hard combinatorial optimization problem with a wide variety of applications.Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems.It has been shown that BBO provides performance on a par with other optimization methods.A classical BBO algorithm employs the mutation operator as its diversification strategy. …”
Get full text
Get full text
Article -
16
Application Of Higher Order Compact Finite Difference Methods To Problems In Fluid Dynamics
Published 2003“…These unknowns are solved explicitly with Hermitian relations that relate the variables and its spatial derivatives. …”
Get full text
Get full text
Thesis -
17
A Biogeography-Based Optimization Algorithm Hybridized With Tabu Search For The Quadratic Assignment Problem
Published 2016“…Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
Opposition-based manta ray foraging algorithm for global optimization and its application to optimize nonlinear type-2 fuzzy logic control
Published 2024“…Moreover, as the algorithms are also promising strategies to other problems, they are applied to solve 50D of 30 IEEE CEC14 benchmark functions representing problems with different features. …”
Get full text
Get full text
Get full text
Article -
19
Modelling and Optimization of Asymmetric Vehicle Routing Problem Using Particle Swarm Optimization Algorithm
Published 2021“…Various problems related to vehicle routing problem attract interest of researchers and industry. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
20
Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier
Published 2013“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text
Article
