Venkatesh Pandiri
Venkatesh Pandiri
Researcher, COSYS-ESTAS, IFSTTAR, Lille
Dirección de correo verificada de ifsttar.fr
TítuloCitado porAño
Two metaheuristic approaches for the multiple traveling salesperson problem
P Venkatesh, A Singh
Applied Soft Computing 26, 74-89, 2015
472015
Swarm intelligence approaches for multidepot salesmen problems with load balancing
V Pandiri, A Singh
Applied Intelligence 44 (4), 849-861, 2016
102016
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
52018
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
42019
A swarm intelligence approach for the colored traveling salesman problem
V Pandiri, A Singh
Applied Intelligence 48 (11), 4412-4428, 2018
32018
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, 279-292, 2019
12019
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
2019
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
2018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–8