Search Results - (( parallel distribution factor algorithm ) OR ( discrete optimization method algorithm ))
Search alternatives:
- parallel distribution »
- distribution factor »
- factor algorithm »
- method algorithm »
-
1
Modification of particle swarm optimization algorithm for optimization of discrete values
Published 2011“…We propose a novel modification to the PSO algorithm to perform rapid discrete optimization. The proposed Discrete-PSO method (DPSO) uses a rescaling equation to convert the continuous-valued positions into discrete-valued variables. …”
Get full text
Get full text
Research Reports -
2
Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems
Published 2024“…Hence, optimization algorithms, consisting of exact and heuristic methods, are crucial for a myriad of real-world applications. …”
Get full text
Get full text
Thesis -
3
A Novel Discrete Filled Function Algorithm in Solving Discrete Optimization Problems (S/O: 12408)
Published 2016“…Several global methods have been proposed for solving discrete optimization problems. …”
Get full text
Get full text
Monograph -
4
A modified discrete filled function algorithm for solving nonlinear discrete optimization problems
Published 2012“…The discrete filled function method is a global optimization tool for searching for best solution amongst multiple local optima.This method has proven useful for solving large-scale discrete optimization problems.In this paper, we consider a standard discrete filled function algorithm in the literature and then propose a modification to increase its efficiency.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems
Published 2009“…These problems are known as discrete-valued optimal control problems. Most practical discrete-valued optimal control problems have multiple local minima and thus require global optimization methods to generate practically useful solutions. …”
Get full text
Get full text
Get full text
Thesis -
6
A discrete simulated kalman filter optimizer for combinatorial optimization problems
Published 2022“…An example of a numerical algorithm is the simulated Kalman filter (SKF). Various method has been introduced as an extension of a numerical algorithm to adapt it to a discrete search space. …”
Get full text
Get full text
Thesis -
7
Mine blast algorithm for optimization of truss structures with discrete variables
Published 2012“…In this study a novel optimization method is presented, the so called mine blast algorithm (MBA). …”
Get full text
Article -
8
-
9
Optimizing Decentralized Exam Timetabling with a Discrete Whale Optimization Algorithm
Published 2025“…In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
Get full text
Get full text
Get full text
Article -
10
Optimizing decentralized exam timetabling with a discrete whale optimization algorithm
Published 2025“…—In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
Get full text
Get full text
Get full text
Article -
11
-
12
Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems
Published 2021“…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
Get full text
Get full text
Get full text
Article -
13
Binary Artificial Bee Colony Optimization For Weighted Random 2 Satisfiability In Discrete Hopfield Neural Network
Published 2023“…Hence, this thesis will utilize Non-Systematic Weighted Random 2 Satisfiability incorporating with Binary Artificial Bee Colony algorithm in Discrete Hopfield Neural Network. The Binary Artificial Bee Colony will be utilized to optimize the logical structure according to the ratio of negative literals by capitalizing the features of the exploration mechanism of the algorithm. …”
Get full text
Get full text
Thesis -
14
Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling
Published 2022“…It is also discovered that the hybrid-discrete MOPSO (HD-MOPSO) algorithm manages to obtain higher values in the performance metrics consisting of non-dominance ratio and hypervolume compared to the competing algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
15
A variational discrete filled function approach in discrete global optimization
Published 2015“…Many real-life applications governed by discrete variables poss multiple local optimal solutions, which requires the utilization of global optimization tools find the best solution amongst them.The main difficulty in determining the best solution, or also known as the global solution, is to escape from the basins surrounding local minimums.To overcome this issue, an auxiliary function is introduced in discrete filled function method which turns the local minimizer of the original function become a maximizer.Then, an improved local minimum is found by minimizing the filled function, otherwise the edge of the feasible region is attained.Based on a discrete filled function method from the literature, we propose a modification particularly on the neighbourhood search to enhance its computational efficiency.Numerical results suggest that the proposed algorithm is efficient in solving large scale complex discrete optimization problems.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
Assisted History Matching by Using Genetic Algorithm and Discrete Cosine Transform
Published 2014“…Next, fluid flow equations were derived to obtain the forward model and eventually, the objective function. Later, an algorithm combining both Genetic Algorithm and Discrete Cosine Transform was proposed, which shows the step-by-step sequence of both methods. …”
Get full text
Get full text
Final Year Project -
17
Optimization Of Bar Linkage By Using Genetic Algorithms
Published 2005“…This thesis presents the method of using simple Genetic Algorithms (GAs) in optimizing the size of bar linkage with discrete design variables and continues design variables. …”
Get full text
Get full text
Monograph -
18
A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem
Published 2020“…The primary aim of this study is to propose a hybrid approach which combines Discrete Differential Evolution (DDE) algorithm and Tabu Search (TS) algorithm to enhance solutions of QAP model, to reduce the distances between the locations by finding the best distribution of N facilities to N locations, and to implement hybrid approach based on discrete differential evolution (HDDETS) on many instances of QAP from the benchmark. …”
Get full text
Get full text
Get full text
Article -
19
Model structure selection for a discrete-time non-linear system using a genetic algorithm
Published 2004“…Genetic algorithms (GAs) have received significant interest from researchers and have been applied to various optimization problems. …”
Get full text
Get full text
Article -
20
Model structure selection for a discrete-time non-linear system using a genetic algorithm
Published 2004“…Genetic algorithms (GAs) have received significant interest from researchers and have been applied to various optimization problems. …”
Get full text
Get full text
Article