@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=2433>
  a sioc:Post, sioct:BlogPost ;
  dc:title "A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem" ;
  dcterms:identifier 2433 ;
  dc:modified "2014-01-20"^^xsd:date ;
  dc:created "2014-01-20"^^xsd:date ;
  sioc:link <https://lib.itenas.ac.id/kti/?p=2433> ;
  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-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.

Dibuat oleh : Arif Imran

E-mail:  arifimr@yahoo.com
Kata Kunci : Meta-heuristic, routing, multi-depot, variable neighborhood.

Keterangan :  Makalah ini  dimuat pada Jurnal Teknik Industri Vol 15, No 2 (2013) : DECEMBER 2013
<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>]]>"""^^rdf:XMLLiteral ;
  sioc:content """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.

Dibuat oleh : Arif Imran

E-mail:  arifimr@yahoo.com
Kata Kunci : Meta-heuristic, routing, multi-depot, variable neighborhood.

Keterangan :  Makalah ini  dimuat pada Jurnal Teknik Industri Vol 15, No 2 (2013) : DECEMBER 2013
A Variable Neighborhood Search-Based Heuristic for the Multi-Depot 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=meta-heuristic>, <https://lib.itenas.ac.id/kti/?tag=multi-depot>, <https://lib.itenas.ac.id/kti/?tag=routing>, <https://lib.itenas.ac.id/kti/?tag=variable-neighborhood> .

<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=meta-heuristic> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?tag=meta-heuristic&feed=lhrdf&format=turtle> .
<https://lib.itenas.ac.id/kti/?tag=multi-depot> rdfs:seeAlso <https://lib.itenas.ac.id/kti/?tag=multi-depot&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> .