Search Results - (( based solving colony algorithm ) OR ( java application testing algorithm ))
Search alternatives:
- application testing »
- testing algorithm »
- java application »
- based solving »
-
1
A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem
Published 2023Get full text
Get full text
Get full text
Conference or Workshop Item -
2
-
3
-
4
-
5
Ant Colony Optimization With Look Forward Ant In Solving Assembly Line Balancing Problem
Published 2011“…This work presents an approach based on the ant colony optimization technique to address the assembly line balancing problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
Published 2021“…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
7
Global gbest guided-artificial bee colony algorithm for numerical function optimization
Published 2018“…The two well-known honeybees-based upgraded algorithms, Gbest Guided Artificial Bee Colony (GGABC) and Global Artificial Bee Colony Search (GABCS), use the foraging behavior of the global best and guided best honeybees for solving complex optimization tasks. …”
Get full text
Get full text
Article -
8
Application of Bee Colony Optimization (BCO) in NP-Hard Problems
Published 2011Get full text
Get full text
Final Year Project -
9
Ant colony optimization in dynamic environments
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 -
10
Hybrid ant colony optimization algorithm for container loading problem
Published 2012“…It was showed that the proposed HACO algorithm has the capability in solving the CLP.…”
Get full text
Get full text
Thesis -
11
Solving economic dispatch using ant colony optimization (ACO) / Nur Hazima Faezaa Ismail
Published 2006“…Ant Colony Optimization (ACO) is a meta-heuristic approach for solving hard combinatorial optimization problems. …”
Get full text
Get full text
Thesis -
12
Reactive approach for automating exploration and exploitation in ant colony optimization
Published 2016“…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
Get full text
Get full text
Get full text
Thesis -
13
Simulation of identifying shortest path walkway in library by using ant colony optimization
Published 2012“…A research is proposed based on Ant Colony Optimization for solving the shortest path problem in library.This is a research that the algorithm is aim to implement on a robot. …”
Get full text
Get full text
Undergraduates Project Papers -
14
Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management
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 -
15
Enhancing Solutions Of Capacity Vehicle Routing Problem Based On An Improvement Ant Colony System Algorithm
Published 2019“…The paper aims to discover an optimal route for VRP by using Improvement Ant Colony System Algorithm (IACS). Optimal routes are founded based on to decrease the distance and the time for each and every one route which directs to quickest the moving of customers to their locations, also based on developing the CVRP model for optimizing the routing issues. …”
Get full text
Get full text
Get full text
Article -
16
Optimization of turning parameters using ant colony optimization
Published 2008“…This project proposed a new optimization technique based on the ant colony algorithm for solving single-pass turning optimization problems. …”
Get full text
Get full text
Undergraduates Project Papers -
17
-
18
Multi-Objectives Ant Colony System For Solving Multi-Objectives Capacitated Vehicle Routing Problem
Published 2020“…In this paper, the following objectives were achieved: (i) in view of the domain of the multiobjective CVRP, the total distance traveled by the vehicles and the total number of vehicles used are reduced, and (ii) in the view of the technique, a multi-objective Ant Colony System is proposed to solve the multiobjective of CVRP based on the experience of sub-paths. …”
Get full text
Get full text
Get full text
Article -
19
Modified ant colony optimization algorithms for deterministic and stochastic inventory routing problems / Lily Wong
Published 2018“…The computational results also show that the algorithms of population based ACO performs better than the algorithms of non-population based ACO. …”
Get full text
Get full text
Get full text
Thesis -
20