An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections

@article{Baldacci2003AnEA,
  title={An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections},
  author={Roberto Baldacci and Eleni Hadjiconstantinou and Aristide Mingozzi},
  journal={Networks},
  year={2003},
  volume={42},
  pages={26-41}
}
In this paper, we describe a new integer programming formulation for the Traveling Salesman Problem with mixed Deliveries and Collections (TSPDC) based on a two-commodity network flow approach. We present new lower bounds that are derived from the linear relaxation of the new formulation by adding valid inequalities, in a cutting-plane fashion. The resulting lower bounds are embedded in a branch-and-cut algorithm for the optimal solution of the TSPDC. Computational results on different classes… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 21 references

New heuristic methods for the traveling salesman problem with mixed deliveries and collections

  • R. Baldacci, A. Mingozzi
  • Technical report, Department of Mathematics…
  • 1999
Highly Influential
5 Excerpts

The travelling salesman problem with pick-up and delivery

  • G. Mosheiov
  • Eur J Oper Res 79
  • 1994
Highly Influential
7 Excerpts

Routing vehicles in the real world: Applications in the solid waste

  • B. L. Golden, A. A. Assad, E. A. Wasil
  • beverage, food, dairy and newspaper industries…
  • 2002
1 Excerpt

Concorde: A code for solving traveling salesman problems

  • D. Applegate, R. Bixby, V. Chvátal, W. Cook
  • World Wide Web, http://www.math.princeton.edu/tsp…
  • 2001
1 Excerpt

Routing vehicles in the real world : Applications in the solid waste , beverage , food , dairy and newspaper industries

  • A. A. Assad, E. A. Wasil
  • 1999

Similar Papers

Loading similar papers…