A genetic algorithm for the vehicle routing problem

By Barrie M. Baker, M. A. Ayechew. Computers & Operations Research, 2003

890 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (2007, methodology): “For recent successful applications to the VRP, see Berger and Barkaoui [32], Prins [33], and Baker andAyechew [34].”
Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms (2006, methodology): “The VRP was solved in [18] using a pure GA and a hybrid GA with neighborhood search methods showing promising results compared to simulated annealing and Tabu search, with respect to solution time and quality.”
The Social Engineering Optimizer (SEO) (2018, neutral): “…variable neighborhood search and also bat algorithm are reported to solve this problem (Osman, 1993; Gendreau et al., 1994; Rego and Roucairol, 1996; Barbarosoglu and Ozgur, 1999; Hiquebran et al., 1994; Bullnheimer et al., 1999; Baker and Ayechew, 2003; Sarasola et al., 2016; Zhou et al., 2016).”
An artificial bee colony algorithm for the capacitated vehicle routing problem (2011, methodology): “The ABC algorithm is an iterative algorithm, and it starts by generating random solutions as the food sources and assigning each employed bee to a food source.”