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

Stochastic process and tutorial of the African buffalo optimization by Odili, Julius Beneoluchi, Noraziah, Ahmad, Alkazemi, Basem, Zarina, M.

“…This paper presents the data description of the African buffalo optimization algorithm (ABO). …”
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

Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

“…The ASH algorithm is basically applied with its probabilistic decision rule and pheromone feedback to construct the sequences of customers to be visited in the CVRP solution. …”
Get full text
Get full text

Stochastic process and tutorial of the African bufalo optimization by Odili, Julius Beneoluchi, Noraziah, Ahmad, Alkazemi, Basem Y., M., Zarina

“…This paper presents the data description of the African buffalo optimization algorithm (ABO). …”
Get full text
Get full text
Get full text

Optimization of supply chain management by simulation based RFID with XBEE Network by Soomro, Aftab Ahmed

“…In order to solve this problem, a simulation based “Multi-Colony Global Particle Swarm Optimization (MC-GPSO)” algorithm was developed. …”
Get full text
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

Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller by Zaridah, Mat Zain

“…The contribution of this work is to optimize the base of Fuzzy membership function of the APFLC by using GA technique. …”
Get full text

Solving unit commitment problem by using particle swarm optimization technique / Muhammad Aqil Ab Rahman by Ab Rahman, Muhammad Aqil

Get full text
Get full text

Development an accurate and stable range-free localization scheme for anisotropic wireless sensor networks by Han, Fengrong

“…This study developed an optimized variation of the DV-Hop localization algorithm for anisotropic wireless sensor networks. …”
Get full text
Get full text

Efficient beamforming and spectral efficiency maximization in a joint transmission LTE-A system by Faisal, Ali Raed

“…Moreover, addressing the lack-of-diversity issue in Basic Particle Swarm Optimization Algorithm (BPSOA) is a primary concern of this work. …”
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

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. …”
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

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. …”
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

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. …”
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

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. …”
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

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. …”
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 Dasri, Yosza Dasri, Chandrasekar Ramasamy, Chandrasekar Ramasamy, Nazarudin Bujang, Nazarudin Bujang, Yahya Nur Ifriza, Yahya Nur Ifriza

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. …”
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

“…Segregated advancement (SA) is a separation approach where the TFN represented by low, middle, and upper are solved part by part. The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. …”
Get full text
Get full text
Get full text

Solving power system state estimation using orthogonal decomposition algorithm / Tey Siew Kian by Tey, Siew Kian

“…By using real time measurements and historical data base, power system state estimator detects errors in measurements and the data base; and calculates an optimal estimate of the system state vector of the bus voltage magnitudes and angles. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text

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

“…In the proposed novel QOJaya algorithm, an intelligence strategy, namely, quasi-oppositional based learning (QOBL) is incorporated into the basic Jaya algorithm to enhance its convergence speed and solution optimality. …”
Get full text
Get full text

Public healthcare facility planning in Malaysia : Using location allocation models / S. Sarifah Radiah Shariff by S. Sarifah Radiah, Shariff

“…The results from CPLEX are observed to violate some of facilities’ constraint, thus making the solutions infeasible. A heuristic based on Genetic Algorithm (GA) is proposed and some computational analysis is carried out to gauge the performance of the existing facilities. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text