Search Results - (( solution using meta algorithm ) OR ( ((java implication) OR (_ implication)) based algorithm ))

Refine Results
  1. 1

    Meta-heuristic structure for multiobjective optimization case study: Green sand mould system by Ganesan, T., Elamvazuthi, I., KuShaari, K.Z., Vasant, P.

    Published 2014
    “…Analysis on the solution set produced by these algorithms is carried out using performance metrics. …”
    Get full text
    Get full text
    Book
  2. 2

    Comparative Performance Analysis of Bat Algorithm and Bacterial Foraging Optimization Algorithm using Standard Benchmark Functions by Mazlina, Abdul Majid, Alsariera, Yazan A., Alamri, Hammoudeh S., Nasser, Abdullah M., Kamal Z., Zamli

    Published 2014
    “…Optimization problem relates to finding the best solution from all feasible solutions. Over the last 30 years, many meta-heuristic algorithms have been developed in the literature including that of Simulated Annealing (SA), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Harmony Search Algorithm (HS) to name a few. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    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
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    Enhancing generality of meta-heuristic algorithms through adaptive selection and hybridization by Kamal Z., Zamli

    Published 2018
    “…Many meta-heuristic algorithms have been developed to date (e.g. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9
  10. 10
  11. 11

    Proposal of meta-requirement approach to analyze requirements specification completeness by Muhamad Idaham, Umar Ong, M. A., Ameedeen

    Published 2018
    “…The objectives of this research are to identify the major factors in validating user requirements, development of a reverse engineered meta-requirement algorithm and validating with expert panel in requirements engineering of the algorithm usefulness. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12
  13. 13

    Multi-state PSO GSA for solving discrete combinatorial optimization problems by Ismail, Ibrahim

    Published 2016
    “…These four algorithms can be used to solve discrete combinatorial optimization problems (COPs). …”
    Get full text
    Get full text
    Thesis
  14. 14

    Enhancing Classification Algorithms with Metaheuristic Technique by Cokro, Nurwinto, Tri Basuki, Kurniawan, Misinem, ., Tata, Sutabri, Yesi Novaria, Kunang

    Published 2024
    “…Meta-heuristic algorithms are search techniques used to solve complexoptimization problems, and these algorithms can help provide reasonable solutions in a shorter time thanexact methods. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
  16. 16

    Meta-requirement method towards analyzing completeness of requirements specification by Muhamad Idaham, Umar Ong, Mohamed Ariff, Ameedeen, Imran Edzereiq, Kamarudin

    Published 2018
    “…The objectives of this research are to identify the major factors in validating user requirements, development of a reverse engineered meta-requirement algorithm and validating with expert panel in requirements engineering of the algorithm usefulness. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  17. 17
  18. 18

    An experimental study of modified black hole algorithms by Mohammed, Suad Khairi

    Published 2018
    “…In BH algorithm, an agent with the best solution forms a black hole. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

    Published 2018
    “…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    An ensemble of neural network and modified grey wolf optimizer for stock prediction by Das, Debashish

    Published 2019
    “…The “ensemble” model selected here to achieve better predictive performance, is used to predict future market price. The proposed approachoutperforms existing available meta-heuristic algorithms. …”
    Get full text
    Get full text
    Thesis