Vehicle Routing Problem: Meta-heuristic Approaches

The purpose of this article is to review the literature on the topic of deterministic vehiclerouting problem (vrp) and to give a review on the exact and approximate solution techniques. morespecifically the approximate (meta-heuristic) solution techniques are classified into: tabu search,simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and antcolony optimization. each of these solution techniques is briefly discussed and a case studyfrom the literature is presented.