Journals
1. Soumen Atta, Priya Ranjan Sinha Mahapatra and Anirban Mukhopadhyay (2018). Solving maximal covering location problem using genetic algorithm with local refinement. Soft Computing, Springer, Vol. 22, No. 12, pp. 3891-3906.
(SCI-E indexed, Impact Factor: 3.050) (Download Link)
2. Soumen Atta, Stanisław Goldstein and Priya Ranjan Sinha Mahapatra (2017). No-hole λ-L (k, k − 1, . . . , 2 , 1)-labeling for Square Grid. Bulletin de la Societe des Sciences et des Lettres de Łódź. Serie: Recherches sur les Deformations, Poland, Vol. 63, No. 3, pp. 9-19.
(MathSciNet indexed) (Download Link-1, Download Link-2, Download Link-3)
3. Soumen Atta, Priya Ranjan Sinha Mahapatra (2018). Perturbation-Minimizing Frequency Assignment to Address Short Term Demand Fluctuation in Cellular Network. International Journal of Communication Networks and Distributed Systems, InderScience, Vol. 21, No. 3, pp. 418-443.
(E-SCI indexed) (Download Link)
4. Soumen Atta, Priya Ranjan Sinha Mahapatra and Anirban Mukhopadhyay (2019). Solving Tool Indexing Problem using Harmony Search Algorithm with Harmony Refinement. Soft Computing, Springer, Vol. 23, No. 16, pp. 7407–7423. (Download Link)
(Supplementary web-page for this article can be found here.)
(SCI-E indexed, Impact Factor: 3.050)
5. Soumen Atta, Priya Ranjan Sinha Mahapatra (2018). L(D,2,1)-labeling of Square Grid. National Academy Science Letters, Springer, Vol. 42, No. 6, pp. 485–487. (Download Link)
(SCI-E indexed, Impact Factor: 0.519)
6. Soumen Atta, Priya Ranjan Sinha Mahapatra and Anirban Mukhopadhyay (2019). Multi-objective Uncapacitated Facility Location Problem with Customers' Preferences: Pareto-based and Weighted Sum GA-based Approaches. Soft Computing, Springer, Vol. 23, No. 23, pp. 12347–12362. (Download Link)
(Supplementary web-page for this article can be found here.)
(SCI-E indexed, Impact Factor: 3.050)
7. Soumen Atta, Priya Ranjan Sinha Mahapatra and Anirban Mukhopadhyay (2019). Solving Uncapacitated Facility Location Problem Using Heuristic Algorithms. International Journal of Natural Computing Research (IJNCR), IGI Global, Vol. 8, No. 2, pp. 18-50. (Download Link)
8. Soumen Atta, Priya Ranjan Sinha Mahapatra (2019). Population Based Improvement Heuristic with Local Search for Single Row Facility Layout Problem. Sādhanā, Springer, Vol. 44:222, pp. 1-19, doi="10.1007/s12046-019-1203-0". (Download Link)
(SCI-E indexed, Impact Factor: 0.849)
9. Soumen Atta, Goutam Sen (2020). Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approach. Applied Intelligence, Springer, Vol. 50, No. 5, pp. 1573-1589. (Download Link)
(Supplementary web-page for this article can be found here / here.)
(SCI indexed, Impact Factor: 3.325)
10. Soumen Atta, Goutam Sen (2021). A new variant of the p-hub location problem with a ring backbone network for content placement in VoD services. Computers & Industrial Engineering, Elsevier, Vol. 159, Article 107432. (Download Link)
(Supplementary web-page for this article can be found here.)
(SCI indexed, Impact Factor: 5.431)
11. Soumen Atta, Priya Ranjan Sinha Mahapatra and Anirban Mukhopadhyay (2021). A multi-objective formulation of maximal covering location problem with customers’ preferences: Exploring Pareto optimality-based solutions. Expert Systems With Applications, Elsevier, Vol. 186, Article 115830. (Download Link)
(Supplementary web-page for this article can be found here.)
(SCI-E indexed, Impact Factor: 6.954)
12. Soumen Atta, Priya Ranjan Sinha Mahapatra and Anirban Mukhopadhyay (2022). Solving a new variant of capacitated maximal covering location problem with fuzzy coverage area using metaheuristic approaches. Computers & Industrial Engineering, Elsevier, Vol. 170, Article 108315. (Download Link)
(Supplementary web-page for this article can be found here.)
(SCI indexed, Impact Factor: 5.431)
13. Soumen Atta (2023). An improved harmony search algorithm using opposition-based learning and local search for solving the maximal covering location problem. Engineering Optimization, Taylor & Francis. (Published online: 05 Sep 2023) (Download Link)