 |
UPT. PERPUSTAKAAN
Institut Teknologi Sepuluh Nopember Surabaya
Kampus ITS Sukolilo - Surabaya 60111
|
|
Phone |
: |
031-5921733 , 5923623 |
|
Fax |
: |
031-5937774 |
|
E-mail |
: |
libits@its.ac.id |
|
Website |
: |
http://library.its.ac.id
|
Support (Customer Service) :
|
|
timit_perpus@its.ac.id |
|
|
Welcome..guys!
|
Have a problem with your access?
Please, contact our technical support below:
|
LIVE SUPPORT
 Taufik Rachmanu  Dewi Eka Agustina  Ansi Aflacha Putri  Tondo Indra Nyata  Aprillia Tri Wulansari
|
! ATTENTION !
To facilitate the activation process, please fill out the member application form correctly and completely
Registration activation of our members will process up to max 24 hours (confirm by email). Please wait patiently
Still Confuse?
Please read our User Guide
|
|
ITS » Master Theses » Rantai Pasok S2 Posted by dee@its.ac.id at 28/10/2011 11:19:34 • 416 Views
PERBANDINGAN PERFORMANSI ALGORITMA CROSS ENTROPY DAN ALGORITMA DIFFERENTIAL EVOLUTION DALAM PENYELESAIAN PERMASALAHAN CREW ROSTERINGCOMPARISON OF CROSS ENTROPY AND DIFFERENTIAL EVOLUTION PERFORMANCE IN SOLVING CREW ROSTERING PROBLEMCreated by :
KRISNAWATI, MARIA ( 2509203002 )
| Subject: | Sistem telekomunikasi | | Alt. Subject : | Scheduling | | Keyword: | Kru regular Kru freelance Cross entropy Crew rostering Differential evolution |
Description:
Penjadwalan kru adalah tugas harian dalam pengelolaan perusahaan penerbangan. Dalam pemenuhan permintaan aktivitas, terkadang ditemukan permasalahan aktivitas dan pairing tidak dijadwalkan karena kekurangan kru. Penelitian ini akan dikembangkan suatu model crew rostering dengan 2 kategori kru (kru regular dan kru freelance) yang memperhatikan aturan – aturan pemerintah, serikat pekerja, dan aktivitas serta penugasan kru, preferensi kru, serta kualifikasi kru. Tujuan pada model ini adalah minimasi biaya total (biaya gaji untuk kru regular, dan freelance), fairness untuk semua anggota kru, serta preferensi kru. Cross Entropy (CE) dengan modifikasi diaplikasikan untuk menyelesaikan permasalahan crew rostering. CE regular memperlihatkan performansi yang baik untuk problem berukuran kecil tetapi membutuhkan waktu yang lama ketika ukuran permasalahan menjadi lebih besar. Untuk memperpendek waktu komputasi, pertama permasalahan dibagi menjadi problem kecil dan diselesaikan secara bertahap. Kedua, solusi dari optimasi parsial dikombinasikan dan digunakan sebagai solusi awal untuk problem secara keseluruhan. Pada penyelesaian permasalahan secara keseluruhan (optimasi total) jumlah populasi pada metode CE dapat dibuat lebih kecil karena kita mempunyai solusi awal yang cukup baik. Jumlah populasi pada tiap iterasi dikurangi secara bertahap untuk mempercepat waktu komputasi. Metode CE dengan penurunan jumlah sampel dapat memberikan kualitas roster yang lebih baik dan waktu penyelesaian masalah yang relatif lebih singkat. Sebagai pembanding kita juga mengimplementasikan metode heuristik lainnya, Differential Evolution (DE), dengan perlakukan yang sama dengan CE. Hasil menunjukkan bahwa metode CE lebih baik dibanding DE.
Alt. Description
Crew scheduling is daily task in airline management. It is frequently encountered in the crew rostering, some tasks and pairing are unscheduled due to lack of crew. This paper proposed a new model and method of crew rostering problem. This paper proposed a rostering model with two crew categories (regular and freelance crew) that consider pre-assigned activities, crew assignment, crew preferences,rules of company and crew qualification with multi objectives of minimizing total cost, fairness for overall crew, and crew satisfaction level. Cross Entropy (CE) with modification is applied to solve the rostering problem. Regular CE method shows good performance for small problems but take long computation time when the size of problem is getting bigger. To overcome this shortcoming, first, the problem is decomposed into small problems and solved by CE separately. Second, the solutions of those partial problems are combined and used as an initial solution for the overall problem. In solving the total optimization problem, the number of population in CE method can be set to lower size since we have already had good initial solution. In addition, the number of population of each iteration is decreased gradually to fasten the computation time. CE method with decreasing number of population produced good results while keeping the computation time short. As a comparison we also implemented another metaheuristics, Differential Evolution(DE) method, with the same scheme as CE .The results show that CE method is better than DE.
| Contributor | : |
- Ir. Budi Santosa, M.S., PhD
- Dr. Eng. Ir. Ahmad Rusdiansyah, M.Eng
| | Date Create | : | 22/07/2011 | | Type | : | Text | | Format | : | pdf | | Language | : | Indonesian | | Identifier | : | ITS-Master-3100011043308 | | Collection ID | : | 3100011043308 | | Call Number | : | RTI 658.53 Kri p |
Source : Master Thesis of Industrial Engineering, RTI 658.53 Kri p, 2011
Coverage : ITS Community
Rights : Copyright @2011 by ITS Library. This publication is protected by copyright and per obtained from the ITS Library prior to any prohibited reproduction, storage in a re transmission in any form or by any means, electronic, mechanical, photocopying, reco For information regarding permission(s), write to ITS Library
Publication URL : http://digilib.its.ac.id/perbandingan-performansi-algoritma-cross-entropy-dan-algoritma-differential-evolution-dalam-penyelesaian-permasalahan-crew-rostering-15627.html
[ Free Download - Free for All ]
ITS-Master-15627-perbandingan-performansi-algoritma-cross-entropy-dan-algoritma-differential-evolution-dalam-penyeles.pdf - 121 KB ITS-Master-15627-comparison-of-cross-entropy-and-differential-evolution-performance-in-solving-crew-rostering-problem.pdf - 108 KB ITS-Master-15627-Approval_Sheet.pdf - 251 KB ITS-Master-15627-Abstract_id.pdf - 214 KB ITS-Master-15627-Abstract_en.pdf - 231 KB ITS-Master-15627-Preface.pdf - 212 KB ITS-Master-15627-Table_of_Content.pdf - 251 KB ITS-Master-15627-Tables.pdf - 246 KB ITS-Master-15627-Illustrations.pdf - 257 KB ITS-Master-15627-Bibliography.pdf - 291 KB ITS-Master-15627-Biography.pdf - 217 KB ITS-Master-15627-Chapter1-293983.pdf - 287 KB ITS-Master-15627-Conclusion-249414.pdf - 244 KB ITS-Master-15627-Paper-1133027.pdf - 1106 KB ITS-Master-15627-Presentation-1125566.pdf - 1099 KB
[ FullText Content - Please, register first ]
1. ITS-Master-15627-Chapter2-623117.pdf - 609 KB 2. ITS-Master-15627-Chapter3-349592.pdf - 341 KB 3. ITS-Master-15627-Chapter4-1205366.pdf - 1177 KB 4. ITS-Master-15627-Chapter5-732322.pdf - 715 KB 5. ITS-Master-15627-Chapter6-503926.pdf - 492 KB 6. ITS-Master-15627-Enclosure-1215625.pdf - 1187 KB 7. ITS-Master-15627-Enclosure-387664.pdf - 379 KB 8. ITS-Master-15627-Enclosure-1787547.pdf - 1746 KB 9. ITS-Master-15627-Enclosure-1004321.pdf - 981 KB
Give your Comment here...
10 Similar Document...
10 Related Document...
|
POLLINGBagaimana pendapat Anda tentang layanan repository kami ?

      
Visitors Today : 3558
Total Visitor : 1430855
Hits Today : 71280
Total Hits : 24025316
Visitors Online: 80
Calculated since 16 May 2012
You are connected from 54.224.79.93 using CCBot/2.0
|