{"http:\/\/lib.itenas.ac.id\/kti\/?p=766":{"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 Threshold Accepting Heuristic for The Heterogeneous Fleet Vehicle Routing Problem "}],"http:\/\/purl.org\/dc\/terms\/identifier":[{"type":"literal","value":"766","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=766"}],"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 heterogeneous fleet vehicle routing problem (HFVRP) is investigated using the Threshold Accepting (TA) heuristic. Here we apply a non-monotonic TA heuristic as it produces better solution than the monotonic one. The initial solution is obtained by Dijkstra's lagorithm based on a cost network constructed by the sweep algorithm and the 2_opt. Our TA algorithm uses a number of local search methods. The algorithm is the tested on the data sets from the literature and produces goood results.\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> Threshold accpeting, metaheuristic, routing, heteregeneous fleet\r\n<strong>Keterangan :<\/strong> Diterbitkan di Jurnal Logistik Bisnis Vol.1, No.2, 2010. Politeknik Pos Indonesia\r\n\r\n<a href=\"http:\/\/lib.itenas.ac.id\/kti\/wp-content\/uploads\/2012\/04\/jurnal1.pdf\">A Threshold Accepting Heuristic for The Heterogeneous Fleet Vehicle Routing Problem<\/a>\r\n\r\n&nbsp;]]>","datatype":"http:\/\/www.w3.org\/1999\/02\/22-rdf-syntax-ns#XMLLiteral"}],"http:\/\/rdfs.org\/sioc\/ns#content":[{"type":"literal","value":"The heterogeneous fleet vehicle routing problem (HFVRP) is investigated using the Threshold Accepting (TA) heuristic. Here we apply a non-monotonic TA heuristic as it produces better solution than the monotonic one. The initial solution is obtained by Dijkstra's lagorithm based on a cost network constructed by the sweep algorithm and the 2_opt. Our TA algorithm uses a number of local search methods. The algorithm is the tested on the data sets from the literature and produces goood results.\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 : Threshold accpeting, metaheuristic, routing, heteregeneous fleet\r\nKeterangan : Diterbitkan di Jurnal Logistik Bisnis Vol.1, No.2, 2010. Politeknik Pos Indonesia\r\n\r\nA Threshold Accepting Heuristic for The Heterogeneous Fleet Vehicle Routing Problem\r\n\r\n&nbsp;"}],"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=heteregeneous-fleet"},{"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=threshold-accpeting"}],"http:\/\/rdfs.org\/sioc\/ns#attachment":[{"type":"uri","value":"http:\/\/lib.itenas.ac.id\/kti\/wp-content\/uploads\/2012\/04\/jurnal1.pdf"}]},"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=heteregeneous-fleet":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=heteregeneous-fleet&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=threshold-accpeting":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=threshold-accpeting&feed=lhrdf&format=json"}]},"http:\/\/lib.itenas.ac.id\/kti\/wp-content\/uploads\/2012\/04\/jurnal1.pdf":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?attachment_id=3614&feed=lhrdf&format=json"}]}}