The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems. The latest approaches still unable to address the fairness problem that has emerged, thus this research proposes a strategy to adopt an amendment of a harmony search algorithm in order to address the fairness issue and thus the level of fairness will be escalate. It is essential to achieve is fairer among driver because this can bring to increase in driver levels of satisfaction.
In this research, the integrated scheduling and rostering bus driver problems are defined as maximising the balance of the assignment of tasks in term of distribution of shifts and routes. The scheduling and rostering problems are deliberated as integrated due to they depend on each other whereby the input of rostering problems is a scheduling problems. Modified Parameters of Harmony Search Algorithm for Better Searchingįarraliza Mansor, Nur Abal Abas, Zuraida Samad Shibghatullah, Abdul Rahman, Ahmad Fadzli Nizam Abdul
0 kommentar(er)
