Two metaheuristic approaches for the multiple traveling salesperson problem. - Pandiri Venkatesh; Alok Singh 001 (Appl. Soft Comput., 2015)

Swarm intelligence approaches for multidepot salesmen problems with load balancing. - Venkatesh Pandiri; Alok Singh 001 (Appl. Intell., 2016)

A swarm intelligence approach for the colored traveling salesman problem. - Venkatesh Pandiri; Alok Singh 001 (Appl. Intell., 2018)

A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem. - Venkatesh Pandiri; Alok Singh 001 (Inf. Sci., 2018)

A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem. - Pandiri Venkatesh; Alok Singh 001; Rammohan Mallipeddi (CEC, 2019)

An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. - Venkatesh Pandiri; Alok Singh 001 (Appl. Soft Comput., 2019)

An evolution strategy based approach for cover scheduling problem in wireless sensor networks. - Gaurav Srivastava 002; Pandiri Venkatesh; Alok Singh 001 (Int. J. Mach. Learn. Cybern., 2020)

Two hybrid metaheuristic approaches for the covering salesman problem. - Venkatesh Pandiri; Alok Singh 001; André Rossi (Neural Comput. Appl., 2020)

A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem. - Venkatesh Pandiri; Alok Singh 001 (J. Heuristics, 2021)

Multi-start heuristics for the profitable tour problem. - Kasi Viswanath Dasari; Venkatesh Pandiri; Alok Singh 001 (Swarm Evol. Comput., 2021)

Solution of the family traveling salesman problem using a hyper-heuristic approach. - Venkatesh Pandiri; Alok Singh 001 (Eng. Appl. Artif. Intell., 2024)