Implementasi artificial bee colony pada mix fleet vehicle routing problem (MFVRP) untuk optimalisasi pendistribusian produk
Abstract
Mix Fleet Vehicle Routing Problem (MFVRP) merupakan bagian dari permasalahan Capacitated Vehicle Routing Problem. Tujuan utama dari MFVRP adalah meminimalisasi jarak tempuh dan banyak kendaraan dengan memperhatikan setiap kendaraan yang memiliki kapasitas berbeda. Artificial Bee Colony merupakan algoritma yang didasarkan kecerdasan berkelompok dari lebah dalam mencari sumber makanan. Terdapat tiga bagian dalam kelompok lebah yaitu Lebah Pekerja (Employed), Lebah Penjaga (Onlooker) dan Lebah Pengintai (Scout). Implementasi Algoritma Artificial Bee Colony untuk memudahkan menyelesaikan permasalahan MFVRP menggunakan Borland Delphi 7.
References
Brajevic, Ivona. 2011. Artificial Bee Colony Algorithm for The Capacitated Vehicle Routing Problem. Proceedings of the European Computing Conference ISBN: 978-960-474-297-4. (Online), (http://www.wseas.us/e-library/conferences/2011/Paris/ECC/ECC-39.pdf ), diakses 20/01/2015 : 10:31 AM.
Fachrurrozi, M. 2005. Konsep dan Aplikasi Pemrograman Menggunakan Borland c++ Builder 6. Palembang. Tidak diterbitkan.
Iskandar. 2010. Model Optimasi Vehicle Routing Problem dan Implementasinya. Tesis. Institut Pertanian Bogor.
Johnsonbaugh, R. 2001. Discrete Mathematics. Fifth Editions. New Jersey: Prentice-Hall, Inc.
Karaboga, D. 2005. An Idea Based on Honey Bee Swarm for Numerical Optimization. Erciyes University, Engineering Faculty Computer Engineering Department Kayseri/Türkiye. (Online), (http://mf.erciyes.edu.tr/abc/pub/tr06_2005.pdf) diakses pada 13 Januari 2015.
Karaboga, D, Basturk, B. 2007. Artificial Bee Colony (Abc) Optimization Algorithm For Solving Constrained Optimization Problems. In: Proceedings Of The 12th International Fuzzy Systems Association World Congress On Foundations Of Fuzzy Logic And Soft Computing. Springer, Berlin, IFSA 2007, Pp 789–798.
Karaboga, D, Ozturk, C. 2011. A Novel Clustering Approach: Artificial Bee Colony (ABC) algorithm. Applied Soft Computing 11(1):652–657. (Online), (http://web.info.uvt.ro/~dzaharie/cne2012/proiecte/tehnici/ABC/ABC_clustering.pdf), diakses 9 Januari 2015.
Nirwan, Sembiring. 1991. Ekonomi Koperasi. Jakarta: Erlangga.
Prive, Julie. 2005. Solving a Vehicle Routing Problem Arising in Soft Drink Distribution. (Online),(http://www.fsa.ulaval.ca/personnel/renaudj/pdf/Recherche/Soft%20Drink%20-%20JORS%20May%202005.pdf ) diakses 18 Januari 2015: 03.37 PM
Sarwadi & Krismi, A. 2004. Algoritma Genetika untuk Penyelesaian Masalah Vehicle Routing. Jurnal matematika dan Komputer, (Online), 7(2) : 1-10, (http://eprints.undip.ac.id/2226/1/1_Sarwadi_-_Anjar_Krismi.pdf), diakses 3 Januari 2013.
Satyananda, Darmawan. 2012. Panduan Praktikum Struktur Data. Malang: Fakultas Matematika dan Ilmu Alam Universitas Negeri Malang.
Staton. 1996. Fundamental Of Marketing. Sydney: McGraw-Hill.
Suthikarnnarunai, N. 2008. A Sweep Algorithm for the Mix Fleet Vehicle Routing Problem. Proceedings of the International Multi Conference of Engineers and Computer Scientists 2008 Vol II IMECS 2008, 19-21 March, 2008, Hong Kong. (Online), (http://www.iaeng.org/publication/IMECS2008/IMECS2008_pp1914-1919.pdf), diakses pada 20 Januari 2015.
Szeto,W.Y., Wu,Y., Ho,S.C. 2011. An Artificial Bee Colony Algorithm for The Capacitated Vehicle Routing Problem. European Journal Of Operational Research, 2011,v.215 n.1, p. 126-135.(Online), (http://hub.hku.hk/bitstream/10722/135063/1/Content.pdf?accept=1), diakses 10 Februari 2015.
Yeun, Choong.L, and Zirour, M. 2008. Vehicle Routing Problem : Models and Solution, (Online), (http://www.ukm.my/ppsmfst/jqma/Vol4_Is1/abstract/JQMA-4-1-19-abstractrefs.pdf), diakses 21 Oktober 2014.
Wilson, J.R. 2000. Graphs and Applications. Jerman: Springer.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
1.png)
4.png)
