| Two metaheuristic approaches for the multiple traveling salesperson problem P Venkatesh, A Singh Applied Soft Computing 26, 74-89, 2015 | 135 | 2015 |
| A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem V Pandiri, A Singh Information Sciences 463, 261-281, 2018 | 67 | 2018 |
| An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem V Pandiri, A Singh Applied Soft Computing 78, 481-495, 2019 | 65 | 2019 |
| A swarm intelligence approach for the colored traveling salesman problem V Pandiri, A Singh Applied Intelligence 48, 4412-4428, 2018 | 42 | 2018 |
| Two hybrid metaheuristic approaches for the covering salesman problem V Pandiri, A Singh, A Rossi Neural Computing and Applications, 2020 | 29 | 2020 |
| Swarm intelligence approaches for multidepot salesmen problems with load balancing V Pandiri, A Singh Applied Intelligence 44 (4), 849-861, 2016 | 18 | 2016 |
| A multi-start iterated local search algorithm with variable degree of perturbation for the covering salesman problem P Venkatesh, G Srivastava, A Singh Harmony Search and Nature Inspired Optimization Algorithms: Theory and …, 2019 | 15 | 2019 |
| A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem P Venkatesh, A Singh, R Mallipeddi 2019 IEEE Congress on Evolutionary Computation (CEC), 1390-1397, 2019 | 14 | 2019 |
| Multi-start heuristics for the profitable tour problem KV Dasari, V Pandiri, A Singh Swarm and Evolutionary Computation 64, 100897, 2021 | 13 | 2021 |
| An evolution strategy based approach for cover scheduling problem in wireless sensor networks G Srivastava, P Venkatesh, A Singh International Journal of Machine Learning and Cybernetics 11 (9), 1981-2006, 2020 | 12 | 2020 |
| Two multi-start heuristics for the k-traveling salesman problem V Pandiri, A Singh OPSEARCH 57 (4), 1164-1204, 2020 | 10 | 2020 |
| A general variable neighborhood search algorithm for the k-traveling salesman problem P Venkatesh, G Srivastava, A Singh Procedia Computer Science 143, 189-196, 2018 | 10 | 2018 |
| A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem V Pandiri, A Singh Journal of Heuristics 27 (5), 791-868, 2021 | 6 | 2021 |
| Solution of the family traveling salesman problem using a hyper-heuristic approach V Pandiri, A Singh Engineering Applications of Artificial Intelligence 133, 108193, 2024 | 2 | 2024 |
| A Multi-Start Iterated Local Search Algorithm for the Bottleneck Traveling Salesman Problem V Rajaramon, V Pandiri 2022 IEEE 19th India Council International Conference (INDICON), 1-7, 2022 | 1 | 2022 |
| Heuristics for variants of traveling salesman problem V Pandiri Hyderabad, 0 | | |
Alok SinghProfessor, School of Computer & Information Sciences, University of HyderabadEmail verificata su uohyd.ernet.in
