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

Refine Results
  1. 1

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

    Published 2017
    “…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
    Thesis
  2. 2
  3. 3

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…Although Althought the average error of proposed ABC algorithm has been 0.371% higher than best solution of all methods, it could improve the solution of 3 problems with average of 3.305%. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

    Published 2019
    “…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
    Thesis
  5. 5

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

    Published 2022
    “…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2019
    “…Recently, intelligent searching methods were proposed to enhance the computational optimization issues in motion estimation but still lack in obtaining the best solution of block matching. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Power line faults classification by neural network train by Ant Colony Optimization by Nasirudin, Mohd Syafiq

    Published 2017
    “…The characteristic of ACO algorithms is their explicit use of elements of previous solutions. …”
    Get full text
    Get full text
    Student Project
  8. 8
  9. 9

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

    Published 2018
    “…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
    Thesis
  10. 10

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

    Published 2022
    “…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
    Article
  11. 11

    Optimization and prediction of battery electric vehicle driving range using adaptive fuzzy technique by Abulifa, Abdulhadi Abdulsalam

    Published 2022
    “…An optimal solution was proposed by integrating fuzzy logic technique with brute force algorithm that gave the best system optimization, where the decision was based on the Satisfaction Ratio (SR) and State of Charge (SoC). …”
    Get full text
    Get full text
    Thesis
  12. 12

    Genetic algorithm optimization of product design for environmental impact reduction / Julirose Gonzales by Julirose , Gonzales

    Published 2018
    “…The results using the proposed methodology yields 50 pareto optimal design solutions for every run, allowing the designers the freedom to choose the suitable design. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

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

    Published 2009
    “…These problems are known as discrete-valued optimal control problems. Most practical discrete-valued optimal control problems have multiple local minima and thus require global optimization methods to generate practically useful solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Optimal feasible solutions to a road freight transportation problem / Tolulope Latunde … [et al.] by Latunde, Tolulope, Richard, Joseph Oluwaseun, Esan, Opeyemi Odunayo, Dare, Damilola Deborah

    Published 2020
    “…This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Basic concept of implementing Artificial Bee Colony (ABC) system in flow shop scheduling by Ho, Yoong Chow, Hasan, Sulaiman, Bareduan, Ahmad Salleh

    Published 2013
    “…However, the fundamental ABC system uses a heuristic approach to obtain an optimum solution which may not be the optimum solution at all. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    UiTM Transportation Unit bus trip scheduling system / Noorzawanah Ab Rahim by Ab Rahim, Noorzawanah

    Published 2009
    “…In order to generate the prototype, the heuristic search is the appropriate technique to solve scheduling problems. A heuristic is a method that might not always find the best solution but is guaranteed to find a good solution in reasonable time. …”
    Get full text
    Get full text
    Thesis
  18. 18

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

    Published 2002
    “…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
    Undergraduates Project Papers
  19. 19

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

    Published 2011
    “…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
    Thesis
  20. 20