Search Results - (( problem using best algorithm ) OR ( java implication based algorithm ))

Search alternatives:

Refine Results
  1. 1
    An enhanced metaheuristic approach to solve quadratic assignment problem using hybrid technique

    An enhanced metaheuristic approach to solve quadratic assignment problem using hybrid technique by Hameed, Asaad Shakir

    Published 2021
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Ant colony optimization in dynamic environments

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…This thesis is an investigation into the application ' of ACO for solving dynamic optimization problems. The first objective of this study is to identify which ant algorithm performs the best under a dynamic environment. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Hybrid flow shop scheduling problem with energy utilization using non-dominated sorting genetic algorithm-III (NSGA-III) optimization

    Hybrid flow shop scheduling problem with energy utilization using non-dominated sorting genetic algorithm-III (NSGA-III) optimization by Muhammad Ammar, Nik Mu’tasim, Mohd Fadzil Faisae, Ab Rashid

    Published 2023
    “…Then, a case study problem is presented to assess all models. The numerical results showed that the NSGA-III obtained 50% best overall for distribution performance metrics and 42% best in convergence performance metrics for HFS benchmark problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches

    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches by Mohd Pauzi, Nur Fazlinda

    Published 2015
    “…Artificial Bee Colony (ABC) algorithm is one of the methods used to solve the flowshop scheduling problem but only a few researches have been found using this method in this area. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…When come to large scale data problems, Maple software is used to solve it with ease.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…The solution’s construction is modified using the concept of global best operator that is used in the Particle Swarm Optimization (PSO). …”
    thesis::doctoral thesis
    Save to List
    Saved in:
  7. 7
    Solving the travelling salesman problem by using artificial bee colony algorithm / Noor Ainul Hayati Mohd Naziri

    Solving the travelling salesman problem by using artificial bee colony algorithm / Noor Ainul Hayati Mohd Naziri by Mohd Naziri, Noor Ainul Hayati

    Published 2021
    “…In Bavaria from Library of Traveling Salesman Problem with the distance from a city to another city has been used to find the best solution of the shortest distance. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  8. 8
    New heuristic function in ant colony system for the travelling salesman problem

    New heuristic function in ant colony system for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…Ant Colony System (ACS) is one of the best algorithms to solve NP-hard problems.However, ACS suffers from pheromone stagnation problem when all ants converge quickly on one sub-optimal solution.ACS algorithm utilizes the value between nodes as heuristic values to calculate the probability of choosing the next node. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Optimization of ship routing using hybrid genetic algorithm / Ismail

    Optimization of ship routing using hybrid genetic algorithm / Ismail by ., Ismail

    Published 2014
    “…Soft constraints concerns with ship draft and load factor. To solve this problem, we propose a hybrid genetic algorithm (hybrid GA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Parameter estimation in double exponential smoothing using genetic algorithm / Foo Fong Yeng, Lau Gee Choon and Zuhaimy Ismail

    Parameter estimation in double exponential smoothing using genetic algorithm / Foo Fong Yeng, Lau Gee Choon and Zuhaimy Ismail by Foo, Fong Yeng, Lau, Gee Choon, Ismail, Zuhaimy

    Published 2014
    “…The objective of this research is to estimate the Double Exponential Smoothing by using Genetic Algorithm Mechanism. The expected result of this research is Genetic Algorithm to able search for the best parameter in Double Exponential Smoothing.…”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  11. 11
    Cuti – cuti Malaysia recommender system using Ant Colony Optimization (ACO) / Nur Maisarah Zulkifli

    Cuti – cuti Malaysia recommender system using Ant Colony Optimization (ACO) / Nur Maisarah Zulkifli by Zulkifli, Nur Maisarah

    Published 2017
    “…Execution of the ACO algorithm shows that the algorithm able to produce optimum solution towards the said problem.…”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  12. 12
    Optimisation of energy efficient Assembly Sequence Planning using Moth-Flame Optimisation alghorithm

    Optimisation of energy efficient Assembly Sequence Planning using Moth-Flame Optimisation alghorithm by Muhammad Arif, Abdullah

    Published 2019
    “…This problem is a non-deterministic polynomial-time (NP) hard problem, as currently cannot be solved by using a specific approach. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    A memory-based gravitational search algorithm for enhancing minimum variance distortionless response beamforming

    A memory-based gravitational search algorithm for enhancing minimum variance distortionless response beamforming by Darzi S., Sieh Kiong T., Tariqul Islam M., Rezai Soleymanpour H., Kibria S.

    Published 2023
    Article
    Save to List
    Saved in:
  14. 14
    Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management

    Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management by Julius, Beneoluchi Odili, M. N. M., Kahar, Noraziah, Ahmad, M., Zarina, Riaz, Ul Haq

    Published 2017
    “…After critical assessments of the performances of eleven algorithms consisting of two heuristics (Randomized Insertion Algorithm and the Honey Bee Mating Optimization for the Travelling Salesman’s Problem), two trajectory algorithms (Simulated Annealing and Evolutionary Simulated Annealing) and seven population-based optimization algorithms (Genetic Algorithm, Artificial Bee Colony, African Buffalo Optimization, Bat Algorithm, Particle Swarm Optimization, Ant Colony Optimization and Firefly Algorithm) in solving the 60 popular and complex benchmark symmetric Travelling Salesman’s optimization problems out of the total 118 as well as all the 18 asymmetric Travelling Salesman’s Problems test cases available in TSPLIB91. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Application of the bees algorithm for constrained mechanical design optimisation problem

    Application of the bees algorithm for constrained mechanical design optimisation problem by Kamaruddin, Shafie, Abd Latif, Mohd Arif Hafizi

    Published 2019
    “…The Bees Algorithm is considered as one of the best optimisation algorithms because it has been successfully solved different type optimisation problem from in various field. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]

    Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.] by Jamaluddin, Siti Hafawati, Mohd Naziri, Noor Ainul Hayati, Mahmud, Norwaziah, Muhammat Pazil, Nur Syuhada

    Published 2022
    “…In Bavaria from the Library of Traveling Salesman Problem, the distance from one city to another has been used to find the best solution for the shortest distance. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Optimization of drilling path using the bees algorithm

    Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

    Published 2021
    “…Optimization is the process of finding the best possible solutions to a problem. It has been widely used in various areas especially in engineering problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    An improved simulated annealing algorithm to avoid crosstalk in optical omega network

    An improved simulated annealing algorithm to avoid crosstalk in optical omega network by Abdullah, Monir, Othman, Mohamed, Johari, Rozita

    Published 2006
    “…Routing the messages in degree-decreasing of the message conflicts gave best performance among them. When Simulated Annealing (SA) algorithm was used to solve the problem, it gave good results. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line

    Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line by Noroziroshan, Alireza, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah

    Published 2010
    “…This study presented an intelligence based genetic algorithm approach to optimize the considered problem objectives through reducing the problem complexity. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: