A unified tabu search algorithm for vehicle routing problems with soft time windows

@article{Fu2008AUT,
  title={A unified tabu search algorithm for vehicle routing problems with soft time windows},
  author={Zhuo Fu and Richard W. Eglese and L. Y. O. Li},
  journal={JORS},
  year={2008},
  volume={59},
  pages={663-673}
}
The different ways of allowing time window violations lead to different types of the vehicle routing problems with soft time windows (VRPSTW). In this paper, different types of VRPSTW are analysed. A unified penalty function and a unified tabu search algorithm for the main types of VRPSTW are presented, with which different types of VRPSTW can be solved by simply changing the values of corresponding parameters in the penalty function. Computational results on benchmark problems are provided and… CONTINUE READING
Tweets
This paper has been referenced on Twitter 1 time. VIEW TWEETS

Citations

Publications citing this paper.
SHOWING 1-10 OF 19 CITATIONS, ESTIMATED 24% COVERAGE

78 Citations

0102030'11'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 78 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

Algorithms for the vehicle routing and scheduling problems with time window constraints

  • MM Solomon
  • Opns Res 35: 254–265.
  • 1987
Highly Influential
3 Excerpts

A metaheuristic for the vehiclerouting problem with soft time windows

  • Chiang W-C, RA Russell
  • J Opl Res Soc 55:
  • 2004

Similar Papers

Loading similar papers…