Kalyanmoy Deb
Kalyanmoy Deb | |
---|---|
Born | Tripura, India |
Academic background | |
Alma mater | IIT Kharagpur, University of Alabama |
Thesis | Binary and Floating-Point Function Optimization using Messy Genetic Algorithms (1991) |
Doctoral advisor | David E. Goldberg |
Academic work | |
Discipline | Multiobjective optimization and evolutionary algorithms |
Institutions | Department of Electrical and Computer Engineering, Michigan State University |
Kalyanmoy Deb is an Indian computer scientist. Deb is the Herman E. & Ruth J. Koenig Endowed Chair Professor in the Department of Electrical and Computing Engineering at Michigan State University.[1] Deb is also a professor in the Department of Computer Science and Engineering and the Department of Mechanical Engineering at Michigan State University.[2]
Deb established the Kanpur Genetic Algorithms Laboratory at
Background and career
Deb received his B.Tech. in
Research
NSGA
Deb is a highly cited researcher, with 138,000+ Google Scholar citations and an h-index of 116. 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]
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".
Awards
This section of a biography of a living person does not include any references or sources. (January 2022) |
- Humboldt Fellow, AvH, Germany (1998)
- Friedrich Wilhelm Bessel Award, AvH, Germany (2003)
- Shanti Swarup Bhatnagar (2005)
- Finnish Distinguished Professor (FiDiPro) (2007–2009)
- Edgeworth-Pareto Award (2008)
- Infosys Awards (2010)
- J.C.Bose National Fellow (2011)
- IEEE Fellow (2011)
- CajAstur "Mamdani" Prize, European Soft Computing Center (2011)
- The World Academy of Sciences (2012)
- Honorary Doctorate Degree, Univ. of Jyvaskyla, Finland (2013)
- ACM Fellow (2022)[18]
Notes
- ^ Previous nondominated-sorting genetic algorithms had been introduced by Carlos M. Fonseca and Peter J. Fleming (Genetic algorithms for multiobjective optimization: formulation, discussion and generalization, 1993) and Jeffrey Horn (Northern Michigan University), Nicholas Nafpliotis, and David E. Goldberg (A niched Pareto genetic algorithm for multiobjective optimization, 1994).
- ^ Faster compared to Srinivas and Deb's implementation in NSGA (1994).
- ^ See also the section Elitist selection in the Selection (genetic algorithm) page.
- ^ Incorporating the faster implementation of nondominated sorting and elitist selection made the algorithm faster. Incorporating crowding distance and elitist selection made the algorithm more reliable.
- ^ Many-objective optimization is a subfield of multiobjective optimization focusing on problems that have a large number of constraints (four or more constraints).
References
- ^ "Kalyanmoy Deb". Honored Faculty - Michigan State University. Retrieved 17 January 2022.
- ^ "Kalyanmoy Deb named Koenig endowed chair at Michigan State University". Michigan State University, College of Engineering. Michigan State University. 21 August 2013. Retrieved 17 January 2022.
- ^ "Kanpur Genetic Algorithms Laboratory". Kanpur Genetic Algorithms Laboratory. Indian Institute of Technology, Kanpur. 2005. Archived from the original on 30 September 2014. Retrieved 13 August 2015.
- ^ "Computational Optimization and Innovation Laboratory (COIN Lab)". Michigan State University, College of Engineering. Archived from the original on 9 March 2015. Retrieved 11 August 2015.
- (PDF) from the original on 13 August 2015. Retrieved 13 August 2015.
- arXiv:physics/0507196.
- ^ "Infosys Prize - Laureates 2011 - Prof. Kalyanmoy Deb". Infosys Science Foundation. Retrieved 17 January 2022.
- ^ "Prizes and Awards". The World Academy of Sciences. 2016.
- ^ "Kalyanmoy Deb's Resume" (PDF). Kalyanmoy Deb's webpage. Retrieved 17 January 2022.
- ^ Goldberg, David E. "Curriculum Vitae" (PDF). ThreeJoy. Retrieved 17 January 2022.
- ProQuest 303943729– via ProQuest.
- ISBN 0-201-15767-5.
- S2CID 13997318.
- ^ Seshadri, Aravind. "NSGA - II: A multi-objective optimization algorithm". MathWorks File Exchange. Retrieved 17 January 2022.
- (PDF) from the original on 11 August 2015. Retrieved 11 August 2015.
- The Telegraph. Calcutta, India. Archived from the originalon 22 July 2015. Retrieved 11 August 2015.
- S2CID 206682597.
- ^ "Global computing association names 57 fellows for outstanding contributions that propel technology today". Association for Computing Machinery. 18 January 2023. Retrieved 18 January 2023.