Kalyanmoy Deb

Deb was born in 1963 in Udaipur, Tripura, then the smallest state of India.^[6] He received his B.Tech. in Mechanical Engineering (1985) from IIT Kharagpur and his MS (1989) and PhD (1991) in Engineering Mechanics from the University of Alabama.^[7] His PhD advisor was David E. Goldberg,^[8] and his PhD thesis was titled Binary and Floating-Point Function Optimization using Messy Genetic Algorithms.^[9] From 1991 to 1992 he was a postdoc at UIUC. In 1993, he became a professor of mechanical engineering at IIT Kanpur, where he went on to hold the Deva Raj Endowed Chair (2007–2010) and the Gurmukh and Veena Mehta Endowed Chair (2011–2013). For his next position, he left for Michigan State University, where he served as the Herman E. & Ruth J. Koenig Endowed Chair Professor in the Department of Electrical and Computer Engineering,^[10] held appointments in the Department of Computer Science and Engineering and the Department of Mechanical Engineering,^[11] and was named University Distinguished Professor in 2021.^[7] Deb retired from Michigan State University in July 2026 and then moved to serve at his alma mater, the University of Alabama.

NSGA

Deb is a highly cited researcher, with 234,000+ Google Scholar citations and an h-index of 150.^[7] A large fraction of his citations come from his work on nondominated-sorting^[12] genetic algorithms for multiobjective optimization. In 1994, Deb and coauthor Nidamarthi Srinivas introduced one of^{[note 1]} the first nondominated-sorting genetic algorithms, which they termed "NSGA".^[13]

NSGA-II

In 2002, Deb and coauthors Amrit Pratap, Sameer Agarwal, and T.A.M.T. Meyarivan introduced a notion of crowding distance for an individual, which "calculates a measure of how close an individual is to its neighbors."^[14] They also introduced a faster^{[note 2]} way to implement nondominated sorting, by for every individual keeping track of which other individuals it strictly dominates. By incorporating crowding distance, elitism,^{[note 3]} and the faster implementation of nondominated sorting into the original NSGA, Deb and his coauthors modified the original NSGA and made it faster and more reliable.^{[note 4]} They termed this modification "NSGA-II". According to the Web of Science Core Collection database, this paper was the first paper solely by Indian authors to have more than 5,000 citations.^[15][16] As of 2025, the paper has accumulated over 65,000 citations.^[7]

NSGA-III

In 2013, Deb and coauthor Himanshu Jain proposed a modification of NSGA-II for solving many-objective optimization problems with 10+ objectives.^{[note 5][17]} They termed this modification "NSGA-III".

Deb is a Fellow of three Indian academies: the Indian National Academy of Engineering (2004), the Indian Academy of Sciences (2006), the Indian National Science Academy (2011). He is also a fellow of the IEEE (2012), the ASME (2014), and the ACM (2022).^[7][18][19]

He has been awarded the Infosys Prize in Engineering and Computer Science (2011) for his contributions to evolutionary multi-objective optimization,^[18] the TWAS Prize in Engineering Sciences (2012) from the World Academy of Sciences,^[20] and the IEEE Computational Intelligence Society Evolutionary Computation Pioneer Award (2018) for his sustained contributions to evolutionary multi-objective optimization.^[7][21]

Other honors include a Humboldt Fellowship (1998–1999), the Friedrich Wilhelm Bessel Research Award from the Alexander von Humboldt Foundation (2002), the Shanti Swarup Bhatnagar Prize in Engineering Sciences (2005), service as a Finland Distinguished Professor (FiDiPro) from 2007 to 2009, the MCDM Edgeworth-Pareto Award (2008) for contributions to multiple-criteria decision making, the J. C. Bose National Fellowship (2011), and an honorary doctorate from the University of Jyväskylä, Finland (2013).^[7][18]