Constrained Optimization via Quantum Genetic Algorithm for Task Scheduling Problem

2020 ◽  
pp. 234-248
Author(s):  
Zihan Yan ◽  
Hong Shen ◽  
Huiming Huang ◽  
Zexi Deng
Keyword(s):  
Genetic Algorithm ◽  
Constrained Optimization ◽  
Task Scheduling ◽  
Scheduling Problem ◽  
Quantum Genetic Algorithm

Fitness distance analysis for parallel genetic algorithm in the test task scheduling problem

2013 ◽  
Vol 18 (12) ◽  
pp. 2385-2396 ◽  
Author(s):  
Hui Lu ◽  
Jing Liu ◽  
Ruiyao Niu ◽  
Zheng Zhu
Keyword(s):  
Genetic Algorithm ◽  
Task Scheduling ◽  
Scheduling Problem ◽  
Parallel Genetic Algorithm ◽  
Test Task ◽  
Distance Analysis

scholarly journals Fixed Task Scheduling of Industrial Robot using Genetic Algorithm Based Travelling Salesman Problem

2020 ◽  
Vol 9 (5) ◽  
pp. 1771-1775
Keyword(s):  
Genetic Algorithm ◽  
Task Scheduling ◽  
Shortest Path ◽  
Completion Time ◽  
Travelling Salesman Problem ◽  
Industrial Robots ◽  
Scheduling Problem ◽  
Search Technique ◽  
Travelling Salesman ◽  
Algorithm Search

The task scheduling of any industrial robots is a prior requirement to effectively use the capability by obtaining shortest path with optimum completion time. In this article, we have presented Travelling Salesman Problem (TSP) with Genetic Algorithm (GA) search technique based task scheduling technique for obtaining optimum shortest path of the task.TSP finds an optimal solution to search for the shortest route by considering every location for completing the required tasks by setting up GA. This article embrace the adaption and implementation of the Genetic Algorithm search strategy for the task scheduling problem in the cooperative control of multiple resources for getting shortest path with minimize the completion time for two zone specific task allocation problem. It can be inferred from the simulation results that the Genetic Algorithm search technique can be considered as a viable solution for the task scheduling problem.

Sign in / Sign up

Export Citation Format

Share Document