Alok Singh
Orcid: 0000-0003-3585-4957Affiliations:
- University of Hyderabad, School of Computer and Information Sciences, India
- University of Allahabad, India (PhD 2006)
According to our database1,
Alok Singh
authored at least 89 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A General Variable Neighborhood Search Approach for the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule.
Proceedings of the Distributed Computing and Intelligent Technology, 2024
2023
A hyper-heuristic based approach with naive Bayes classifier for the reliability p-median problem.
Appl. Intell., November, 2023
Two heuristic approaches for clustered traveling salesman problem with <i>d</i>-relaxed priority rule.
Expert Syst. Appl., August, 2023
Evol. Intell., June, 2023
Two evolutionary approaches with objective-specific variation operators for vehicle routing problem with time windows and quality of service objectives.
Appl. Soft Comput., February, 2023
An evolutionary approach comprising tailor-made variation operators for rescue unit allocation and scheduling with fuzzy processing times.
Eng. Appl. Artif. Intell., 2023
Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2023
Proceedings of the Distributed Computing and Intelligent Technology, 2023
2022
Swarm intelligence, exact and matheuristic approaches for minimum weight directed dominating set problem.
Eng. Appl. Artif. Intell., 2022
An evolutionary approach for obnoxious cooperative maximum covering location problem.
Appl. Intell., 2022
2021
Focus distance-aware lifetime maximization of video camera-based wireless sensor networks.
J. Heuristics, 2021
A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem.
J. Heuristics, 2021
NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows.
Expert Syst. Appl., 2021
Multi-start iterated local search, exact and matheuristic approaches for minimum capacitated dominating set problem.
Appl. Soft Comput., 2021
A Hybrid Discrete Differential Evolution Approach for the Single Machine Total Stepwise Tardiness Problem with Release Dates.
Proceedings of the IEEE Congress on Evolutionary Computation, 2021
2020
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
Proceedings of the Pattern Recognition and Machine Intelligence, 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
Int. J. Mach. Learn. Cybern., 2018
A hyper-heuristic based artificial bee colony algorithm for <i>k</i>-Interconnected multi-depot multi-traveling salesman problem.
Inf. Sci., 2018
Boosting an evolution strategy with a preprocessing step: application to group scheduling problem in directional sensor networks.
Appl. Intell., 2018
Appl. Intell., 2018
Properties and Exact Solution Approaches for the Minimum Cost Dominating Tree Problem.
Proceedings of the Distributed Computing and Internet Technology, 2018
2017
Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates.
Oper. Res., 2017
A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem.
Int. J. Mach. Learn. Cybern., 2017
Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem.
Appl. Soft Comput., 2017
Appl. Intell., 2017
Hybrid artificial bee colony algorithm based approaches for two ring loading problems.
Appl. Intell., 2017
2016
Soft Comput., 2016
Appl. Intell., 2016
Proceedings of the Ninth International Conference on Contemporary Computing, 2016
2015
Inf. Sci., 2015
Swarm intelligence approaches for cover scheduling problem in wireless sensor networks.
Int. J. Bio Inspired Comput., 2015
Appl. Soft Comput., 2015
A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set.
Appl. Intell., 2015
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2015
2014
Appl. Intell., 2014
Proceedings of the 2014 IEEE Symposium on Swarm Intelligence, 2014
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2014
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2014
An effective heuristic for construction of all-to-all minimum power broadcast trees in wireless networks.
Proceedings of the 2014 International Conference on Advances in Computing, 2014
2013
Metaheuristic algorithms for computing capacitated dominating set with uniform and variable capacities.
Swarm Evol. Comput., 2013
Eur. J. Oper. Res., 2013
Appl. Soft Comput., 2013
A genetic algorithm based exact approach for lifetime maximization of directional sensor networks.
Ad Hoc Networks, 2013
Proceedings of the Third International Conference on Soft Computing for Problem Solving, 2013
An Ant Colony Optimization Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem.
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2013
A study on energy issues in construction of all-to-all minimum power broadcast (A2A MPB) trees in wireless networks.
Proceedings of the International Conference on Advances in Computing, 2013
2012
Swarm Evol. Comput., 2012
Column generation algorithm for sensor coverage scheduling under bandwidth constraints.
Networks, 2012
Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs.
Int. J. Mach. Learn. Cybern., 2012
An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges.
Comput. Oper. Res., 2012
Proceedings of the Contemporary Computing - 5th International Conference, 2012
Proceedings of the Contemporary Computing - 5th International Conference, 2012
2011
An artificial bee colony algorithm for the minimum routing cost spanning tree problem.
Soft Comput., 2011
A hybrid genetic algorithm for the minimum energy broadcast problem in wireless ad hoc networks.
Appl. Soft Comput., 2011
Asia Pac. J. Oper. Res., 2011
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2011
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
2010
Inf. Sci., 2010
Comput. Oper. Res., 2010
A Hybrid Permutation-Coded Evolutionary Algorithm for the Early/tardy Scheduling Problem.
Asia Pac. J. Oper. Res., 2010
Proceedings of the Neural Information Processing. Theory and Algorithms, 2010
Proceedings of the Contemporary Computing - Third International Conference, 2010
2009
A new grouping genetic algorithm approach to the multiple traveling salesperson problem.
Soft Comput., 2009
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem.
Appl. Soft Comput., 2009
Proceedings of the Neural Information Processing, 16th International Conference, 2009
Proceedings of the Contemporary Computing - Second International Conference, 2009
2008
Asia Pac. J. Oper. Res., 2008
Proceedings of the 2008 International Conference on Information Technology, 2008
2007
Soft Comput., 2007
Perturbation Based Local Search for the Degree-Constrained Minimum Spanning-Tree Problem.
Proceedings of the 3rd Indian International Conference on Artificial Intelligence, 2007
A Hybrid Evolutionary Approach to the Quadratic Knapsack Problem.
Proceedings of the 3rd Indian International Conference on Artificial Intelligence, 2007
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2007
2006
Asia Pac. J. Oper. Res., 2006
2005
Two New Heuristics for the Equal Piles Problem.
Proceedings of the 2nd Indian International Conference on Artificial Intelligence, 2005