Search Results - (( using functional study algorithm ) OR ( basic optimization method algorithm ))

Refine Results
  1. 1

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

    Published 2021
    “…Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in the graph. This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    Published 2009
    “…In this study, we present a scaled memoryless modified Symmetric Rank-One (SR1) algorithm and investigate the numerical performance of the proposed algorithm for solving large-scale unconstrained optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Backtracking search algorithm for optimal power dispatch in power system / Mostafa Modiri Delshad by Mostafa, Modiri Delshad

    Published 2016
    “…Backtracking search algorithm (BSA) as the new evolutionary technique of optimization is used for solving the problems. …”
    Get full text
    Get full text
    Thesis
  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
    “…The experimentations of the proposed algorithm are conducted using existing benchmark instances and a published case study on an energy-efficient job-shop model. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2010
    “…A review of di®erent minimization methods that can be used to solve unconstrained optimization problems is also given. …”
    Get full text
    Get full text
    Thesis
  7. 7

    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
  8. 8

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

    Published 2018
    “…This dissertation presents a study on product design optimization which focuses on the inclusion of the potential environmental impact in the design consideration. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Potential of data minimization techniques approach in improving DNA sequences alignment and comparison / Syed Abdul Mutalib Al Junid … [et al.] by Al Junid, Syed Abdul Mutalib, Haron, Muhammad Adib, Abd Majid, Zulkifli, Othman, Zulkifli

    Published 2012
    “…This study will initially involve algorithm modification, mathematical formulation, logic design and simulation for data minimization and existing DNA sequences alignment algorithm. …”
    Get full text
    Get full text
    Research Reports
  10. 10

    Fractal coding of bio-metric image for face authentication by Ahadullah, Md

    Published 2021
    “…This thesis implements the algorithms for the Methods of CPM, BPBM fractal coding, and its application. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Published 2016
    “…Followed by development of prediction algorithm for solar radiation using soft-computing methodologies. …”
    Get full text
    Get full text
    Thesis
  12. 12

    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
  13. 13

    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
  14. 14

    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
  15. 15
  16. 16

    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.

    Published 2023
    “…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. …”
    Conference paper
  17. 17

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

    Published 2021
    “…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
    Thesis
  18. 18

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

    Published 1997
    “…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
    Thesis
  19. 19

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

    Published 2019
    “…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
    Conference or Workshop Item
  20. 20

    Algorithm development for optimization of a refrigeration system by Izzat, Mohamad Adnan

    Published 2010
    “…This thesis deals with algorithm development for optimization of a refrigeration system. …”
    Get full text
    Get full text
    Undergraduates Project Papers