Search Results - (( using ant problem algorithm ) OR ( evolution optimization method algorithm ))

Search alternatives:

Refine Results
  1. 1
    Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem

    Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem by Anniza, Hamdan, San Nah, Sze, Say Leng, Goh, Kang Leng, Chiew, Wei King, Tiong

    Published 2023
    “…Other metaheuristic approaches such as genetic algorithm, differential evolution algorithm, particle swarm optimization, and ant colony optimization are still preferable to address combinatorial optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…Based on the proposed heuristic method, we developed a program to optimize the routing problem using the Visual Studio C++ 6.0 programming language.…”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  3. 3
    Sensitivity analysis of GA parameters for ECED problem

    Sensitivity analysis of GA parameters for ECED problem by Kamil K., Razali N.M.M., Teh Y.Y.

    Published 2023
    Subjects: “…Genetic algorithms…”
    Conference paper
    Save to List
    Saved in:
  4. 4
    Dynamic smart grid communication parameters based cognitive radio network

    Dynamic smart grid communication parameters based cognitive radio network by Haider H.T., Muhsen D.H., Shahadi H.I., See O.H., Elmenreich W.

    Published 2023
    “…A differential evolution algorithm is used to select the optimal transmission parameters for given communication modes based on a fitness function that combines multiple objectives based on appropriate weights. …”
    Article
    Save to List
    Saved in:
  5. 5
    Task scheduling in cloud computing using hybrid genetic algorithm and bald eagle search (GA-BES)

    Task scheduling in cloud computing using hybrid genetic algorithm and bald eagle search (GA-BES) by Kamal Khairi Supaprhman

    Published 2022
    “…The natural evolution optimization algorithm which is genetic algorithm can be improve by combining the nature meta-heuristic algorithms which is bald eagle search to improve the makespan of genetic algorithm using cloudsim that need to be implement on the eclipse platform. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
    Save to List
    Saved in:
  6. 6
    A hybrid optimization technique for solving economic emission load dispatch problems

    A hybrid optimization technique for solving economic emission load dispatch problems by Aisyah binti Nordin

    Published 2023
    text::Final Year Project
    Save to List
    Saved in:
  7. 7
    Ant colony optimization and genetic algorithm models for suspended sediment discharge estimation for gorgan-river, Iran

    Ant colony optimization and genetic algorithm models for suspended sediment discharge estimation for gorgan-river, Iran by Mohammad Reza Pour, Omolbani

    Published 2011
    “…New models based on artificial intelligence models, namely; Ant Colony Optimization (ACO) and Genetic Algorithm (GA) are now being used more frequently to solve optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Comparison between ant colony and genetic algorithm using traveling salesman problem

    Comparison between ant colony and genetic algorithm using traveling salesman problem by Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah

    Published 2013
    “…In ant colony algorithm each individual ant constructs a part of the solution using an artificial pheromone which reflects its experience accumulated while solving the problem and heuristic information dependent on the problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Ant colony optimization in dynamic environments

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…In order to achieve this objective, six ant algorithms namely Ant System (AS), Ant Colony System (ACS), Best-Worst Ant System (BWAS), Elitist Ant System (EAS), Max-Min Ant System (MMAS) and Rank-Based Ant System (RBAS) were implemented to solve a dynamic optimization problem in the form of the dynamic Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Interacted Multiple Ant Colonies for Search Stagnation Problem

    Interacted Multiple Ant Colonies for Search Stagnation Problem by Aljanabi, Alaa Ismael

    Published 2010
    “…This thesis addresses the issues associated with search stagnation problem that ACO algorithms suffer from. In particular, it proposes the use of multiple interacted ant colonies as a new algorithmic framework. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Optimizing large scale combinatorial problems using multiple ant colonies algorithm based on pheromone evaluation technique

    Optimizing large scale combinatorial problems using multiple ant colonies algorithm based on pheromone evaluation technique by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md Norwawi, Norita

    Published 2008
    “…The new algorithm can effectively be used to tackle large scale optimization problems.Computational tests show promises of the new algorithm.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules

    A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules by Rizauddin, Saian

    Published 2013
    “…In the first proposed algorithm, SA is used to optimize the rule's discovery activity by an ant. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Heuristic factors in ant system algorithm for course timetabling problem

    Heuristic factors in ant system algorithm for course timetabling problem by Djamarus, Djasli, Ku-Mahamud, Ku Ruhana

    Published 2009
    “…This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concept of negative pheromone was also applied to ensure that paths leading to dead ends are not chosen.The performance of this proposed algorithm is promising when comparison of performance was made with the original ant system algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    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:
  16. 16
    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  17. 17
    An adaptive ant colony optimization algorithm for rule-based classification

    An adaptive ant colony optimization algorithm for rule-based classification by Al-Behadili, Hayder Naser Khraibet

    Published 2020
    “…Ant-Miner is a variant of ant colony optimisation and a prominent intelligent algorithm widely use in rules-based classification. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    AntNet: a robust routing algorithm for data networks

    AntNet: a robust routing algorithm for data networks by Haseeb, Shariq, Sidek, Khairul Azami, Ismail, Ahmad Faris, Weng Kin, Lai, Yit Mei, Aw

    Published 2004
    “…AntNet is an innovative algorithm that may be used for data networks. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    New heuristic function in ant colony system for job scheduling in grid computing

    New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

    Published 2012
    “…Job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: