Search Results - (( simulation optimization problems algorithm ) OR ( using optimization max algorithm ))
Search alternatives:
- optimization max »
- max algorithm »
- problems »
-
1
An exploration technique for the interacted multiple ant colonies optimization framework
Published 2024Conference Paper -
2
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
Review -
3
An Exploration Technique for the Interacted Multiple Ant Colonies Optimization Framework
Published 2024“…These colonies are working cooperatively to solve an optimization problem using some interaction technique. …”
Proceedings Paper -
4
Fair energy-efficient resource allocation for downlink NOMA heterogeneous networks
Published 2020“…The energy consumption of both the transmitter and the receiver are considered to simulate the real system design. The Greedy Algorithm (GA) is used to achieve a low-complex optimal solution during the user-pairing process. …”
Get full text
Get full text
Get full text
Article -
5
A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function
Published 2018“…Emissions of CO2, SO2, and NOx are considered 3 different objectives, thus making it a 4-objective problem considering ED. Many-objective EED problems are defined by using a cubic criterion function, and a max/max price penalty factor is considered to convert all the objectives into a single objective to compare the final results with other well-known methods found in the literature like Lagrangian relaxation, particle swarm optimization, simulated annealing, and quantum-behaved bat algorithm. …”
Get full text
Get full text
Article -
6
A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function
Published 2018“…Emissions of CO2, SO2, and NOx are considered 3 different objectives, thus making it a 4-objective problem considering ED. Many-objective EED problems are defined by using a cubic criterion function, and a max/max price penalty factor is considered to convert all the objectives into a single objective to compare the final results with other well-known methods found in the literature like Lagrangian relaxation, particle swarm optimization, simulated annealing, and quantum-behaved bat algorithm. …”
Get full text
Get full text
Article -
7
Adaptive and optimized radio resource allocation algorithms for OFDMA based networks
Published 2015“…AORAA contains an adaptive and optimized subcarrier allocation algorithm which uses graph theoretic techniques to do the best probable matching of subcarrier and users’ channel information. …”
Get full text
Get full text
Thesis -
8
An exploration technique for the interacted multiple ant colonies optimization framework
Published 2010“…These colonies are working coopereatively to solve an optimization problem using some interaction technique. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
-
10
A discrete simulated kalman filter optimizer for combinatorial optimization problems
Published 2022“…Another type of algorithm is called numerical algorithms. These algorithms were built specifically to address numerical optimization problems. …”
Get full text
Get full text
Thesis -
11
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
Get full text
Get full text
Thesis -
12
A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem
Published 2021“…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
Get full text
Get full text
Get full text
Article -
13
Simulated Kalman Filter: A Novel Estimation-based Metaheuristic Optimization Algorithm
Published 2016“…To evaluate the performance of the Simulated Kalman Filter algorithm, it is applied to 30 benchmark functions of CEC 2014 for real-parameter single objective optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Angle Modulated Simulated Kalman Filter Algorithm for Combinatorial Optimization Problems
Published 2016“…However, the SKF is only capable to solve continuous numerical optimization problem. In order to solve discrete optimization problems, the SKF algorithm is combined with an angle modulated approach. …”
Get full text
Get full text
Get full text
Get full text
Article -
15
-
16
An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem
Published 2021“…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
Get full text
Get full text
Get full text
Article -
17
Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems
Published 2018“…The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches
Published 2015“…The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation
Published 2022“…This thesis proposes and simulates the three novel optimization algorithms to handle DG allocation, different single-objective, and multi-objective OPF problems. …”
Get full text
Get full text
Thesis -
20
Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems
Published 2018“…The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. …”
Get full text
Get full text
Article
