A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows

@article{Taillard1997ATS,
  title={A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows},
  author={{\'E}ric D. Taillard and Philippe Badeau and Michel Gendreau and François Guertin and Jean-Yves Potvin},
  journal={Transportation Science},
  year={1997},
  volume={31},
  pages={170-186}
}
This paper describes a tabu search heuristic for the vehicle routing problem with soft time windows. This problem allows lateness at customer locations although a penalty is then incurred and added to the objective value. By adding large penalty values, the vehicle routing problem with hard time windows can be addressed as well. In the tabu search, a neighborhood of the current solution is created through an exchange procedure that swaps sequences of consecutive customers (or segments) between… CONTINUE READING
Highly Influential
This paper has highly influenced 76 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 1,332 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
685 Citations
41 References
Similar Papers

Citations

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

1,332 Citations

050'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 1,332 citations based on the available data.

See our FAQ for additional information.

References

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

A Tabu Search Approach to the General Vehicle Routing Problem. Ph.D. Dissertation, The University of Texas at Austin, Texas

  • W. B. Carlton
  • 1995
Highly Influential
9 Excerpts

An Exchange Heuristic for Routing Problems with Time Windows

  • J. Y. Potvin, J. M. Rousseau
  • Journal of the Operational Research Society
  • 1995
Highly Influential
4 Excerpts

An Efficient Implementation of Local Search Algorithms for Constrained Routing Problems, E u r o p e a n

  • M.W.P. Savelsbergh
  • Journal of Operational Research
  • 1990
Highly Influential
6 Excerpts

Local Search in Routing Problems with Time Windows

  • M.W.P. Savelsbergh
  • Annals of Operations Research
  • 1986
Highly Influential
6 Excerpts

Traveling Salesman-type Combinatorial Problems and their relation to the Logistics of Blood Banking

  • I. Or
  • Ph.D. thesis,
  • 1976
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…