Search Results - (( based solving method algorithm ) OR ( basic optimization method algorithm ))

Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

“…Meanwhile, the proposed QOJaya algorithm produces better results than the basic Jaya method in terms of solution optimality and convergence speed. …”
Get full text
Get full text

Memoryless modified symmetric rank-one method for large-scale unconstrained optimization by Modarres, Farzin, Abu Hassan, Malik, Leong, Wah June

“…Conclusion/Recommendations: In this study a memoryless QN method developed for solving large-scale unconstrained optimization problems, in which the SR1 update based on the modified QN equation have applied. …”
Get full text
Get full text
Get full text

Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

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

Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

“…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
Get full text
Get full text
Get full text
Get full text

Development of cell formation algorithm and model for cellular manufacturing system by Nouri, Hossein

“…In addition, one of the main challenges has been development of efficient algorithm for solving aforementioned model to find exact feasible optimal solution. …”
Get full text
Get full text

Mathematical formulation of tabu search in combinatorial optimization by Ismail, Zuhaimy

“…CARP is known to be Non-deterministic Polynomialtime hard (NP-hard) where solutions are obtained through heuristic methods. Tabu Search (TS) is a heuristic method based on the use of prohibition-based techniques and basic heuristics algorithms like local search. …”
Get full text
Get full text

Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

“…The basic idea of the discrete filled function method is as follows. …”
Get full text
Get full text
Get full text

Nomadic people optimizer (NPO) for large-scale optimization problems by Mohamd Salih, Sinan Qahtan

“…The basic component of the algorithm consists of several clans and each clan searches for the best place (or best solution) based on the position of their leader. …”
Get full text
Get full text

Tackling the berth allocation problem via harmony search algorithm by Ahmed, Bilal, Hamdan, Hazlina, Muhammed, Abdullah, Husin, Nor Azura

“…Harmony Search Algorithm (HSA) is one of the recent population-based optimization methods which inspired by modern-nature. …”
Get full text
Get full text
Get full text

A new modern scheme for solving fractal–fractional differential equations based on deep feedforward neural network with multiple hidden layer by Admon, Mohd Rashid, Senu, Norazak, Ahmadian, Ali, Majid, Zanariah Abdul, Salahshour, Soheil

“…During the initial stage of the method development, the basic framework on solving FFDEs is designed. …”
Get full text
Get full text

Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

“…Particle Swarm Optimization (PSO) is a population-based metaheuristic that possesses many advantages compared to other metaheuristics in solving scheduling problems. …”
Get full text
Get full text
Get full text
Get full text

Optimal resource allocation for NOMA wireless networks by Albogamy, Fahad R., Aiyashi, M. A., Hashim, Fazirul Hisyam, Imran Khan, Choi, Bong Jun

“…The major goal is to maximize the users’ maximum weighted sum rate. The suggested algorithm’s most notable feature is that it converges to the global optimal solution. …”
Get full text
Get full text

Implementation of Symmetric Rank-One Methods for Unconstrained Optimization by Khiyaban, Farzin Modarres

“…We then examine a new scaled memoryless SR1 method based on modied secant equation for solving large-scale unconstrained optimization problems. …”
Get full text
Get full text

Heuristic resource allocation algorithm for controller placement in multi-control 5G based on SDN/NFV architecture by Ibrahim, Abeer Abdalla Zakaria, Hashim, Fazirulhisyam, Noordin, Nor Kamariah, Sali, Aduwati, Navaie, Keivan, Fadul, Saber Mohammed Elnour

“…A Greedy Randomized Search (GRS) algorithm was used to solve the dynamic assignment of nodes to controllers to achieve load balancing. …”
Get full text
Get full text
Get full text

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasril, Yosza Dasril, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Bujang, Nazarudin, Yahya, Nur Ifriza

“…The third example presents the limitation of existing methods along with the SA approach. The results show that the proposed method is capable in solving the third example whereas the existing approach failed to solve the said example…”
Get full text
Get full text
Get full text

Long-term optimal planning for renewable based distributed generators and battery energy storage systems toward enhancement of green energy penetration by ALAhmad A.K., Verayiah R., Shareef H.

“…To solve the optimization planning model, a hybrid optimization algorithm is proposed, combining the non-dominating sorting genetic algorithm (NSGAII) and multi-objective particle swarm optimization (MOPSO). …”

Master-leader-slave cuckoo search with parameter control for ANN optimization and its real-world application to water quality prediction by Jaddi N.S., Abdullah S., Malek M.A.

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasril, Yosza Dasril, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Nazarudin Bujang, Nazarudin Bujang, Yahya Nur Ifriza, Yahya Nur Ifriza

“…The third example presents the limitation of existing methods along with the SA approach. The results show that the proposed method is capable in solving the third example whereas the existing approach failed to solve the said example.…”
Get full text
Get full text
Get full text

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasril, Yosza Dasril, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Nazarudin Bujang, Nazarudin Bujang, Yahya Nur Ifriza, Yahya Nur Ifriza

“…The third example presents the limitation of existing methods along with the SA approach. The results show that the proposed method is capable in solving the third example whereas the existing approach failed to solve the said example.…”
Get full text
Get full text
Get full text

Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems by Muhammad Sam’An, Muhammad Sam’An, Yosza Dasril, Yosza Dasril, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Nazarudin Bujang, Nazarudin Bujang, Yahya Nur Ifriza, Yahya Nur Ifriza

“…The third example presents the limitation of existing methods along with the SA approach. The results show that the proposed method is capable in solving the third example whereas the existing approach failed to solve the said example.…”
Get full text
Get full text
Get full text