1. Augerat P, Belenguer JM, Benavent E, Corberan A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Research report 949-M. Universite Joseph Fourier, Grenoble
2. Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209–219
3. Chandran N, Narendran TT, Ganesh K (2006) A clustering approach to solve the multiple travelling salesmen problem. Int J Ind Syst Eng 1(3):372–387
4. Chatterjee S, Carrera C, Lynch LA (1996) Genetic algorithms and traveling salesman problems. Eur J Oper Res 93(3):490–510
5. Davis L (1985) Job shop scheduling with genetic algorithms. In: Proceedings of the international conference on genetic algorithms, London, pp 136–140