Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Comparison of Crossover and Mutation Operators to Solve Teachers Placement Problem by Using Genetic Algorithm
by
Sriwindono, H
, Polina, A M
, Pinaryanto, K
, Rosa, P H P
, Nugroho, R A
2020
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Comparison of Crossover and Mutation Operators to Solve Teachers Placement Problem by Using Genetic Algorithm
by
Sriwindono, H
, Polina, A M
, Pinaryanto, K
, Rosa, P H P
, Nugroho, R A
2020
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Comparison of Crossover and Mutation Operators to Solve Teachers Placement Problem by Using Genetic Algorithm
Journal Article
Comparison of Crossover and Mutation Operators to Solve Teachers Placement Problem by Using Genetic Algorithm
2020
Request Book From Autostore
and Choose the Collection Method
Overview
The placement of elementary school teachers is an NP-complex problem. Teacher placement can be optimized by considering several factors that influence their performance, including the distance of teacher's residence to school, age, and gender of the teacher. This paper discusses the solution model of the problem based on genetic algorithms by finding a chromosome formation that represents the possibility of teachers placement solution, composing a population, and finding the recommended combination of two selected mutations operators and two selected crossover operators to achieve optimal results. The selected mutation operators were Reverse Sequence Mutation (RSM) and Partial Shuffle Mutation (PSM), while the selected crossover-operators were Single Point Crossover (SPX) and Ordered Crossover (OX). The combined performance of these operators is measured based on the fitness value and running time of the program. Based on experiments, it can be concluded that the combination of OX-PSM with mutation probability 1:20 gives the lowest minimum fitness value compared to other combinations of crossover and mutation operators. The running time of the combination of OX-PSM is stable in any mutation probability, ranging from 39,5 - 41 minutes.
Publisher
IOP Publishing
MBRLCatalogueRelatedBooks
Related Items
Related Items
We currently cannot retrieve any items related to this title. Kindly check back at a later time.
This website uses cookies to ensure you get the best experience on our website.