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

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

Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman by Che Osman, Siti Eshah

“…The final results have proved that HPSO algorithm could achieve 5% - 34% of computation cost reduction with satisfying degradation value of image quality. …”
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

Scheduling scientific workflow using multiobjective algorithm with fuzzy resource utilization in multi-cloud environment by Farid, Mazen, Latip, Rohaya, Hussin, Masnida, Abdul Hamid, Nor Asilah Wati

“…In this respect, this paper proposes a new multi-objective scheduling algorithm with Fuzzy resource utilization (FR-MOS) for scheduling scientific workflow based on particle swarm optimization (PSO) method. …”
Get full text
Get full text

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

“…Therefore, for this proposes good benchmarked algorithm, bacteria foraging algorithm is selected and developed to solve multiobjective cell formation model and traced constraints satisfaction handling to produce feasible optimal solution. …”
Get full text
Get full text

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

“…The localization accuracy and robustness of comparison indicated that the developed DWGWO-DV-Hop algorithm super outperforms the other classical range-free methods. …”
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). …”

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

“…The design of the heuristic method provides proper load balancing, efficient cost management, and network resource management, as compared to the basic CCPP model. …”
Get full text
Get full text
Get full text

Stereo matching algorithm using census transform and segment tree for depth estimation by Hamzah, Rostam Affendi, Zainal Azali, Muhammad Nazmi, Mohd Noh, Zarina, Tengku Wook, Tg Mohd Faisal, Zainal Abidin, Izwan

“…Fundamentally, the framework input is the stereo image which represents left and right images respectively. The proposed algorithm in this article has four steps in total, which starts with the matching cost computation using census transform, cost aggregation utilizes segment-tree, optimization using winner-takes-all (WTA) strategy, and post-processing stage uses weighted median filter. …”
Get full text
Get full text
Get full text

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

“…From the results, it is found that the proposed improved algorithm is effective in solving the benchmark instances compared to when no improvement is implemented and with a reasonable increase in computational costs. …”
Get full text
Get full text
Get full text
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

An Environmentally Energy Dispatch Using New Meta Heuristic Evolutionary Programming by Mohamad Ridzuan, Mohamad Radzi

“…Basically,one important issue in the power system network is to provide the optimal Economic Load Dispatch (ELD) solution in order to guarantee the sustainable consumer load demand.However,today ELD solution is essential to include together with the environmental aspect and known as Environmental Economic Load Dispatch (EELD).For that reason, many researchers continue in the development of new simulation tool specifically to overcome the EELD problems.Therefore,this study prepared an improved hybrid metaheuristic technique named as New Meta Heuristic Evolutionary Programming (NMEP) to provide the best possible solution in solving the identified single objective and multi objective functions for EELD solution.This new technique a merging cloning strategy that involved in an Artificial Immune System (AIS) algorithm into algorithm of Meta Heuristic Evolutionary Programming (Meta-EP).The development of NMEP technique is to minimize total cost,reduce the total emission during generator operation through the common formula in EELD and lowest total system loss.Besides that,all mentioned objective functions were also optimized together simultaneously that formulated using the weighted sum method before had been executed on the multi objective NMEP or called MONMEP.Both individual and multi objective NMEP techniques performance were verified among other two common heuristic methods known as AIS and Meta-EP techniques.In addition,the best possible solution defined using the aggregate function method.Through this method,the selection of the best MOEELD solution became effortless as compared with MO individually that required compare two or more objective function in one time manually.Among those three optimization techniques the lowest total aggregate values mostly resulted via the NMEP technique.Based upon that,the proposed technique is proving as the outstanding method compared with Meta-EP and AIS techniques in solving the EELD problem for both standard IEEE 26 bus and 57 bus systems.…”
Get full text
Get full text
Get full text
Get full text

CFD modeling on coal properties towards the burnout efficiency by Nabil Asyraf Abd Halim

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 flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
Get full text
Get full text
Get full text

Optimal planning and design of hybrid renewable energy system for rural healthcare facilities / Olatomiwa Lanre Joseph by Olatomiwa Lanre , Joseph

“…Then, utilization of cost-effective optimization algorithm for optimal sizing of the energy resources and other system components with accurate mathematical models for energy management of the entire hybrid system. …”
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 flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
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 flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
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 flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
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 flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
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

“…The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
Get full text
Get full text
Get full text