Search Results - (( discrete optimization methods algorithm ) OR ( time optimization method algorithm ))*
Search alternatives:
- optimization methods »
- methods algorithm »
- time optimization »
- method algorithm »
-
1
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 -
2
A discrete simulated kalman filter optimizer for combinatorial optimization problems
Published 2022“…However, these extensions may result in increased execution times for the algorithm. In this research, a new combinatorial algorithm named discrete simulated Kalman filter optimizer (DSKFO) is proposed to solve combinatorial optimization problem. …”
Get full text
Get full text
Thesis -
3
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 -
4
Development and applications of metaheuristic algorithms in engineering design and structural optimization / Ali Sadollah
Published 2013“…In addition, two novel optimization methods are developed and presented which are named the mine blast algorithm (MBA) and the water cycle algorithm (WCA). …”
Get full text
Get full text
Thesis -
5
-
6
Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems
Published 2021“…In order to improve the final solutions of a single created tour, The employee bees’ movement radius has been limited, because of avoidance of long random jump between nodes. To reduce the optimization time of the tours created by the artificial bee colony algorithm, the fixed-radius near neighbor 2-opt algorithm was used as well. …”
Get full text
Get full text
Get full text
Article -
7
Global optimization method for continuous - Time sensor scheduling
Published 2010“…We consider a situation in which several sensors are used to collect data for signal processing since operating multiple sensors simultaneously canses system interference, only one sensor can be active at any one time.The problem of scheduling a discrete-valued optimal control problem.This problem cannot be solved using conventional optimization problem.The Transformed problem is then decomposed into a bi-level optimization problem, which is solved using a discreate filled function method in conjunction with a conventional optimal control algorithm.Numerical results show that our algorithm is robust, efficient, and reliable in attaining a near globally optimal solution.…”
Get full text
Get full text
Get full text
Article -
8
Assisted History Matching by Using Genetic Algorithm and Discrete Cosine Transform
Published 2014“…Hence, this project, which propose the usage of assisted history matching technique with Genetic Algorithm (GA) as the optimization tool and Discrete Cosine Transform (DCT) as the parameter reduction method is carried out in order to achieve the objective of minimizing the time taken to do history matching. …”
Get full text
Get full text
Final Year Project -
9
-
10
Improvement and application of particle swarm optimization algorithm
Published 2025“…Finally, real-world tests are performed to verify the proposed Algorithm's efficacy compared to existing optimization methods. …”
Get full text
Get full text
Article -
11
Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification
Published 2007“…The genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
Get full text
Get full text
Article -
12
Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification
Published 2007“…he genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
Get full text
Get full text
Article -
13
Voting algorithms for large scale fault-tolerant systems
Published 2011“…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
Get full text
Get full text
Thesis -
14
A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem
Published 2020“…One of the major problems of Combinatorial NP-hard Optimization Problem is QAP mathematical model. Consequently, many approaches have been introduced to solve this problem, and these approaches are classified as Approximate and Exact methods. …”
Get full text
Get full text
Get full text
Article -
15
Model structure selection for a discrete-time non-linear system using a genetic algorithm
Published 2004“…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
Get full text
Get full text
Article -
16
Model structure selection for a discrete-time non-linear system using a genetic algorithm
Published 2004“…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
Get full text
Get full text
Article -
17
Model structure selection for a discrete-time non-linear system using genetic algorithm
Published 2004“…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
Get full text
Get full text
Get full text
Article -
18
Deterministic Mutation-Based Algorithm for Model Structure Selection in Discrete-Time System Identification
Published 2011“…Evolutionary computation (EC) is known to be an effective search and optimization method and in this paper EC is proposed as a model structure selection algorithm. …”
Get full text
Get full text
Get full text
Article -
19
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
Get full text
Get full text
Thesis -
20
A novel single parent mating technique in genetic algorithm for discrete - time system identification
Published 2024“…A typical rule is that the model must have a good balance between parsimony and accuracy in estimating a dynamic system. As a popular search method, genetic algorithm (GA) is used for selecting a model structure. …”
Get full text
Get full text
Get full text
Article
