{"id":775,"date":"2012-04-12T02:37:30","date_gmt":"2012-04-12T02:37:30","guid":{"rendered":"http:\/\/lib.itenas.ac.id\/kti\/?p=775"},"modified":"2012-04-12T02:41:07","modified_gmt":"2012-04-12T02:41:07","slug":"aplikasi-multi-level-heuristik-dan-fixed-threshold-pada-variable-neighborhood-search-untuk-heterogeneous-fleet-vehicle-routing-problem","status":"publish","type":"post","link":"https:\/\/lib.itenas.ac.id\/kti\/?p=775","title":{"rendered":"Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous Fleet Vehicle Routing Problem"},"content":{"rendered":"<p>Heterogeneous Fleet Vehicle Routing Problem (HFVRP) diselesaikan dengan mengaplikasikan multi-level heuristic, fixed threshold dan beberapa adaptasi pada variable neighborhood search (VNS). Solusi inisial diperoleh dengan menggunakan algoritma Dijkstra berdasarkan cost network yang dibentuk oleh algoritma Sweep dan 2-opt. Solusi yang dibangkitkan secara random dipilih menggunakan fixed threshold. Algoritma yang diusulkan pada penelitian ini menggunakan beberapa neighborhood. Sebagai tambahan pada algoritma juga diaplikasikan beberapa local search, dan prosedur diversifikasi. Multi-level heuristik digunakan dalam pemakaian local search. Algoritma usulan diuji dengan data set yang terdapat pada literatur. Solusi yang diperoleh kompetitif jika dibandingkan dengan solusi-solusi yang telah dipublikasikan.<\/p>\n<p>&nbsp;<\/p>\n<p>Abstract<br \/>\n<span style=\"direction: ltr;\">The heterogeneous fleet vehicle routing problem is investigated using multi-level heuristic, fixed threshold and some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra\u2019s algorithm based on a cost network constructed by the sweep algorithm and the 2-opt. Random generated solutions are selected using a fixed threshold. Our VNS algorithm uses several neighborhoods which are adapted for this problem. In addition, a number of local search methods together with a diversification procedure are used. Multi-level heuristic is used when applying local search. Our algorithm is tested using data set from literature and the results appear to be competitive when compared to the published results in the literature.<\/span><\/p>\n<p>&nbsp;<\/p>\n<p><strong>Di buat oleh:<\/strong> Arif Imran (arifimran@itenas.ac.id \/ arifimr@yahoo.com)<br \/>\n<strong>Kata kunci :<\/strong> metaheuristik, routing, threshold, multi-level, variable neighborhood, metaheuristic, routing, threshold, multi-level, variable neighborhood<br \/>\n<strong>Keterangan :<\/strong> Dipresentasikan pada Seminar Nasional Teknik dan Manajemen Industri, Universitas Muhammadiyah Malang 2011, ISBN : 978-979-796-189-3.<\/p>\n<p>&nbsp;<\/p>\n<p><a href=\"http:\/\/lib.itenas.ac.id\/kti\/wp-content\/uploads\/2012\/04\/04.-Aplikasi-Multi-Level-Heuristik-dan-Fixed-Threshold-pada-Variable-Neighborhood-Search-....pdf\">Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous Fleet Vehicle Routing Problem<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Heterogeneous Fleet Vehicle Routing Problem (HFVRP) diselesaikan dengan mengaplikasikan multi-level heuristic, fixed threshold dan beberapa adaptasi pada variable neighborhood search (VNS). Solusi inisial diperoleh dengan menggunakan algoritma Dijkstra berdasarkan cost network yang dibentuk oleh algoritma Sweep dan 2-opt. Solusi yang dibangkitkan secara random dipilih menggunakan fixed threshold. Algoritma yang diusulkan pada penelitian ini menggunakan beberapa [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,5],"tags":[315,323,325,316,324,318],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v21.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous 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=775\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous Fleet Vehicle Routing Problem - Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"og:description\" content=\"Heterogeneous Fleet Vehicle Routing Problem (HFVRP) diselesaikan dengan mengaplikasikan multi-level heuristic, fixed threshold dan beberapa adaptasi pada variable neighborhood search (VNS). Solusi inisial diperoleh dengan menggunakan algoritma Dijkstra berdasarkan cost network yang dibentuk oleh algoritma Sweep dan 2-opt. Solusi yang dibangkitkan secara random dipilih menggunakan fixed threshold. Algoritma yang diusulkan pada penelitian ini menggunakan beberapa [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/lib.itenas.ac.id\/kti\/?p=775\" \/>\n<meta property=\"og:site_name\" content=\"Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"article:published_time\" content=\"2012-04-12T02:37:30+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2012-04-12T02:41:07+00:00\" \/>\n<meta name=\"author\" content=\"bhakti\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"bhakti\" \/>\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=775\",\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=775\",\"name\":\"Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous Fleet Vehicle Routing Problem - Karya Tulis Ilmiah Itenas\",\"isPartOf\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#website\"},\"datePublished\":\"2012-04-12T02:37:30+00:00\",\"dateModified\":\"2012-04-12T02:41:07+00:00\",\"author\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/c5a837ce04e34308ed2e7583a68ea8c4\"},\"breadcrumb\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=775#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/lib.itenas.ac.id\/kti\/?p=775\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=775#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/lib.itenas.ac.id\/kti\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous 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\/c5a837ce04e34308ed2e7583a68ea8c4\",\"name\":\"bhakti\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/ccecf4e038984a122fdacecaf647e3c0?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/ccecf4e038984a122fdacecaf647e3c0?s=96&d=mm&r=g\",\"caption\":\"bhakti\"},\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/?author=2\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous 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=775","og_locale":"en_US","og_type":"article","og_title":"Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous Fleet Vehicle Routing Problem - Karya Tulis Ilmiah Itenas","og_description":"Heterogeneous Fleet Vehicle Routing Problem (HFVRP) diselesaikan dengan mengaplikasikan multi-level heuristic, fixed threshold dan beberapa adaptasi pada variable neighborhood search (VNS). Solusi inisial diperoleh dengan menggunakan algoritma Dijkstra berdasarkan cost network yang dibentuk oleh algoritma Sweep dan 2-opt. Solusi yang dibangkitkan secara random dipilih menggunakan fixed threshold. Algoritma yang diusulkan pada penelitian ini menggunakan beberapa [&hellip;]","og_url":"https:\/\/lib.itenas.ac.id\/kti\/?p=775","og_site_name":"Karya Tulis Ilmiah Itenas","article_published_time":"2012-04-12T02:37:30+00:00","article_modified_time":"2012-04-12T02:41:07+00:00","author":"bhakti","twitter_card":"summary_large_image","twitter_misc":{"Written by":"bhakti","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=775","url":"https:\/\/lib.itenas.ac.id\/kti\/?p=775","name":"Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous Fleet Vehicle Routing Problem - Karya Tulis Ilmiah Itenas","isPartOf":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#website"},"datePublished":"2012-04-12T02:37:30+00:00","dateModified":"2012-04-12T02:41:07+00:00","author":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/c5a837ce04e34308ed2e7583a68ea8c4"},"breadcrumb":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=775#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/lib.itenas.ac.id\/kti\/?p=775"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=775#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/lib.itenas.ac.id\/kti"},{"@type":"ListItem","position":2,"name":"Aplikasi Multi-Level Heuristik dan Fixed Threshold pada Variable Neighborhood Search untuk Heterogeneous 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\/c5a837ce04e34308ed2e7583a68ea8c4","name":"bhakti","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/ccecf4e038984a122fdacecaf647e3c0?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/ccecf4e038984a122fdacecaf647e3c0?s=96&d=mm&r=g","caption":"bhakti"},"url":"https:\/\/lib.itenas.ac.id\/kti\/?author=2"}]}},"views":994,"_links":{"self":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/775"}],"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\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=775"}],"version-history":[{"count":4,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/775\/revisions"}],"predecessor-version":[{"id":777,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/775\/revisions\/777"}],"wp:attachment":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=775"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=775"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=775"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}