Search Results - (( basic optimization method algorithm ) OR ( total solution using algorithm ))

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

“…In this HPSO algorithm, totally seven particles positions are initialized. …”
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

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

Determining optimal transportation allocation using linear programming methods / Tengku Mohd Hazimi Tuan Hassan and Maslin Masrom by Tuan Hassan, Tengku Mohd Hazimi, Masrom, Maslin

“…The efficiency and effectiveness of the transportation problem algorithm are determined using the Excel Solver. The excel solution and sensitivity analysis provide information about the optimal distribution strategy for their products. …”
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 first and second examples illustrate the existing methods without using the SA approach. The results show that the proposed method obtained the optimal solution of FTP, whereas the existing methods produced infeasible solution. …”
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 first and second examples illustrate the existing methods without using the SA approach. The results show that the proposed method obtained the optimal solution of FTP, whereas the existing methods produced infeasible solution. …”
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 first and second examples illustrate the existing methods without using the SA approach. The results show that the proposed method obtained the optimal solution of FTP, whereas the existing methods produced infeasible solution. …”
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 first and second examples illustrate the existing methods without using the SA approach. The results show that the proposed method obtained the optimal solution of FTP, whereas the existing methods produced infeasible solution. …”
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 first and second examples illustrate the existing methods without using the SA approach. The results show that the proposed method obtained the optimal solution of FTP, whereas the existing methods produced infeasible solution. …”
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 first and second examples illustrate the existing methods without using the SA approach. The results show that the proposed method obtained the optimal solution of FTP, whereas the existing methods produced infeasible solution. …”
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 first and second examples illustrate the existing methods without using the SA approach. The results show that the proposed method obtained the optimal solution of FTP, whereas the existing methods produced infeasible solution. …”
Get full text
Get full text
Get full text

Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

“…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
Get full text
Get full text

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

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

Data Analysis using Particle Swarm Optimization Algorithm by Tai, Zu Jie

Get full text
Get full text

Using Electromagnetism-like algorithm and genetic algorithm to optimize time of task scheduling for dual manipulators by Abed I.A., Sahari K.S.M., Koh S.P., Tiong S.K., Jagadeesh P.

“…A method based on Electromagnetism-Like algorithm (EM) and Genetic Algorithm (GA) is proposed to determine the time-optimal task scheduling for dual robot manipulators. …”

Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction by Abasi, Ammar Kamal Mousa

“…Second, three multi-verse optimizer algorithm (MVOs), namely, basic MVO, modified MVO, hybrid MVO is proposed to solve the TDC problem; these algorithms are incremental improvements of the preceding versions. …”
Get full text
Get full text

Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

“…After discussing about the introduction (the basic of CMOS transistor ), we will discuss how to create the Optimal layout of CMOS Functional Array with the minimum separation based on euler path method. …”
Get full text
Get full text

Model of Improved a Kernel Fast Learning Network Based on Intrusion Detection System by Ali, Mohammed Hasan, Mohamed Fadli, Zolkipli

“…In this paper, the particle swan optimization algorithm (PSO) was used to obtain an optimal set of initial parameters for Reduce Kernel FLN (RK-FLN), thus, creating an optimal RKFLN classifier named PSO-RKELM. …”
Get full text
Get full text