An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree

  • Xu Z
  • Lai X
  • Lim A
 et al. 
  • 3


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


In this research, we study the capacitated traveling salesman problem with pickup and delivery (CTSPPD) on a tree, which aims to determine the best route for a vehicle with a finite capacity to transport amounts of a product from pickup points to delivery points on a tree network, such that the vehicle's total travel distance is kept to a minimum. It has several applications in logistics and is known to be NP-hard. We develop a 2-approximation algorithm that is a significant improvement over the best constant approximation ratio of 5 derived from existing CTSPPD literature. Computational results show that the proposed algorithm also achieves good average performance over randomly generated instances. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(2), 179–195 2014

Author-supplied keywords

  • approximation algorithm
  • pickup and delivery
  • traveling salesman problem
  • tree

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free