{"id":2445,"date":"2014-01-20T02:52:46","date_gmt":"2014-01-20T02:52:46","guid":{"rendered":"http:\/\/lib.itenas.ac.id\/kti\/?p=2445"},"modified":"2014-01-20T03:03:55","modified_gmt":"2014-01-20T03:03:55","slug":"multi-level-heuristik-untuk-heterogeneous-fixed-fleet-vehicle-routing-problem","status":"publish","type":"post","link":"https:\/\/lib.itenas.ac.id\/kti\/?p=2445","title":{"rendered":"MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM"},"content":{"rendered":"<p>Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) adalah salah satu varian dari Vehicle Routing Problem (VRP). Pada HFFVRP terdapat beberapa jenis kendaraan dengan jumlah tetap untuk melayani konsumen. Pada penelitian ini HFFVRP diselesaikan dengan mengaplikasikan Multi-level heuristik. Solusi inisial diperoleh dengan mengalokasikan konsumen yang dibentuk oleh algoritma Sweep dan 2-opt ke kendaraan terkecil lebih dahulu dengan memperhatikan tingkat keterisian kendaraan. Algoritma yang diusulkan menggunakan beberapa local search seperti 1-insertion, swap, 2-insertion dan 2-opt. Algoritma diuji menggunakan data set yang terdapat pada literatur.<\/p>\n<p>Dibuat oleh : Arif Imran<\/p>\n<p>E-mail:\u00a0 arifimr@yahoo.com<br \/>\nKata Kunci : metaheuristik, routing, heterogeneous fixed fleet, multi-level, local search.<\/p>\n<p>Keterangan : \u00a0Makalah ini\u00a0 dimuat pada Prosiding Industrial Engineering Conference on Telecommunication (INDECT) 2013<\/p>\n<p><a href=\"http:\/\/lib.itenas.ac.id\/kti\/wp-content\/uploads\/2014\/01\/PROCEEDING-up-load.pdf\">MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) adalah salah satu varian dari Vehicle Routing Problem (VRP). Pada HFFVRP terdapat beberapa jenis kendaraan dengan jumlah tetap untuk melayani konsumen. Pada penelitian ini HFFVRP diselesaikan dengan mengaplikasikan Multi-level heuristik. Solusi inisial diperoleh dengan mengalokasikan konsumen yang dibentuk oleh algoritma Sweep dan 2-opt ke kendaraan terkecil lebih dahulu [&hellip;]<\/p>\n","protected":false},"author":6,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,5],"tags":[978,979,323,325,316],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v21.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM - Karya Tulis Ilmiah Itenas<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/lib.itenas.ac.id\/kti\/?p=2445\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM - Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"og:description\" content=\"Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) adalah salah satu varian dari Vehicle Routing Problem (VRP). Pada HFFVRP terdapat beberapa jenis kendaraan dengan jumlah tetap untuk melayani konsumen. Pada penelitian ini HFFVRP diselesaikan dengan mengaplikasikan Multi-level heuristik. Solusi inisial diperoleh dengan mengalokasikan konsumen yang dibentuk oleh algoritma Sweep dan 2-opt ke kendaraan terkecil lebih dahulu [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/lib.itenas.ac.id\/kti\/?p=2445\" \/>\n<meta property=\"og:site_name\" content=\"Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"article:published_time\" content=\"2014-01-20T02:52:46+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2014-01-20T03:03:55+00:00\" \/>\n<meta name=\"author\" content=\"Asep Kamaludin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Asep Kamaludin\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=2445\",\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=2445\",\"name\":\"MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM - Karya Tulis Ilmiah Itenas\",\"isPartOf\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#website\"},\"datePublished\":\"2014-01-20T02:52:46+00:00\",\"dateModified\":\"2014-01-20T03:03:55+00:00\",\"author\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9\"},\"breadcrumb\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=2445#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/lib.itenas.ac.id\/kti\/?p=2445\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=2445#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/lib.itenas.ac.id\/kti\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#website\",\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/\",\"name\":\"Karya Tulis Ilmiah Itenas\",\"description\":\"Karya Tulis Ilmiah Itenas\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/lib.itenas.ac.id\/kti\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9\",\"name\":\"Asep Kamaludin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/f3fff432f1af1e74180f39e33a202251?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/f3fff432f1af1e74180f39e33a202251?s=96&d=mm&r=g\",\"caption\":\"Asep Kamaludin\"},\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/?author=6\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM - Karya Tulis Ilmiah Itenas","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/lib.itenas.ac.id\/kti\/?p=2445","og_locale":"en_US","og_type":"article","og_title":"MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM - Karya Tulis Ilmiah Itenas","og_description":"Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) adalah salah satu varian dari Vehicle Routing Problem (VRP). Pada HFFVRP terdapat beberapa jenis kendaraan dengan jumlah tetap untuk melayani konsumen. Pada penelitian ini HFFVRP diselesaikan dengan mengaplikasikan Multi-level heuristik. Solusi inisial diperoleh dengan mengalokasikan konsumen yang dibentuk oleh algoritma Sweep dan 2-opt ke kendaraan terkecil lebih dahulu [&hellip;]","og_url":"https:\/\/lib.itenas.ac.id\/kti\/?p=2445","og_site_name":"Karya Tulis Ilmiah Itenas","article_published_time":"2014-01-20T02:52:46+00:00","article_modified_time":"2014-01-20T03:03:55+00:00","author":"Asep Kamaludin","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Asep Kamaludin","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=2445","url":"https:\/\/lib.itenas.ac.id\/kti\/?p=2445","name":"MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM - Karya Tulis Ilmiah Itenas","isPartOf":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#website"},"datePublished":"2014-01-20T02:52:46+00:00","dateModified":"2014-01-20T03:03:55+00:00","author":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9"},"breadcrumb":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=2445#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/lib.itenas.ac.id\/kti\/?p=2445"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=2445#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/lib.itenas.ac.id\/kti"},{"@type":"ListItem","position":2,"name":"MULTI-LEVEL HEURISTIK UNTUK HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEM"}]},{"@type":"WebSite","@id":"https:\/\/lib.itenas.ac.id\/kti\/#website","url":"https:\/\/lib.itenas.ac.id\/kti\/","name":"Karya Tulis Ilmiah Itenas","description":"Karya Tulis Ilmiah Itenas","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/lib.itenas.ac.id\/kti\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9","name":"Asep Kamaludin","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/f3fff432f1af1e74180f39e33a202251?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/f3fff432f1af1e74180f39e33a202251?s=96&d=mm&r=g","caption":"Asep Kamaludin"},"url":"https:\/\/lib.itenas.ac.id\/kti\/?author=6"}]}},"views":948,"_links":{"self":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/2445"}],"collection":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2445"}],"version-history":[{"count":4,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/2445\/revisions"}],"predecessor-version":[{"id":2448,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/2445\/revisions\/2448"}],"wp:attachment":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2445"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2445"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2445"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}