Solving multi-task optimization problems using the sine cosine algorithm
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...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
Association for Computing Machinery
2022
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/34368/ http://umpir.ump.edu.my/id/eprint/34368/1/Solving%20multi-task%20optimization%20problems%20using%20the%20sine%20cosine%20algorithm_FULL.pdf http://umpir.ump.edu.my/id/eprint/34368/2/Solving%20multi-task%20optimization%20problems%20using%20the%20sine%20cosine%20algorithm%20.pdf |
| _version_ | 1848824487992098816 |
|---|---|
| author | Kamal Z., Zamli Kader, Md. Abdul |
| author_facet | Kamal Z., Zamli Kader, Md. Abdul |
| author_sort | Kamal Z., Zamli |
| building | UMP Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T03:13:49Z |
| format | Conference or Workshop Item |
| id | ump-34368 |
| institution | Universiti Malaysia Pahang |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T03:13:49Z |
| publishDate | 2022 |
| publisher | Association for Computing Machinery |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | ump-343682022-06-14T06:56:31Z http://umpir.ump.edu.my/id/eprint/34368/ Solving multi-task optimization problems using the sine cosine algorithm Kamal Z., Zamli Kader, Md. Abdul QA76 Computer software 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. Association for Computing Machinery 2022 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/34368/1/Solving%20multi-task%20optimization%20problems%20using%20the%20sine%20cosine%20algorithm_FULL.pdf pdf en http://umpir.ump.edu.my/id/eprint/34368/2/Solving%20multi-task%20optimization%20problems%20using%20the%20sine%20cosine%20algorithm%20.pdf 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 (Published) https://doi.org/10.1145/3524304.3524336 |
| spellingShingle | QA76 Computer software Kamal Z., Zamli Kader, Md. Abdul Solving multi-task optimization problems using the sine cosine algorithm |
| title | Solving multi-task optimization problems using the sine cosine algorithm |
| title_full | Solving multi-task optimization problems using the sine cosine algorithm |
| title_fullStr | Solving multi-task optimization problems using the sine cosine algorithm |
| title_full_unstemmed | Solving multi-task optimization problems using the sine cosine algorithm |
| title_short | Solving multi-task optimization problems using the sine cosine algorithm |
| title_sort | solving multi-task optimization problems using the sine cosine algorithm |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/34368/ http://umpir.ump.edu.my/id/eprint/34368/ http://umpir.ump.edu.my/id/eprint/34368/1/Solving%20multi-task%20optimization%20problems%20using%20the%20sine%20cosine%20algorithm_FULL.pdf http://umpir.ump.edu.my/id/eprint/34368/2/Solving%20multi-task%20optimization%20problems%20using%20the%20sine%20cosine%20algorithm%20.pdf |