Name
Title | ||
|---|---|---|
The one-commodity pickup and delivery travelling salesman problem on a path or a tree |
Abstract | ||
|---|---|---|
Optimization algorithms for both path and tree topology classes of the one-commodity pickup and delivery travelling salesman problem (1-PDTSP) are proposed in this article, which focus on minimizing the route distance to transport products among pickup and delivery customers by a single vehicle with a limited capacity of k. Each pickup customer provides one unit volume of the product while each delivery customer requires one unit volume of the product. For the path case, we propose an O(n2/ min (k,n)) algorithm for any arbitrary k, and two O(n) algorithms for k = 1 and k = ∞. For the tree case, O(n2) and O(n) algorithms are proposed for k = 1 and k = ∞, respectively. Moreover, when k is arbitrary, the problem becomes NP-hard in the strong sense. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(1), 24–35 2006 |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1002/net.v48:1 | Networks |
Keywords | Field | DocType |
tree,travelling salesman problem,path | Combinatorics,Mathematical optimization,Network topology,Travelling salesman problem,Tree structure,Optimization algorithm,Pickup,Mathematics | Journal |
Volume | Issue | ISSN |
48 | 1 | 0028-3045 |
Citations | PageRank | References |
8 | 0.70 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fan Wang | 1 | 166 | 12.73 |
| Andrew Lim | 2 | 937 | 89.78 |
| Zhou Xu | 3 | 208 | 14.97 |