1. Augerat P, Belenguer J, Benavent E, Corberán A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut node for the capacitated vehicle routing problem. Istituto di Analisi dei Sistemi ed Informatica. Consiglio Nazionale Delle Ricerche
2. Bacanin N (2011) An object-oriented software implementation of a novel cuckoo search algorithm. In: ECC’11 Proceedings of the 5th European Conference on European Computing Conference, Paris, France, pp 245–250
3. Chandran B, Raghavan S (2008) Modeling and solving the capacitated vehicle routing problem on trees. Veh Rout Probl Latest Adv New Chall, 1st edn. Springer, US, pp 239–261
4. Chang C (2015) A 2-opt with mutation operator to the traveling salesman problem. Int J Adv Eng Technol Comput Sci (IROSSS) 2(1):16–21
5. Christiansen C, Lysgaard J (2007) A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Oper Res Lett 35(6):773–781