SECURITY SCHEDULING USING GENETIC ALGORITHM
| ctrlnum |
14919 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><relation>http://repository.unika.ac.id/14919/</relation><title>SECURITY SCHEDULING USING GENETIC ALGORITHM</title><creator>RONNY, -</creator><subject>Data processing & computer science</subject><description>Scheduling is to manage life easier and more effective. It informs us
about what to do, and when we do it. Many scheduling are still arranged
manually, including security scheduling. Good schedule have no collisions
in it, such as collision between security that guard in a day, or time
collision.
This project is to generate security schedule. With genetic algorithm
that usually used in schedule optimization and Java programming
language. First step of genetic algorithm is to initialize a population of
data. And the value of each population will be calculated. After that each
population will pass crossover and mutation processes. Finally, the
schedule will be displayed.
The expectation of this project is to make security scheduling easier
and more effective without any collisions.</description><date>2017</date><type>Thesis:Thesis</type><type>PeerReview:NonPeerReviewed</type><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/14919/1/13.02.0148%20Ronny%20COVER.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/14919/2/13.02.0148%20Ronny%20BAB%20I.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/14919/3/13.02.0148%20Ronny%20BAB%20II.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/14919/4/13.02.0148%20Ronny%20BAB%20III.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/14919/5/13.02.0148%20Ronny%20BAB%20IV.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/14919/6/13.02.0148%20Ronny%20BAB%20V.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/14919/7/13.02.0148%20Ronny%20BAB%20VI.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/14919/8/13.02.0148%20Ronny%20DAFTAR%20PUSTAKA.pdf</identifier><identifier> RONNY, - (2017) SECURITY SCHEDULING USING GENETIC ALGORITHM. Other thesis, Unika Soegijapranata Semarang. </identifier><recordID>14919</recordID></dc>
|
| language |
eng |
| format |
Thesis:Thesis Thesis PeerReview:NonPeerReviewed PeerReview Book:Book Book |
| author |
RONNY, - |
| title |
SECURITY SCHEDULING USING GENETIC ALGORITHM |
| publishDate |
2017 |
| topic |
Data processing & computer science |
| url |
http://repository.unika.ac.id/14919/1/13.02.0148%20Ronny%20COVER.pdf http://repository.unika.ac.id/14919/2/13.02.0148%20Ronny%20BAB%20I.pdf http://repository.unika.ac.id/14919/3/13.02.0148%20Ronny%20BAB%20II.pdf http://repository.unika.ac.id/14919/4/13.02.0148%20Ronny%20BAB%20III.pdf http://repository.unika.ac.id/14919/5/13.02.0148%20Ronny%20BAB%20IV.pdf http://repository.unika.ac.id/14919/6/13.02.0148%20Ronny%20BAB%20V.pdf http://repository.unika.ac.id/14919/7/13.02.0148%20Ronny%20BAB%20VI.pdf http://repository.unika.ac.id/14919/8/13.02.0148%20Ronny%20DAFTAR%20PUSTAKA.pdf http://repository.unika.ac.id/14919/ |
| contents |
Scheduling is to manage life easier and more effective. It informs us
about what to do, and when we do it. Many scheduling are still arranged
manually, including security scheduling. Good schedule have no collisions
in it, such as collision between security that guard in a day, or time
collision.
This project is to generate security schedule. With genetic algorithm
that usually used in schedule optimization and Java programming
language. First step of genetic algorithm is to initialize a population of
data. And the value of each population will be calculated. After that each
population will pass crossover and mutation processes. Finally, the
schedule will be displayed.
The expectation of this project is to make security scheduling easier
and more effective without any collisions. |
| id |
IOS2679.14919 |
| institution |
Universitas Katolik Soegijapranata |
| institution_id |
334 |
| institution_type |
library:university library |
| library |
Perpustakaan Universitas Katolik Soegijapranata |
| library_id |
522 |
| collection |
Unika Repository |
| repository_id |
2679 |
| subject_area |
Akuntansi Arsitektur Ekonomi |
| city |
SEMARANG |
| province |
JAWA TENGAH |
| repoId |
IOS2679 |
| first_indexed |
2017-11-09T21:48:58Z |
| last_indexed |
2017-11-09T21:48:58Z |
| recordtype |
dc |
| _version_ |
1765771832122671104 |
| score |
17.538404 |