@prefix sioc: <http://rdfs.org/sioc/ns#> .
@prefix sioct: <http://rdfs.org/sioc/types#> .
@prefix dc: <http://purl.org/dc/elements/1.1/> .
@prefix dcterms: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix content: <http://purl.org/rss/1.0/modules/content/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .

<http://lib.itenas.ac.id/kti/?p=2441>
  a sioc:Post, sioct:BlogPost ;
  dc:title "An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem" ;
  dcterms:identifier 2441 ;
  dc:modified "2014-01-20"^^xsd:date ;
  dc:created "2014-01-20"^^xsd:date ;
  sioc:link <https://lib.itenas.ac.id/kti/?p=2441> ;
  sioc:has_creator <https://lib.itenas.ac.id/kti/?author=6#account> ;
  sioc:has_container <https://lib.itenas.ac.id/kti/#posts> ;
  dc:abstract "" ;
  content:encoded """<![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’s 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’s 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.

Dibuat oleh : Arif Imran

E-mail:  arifimr@yahoo.com
Kata Kunci : multi-level, heuristic, routing, heterogeneous fleet

Keterangan :  Makalah ini  dimuat pada Jurnal  ITENAS REKAYASA,  Vol 14, No 1 (2010)
<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>]]>"""^^rdf:XMLLiteral ;
  sioc:content """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’s 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’s 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.

Dibuat oleh : Arif Imran

E-mail:  arifimr@yahoo.com
Kata Kunci : multi-level, heuristic, routing, heterogeneous fleet

Keterangan :  Makalah ini  dimuat pada Jurnal  ITENAS REKAYASA,  Vol 14, No 1 (2010)
An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem""" ;
  sioc:topic <https://lib.itenas.ac.id/kti/?cat=1>, <https://lib.itenas.ac.id/kti/?cat=5>, <https://lib.itenas.ac.id/kti/?tag=heterogeneous-fleet>, <https://lib.itenas.ac.id/kti/?tag=heuristic>, <https://lib.itenas.ac.id/kti/?tag=multi-level>, <https://lib.itenas.ac.id/kti/?tag=routing> .

<https://lib.itenas.ac.id/kti/?author=6#account> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?author=6&feed=lhrdf&format=turtle> .
<https://lib.itenas.ac.id/kti/?cat=1> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?cat=1&feed=lhrdf&format=turtle> .
<https://lib.itenas.ac.id/kti/?cat=5> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?cat=5&feed=lhrdf&format=turtle> .
<https://lib.itenas.ac.id/kti/?tag=heterogeneous-fleet> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?tag=heterogeneous-fleet&feed=lhrdf&format=turtle> .
<https://lib.itenas.ac.id/kti/?tag=heuristic> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?tag=heuristic&feed=lhrdf&format=turtle> .
<https://lib.itenas.ac.id/kti/?tag=multi-level> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?tag=multi-level&feed=lhrdf&format=turtle> .
<https://lib.itenas.ac.id/kti/?tag=routing> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?tag=routing&feed=lhrdf&format=turtle> .