An Effective Chromosome Representation on Proportional Tuition Fees Assessment Using NSGA-II
AbstractProportional tuition fees assessment is an optimization process to find a compromise point between student willingness to pay and institution income. Using a genetic algorithm to find optimal solutions requires effective chromosome representations, parameters, and operator genetic to obtain efficient search. This paper proposes a new chromosome representation and also finding efficient genetic parameters to solve the proportional tuition fees assessment problem. The results of applying the new chromosome representation are compared with another chromosome representation in the previous study. The evaluations show that the proposed chromosome representation obtains better results than the other in both execution time required and the quality of the solutions.
MENRISTEKDIKTI Republik Indonesia, Peraturan Menteri Riset, Teknologi, dan Pendidikan Tinggi Republik Indonesia Nomor 22 Tahun 2015 Tentang Biaya Kuliah dan Uang Kuliah Tunggal Pada Perguruan Tinggi Negeri Di Lingkungan Kementrian Riset, Teknologi dan Pendidikan. Indonesia, 2015.
F. Jauhari, W. F. Mahmudy, and A. Basuki, â€œMulti-Objective Optimization for Proportional Tuition Fees Assessment Using Non-Dominated Sorting Genetic Algorithm II (NSGA II),â€ 3rd Int. Conf. Sustain. Inf. Eng. Technol. SIET 2018 - Proc., pp. 292â€“297, 2019.
A. Zhou, B.-Y. Qu, H. Li, S.-Z. Zhao, P. N. Suganthan, and Q. Zhang, â€œMultiobjective evolutionary algorithms: A survey of the state of the art,â€ Swarm Evol. Comput., vol. 1, no. 1, pp. 32â€“49, 2011.
J. C. Tay and D. Wibowo, â€œAn effective chromosome representation for evolving flexible job shop schedules,â€ Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 3103, pp. 210â€“221, 2004.
W. F. Mahmudy, R. M. Marian, and L. H. S. Luong, â€œReal Coded Genetic Algorithms for Solving Flexible Job-Shop Scheduling Problem - Part I: Modelling,â€ Adv. Mater. Res., vol. 701, pp. 359â€“363, May 2013.
W. F. Mahmudy, R. M. Marian, and L. H. S. Luong, â€œReal Coded Genetic Algorithms for Solving Flexible Job-Shop Scheduling Problem - Part II: Optimization,â€ Adv. Mater. Res., vol. 701, pp. 364â€“369, May 2013.
N. Rikatsih, W. F. Mahmudy, and S. Syafrial, â€œHybrid Real-Coded Genetic Algorithm and Variable Neighborhood Search for Optimization of Product Storage,â€ J. Inf. Technol. Comput. Sci., vol. 4, no. 2, p. 166, 2019.
M. T. Ben Othman and G. Abdel-Azim, â€œMultiple sequence alignment based on genetic algorithms with new chromosomes representation,â€ Proc. Mediterr. Electrotech. Conf. - MELECON, pp. 1030â€“1033, 2012.
Y. Hou, N. Q. Wu, M. C. Zhou, and Z. W. Li, â€œPareto-optimization for scheduling of crude oil operations in refinery via genetic algorithm,â€ IEEE Trans. Syst. Man, Cybern. Syst., vol. 47, no. 3, pp. 517â€“530, 2017.
R. Rody, W. F. Mahmudy, and I. P. Tama, â€œUsing Guided Initial Chromosome of Genetic Algorithm for Scheduling Production-Distribution System,â€ J. Inf. Technol. Comput. Sci., vol. 4, no. 1, p. 26, 2019.
Y. Liu, W. Huangfu, H. Zhang, H. Wang, W. An, and K. Long, â€œAn Efficient Geometry-Induced Genetic Algorithm for Base Station Placement in Cellular Networks,â€ IEEE Access, vol. 7, pp. 108604â€“108616, 2019.
N. Hitomi and D. Selva, â€œConstellation optimization using an evolutionary algorithm with a variable-length chromosome,â€ IEEE Aerosp. Conf. Proc., vol. 2018-March, pp. 1â€“12, 2018.
L. Cruz-Piris, I. Marsa-Maestre, and M. A. Lopez-Carmona, â€œA Variable-Length Chromosome Genetic Algorithm to Solve a Road Traffic Coordination Multipath Problem,â€ IEEE Access, vol. 7, pp. 111968â€“111981, 2019.
B. Tan, H. Ma, and Y. Mei, â€œNovel Genetic Algorithm with Dual Chromosome Representation for Resource Allocation in Container-Based Clouds,â€ 2019 IEEE 12th Int. Conf. Cloud Comput., pp. 452â€“456, 2019.
How to Cite
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).