{"http:\/\/lib.itenas.ac.id\/kti\/?p=769":{"http:\/\/www.w3.org\/1999\/02\/22-rdf-syntax-ns#type":[{"type":"uri","value":"http:\/\/rdfs.org\/sioc\/ns#Post"},{"type":"uri","value":"http:\/\/rdfs.org\/sioc\/types#BlogPost"}],"http:\/\/purl.org\/dc\/elements\/1.1\/title":[{"type":"literal","value":"Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem"}],"http:\/\/purl.org\/dc\/terms\/identifier":[{"type":"literal","value":"769","datatype":"http:\/\/www.w3.org\/2001\/XMLSchema#integer"}],"http:\/\/purl.org\/dc\/elements\/1.1\/modified":[{"type":"literal","value":"2014-04-11","datatype":"http:\/\/www.w3.org\/2001\/XMLSchema#date"}],"http:\/\/purl.org\/dc\/elements\/1.1\/created":[{"type":"literal","value":"2012-04-12","datatype":"http:\/\/www.w3.org\/2001\/XMLSchema#date"}],"http:\/\/rdfs.org\/sioc\/ns#link":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?p=769"}],"http:\/\/rdfs.org\/sioc\/ns#has_creator":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?author=2#account"}],"http:\/\/rdfs.org\/sioc\/ns#has_container":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/#posts"}],"http:\/\/purl.org\/dc\/elements\/1.1\/abstract":[{"type":"literal","value":""}],"http:\/\/purl.org\/rss\/1.0\/modules\/content\/encoded":[{"type":"literal","value":"<![CDATA[The vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra'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.\r\n\r\n&nbsp;\r\n\r\n<strong>Di buat oleh:<\/strong> Arif Imran (arifimran@itenas.ac.id \/ arifimr@yahoo.com),\u00a0Liane Okdinawati (aneu88@yahoo.com).\r\n<strong>Kata kunci :<\/strong> metaheuristic, routing, variable neighborhood\r\n<strong>Keterangan :<\/strong> Jurnal Teknik Industri No.1, 2011, Universitas Muhammadiyah Malang ( Terakreditasi)\r\n\r\n&nbsp;\r\n\r\n<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>]]>","datatype":"http:\/\/www.w3.org\/1999\/02\/22-rdf-syntax-ns#XMLLiteral"}],"http:\/\/rdfs.org\/sioc\/ns#content":[{"type":"literal","value":"The vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra'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.\r\n\r\n&nbsp;\r\n\r\nDi buat oleh: Arif Imran (arifimran@itenas.ac.id \/ arifimr@yahoo.com),\u00a0Liane Okdinawati (aneu88@yahoo.com).\r\nKata kunci : metaheuristic, routing, variable neighborhood\r\nKeterangan : Jurnal Teknik Industri No.1, 2011, Universitas Muhammadiyah Malang ( Terakreditasi)\r\n\r\n&nbsp;\r\n\r\nAdaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem"}],"http:\/\/rdfs.org\/sioc\/ns#topic":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?cat=1"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?cat=5"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=metaheuristic"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=routing"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=variable-neighborhood"}]},"https:\/\/lib.itenas.ac.id\/kti\/?author=2#account":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?author=2&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?cat=1":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?cat=1&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?cat=5":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?cat=5&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=metaheuristic":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=metaheuristic&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=routing":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=routing&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=variable-neighborhood":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=variable-neighborhood&feed=lhrdf&format=json"}]}}