Optimasi Rute dan Jumlah Kendaraan Distribusi Surat Kabar dengan Metode Nearest Neighbour (Studi Kasus: PT. Metro-Riau)
Abstract
Keywords: distribution, nearest neighbour, OVRP (Open Vehicle Routing Problem)
References
Ghiani, Laporte, Musmanno, Introduction to Logistics Systems Planning and Control, ohn Wiley & Sons Ltd, 2004
Council of Supply Chain Management Professionals, 2000
Peraturan Presiden Republik Indonesia No. 26 Tahun 2012
Adriand, Indra Jaya. Review Literatur Teori Lokasi dan Pola Ruang (Teori Aglomerasi), 2008
Implementasi Algoritma Ant System (ACS) untuk Open Vehicle Routing Problem (OVRP) dalam Penentuan Rute Distribusi Surat Kabar, Tugas Akhir Teknik Industri ITS.AGUSTINA, PRIMA 2008Ballou, Ronald H, Business Logistics/Supply Chain Management (5th ed), New Jersey: Prentice Hall, 2004
Tarantilis, Solving The Open Vehicle Routing Problem Via Single Parameter Meta-Heuristic Algorithm, Computers & Operations Research 56. pp. 588-596, 2005
Algoritma Sequential Insertion untuk Memecahkan Vehicle Routing Problem dengan Multiple Trips dan Time Windows. Jurnal Teknik dan Manajemen. SUPRAYOGI 2003Scheduling of Vehicle from a Central Depot to a Number of Delivery Points. Operations Research, 12, pp. 568-581.CLARKE, G., WRIGHT, J.W 1964.
Refbacks
- There are currently no refbacks.
FAKULTAS SAINS DAN TEKNOLOGI
UIN SUSKA RIAU
Kampus Raja Ali Haji
Gedung Fakultas Sains & Teknologi UIN Suska Riau
Jl.H.R.Soebrantas No.155 KM 18 Simpang Baru Panam, Pekanbaru 28293
Email: sntiki@uin-suska.ac.id