{"http:\/\/lib.itenas.ac.id\/kti\/?p=2433":{"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":"A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem"}],"http:\/\/purl.org\/dc\/terms\/identifier":[{"type":"literal","value":"2433","datatype":"http:\/\/www.w3.org\/2001\/XMLSchema#integer"}],"http:\/\/purl.org\/dc\/elements\/1.1\/modified":[{"type":"literal","value":"2014-01-20","datatype":"http:\/\/www.w3.org\/2001\/XMLSchema#date"}],"http:\/\/purl.org\/dc\/elements\/1.1\/created":[{"type":"literal","value":"2014-01-20","datatype":"http:\/\/www.w3.org\/2001\/XMLSchema#date"}],"http:\/\/rdfs.org\/sioc\/ns#link":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?p=2433"}],"http:\/\/rdfs.org\/sioc\/ns#has_creator":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?author=6#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 multi-depot vehicle routing problem (MDVRP) is addressed using an adaptation of the variable neighborhood search (VNS). The proposed VNS algorithm besides using several neighborhoods and a number of local searches has a number of additional features. These include a scheme for identifying borderline customers, a diversivication procedure and a mechanism that aggregates and disaggregates routes between depots. The proposed algorithm is tested on the data instances from the literature and produces competitive results.\r\n\r\nDibuat oleh : Arif Imran\r\n\r\nE-mail:\u00a0 arifimr@yahoo.com\r\nKata Kunci : Meta-heuristic, routing, multi-depot, variable neighborhood.\r\n\r\nKeterangan : \u00a0Makalah ini\u00a0 dimuat pada Jurnal Teknik Industri Vol 15, No 2 (2013) : DECEMBER 2013\r\n<h3><a href=\"http:\/\/puslit2.petra.ac.id\/ejournal\/index.php\/ind\/article\/view\/18846\">A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem<\/a><\/h3>]]>","datatype":"http:\/\/www.w3.org\/1999\/02\/22-rdf-syntax-ns#XMLLiteral"}],"http:\/\/rdfs.org\/sioc\/ns#content":[{"type":"literal","value":"The multi-depot vehicle routing problem (MDVRP) is addressed using an adaptation of the variable neighborhood search (VNS). The proposed VNS algorithm besides using several neighborhoods and a number of local searches has a number of additional features. These include a scheme for identifying borderline customers, a diversivication procedure and a mechanism that aggregates and disaggregates routes between depots. The proposed algorithm is tested on the data instances from the literature and produces competitive results.\r\n\r\nDibuat oleh : Arif Imran\r\n\r\nE-mail:\u00a0 arifimr@yahoo.com\r\nKata Kunci : Meta-heuristic, routing, multi-depot, variable neighborhood.\r\n\r\nKeterangan : \u00a0Makalah ini\u00a0 dimuat pada Jurnal Teknik Industri Vol 15, No 2 (2013) : DECEMBER 2013\r\nA Variable Neighborhood Search-Based Heuristic for the Multi-Depot 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=meta-heuristic"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=multi-depot"},{"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=6#account":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?author=6&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=meta-heuristic":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=meta-heuristic&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=multi-depot":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=multi-depot&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"}]}}