[PDF] Top 20 Using Simulated Annealing and Ant Colony Optimization Algorithms to Solve the Scheduling Problem

Using Simulated Annealing and Ant Colony Optimization Algorithms to Solve the Scheduling Problem

... a simulated annealing phase with Kempe chain ...method using Graph Coloring was developed for optimizing solutions to the timetabling ...Max-Min Ant System (MMAS) with a construction graph for ... See full document

17

A Hybrid Simulated Annealing for Job Shop Scheduling Problem

... combinatorial optimization problems whose models are relatively easy to build, but the algorithms to find the best solutions are not easy to ...this problem belongs to NP-hard Problem class ... See full document

10

Aircraft sequencing problem solve by using simulated annealing method

... ASP can also be viewed as a routing and scheduling problem. As an example, if there are a number of customers to be picked up by a vehicle, there would be a time window given for each customer and ... See full document

27

Fire Fly and Artificial Bees Colony Algorithm for Synthesis of Scanned and Broadside Linear Array Antenna

... the problem can be referred as ...based optimization techniques, namely FFA and ABC, to solve this multi-objective designing ...problem. Algorithms efficiently compute the non-uniform ... See full document

22

Heuristic Task Allocation Strategies for Computational Grid

... The ant colony optimization algorithm is a probabilistic technique for solving NP complete ...Balanced Ant Colony Optimization (BACO) for job scheduling in grid is ... See full document

7

Model Analysis on Job Shop Scheduling in Automobile Industry using Ant Colony Optimization and Particle Swarm Optimization

... Swarm Optimization is an optimization algorithm which uses iterations to improve the ...the problem by moving the candidate solutions by applying common mathematical formulae over the candidate ... See full document

5

A Hybrid Method to Solve Travelling Salesman Problem

... Genetic Algorithms (GA) to the TSP ...Swarm Optimization(PSO) based algorithm for the TSP ...on Simulated Annealing (SA) and greedy search techniques to solve the ...to solve the ... See full document

5

Heuristic Approaches for Cell Formation in Cellular Manufacturing

... formation problem (CFP) which is an NP-hard ...solved using the Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Simulated An- nealing (SA) meta-heuristic methods and ... See full document

9

Survey of Metaheuristic Algorithms for Combinatorial Optimization

... to solve task assignment ...salesman problem [9]. Kang-Ping Wang et al. (2003) proposed PSO to solve traveling salesman ...to solve the single machine total weighted tardiness ...to ... See full document

11

IJCSMC, Vol. 5, Issue. 5, May 2016, pg.489 – 493 A Review on ACO based Scheduling Algorithm in Cloud Computing

... task scheduling. Cloud task scheduling is an NP-hard optimization problem and many meta-heuristic algorithms have been proposed to solve ...its scheduling strategy to the ... See full document

5

Solving Asymmetric Travelling Salesman Problem using Memetic Algorithm

... Salesman Problem is a problem that is not deterministic and hard and quite known in combinatorial optimization studied in theory based computer science and operation research ...Various ... See full document

6

Online Full Text

... combinatorial optimization problem such as the traveling salesman problem (TSP), the quadratic assignment problem, the vehicle routing problem, and the job-shop scheduling ...to ... See full document

6

A Novel Approach To Solve Tsp Using Ant Colony Optimization

... salesman problem (TSP) is a routing problem, which is a sub-problem of many application domains such as transportation, network ...the problem ACO algorithm has defined with well distribution ... See full document

6

Solving Job Shop Scheduling Problem Using an Ant Colony Algorithm

... The JSSP with a minimum makespan objective is widely acknowledged as one of the most difficult combinatorial optimization problems. A comprehensive survey of approximation algorithms can be found in, Jain ... See full document

8

A Hybrid Ant Colony Optimization Algorithm using MapReduce for Arc Routing Problem

... “Ant colony system: A cooperative learning approach to the travelling salesman problem this paper introduces the premire colony system (ACS), a distributed formula that's applied to the voice ... See full document

5

IJCSMC, Vol. 3, Issue. 2, February 2014, pg.39 – 44 SURVEY ARTICLE A SURVEY ON WORKFLOW SCHEDULING IN CLOUD USING ANT COLONY OPTIMIZATION

... the scheduling algorithm to start the decision making ...to solve this problem by providing portable abstractions to several existing cloud ... See full document

6

Comparative Analysis of ACO and PSO over Task Scheduling

... task scheduling has become one of the most discussed ...is scheduling, to benefit from colossal computing capacity of these systems and this problem is NP- ...of Ant Colony ... See full document

6

Population-based optimization algorithms for solving the travelling salesman problem

... NP-complete problem, which has extremely large search spaces and is very difficult to solve (Louis & Gong, ...optimally solve small problems while the heuristic methods, such as 2-opt (Lin & ... See full document

36

Job Scheduling in Grid Computing with Cuckoo Optimization Algorithm

... genetic simulated annealing (GSA) algorithm which combines genetic algorithm with simulated annealing algorithm for grid scheduling is ...global optimization at ...jobs ... See full document

6

Machine Vision Optimization using Nature-Inspired Algorithms to Model Sunagoke Moss Water Status

... Therefore optimization is needed to improve the performance of machine ...Objective Optimization (MOO) was used to select 212 image features to get maximum prediction accuracy and minimum number of features ... See full document

13