Search Results - (( using optimization max algorithm ) OR ( using optimization problems algorithm ))

A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

“…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

An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

“…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

A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems by Phen, Chiak See

Get full text

Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

“…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

Ant colony optimization in dynamic environments by Chen, Fei Huang

“…Apart from the size of the optimization problem, how the swapping interval affects the dynamic optimization by the ant algorithms is also investigated. …”
Get full text
Get full text
Get full text

Performance comparison of differential evolution and particle swarm optimization in constrained optimization by Iwan, Mahmud, Akmeliawati, Rini, Faisal, Tarig, Al-Assadi, Hayder M.A.A.

“…There are quite numbers of modern optimization algorithms proposed in the last two decades to solve optimization problems. …”
Get full text
Get full text
Get full text

An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby A., Ku-Mahamud K.R., Norwawi N.Md.

Interacted Multiple Ant Colonies for Search Stagnation Problem by Aljanabi, Alaa Ismael

“…This thesis addresses the issues associated with search stagnation problem that ACO algorithms suffer from. In particular, it proposes the use of multiple interacted ant colonies as a new algorithmic framework. …”
Get full text
Get full text
Get full text

Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

“…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
Get full text
Get full text
Get full text

Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network by Ismail Abdullah, Kalid Abdlkader Marsal

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

“…In recent years, various metaheuristic approaches have been created to solve quadratic assignment problems (QAPs). Among others is the ant colony optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. …”
Get full text
Get full text

Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

“…We introduced two new approaches to normalization techniques to enhance the K-Means algorithms. This is to remedy the problem of using the existing Min-Max (MM) and Decimal Scaling (DS) techniques, which have overflow weakness. …”
Get full text
Get full text
Get full text

A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function by Mahdi, F.P., Vasant, P., Abdullah-Al-Wadud, M., Watada, J., Kallimani, V.

“…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

A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function by Mahdi, F.P., Vasant, P., Abdullah-Al-Wadud, M., Watada, J., Kallimani, V.

“…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

An Exploration Technique for the Interacted Multiple Ant Colonies Optimization Framework by Aljanaby, A, Ku-Mahamud, KR, Norwawi, NM

“…These colonies are working cooperatively to solve an optimization problem using some interaction technique. …”

Fair energy-efficient resource allocation for downlink NOMA heterogeneous networks by Ali, Zuhura Juma, Noordin, Nor Kamariah, Sali, Aduwati, Hashim, Fazirulhisyam

“…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

Adaptive and optimized radio resource allocation algorithms for OFDMA based networks by Saadat, Md. Nazmus

“…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

An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md. Norwawi, Norita

“…These colonies are working coopereatively to solve an optimization problem using some interaction technique. …”
Get full text
Get full text
Get full text

The effect of pre-processing techniques and optimal parameters on BPNN for data classification by HUSSEIN, AMEER SALEH

Get full text
Get full text
Get full text
Get full text