In mathematics, computer science and economics, optimization, refers to choosing the finest element from some set of existing alternatives. In the simplest manner, this means solving problems in which one seeks to minimize or maximize a real function by methodically choosing the values of real or integer variables from within an acceptable set. An optimization problem is the predicament of getting the best solution from all possible solutions. In this review paper we will discuss various optimization techniques for vehicle routing problem (VRP) which is a combinatorial optimization problem seeking to serve n customers with a group of vehicles.

1. Ausiello, Giorgio; et al. (2003), Complexity and Approximation (Corrected ed. ), Springer, ISBN 978-3540654315
2. Oliveira, H. C. B. de; Vasconcelos, G. C. (2008). "A hybrid search method for the vehicle routing problem with time windows". Annals of Operations Research. . Retrieved 2009-01-29
3. Toth P, Vigo D, editors. The Vehicle Routing Problem. Philadelphia: Siam, 2002.
4. Dorigo M Gambardella L M. . Ant Colony system :a cooperative learning approach to the traveling salesman problem [J]. IEEE Transactions on Evolutionary Camputation,1997,1(1):53.
5. Maniezzo V. , & Colorni, A. (1999). The ant system applied to the quadratic assignment problem. IEEE Transaction on Knowledge and Data Engineering, 11(5), 769–778
6. G. Clarke, J. Wright, "Scheduling of vehicles from a central depot to a number of delivery points," Operations Research, 1964, vol. 12, pp. 568– 581.
7. B. GILLETT, L. MILLER, "A heuristic algorithm for the vehicle dispatch problem," Operations Research, 1974, vol. 22, pp. 540–349.
8. N. Christofides, A. Mingozzi, P. Toth, Combinatorial Optimization. Wiley, Chichester, 1979
9. M. L. Fisher, R. Jaikumar, "A generalized assignment heuristic for vehicle routing," Networks, 1981, vol. 11, pp. 109–124.
10. Dantzig G. B,Ramser RH,The truck dispatch problem ,Management Science,1959. 6:80-91
11. Min H The multiple the vehicle routing problem with simultaneous pick up and delivery and pick up points. Transportation Research part A,1989,5:377-386.
12. Halse K ,Modelling and solving Complex Vehicle Routing Problems,PhD thesis,Technical University of Denmark. Lyngby,1992
13. DethloffJ,Vehicle routing and reverse logistics: thevehicle rouitng problem with simultaneous delivery and pick-up OR Spektrum,2001,23:79-96.
14. Salhi S,Nagy G Acluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of Operational Research Society,2005,162910:126-141.
15. Nagy G,Salhi S, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries . European Journal of Operational Research Society,2005,162910:126-141.
16. Chen J. F. ,Wu T. H. ,Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society,2006,57:579-587.
17. Tang F. A. ,Galvao R. D. ,A tabu search algorithm for the vehicle routing problem with simultaneous pick up and delivery service. Computers and Operations Research,2006. 33(3):595-619.
18. Hoff A,Gribkovskaia A,Laporte G,LokkentangenA,Lasso solution strategies for the vehicle routing problem with pickups and deliveries. European Journal of Operational Research,2009,192:755-766.
19. Dell'Amico M. ,Righini G,Salani M,A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Science,2006,40(2):235-247.
20. Kennedy J. ,Eberhart R. Particle Swarm Optimization. Proceedings of the 1995 IEEE International Conference on Neural Network,Perth,Australia,1995,pp 1942-1948.
21. Shigenori N. , Takamu G. J. ,Toshiki Y. ,Yoshikazu F. , A hybrid particle swarm optimization for distribution state estimation. IEEE Trans. On Power Systems. 2003,18(1):60-68.

Vehicle Routing Problem Optimization Techniques Ant Colony Optimization Vehicle Routing Problem With Time Windows Vehicle Routing Problem With Pick-up And Delivery