Solving multi-task optimization problems using the sine cosine algorithm

Kamal Z., Zamli and Kader, Md. Abdul (2022) Solving multi-task optimization problems using the sine cosine algorithm. In: ACM International Conference Proceeding Series; 11th International Conference on Software and Computer Applications (ICSCA 2022) , 24 - 26 February 2022 , Melaka, Malaysia. pp. 219-224.. ISBN 978-1-4503-8577-0

	Pdf Solving multi-task optimization problems using the sine cosine algorithm_FULL.pdf Restricted to Repository staff only Download (903kB) | Request a copy
Preview	Pdf Solving multi-task optimization problems using the sine cosine algorithm .pdf Download (124kB) | Preview

Abstract

Optimization problems relate to the problem of finding minimum or maximum values from a large pools of solutions whereby exhaustive search is practically impossible. Often, optimization problems are solved using metaheuristic algorithms which provide good enough solution within reasonable execution time and limited resources. Recently, much research focus in the literature is devoted on a new kind of optimization problem, called multi-task optimization (MTO). This paper highlights our on-going work dealing with MTO problem. More precisely, our work investigates the adoption of partitioned population based on Sine Cosine algorithm for dealing with MTO problem. We took the team formation problem from IMDB dataset as our case study based on two objectives, minimizing team costs and team load distribution.

Item Type:	Conference or Workshop Item (Lecture)
Uncontrolled Keywords:	Sine cosine algorithm; Multi-task optimization
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Faculty/Division:	Institute of Postgraduate Studies Faculty of Computing
Depositing User:	Mrs Norsaini Abdul Samat
Date Deposited:	14 Jun 2022 06:56
Last Modified:	14 Jun 2022 06:56
URI:	http://umpir.ump.edu.my/id/eprint/34368
Download Statistic:	View Download Statistics

Actions (login required)

View Item