{"id":769,"date":"2012-04-12T02:31:53","date_gmt":"2012-04-12T02:31:53","guid":{"rendered":"http:\/\/lib.itenas.ac.id\/kti\/?p=769"},"modified":"2014-04-11T01:33:25","modified_gmt":"2014-04-11T01:33:25","slug":"adaptation-of-the-variable-neighborhood-search-heuristic-to-solve-the-vehicle-routing-problem","status":"publish","type":"post","link":"https:\/\/lib.itenas.ac.id\/kti\/?p=769","title":{"rendered":"Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem"},"content":{"rendered":"<p>The vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra&#8217;s algorithm based on a cost network constructed by the sweep algorithm and the 2 opt. Our VNS algorithm use several neighborhoods which are adapted for this problem. In addition, a number of local search methods together with a diversification procedure are used. The algorithm is thebn tested on the data sets from the literature and it produces competitve result if compared to teh solutions published.<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Di buat oleh:<\/strong> Arif Imran (arifimran@itenas.ac.id \/ arifimr@yahoo.com),\u00a0Liane Okdinawati (aneu88@yahoo.com).<br \/>\n<strong>Kata kunci :<\/strong> metaheuristic, routing, variable neighborhood<br \/>\n<strong>Keterangan :<\/strong> Jurnal Teknik Industri No.1, 2011, Universitas Muhammadiyah Malang ( Terakreditasi)<\/p>\n<p>&nbsp;<\/p>\n<p><a href=\"http:\/\/ejournal.umm.ac.id\/index.php\/industri\/article\/view\/648\">Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>The vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra&#8217;s algorithm based on a cost network constructed by the sweep algorithm and the 2 opt. Our VNS algorithm use several neighborhoods which are adapted for this problem. In addition, a number of local [&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,316,318],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v21.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Adaptation of The Variable Neighborhood Search Heuristic to Solve The 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=769\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem - Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"og:description\" content=\"The vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra&#8217;s algorithm based on a cost network constructed by the sweep algorithm and the 2 opt. Our VNS algorithm use several neighborhoods which are adapted for this problem. In addition, a number of local [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/lib.itenas.ac.id\/kti\/?p=769\" \/>\n<meta property=\"og:site_name\" content=\"Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"article:published_time\" content=\"2012-04-12T02:31:53+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2014-04-11T01:33:25+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=769\",\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=769\",\"name\":\"Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem - Karya Tulis Ilmiah Itenas\",\"isPartOf\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#website\"},\"datePublished\":\"2012-04-12T02:31:53+00:00\",\"dateModified\":\"2014-04-11T01:33:25+00:00\",\"author\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/c5a837ce04e34308ed2e7583a68ea8c4\"},\"breadcrumb\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=769#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/lib.itenas.ac.id\/kti\/?p=769\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=769#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/lib.itenas.ac.id\/kti\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Adaptation of The Variable Neighborhood Search Heuristic to Solve The 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":"Adaptation of The Variable Neighborhood Search Heuristic to Solve The 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=769","og_locale":"en_US","og_type":"article","og_title":"Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem - Karya Tulis Ilmiah Itenas","og_description":"The vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra&#8217;s algorithm based on a cost network constructed by the sweep algorithm and the 2 opt. Our VNS algorithm use several neighborhoods which are adapted for this problem. In addition, a number of local [&hellip;]","og_url":"https:\/\/lib.itenas.ac.id\/kti\/?p=769","og_site_name":"Karya Tulis Ilmiah Itenas","article_published_time":"2012-04-12T02:31:53+00:00","article_modified_time":"2014-04-11T01:33:25+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=769","url":"https:\/\/lib.itenas.ac.id\/kti\/?p=769","name":"Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem - Karya Tulis Ilmiah Itenas","isPartOf":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#website"},"datePublished":"2012-04-12T02:31:53+00:00","dateModified":"2014-04-11T01:33:25+00:00","author":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/c5a837ce04e34308ed2e7583a68ea8c4"},"breadcrumb":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=769#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/lib.itenas.ac.id\/kti\/?p=769"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=769#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/lib.itenas.ac.id\/kti"},{"@type":"ListItem","position":2,"name":"Adaptation of The Variable Neighborhood Search Heuristic to Solve The 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":916,"_links":{"self":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/769"}],"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=769"}],"version-history":[{"count":6,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/769\/revisions"}],"predecessor-version":[{"id":771,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/769\/revisions\/771"}],"wp:attachment":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=769"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=769"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=769"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}