BINARY CUCKOO SEARCH UNTUK OPTIMASI PORTOFOLIO DENGAN KENDALA CARDINALITY
DOI:
https://doi.org/10.12928/admathedu.v6i1.4759Abstract
Cuckoo Search merupakan salah satu metode optimasi metaheuristik yang terinspirasi dari tingkah laku burung Cuckoo. Algoritma Cuckoo Search pertama kali dikembangkan oleh Yang dan Deb pada tahun 2009. Pada dasarnya algoritma ini dikembangkan untuk menyelesaikan masalah optimasi yang hanya melibatkan variabel kontinu (real). Akan tetapi, pada kenyataannya banyak masalah optimasi yang melibatkan tidak hanya variabel real, teapi juga variabel diskrit, bulat, dan biner. Masalah optimasi portofolio dengan kendala cardinality, yaitu permasalahan membentuk komposisi dari berbagai aset dalam portofolio sehingga didapatkan hasil yang optimal dengan cara memilih  aset dari  aset yang tersedia. Masalah optimasi portofolio dengan kendala cardinality melibatkan variabel real dan biner (0-1). Pada variabel biner, nol artinya aset tersebut tidak dipilih sedangkan satu artinya aset tersebut dipilih untuk dimasukkan ke dalam portofolio. Pada penelitian ini penulis memodifikasi algoritma Cuckoo Search sehingga mampu mengatasi masalah optimasi yang melibatkan variabel real dan biner, yang selanjutnya disebut algoritma Binary Cuckoo Search. Kemudian algoritma tersebut diterapkan pada masalah meminimumkan risiko (Minrisk) dan memaksimumkan return (Maxret) dengan memilih 20 saham dari 31 saham Hangseng. Hasil penelitian menunjukkan bahwa Binary Cuckoo Search merupakan algoritma yang handal untuk mengatasi masalah optimasi portofolio dengan kendala cardinality.
Â
Kata Kunci: algoritma cockoosearch, binary cuckoo search, optimasi portofolio, cardinality
References
Hongqing Zheng, Yongquan Zhou , Sucai He, Xinxin Ouyang. 2012. A Discrete Cuckoo Search Algorithm for Solving Knapsack Problems.Advances in information Sciences and Service Sciences(AISS), Vol. 4.
Markowitz, H. 1952. Portofolio Selection. The Journal of Finance,Vol. 7, pp. 77-91.
Yang, X. S. 2010. Nature-Inspired Metaheuristic Algorithms, Second Edition, United Kingdom: Luniver Press.
Yang, X. S. dan Deb, S. 2009. Cuckoo Search via Lévy Flights. Proceeding of World Congres on Nature and Biologically Inspired Computing (NaBIC 2009, India), IEEE Publications, USA, pp.210-214.
Yanhong Feng, Ke Jia, dan Yichao He. 2014. An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems. The Journal of Computational Intelligence and Neuroscience,Vol. 2014, Article ID 970456, 9 pages.
http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files/, Diakses pada tanggal8 April 2016, pukul 15.00 WIB
Downloads
Issue
Section
License
License and Copyright Agreement
In submitting the manuscript to the journal, the authors certify that:
- They are authorized by their co-authors to enter into these arrangements.
- The work described has not been formally published before, except in the form of an abstract or as part of a published lecture, review, thesis, or overlay journal. Please also carefully read the AdmathEdu Author Guidelines at http://journal.uad.ac.id/index.php/admathedu/about/submissions#onlineSubmissions
- That it is not under consideration for publication elsewhere,
- That its publication has been approved by all the author(s) and by the responsible authorities “tacitly or explicitly“ of the institutes where the work has been carried out.
- They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
- They agree to the following license and copyright agreement.
Copyright
Authors who publish with the AdmathEdu agree to the following terms:
- Authors retain copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment 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 acknowledgment 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.
Ciptaan disebarluaskan di bawah Lisensi Creative Commons Atribusi-BerbagiSerupa 4.0 Internasional.