{"id":2456,"date":"2014-01-20T03:58:15","date_gmt":"2014-01-20T03:58:15","guid":{"rendered":"http:\/\/lib.itenas.ac.id\/kti\/?p=2456"},"modified":"2014-01-20T03:58:15","modified_gmt":"2014-01-20T03:58:15","slug":"apilikasi-variabel-neighborhood-descent-metaheuristik-untuk-vehicle-routing-problem","status":"publish","type":"post","link":"https:\/\/lib.itenas.ac.id\/kti\/?p=2456","title":{"rendered":"Apilikasi Variabel Neighborhood Descent Metaheuristik untuk Vehicle Routing Problem"},"content":{"rendered":"<p>descent (VND) metaheuristik. Solusi inisial diperoleh dengan menggunakan algoritma Dijkstra berdasarkan cost networkyang dibentuk oleh algoritma Sweep dan 2-opt.Algoritma variable neighborhood descent yang diusulkan pada penelitian ini menggunakan beberapa neighborhood\u00a0 (local seacrh) untuk mendapatkan solusi. Sebagai tambahan pada algoritma juga diaplikasikan prosedur diverifikasi yang membantu proses pencarian solusi jika solusi yang didapatkan oleh local seacrh-local seacrh yang digunakan tidak dapat diperbaiki lagi. Algoritma usulan diuji dengan data sel yang terdapat pada literatur<\/p>\n<p>Dibuat oleh : Liane Okdinawati, Arif Imran<\/p>\n<p>E-mail:\u00a0 arifimr@yahoo.com<br \/>\nKata Kunci : metaheuristik,local seacrh, roiting, variable neighborhood<\/p>\n<p>Keterangan : \u00a0Makalah ini\u00a0 dimuat pada Prosiding Seminar Nasional Supply Chain dan Sistem Informasi (SEMASSI) Volume 1,<\/p>\n<p><a href=\"http:\/\/lib.itenas.ac.id\/kti\/wp-content\/uploads\/2014\/01\/proceeding-SN.pdf\">Apilikasi Variabel Neighborhood Descent Metaheuristik untuk Vehicle Routing Problem<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>descent (VND) metaheuristik. Solusi inisial diperoleh dengan menggunakan algoritma Dijkstra berdasarkan cost networkyang dibentuk oleh algoritma Sweep dan 2-opt.Algoritma variable neighborhood descent yang diusulkan pada penelitian ini menggunakan beberapa neighborhood\u00a0 (local seacrh) untuk mendapatkan solusi. Sebagai tambahan pada algoritma juga diaplikasikan prosedur diverifikasi yang membantu proses pencarian solusi jika solusi yang didapatkan oleh local seacrh-local [&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":[980,323,981,318],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v21.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Apilikasi Variabel Neighborhood Descent Metaheuristik untuk 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=\"http:\/\/lib.itenas.ac.id\/kti\/?p=2456\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Apilikasi Variabel Neighborhood Descent Metaheuristik untuk Vehicle Routing Problem - Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"og:description\" content=\"descent (VND) metaheuristik. Solusi inisial diperoleh dengan menggunakan algoritma Dijkstra berdasarkan cost networkyang dibentuk oleh algoritma Sweep dan 2-opt.Algoritma variable neighborhood descent yang diusulkan pada penelitian ini menggunakan beberapa neighborhood\u00a0 (local seacrh) untuk mendapatkan solusi. Sebagai tambahan pada algoritma juga diaplikasikan prosedur diverifikasi yang membantu proses pencarian solusi jika solusi yang didapatkan oleh local seacrh-local [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"http:\/\/lib.itenas.ac.id\/kti\/?p=2456\" \/>\n<meta property=\"og:site_name\" content=\"Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"article:published_time\" content=\"2014-01-20T03:58:15+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\":\"http:\/\/lib.itenas.ac.id\/kti\/?p=2456\",\"url\":\"http:\/\/lib.itenas.ac.id\/kti\/?p=2456\",\"name\":\"Apilikasi Variabel Neighborhood Descent Metaheuristik untuk Vehicle Routing Problem - Karya Tulis Ilmiah Itenas\",\"isPartOf\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#website\"},\"datePublished\":\"2014-01-20T03:58:15+00:00\",\"dateModified\":\"2014-01-20T03:58:15+00:00\",\"author\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9\"},\"breadcrumb\":{\"@id\":\"http:\/\/lib.itenas.ac.id\/kti\/?p=2456#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"http:\/\/lib.itenas.ac.id\/kti\/?p=2456\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"http:\/\/lib.itenas.ac.id\/kti\/?p=2456#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/lib.itenas.ac.id\/kti\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Apilikasi Variabel Neighborhood Descent Metaheuristik untuk 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":"Apilikasi Variabel Neighborhood Descent Metaheuristik untuk 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":"http:\/\/lib.itenas.ac.id\/kti\/?p=2456","og_locale":"en_US","og_type":"article","og_title":"Apilikasi Variabel Neighborhood Descent Metaheuristik untuk Vehicle Routing Problem - Karya Tulis Ilmiah Itenas","og_description":"descent (VND) metaheuristik. Solusi inisial diperoleh dengan menggunakan algoritma Dijkstra berdasarkan cost networkyang dibentuk oleh algoritma Sweep dan 2-opt.Algoritma variable neighborhood descent yang diusulkan pada penelitian ini menggunakan beberapa neighborhood\u00a0 (local seacrh) untuk mendapatkan solusi. Sebagai tambahan pada algoritma juga diaplikasikan prosedur diverifikasi yang membantu proses pencarian solusi jika solusi yang didapatkan oleh local seacrh-local [&hellip;]","og_url":"http:\/\/lib.itenas.ac.id\/kti\/?p=2456","og_site_name":"Karya Tulis Ilmiah Itenas","article_published_time":"2014-01-20T03:58:15+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":"http:\/\/lib.itenas.ac.id\/kti\/?p=2456","url":"http:\/\/lib.itenas.ac.id\/kti\/?p=2456","name":"Apilikasi Variabel Neighborhood Descent Metaheuristik untuk Vehicle Routing Problem - Karya Tulis Ilmiah Itenas","isPartOf":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#website"},"datePublished":"2014-01-20T03:58:15+00:00","dateModified":"2014-01-20T03:58:15+00:00","author":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9"},"breadcrumb":{"@id":"http:\/\/lib.itenas.ac.id\/kti\/?p=2456#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["http:\/\/lib.itenas.ac.id\/kti\/?p=2456"]}]},{"@type":"BreadcrumbList","@id":"http:\/\/lib.itenas.ac.id\/kti\/?p=2456#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/lib.itenas.ac.id\/kti"},{"@type":"ListItem","position":2,"name":"Apilikasi Variabel Neighborhood Descent Metaheuristik untuk 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":924,"_links":{"self":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/2456"}],"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=2456"}],"version-history":[{"count":2,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/2456\/revisions"}],"predecessor-version":[{"id":2459,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/2456\/revisions\/2459"}],"wp:attachment":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2456"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2456"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2456"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}