Optimasi Masalah Pairing dan Rostering Awak Pesawat Menggunakan Metode Simulated Annealing
The problem of scheduling the airline-crew is frequently investigated in the research operation eld since the ecient schedule can extremely reduce operational costs of airline companies. Airline-crew schedule problem can be solved in two steps, determination of optimal ight-pairing and the solu...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/37059 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | The problem of scheduling the airline-crew is frequently investigated in the
research operation eld since the ecient schedule can extremely reduce
operational costs of airline companies. Airline-crew schedule problem can be
solved in two steps, determination of optimal
ight-pairing and the solution
of crew-rostering. In this research, airline-crew rostering problem is solved by
using Simulated Annealing method. The minimization of work-hours deviation
is the objective function that be used on the optimization process. The results
of simulation from three dierent data showed that the optimum solution of
aircrew scheduling can be achieved by using Simulated Annealing method,
and together with this method the solution of minimization of number of
pilots and an adaptive schedule solution with some backup pilots can also
be accomplished. |
|---|