Dr. Shyam  Sundar

Department Master In Computer Application
Designation Associate Professor
Educational Qualification Ph.D. (CS), University of Hyderabad, India
E-Mail ssundar.mca@nitrr.ac.in
Contact Number 7745968949
Areas of Interest
Heuristic & Metaheuristic Techniques for Combinatorial Optimization Problems
Publications

 

Journal Publications 

  1. Manisha Israni and Shyam Sundar (2024), “Iterated local search with two strategies in the acceptance criterion for the tree t-spanner problem”, International Transactions in Operational Research, vol 33, 2670-2687, Wiley (Impact factor: 2.9)

  2. Manisha Israni and Shyam Sundar (2024), “An Iterative Local Search for the Single Machine Scheduling Problem with Periodic Machine Availability”, SN Computer Science, vol 6, 108, Springer (Scopus)

  3. Manisha Israni and Shyam Sundar (2023), “An artificial bee colony algorithm for the minimum edge-dilation K-center problem”, Soft Computing, vol 28, 8497-8511, 2023, Springer (Impact factor: 2.5)

  4. Manisha Israni and Shyam Sundar (2023), “An Iterated Local Search for the Minimum Edge-Dilation K-Center Problem”, SN Computer Science, vol 4, 781, Springer (Scopus)

  5. Punit Kumar Chaubey and Shyam Sundar (2023), ”A Steady-State Genetic Algorithm for the Single Machine Scheduling Problem with Periodic Machine Availability”, SN Computer Science, vol 4, 651, Springer (Scopus)

  6. Punit Kumar Chaubey and Shyam Sundar (2023): Two phases of metaheuristic techniques for the minimum conflict weighted spanning tree problem, Applied Soft Computing, 138, 110205 , Elsevier [Journal Impact Factor: 6.6]

  7. Sudishna Ghoshal and Shyam Sundar (2023): A Steady-State Grouping Genetic Algorithm for the Rainbow Spanning Forest Problem, SN Computer Science,  25, 11289–11305, Springer (Scopus)

  8. Sudishna Ghoshal and Shyam Sundar (2021): Two approaches for the min-degree constrained minimum spanning tree problem. Applied Soft Computing, Elsevier, 111, 107715 [Journal Impact Factor: 6.6]

  9. Kavita Singh and Shyam Sundar (2021): Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem, Soft Computing, 25, 11289–11305, Springer [Journal Impact Factor: 2.5]

  10. Sudishna Ghoshal and Shyam Sundar (2020): Two heuristics for the rainbow spanning forest problem. European Journal of Operational Research, 285, 853-864  , Elsevier [Journal Impact Factor: 6.0]

  11. Kavita Singh and Shyam Sundar (2020): A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem. Soft Computing, vol 24, 2169–2186 , Springer  [Journal Impact Factor: 2.5]

  12. Kavita Singh and Shyam Sundar (2019): A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem. European Journal of Operational Research, 276, 88-105, Elsevier [Journal Impact Factor: 6.0]

  13. Kavita Singh and Shyam Sundar (2018): A new hybrid genetic algorithm for the maximally diverse grouping problem. International Journal of Machine Learning and Cybernetics,  10, 2921–2940  Springer [ Journal Impact Factor: 2.7 ]

  14. Kavita Singh and Shyam Sundar (2018):  Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t-spanner problem. Applied Soft Computing 62, 110-118, Elsevier [Journal Impact Factor: 6.6]

  15. Kavita Singh and Shyam Sundar (2018): Two new heuristics for the dominating tree problem. Applied Intelligence, 48, 2247–2267  Springer [Journal Impact Factor: 3.5]

  16. Shyam Sundar and Alok Singh (2017): Two Grouping-Based Metaheuristics for Clique Partitioning Problem. Applied Intelligence 47, 430-442, Springer [ Journal Impact Factor: 3.5 ]

  17. Sachchidanand Chaurasia, Shyam Sundar and Alok Singh (2016): Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates. Operational Research: An International Journal, 17, 275-295, Springer [Journal Impact Factor: 2.7]

  18. Shyam Sundar, P.N. Suganthan, T.J. Chua, T.X. Cai and C.S. Chong (2015): A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint, Soft Computing 21 (5), 1193-1202, Springer [ Journal Impact Factor: 2.5 ]

  19.  Sachchida Nand Chaurasia, Shyam Sundar and Alok Singh (2015): A hybrid evolutionary approach for set packing problem. OPSEARCH, 52, 271-284, Springer [ Journal Impact Factor: 1.8 ]

  20. Shyam Sundar and Alok Singh (2015): Metaheuristic approaches for the blockmodel problem. IEEE Systems Journal, 9, 1237-1247, IEEE [Journal Impact Factor: 4.4]

  21. André Rossi, Alok Singh and Shyam Sundar (2014): Cutting-Plane-Based Algorithms for Two Branch Vertices Related Spanning Tree Problems. Optimization and Engineering 15, 855-887, Springer [Journal Impact Factor: 1.7]

  22. Shyam Sundar and Alok Singh (2013): New heuristic approaches for the dominating tree problem. Applied Soft Computing 13, 4695-4703, Elsevier [ Journal Impact Factor: 6.6 ]

  23. Shyam Sundar, Alok Singh and André Rossi (2012): New heuristics for two bounded-degree spanning tree problems. Information Sciences 195, 226-240, Elsevier [Journal Impact Factor: 6.8]

  24. Shyam Sundar and Alok Singh (2012): A swarm intelligence approach to the early/tardy scheduling problem. Swarm and Evolutionary Computation, Elsevier 4, 25-32 [Journal Impact Factor: 8.5]

  25. Shyam Sundar and Alok Singh (2012): A hybrid heuristic for the set covering problem. Operational Research: An International Journal, 12,345-365, Springer [ Journal Impact Factor: 2.7 ]

  26. Alok Singh and Shyam Sundar (2011): An artificial bee colony algorithm for the minimum routing cost spanning tree problem. Soft Computing, Springer 15, 2489-2499 [Journal Impact Factor: 2.5]

  27. Shyam Sundar and Alok Singh (2010): A swarm intelligence approach to the quadratic minimum spanning tree problem. Information Sciences, Elsevier 180, 3182-3191 [ Journal Impact Factor: 6.8 ]


