Search Results - (( parallel optimization modified algorithm ) OR ( using optimization max algorithm ))
Search alternatives:
- parallel optimization »
- optimization modified »
- optimization max »
- max algorithm »
-
1
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 -
2
-
3
-
4
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 -
5
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 -
6
Parallel multiple tabu search for multiobjective Urban Transit Scheduling Problem
Published 2020“…A set covering model was then adopted to minimize the number of buses and drivers simultaneously. A parallel tabu search algorithm was proposed to solve the problem by modifying the initialization process and incorporating intensification and diversification approaches to guide the search effectively from the different feasible domain in finding optimal solutions with lesser computational effort. …”
Get full text
Get full text
Article -
7
An optimal tasks scheduling algorithm based on QoS in cloud computing network
Published 2017“…This study presents an optimal task scheduling algorithm by enhancing Max-Min and TS algorithm. …”
Get full text
Get full text
Thesis -
8
Development of optimization Alghorithm for uncertain non-linear dynamical system
Published 2004“…An algorithm that definitely can satisfy the objectives is the Dynamic Integrated Systems Optimization and Parameter Estimation (DISOPE) algorithm. …”
Get full text
Get full text
Monograph -
9
Maximum 2-satisfiability in radial basis function neural network
Published 2020“…This paper presents a new paradigm in using MAX2SAT by implementing in Radial Basis Function Neural Network (RBFNN). …”
Get full text
Get full text
Get full text
Article -
10
Review of the grey wolf optimization algorithm: variants and applications
Published 2023“…The paper begins with a concise introduction to the GWO, providing insight into its natural establishment and conceptual framework for optimization. It then lays out the theoretical foundation and key procedures involved in the GWO, following which it comprehensively examines the most recent iterations of the algorithm and categorizes them into parallel, modified, and hybridized variations. …”
Get full text
Get full text
Article -
11
Fair uplink bandwidth allocation and latency guarantee for mobile WiMAX using fuzzy adaptive deficit round robin
Published 2014“…In this paper, an efficient bandwidth allocation algorithm for the uplink traffic in mobile WiMAX is proposed. …”
Get full text
Get full text
Get full text
Article -
12
Cross-layer design using multi-channel system in WiMAX mesh networks
Published 2008Get full text
Get full text
Conference or Workshop Item -
13
-
14
A new minimum pheromone threshold strategy (MPTS) for max-min ant system
Published 2009“…Among others is the ant colony optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. …”
Get full text
Get full text
Article -
15
An exploration technique for the interacted multiple ant colonies optimization framework
Published 2024Conference Paper -
16
A modified artificial neural network (ANN) algorithm to control shunt active power filter (SAPF) for current harmonics reduction
Published 2013“…The novelty control design is an artificial neural network (ANN) adopting a modified mathematical algorithm (a modified delta rule weight-updating W-H) and a suitable alpha value (learning rate value) which determines the filters optimal operation. …”
Get full text
Get full text
Conference or Workshop Item -
17
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 -
18
Performance comparison of differential evolution and particle swarm optimization in constrained optimization
Published 2012“…This paper presents a comparative study for min-max constrained optimization using PSO and DE. Here, the constrained optimization is represented by some selected standard benchmark functions. …”
Get full text
Get full text
Get full text
Article -
19
Process Planning Optimization In Reconfigurable Manufacturing Systems
Published 2008“…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
Get full text
Get full text
Thesis -
20
Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks
Published 2009“…This thesis proposes an optimized strategy namely cross-layer design in routing algorithms used find the best route for all SSs and scheduling algorithms, used to assign a time slot for each possible node transmission. …”
Get full text
Get full text
Thesis
