Novel Genetic Algorithm with Dual Chromosome Representation for Resource Allocation in Container-Based Clouds

Author(s):  
Boxiong Tan ◽  
Hui Ma ◽  
Yi Mei
2017 ◽  
Vol 26 (1) ◽  
pp. 169-184 ◽  
Author(s):  
Absalom E. Ezugwu ◽  
Nneoma A. Okoroafor ◽  
Seyed M. Buhari ◽  
Marc E. Frincu ◽  
Sahalu B. Junaidu

AbstractThe operational efficacy of the grid computing system depends mainly on the proper management of grid resources to carry out the various jobs that users send to the grid. The paper explores an alternative way of efficiently searching, matching, and allocating distributed grid resources to jobs in such a way that the resource demand of each grid user job is met. A proposal of resource selection method that is based on the concept of genetic algorithm (GA) using populations based on multisets is made. Furthermore, the paper presents a hybrid GA-based scheduling framework that efficiently searches for the best available resources for user jobs in a typical grid computing environment. For the proposed resource allocation method, additional mechanisms (populations based on multiset and adaptive matching) are introduced into the GA components to enhance their search capability in a large problem space. Empirical study is presented in order to demonstrate the importance of operator improvement on traditional GA. The preliminary performance results show that the proposed introduction of an additional operator fine-tuning is efficient in both speed and accuracy and can keep up with high job arrival rates.


Electronics ◽  
2021 ◽  
Vol 10 (23) ◽  
pp. 2909
Author(s):  
Chen Zhang ◽  
Jiangtao Yang ◽  
Yong Zhang ◽  
Ziwei Liu ◽  
Gengxin Zhang

Beam hopping technology is considered to provide a high level of flexible resource allocation to manage uneven traffic requests in multi-beam high throughput satellite systems. Conventional beam hopping resource allocation methods assume constant rainfall attenuation. Different from conventional methods, by employing genetic algorithm this paper studies dynamic beam hopping time slots allocation under the effect of time-varying rain attenuation. Firstly, a beam hopping system model as well as rain attenuation time series based on Dirac lognormal distribution are provided. On this basis, the dynamic allocation method by employing genetic algorithm is proposed to obtain both quantity and arrangement of time slots allocated for each beam. Simulation results show that, compared with conventional methods, the proposed algorithm can dynamically adjust time slots allocation to meet the non-uniform traffic requirements of each beam under the effect of time-varying rain attenuation and effectively improve system performance.


2020 ◽  
Author(s):  
Jiawei LI ◽  
Tad Gonsalves

This paper presents a Genetic Algorithm approach to solve a specific examination timetabling problem which is common in Japanese Universities. The model is programmed in Excel VBA programming language, which can be run on the Microsoft Office Excel worksheets directly. The model uses direct chromosome representation. To satisfy hard and soft constraints, constraint-based initialization operation, constraint-based crossover operation and penalty points system are implemented. To further improve the result quality of the algorithm, this paper designed an improvement called initial population pre-training. The proposed model was tested by the real data from Sophia University, Tokyo, Japan. The model shows acceptable results, and the comparison of results proves that the initial population pre-training approach can improve the result quality.


2020 ◽  
Vol 3 (2) ◽  
pp. 60
Author(s):  
Wayan Firdaus Mahmudy ◽  
Andreas Pardede ◽  
Agus Wahyu Widodo ◽  
Muh Arif Rahman

Workers at large plantation companies have various activities. These activities include caring for plants, regularly applying fertilizers according to schedule, and crop harvesting activities. The density of worker activities must be balanced with efficient and fair work scheduling. A good schedule will minimize worker dissatisfaction while also maintaining their physical health. This study aims to optimize workers' schedules using a genetic algorithm. An efficient chromosome representation is designed to produce a good schedule in a reasonable amount of time. The mutation method is used in combination with reciprocal mutation and exchange mutation, while the type of crossover used is one cut point, and the selection method is elitism selection. A set of computational experiments is carried out to determine the best parameters’ value of the genetic algorithm. The final result is a better 30 days worker schedule compare to the previous schedule that was produced manually. 


Sign in / Sign up

Export Citation Format

Share Document