@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=769>
  a sioc:Post, sioct:BlogPost ;
  dc:title "Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem" ;
  dcterms:identifier 769 ;
  dc:modified "2014-04-11"^^xsd:date ;
  dc:created "2012-04-12"^^xsd:date ;
  sioc:link <https://lib.itenas.ac.id/kti/?p=769> ;
  sioc:has_creator <https://lib.itenas.ac.id/kti/?author=2#account> ;
  sioc:has_container <https://lib.itenas.ac.id/kti/#posts> ;
  dc:abstract "" ;
  content:encoded """<![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.

&nbsp;

<strong>Di buat oleh:</strong> Arif Imran (arifimran@itenas.ac.id / arifimr@yahoo.com), Liane Okdinawati (aneu88@yahoo.com).
<strong>Kata kunci :</strong> metaheuristic, routing, variable neighborhood
<strong>Keterangan :</strong> Jurnal Teknik Industri No.1, 2011, Universitas Muhammadiyah Malang ( Terakreditasi)

&nbsp;

<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>]]>"""^^rdf:XMLLiteral ;
  sioc:content """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.

&nbsp;

Di buat oleh: Arif Imran (arifimran@itenas.ac.id / arifimr@yahoo.com), Liane Okdinawati (aneu88@yahoo.com).
Kata kunci : metaheuristic, routing, variable neighborhood
Keterangan : Jurnal Teknik Industri No.1, 2011, Universitas Muhammadiyah Malang ( Terakreditasi)

&nbsp;

Adaptation of The Variable Neighborhood Search Heuristic to Solve The 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=metaheuristic>, <https://lib.itenas.ac.id/kti/?tag=routing>, <https://lib.itenas.ac.id/kti/?tag=variable-neighborhood> .

<https://lib.itenas.ac.id/kti/?author=2#account> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?author=2&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=metaheuristic> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?tag=metaheuristic&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> .
<https://lib.itenas.ac.id/kti/?tag=variable-neighborhood> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?tag=variable-neighborhood&feed=lhrdf&format=turtle> .