A new approximation algorithm for the capacitated vehicle routing problem on a tree (Q5943821): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1011461300596 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1529079830 / rank | |||
Normal rank |
Latest revision as of 11:26, 30 July 2024
scientific article; zbMATH DE number 1648633
Language | Label | Description | Also known as |
---|---|---|---|
English | A new approximation algorithm for the capacitated vehicle routing problem on a tree |
scientific article; zbMATH DE number 1648633 |
Statements
A new approximation algorithm for the capacitated vehicle routing problem on a tree (English)
0 references
2001
0 references
Given a tree \((V,E)\), where \(V\) is a set of \(n\) vertices and \(E\) is a set of edges. Customers are located on the vertices and each customer has a positive demand. Each edge is associated with a nonnegative length. The demands are served by a fleet of identical vehicles with limited capacity starting at a fixed vertex called depot. It is assumed that the demand of a customer is splittable, i.e. it can be served by more than one vehicle. The problem is to find a set of tours beginning at the depot, visiting a subset of customers to serve (partially) their demands, and returning to the depot without violating the capacity constraint and with minimum sum of lengths.
0 references
routing problem
0 references