A new formulation for the Traveling Deliveryman Problem

  title={A new formulation for the Traveling Deliveryman Problem},
  author={Isabel M{\'e}ndez-D{\'i}az and Paula Zabala and Abilio Lucena},
  journal={Discrete Applied Mathematics},
The Traveling Deliveryman Problem is a generalization of the Minimum Cost Hamiltonian Path Problem where the starting vertex of the path, i.e. a depot vertex, is fixed in advance and the cost associated with a Hamiltonian path equals the sum of the costs for the layers of paths (along the Hamiltonian path) going from the depot vertex to each of the remaining vertices. In this paper, we propose a new Integer Programming formulation for the problem and computationally evaluate the strength of its… CONTINUE READING