The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem

@article{Juan2010TheSH,
  title={The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem},
  author={Angel A. Juan and Javier Faulin and Rub{\'e}n Ruiz and Barry B. Barrios and Santi Caball{\'e}},
  journal={Appl. Soft Comput.},
  year={2010},
  volume={10},
  pages={215-224}
}
The Capacitated Vehicle Routing Problem (CVRP) is a well known problem which has long been tackled by researchers for several decades now, not only because of its potential applications but also due to the fact that CVRP can be used to test the efficiency of new algorithms and optimization methods. The objective of our work is to present SR-GCWS, a hybrid algorithm that combines a CVRP classical heuristic with Monte Carlo simulation using state-of-the-art random number generators. The resulting… CONTINUE READING
BETA
Tweets
This paper has been referenced on Twitter 1 time. VIEW TWEETS

Citations

Publications citing this paper.
SHOWING 1-10 OF 47 CITATIONS

References

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

K

  • L. Xing, Y. Chen, K. Yang
  • Multi-objective flexible job shop schedule…
  • 2009

M

  • A. Juan, J. Faulin, R. Ruiz, B Barrios
  • Gilibert and X, Vilajosana, Using oriented random…
  • 2009
1 Excerpt

Meta-heuristics for the vehicle routing problem and its extensions: A categorized bibliography

  • M. Gendreau, J. Potvin, O. Bräysy, G. Hasle, A. Løkketangen
  • The Vehicle Routing Problem: Latest Advanced and…
  • 2008
1 Excerpt

R

  • J. Faulin, M. Gilibert, A. Juan, R. Ruiz
  • and X. Vilajosana, SR-1: A Simulation-based…
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…