Dr.Pandiri Venkatesh

Assistant Professor

E-mail: venkateshpandiri@iiitdm.ac.in | Room No: 109M, Laboratory Complex

Google Scholar: https://scholar.google.co.in/citations?user=FjHS438AAAAJ&hl=en

DBLP: https://dblp.org/pid/153/4065.html

Website: https://sites.google.com/view/venkateshpandiri/home


University of Hyderabad


Ph.D. in Computer Science


University of Hyderabad


M.Tech. in Computer Science



B.Tech. in Computer Science and Engineering


Research Interests

  1. Combinatorial Optimization

  2. Heuristics

  3. Metaheuristics

  4. Swarm Intelligence

  5. Multi-objective Optimization

Work Experience


  1. Assistant Professor, Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, Chennai, India.

  2. Faculty, National Institute of Technology Andhra Pradesh, India.


  1. Postdoctoral Fellow, IFSTTAR, Lille, France.


  1. Optimization Techniques

  2. Modeling and Optimization Techniques

  3. Computer Organization and Design

  4. Design and Analysis of Algorithms

Journal Publications

  1. Venkatesh Pandiri, Alok Singh: A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem. Information Sciences. 463-464: 261-281 (2018)

  2. Venkatesh Pandiri, Alok Singh: Two metaheuristic approaches for the multiple traveling salesperson problem. Applied Soft Computing. 26: 74-89 (2015)

  3. Venkatesh Pandiri, Alok Singh: An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. Applied Soft Computing. 78: 481-495 (2019)

  4. Venkatesh Pandiri, Alok Singh: A swarm intelligence approach for the colored traveling salesman problem. Applied Intelligence. 48(11): 4412-4428 (2018)

  5. Venkatesh Pandiri, Alok Singh: Swarm intelligence approaches for multidepot salesmen problems with load balancing. Applied Intelligence. 44(4): 849-861 (2016)

  6. Venkatesh Pandiri, Alok Singh, André Rossi: Two hybrid metaheuristic approaches for the covering salesman problem. Neural Computing and Applications. 32(19): 15643-15663 (2020)

  7. Gaurav Srivastava, Venkatesh Pandiri, Alok Singh: An evolution strategy based approach for cover scheduling problem in wireless sensor networks. International Journal of Machine Learning and Cybernetics. 11(9): 1981-2006 (2020)

  8. Venkatesh Pandiri, Alok Singh: Two multi-start heuristics for the k-traveling salesman problem. OPSEARCH. 57(4): 1164-1204 (2020)

  9. Venkatesh Pandiri, Gaurav Srivastava, Alok Singh: A general variable neighborhood search algorithm for the k-traveling salesman problem. Procedia Computer Science. 143: 189-196 (2018)

Conference Publications

  1. Venkatesh Pandiri, Gaurav Srivastava, Rammohan Mallipeddi: A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem. IEEE Congress on Evolutionary Computation (CEC), 1390-1397 (2019)

  2. Venkatesh Pandiri, Gaurav Srivastava, Alok Singh: A Multi-start Iterated Local Search Algorithm with Variable Degree of Perturbation for the Covering Salesman Problem. International Conference on Harmony Search and Algorithms (ICHSA), 279-292 (2018)

Institute Login
© IIITDM Kancheepuram 2017
Best viewed in Safari, Chrome and Firefox.