{"http:\/\/lib.itenas.ac.id\/kti\/?p=2441":{"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":"An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem"}],"http:\/\/purl.org\/dc\/terms\/identifier":[{"type":"literal","value":"2441","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=2441"}],"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-Level heuristic is used to investigate the heterogeneous fleet vehicle routing problem (HFVRP). The initial solution for the Multi-Level heuristic is obtained by Dijkstra\u2019s algorithm based on a cost network constructed by the sweep algorithm and the 2-opt procedure. The proposed algorithm uses a number of local search operators such as swap, 1-0 insertion, 2-opt, and Dijkstra\u2019s Algorithm. In addition, in order to improve the search process, a diversification procedure is applied. The proposed algorithm is then tested on the data sets from the literature.\r\n\r\nDibuat oleh : Arif Imran\r\n\r\nE-mail:\u00a0 arifimr@yahoo.com\r\nKata Kunci : multi-level, heuristic, routing, heterogeneous fleet\r\n\r\nKeterangan : \u00a0Makalah ini\u00a0 dimuat pada Jurnal\u00a0 ITENAS REKAYASA, \u00a0Vol 14, No 1 (2010)\r\n<h3><a href=\"http:\/\/ejurnal.itenas.ac.id\/index.php\/rekayasa\/article\/view\/24\">An Application of the Multi-Level Heuristic for the Heterogeneous Fleet 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-Level heuristic is used to investigate the heterogeneous fleet vehicle routing problem (HFVRP). The initial solution for the Multi-Level heuristic is obtained by Dijkstra\u2019s algorithm based on a cost network constructed by the sweep algorithm and the 2-opt procedure. The proposed algorithm uses a number of local search operators such as swap, 1-0 insertion, 2-opt, and Dijkstra\u2019s Algorithm. In addition, in order to improve the search process, a diversification procedure is applied. The proposed algorithm is then tested on the data sets from the literature.\r\n\r\nDibuat oleh : Arif Imran\r\n\r\nE-mail:\u00a0 arifimr@yahoo.com\r\nKata Kunci : multi-level, heuristic, routing, heterogeneous fleet\r\n\r\nKeterangan : \u00a0Makalah ini\u00a0 dimuat pada Jurnal\u00a0 ITENAS REKAYASA, \u00a0Vol 14, No 1 (2010)\r\nAn Application of the Multi-Level Heuristic for the Heterogeneous Fleet 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=heterogeneous-fleet"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=heuristic"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=multi-level"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=routing"}]},"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=heterogeneous-fleet":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=heterogeneous-fleet&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=heuristic":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=heuristic&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=multi-level":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=multi-level&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"}]}}