An Intelligent Genetic Scheme for Multi-Objective Collaboration Services Scheduling
Open Access
- 29 September 2022
- Vol. 14 (10), 2037
- https://doi.org/10.3390/sym14102037
Abstract
The optimization of collaborative service scheduling is the main bottleneck restricting the efficiency and cost of collaborative service execution. It is helpful to reduce the cost and improve the efficiency to deal with the scheduling problem correctly and effectively. The traditional genetic algorithm can solve the multi-objective problem more comprehensively than the optimization algorithm, such as stochastic greedy algorithm. But in the actual situation, the traditional algorithm is still one-sided. The intelligent genetic scheme (IGS) proposed in this paper enhances the expansibility and diversity of the algorithm on the basis of traditional genetic algorithm. In the process of initial population selection, the initial population generation strategy is changed, a part of the population is randomly generated and the selection process is iteratively optimized, which is a selection method based on population asymmetric exchange to realize selection. Mutation factors enhance the diversity of the population in the adaptive selection based on individual innate quality. The proposed IGS can not only maintain individual diversity, increase the probability of excellent individuals, accelerate the convergence rate, but also will not lead to the ultimate result of the local optimal solution. It has certain advantages in solving the optimization problem, and provides a new idea and method for solving the collaborative service optimization scheduling problem, which can save manpower and significantly reduce costs on the premise of ensuring the quality. The experimental results show that Intelligent Genetic algorithm (IGS) not only has better scalability and diversity, but also can increase the probability of excellent individuals and accelerate the convergence speed.Keywords
Funding Information
- the National Nature Science Foundation of China (No.91846205, 61772316, No.2018YFJH0506, 2018CXGC0706, No.2019GGX101009, No. cstc2020jscx-lyjsAX0010)
This publication has 38 references indexed in Scilit:
- An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robotsNeurocomputing, 2013
- Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor NetworksSensors, 2011
- An Adaptive Management Mechanism for Resource Scheduling in Multiple Virtual Machine SystemLecture Notes in Computer Science, 2011
- A data placement strategy in scientific cloud workflowsFuture Generation Computer Systems, 2010
- A genetic algorithm with local search strategy for improved detection of community structureComplexity, 2009
- A review of applications of genetic algorithms in lot sizingJournal of Intelligent Manufacturing, 2008
- Genetic algorithm for the personnel assignment problem with multiple objectivesInformation Sciences, 2007
- Ants can solve constraint satisfaction problemsIEEE Transactions on Evolutionary Computation, 2002
- A genetic algorithm for multiple objective sequencing problems in mixed model assembly linesComputers & Operations Research, 1998
- Linear programming with multiple objective functions: Step method (stem)Mathematical Programming, 1971