Conference Publications

 

  1. Punit Kumar Chaubey and Shyam Sundar, “Minimizing the weight of conflict-free spanning trees: an extension of hybrid steady-state genetic algorithm using variable neighborhood search”, 7th International Conference on Soft Computing and Its Engineering Applications, icSoftComp 2025, CCIS 2875, 377-388, Springer, 9-11 December 2025, Hanoi, Vietnam

  2. Manisha Israni and Shyam Sundar, ”Variable neighborhood search for the tree t-spanner problem”, 7th International Conference on Soft Computing and Its Engineering Applications, icSoftComp 2025, CCIS 2873, 18-28, Springer, 9-11 December 2025, Hanoi, Vietnam

  3. Sudishna Ghoshal and Shyam Sundar (2021): An iterated local search algorithm for the degree-constrained minimum spanning tree problem. Proceedings of the 3rd International Conference on Sustainable and Innovative Solutions for Current Challenges in Engineering & Technology (ICSISCET 2021), 247-258, Springer, 13-14 November 2021, Gwalior, India

  4. Sudishna Ghoshal and Shyam Sundar (2021): A hybrid artifical bee colony algorithm for the degree-constrained minimum spanning tree problem. Proceedings of the 3rd International Conference on Data Science, Machine Learning & Applications (ICDSMLA 2021), 671-680, Springer-Verlag, 26 December 2021, Pune, India

  5. Shyam Sundar (2019): A hybrid ant colony optimization approach for the cyclic antibandwidth problem. 6th International Conference on Control, Decision, and Information Technologies (CODIT'19), IEEE, 23-26 April 2019, Paris, France

  6. André Rossi, Alok Singh and Shyam Sundar (2013): Properties and exact solution approaches for the minimum cost dominating tree problem. International Conference on Distributed Computing and Internet Technology (ICDCIT 2018), LNCS 10722, pages 3-26, Springer-Verlag 2018, Bhubaneshwar, India

  7. Kavita Singh and Shyam Sundar (2017): A heuristic for the degree-constrained minimum spanning tree problem. 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI 2018), ACM 742, 351-363, 24-25 March 2018, Phuket, Thailand

  8. Shyam Sundar (2017): A steady-state genetic algorithm for the tree t-spanner problem. 2nd International Conference on Soft Computing: Theories and Applications (SoCTA 2017), AISC 742, 387-398, Springer, 22-24 December 2017, Jhansi, India

  9. Kavita Singh and Shyam Sundar (2017): A heuristic for the degree-constrained minimum spanning tree problem. 2nd International Conference on Soft Computing: Theories and Applications (SoCTA 2017), AISC 742, 351-363, Springer, 22-24 December 2017, Jhansi, India

  10. Kavita Singh and Shyam Sundar (2017): A new heuristic for degree-constrained minimum spanning tree problem. International Conference on Computational Intelligence: Theories, Applications and Future Directions (ICCI 2017), AISC 798, 149-160, Springer, 6-8 December 2017, IIT Kanpur, India

  11. Manisha Israni and Shyam Sundar (2017): Ant colony optimization approaches for the tree t-spanner problem. 9th International Joint Conference on Computational Intelligence (IJCCI 2017), SCITEPRESS 200-206, 1-3 November 2017, Funchal, Portugal

  12. Shyam Sundar, Sachchidanand Chaurasia and Alok Singh (2015). An ant colony optimization approach for the dominating tree problem. International conference on Swarm, Evolutionary and Memetic Computing (SEMCCO-2015), LNCS 9873, 143-153, Springer, 18-19 December 2015, Hyderabad, India 

  13. Shyam Sundar (2014). A steady-state genetic algorithm for the dominating tree problem. Proceedings of The Tenth International Conference on Simulated Evolution And Learning (SEAL 2014), LNCS 8886, 48-57, Springer, 15-18 December 2014, Dunedin, New Zealand

  14. Shyam Sundar, P. N. Suganthan and T. J. Chua (2013). A swarm intelligence approach to flexible job-shop scheduling problem with no-wait constraint in remanufacturing. Proceedings of the 12th International Conference on Artificial Intelligence and Soft Computing, (ICAISC 2013), LNAI 7895, 593-602, Springer, 9-13 June 2013, Zakopane, Poland

  15. Shyam Sundar and Alok Singh (2010). A swarm intelligence approach to the quadratic multiple knapsack problem. Proceedings of the 17th International Conference on Neural Information Processing (ICONIP 2010), LNCS 6443, 626-633, Springer, 22-25 November 2010, Sydney, Australia

  16. Shyam Sundar, Alok Singh and André Rossi (2010). An artificial bee colony algorithm for the 0-1 multidimensional knapsack problem. Proceedings of the Third International Conference on Contemporary Computing (IC3 2010), CCIS 94, 141-151, Springer, 9-11 August 2010, NOIDA, India

Other Info.

Professional Exposure and Outreach Activities

  • Post-Doctoral Fellow at Nanyang Technological University, Singapore (May 2012 – May 2013)

  • Assistant Professor (2013-2018) and Associate Professor (2018-till date) in the Department of Computer Applications, NIT Raipur

  • Editorial Board member of the Applied Soft Computing journal (Q1 Journal), Elsevier

  • Reviewer for the various journals such as IEEE Transactions on Cybernetics, European Journal of Operation Research (Elsevier), Applied Soft Computing (Elsevier), Computers & Operations Research (Elsevier), Swarm and Evolutionary Computation (Elsevier),  Soft Computing (Springer), Information Sciences (Elsevier)