Pandiri Venkatesh

Orcid: 0000-0001-5077-5435

Affiliations:
  • University of Hyderabad, India


According to our database1, Pandiri Venkatesh authored at least 11 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Solution of the family traveling salesman problem using a hyper-heuristic approach.
Eng. Appl. Artif. Intell., 2024

2021
Multi-start heuristics for the profitable tour problem.
Swarm Evol. Comput., 2021

A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem.
J. Heuristics, 2021

2020
Two hybrid metaheuristic approaches for the covering salesman problem.
Neural Comput. Appl., 2020

An evolution strategy based approach for cover scheduling problem in wireless sensor networks.
Int. J. Mach. Learn. Cybern., 2020

2019
An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem.
Appl. Soft Comput., 2019

A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2018
A hyper-heuristic based artificial bee colony algorithm for <i>k</i>-Interconnected multi-depot multi-traveling salesman problem.
Inf. Sci., 2018

A swarm intelligence approach for the colored traveling salesman problem.
Appl. Intell., 2018

2016
Swarm intelligence approaches for multidepot salesmen problems with load balancing.
Appl. Intell., 2016

2015
Two metaheuristic approaches for the multiple traveling salesperson problem.
Appl. Soft Comput., 2015


  Loading...