Title of article
An approximation algorithm for the pickup and delivery vehicle routing problem on trees Original Research Article
Author/Authors
Naoki Katoh، نويسنده , , Taihei Yano، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
15
From page
2335
To page
2349
Abstract
This paper presents an approximation algorithm for a vehicle routing problem on a tree-shaped network with a single depot where there are two types of demands, pickup demand and delivery demand. Customers are located on nodes of the tree, and each customer has a positive demand of pickup and/or delivery.
Keywords
vehicle routing , Approximation algorithm
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886370
Link To Document