Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Venkatesh Pandiri
Observed name:
Pandiri Venkatesh
Institution:
Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram
Observed institutions:
University of Hyderabad,
Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram
ORCID:
0000-0001-5077-5435
Observed ORCID:
0000-0001-5077-5435
OpenAlex ID:
A5014082246
Two metaheuristic approaches for the multiple traveling salesperson problem
2014
·
Pandiri Venkatesh
, Alok Singh
·
Applied Soft Computing
·
138
A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem
2018
·
Venkatesh Pandiri
, Alok Singh
·
Information Sciences
·
73
An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem
2019
·
Venkatesh Pandiri
, Alok Singh
·
Applied Soft Computing
·
69
A swarm intelligence approach for the colored traveling salesman problem
2018
·
Venkatesh Pandiri
, Alok Singh
·
Applied Intelligence
·
52
Two hybrid metaheuristic approaches for the covering salesman problem
2020
·
Venkatesh Pandiri
, Alok Singh
, et al.
·
Neural Computing and Applications
·
31
Swarm intelligence approaches for multidepot salesmen problems with load balancing
2015
·
Venkatesh Pandiri
, Alok Singh
·
Applied Intelligence
·
17
A Multi-start Iterated Local Search Algorithm with Variable Degree of Perturbation for the Covering Salesman Problem
2018
·
Pandiri Venkatesh
, Gaurav Srivastava
, et al.
·
Advances in intelligent systems and computing
·
16
Multi-start heuristics for the profitable tour problem
2021
·
Kasi Viswanath Dasari
, Venkatesh Pandiri
, et al.
·
Swarm and Evolutionary Computation
·
15
A general variable neighborhood search algorithm for the k-traveling salesman problem
2018
·
Pandiri Venkatesh
, Gaurav Srivastava
, et al.
·
Procedia Computer Science
·
15
PDF
A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem
2021
·
Venkatesh Pandiri
, Alok Singh
·
Journal of Heuristics
·
13
An evolution strategy based approach for cover scheduling problem in wireless sensor networks
2020
·
Gaurav Srivastava
, Pandiri Venkatesh
, et al.
·
International Journal of Machine Learning and Cybernetics
·
12
Two multi-start heuristics for the k-traveling salesman problem
2020
·
Venkatesh Pandiri
, Alok Singh
·
OPSEARCH
·
11
A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem
2019
·
Pandiri Venkatesh
, Alok Singh
, et al.
·
IEEE Congress on Evolutionary Computation (CEC)
·
11
Solution of the family traveling salesman problem using a hyper-heuristic approach
2024
·
Venkatesh Pandiri
, Alok Singh
·
Engineering Applications of Artificial Intelligence
·
9
Artificial bee colony and adaptive large neighborhood search based approaches for the star-ring network design problem
2026
·
Sudhakar Chittimadha
, Venkatesh Pandiri
·
Applied Soft Computing
·
2
Reinforcement Learning Guided Adaptive Local Search in Max-Min Ant System for the Ring–Star Problem
2026
·
Sudhakar Chittimadha
, Venkatesh Pandiri
·
International Conference on Secure Cyber Computing and Communications (ICSCCC)
FERN: Fast and Energy-Efficient Ring-Star Network Design Problem using MMACO
2025
·
Sudhakar Chittimadha
, Venkatesh Pandiri
·
IEEE International Conference on High Performance Computing, Data and Analytics Workshop (HiPCW)
A Multi-Start Iterated Local Search Algorithm for the Bottleneck Traveling Salesman Problem
2022
·
Viknesh Rajaramon
, Venkatesh Pandiri
·
IEEE India Conference
Show more works
View as search
Works count:
18
Citation count:
484
H-index:
11
I10-index:
13
Year
Topic
Type