Jump to content

Kalyanmoy Deb

Add links
From Wikipedia, the free encyclopedia

Kalyanmoy Deb
Born
Tripura, India
Academic background
Alma materIIT Kharagpur, University of Alabama
ThesisBinary and Floating-Point Function Optimization using Messy Genetic Algorithms (1991)
Doctoral advisorDavid E. Goldberg
Academic work
DisciplineMultiobjective optimization and evolutionary algorithms
InstitutionsDepartment 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 IIT Kanpur in 1997 and the Computational Optimization and Innovation (COIN) Laboratory at Michigan State in 2013.[3][4] In 2001, Wiley published a textbook written by Deb titled Multi-Objective Optimization using Evolutionary Algorithms as part of its series titled "Systems and Optimization".[5] In an analysis of the network of authors in the academic field of evolutionary computation by Carlos Cotta and Juan-Julián Merelo, Deb was identified as one of the most central authors in the community and was designated as a "sociometric superstar" of the field.[6] Deb has several honors, including the Shanti Swarup Bhatnagar award in engineering sciences (2005), the Thomson Citation Laureate award for his highly cited research in computer science (1996–2005), and the MCDM Edgeworth-Pareto Award for a record of creativity to the extent that the field of multiple-criteria decision making would not exist in its current form in 2008. Deb has been awarded the Infosys Prize in Engineering and Computer Science from Infosys Limited, Bangalore, India for his contributions to evolutionary multi-objective optimization, which have led to "advances in non-linear constraints, decision uncertainty, programming and numerical methods, computational efficiency of large-scale problems, and optimization algorithms."[7] He is also a recipient of the 2012 TWAS Prize from the World Academy of Sciences.[8]

Background and career

[edit]

Deb 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.[9] His PhD advisor was David E. Goldberg,[10] and his PhD thesis was titled Binary and Floating-Point Function Optimization using Messy Genetic Algorithms.[11] 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 the Michigan State University, where has been the Herman E. & Ruth J. Koenig Endowed Chair since 2013.

Research

[edit]

NSGA

[edit]

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

[edit]

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

[edit]

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

[edit]
  • 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

[edit]
  1. ^ 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).
  2. ^ Faster compared to Srinivas and Deb's implementation in NSGA (1994).
  3. ^ See also the section Elitist selection in the Selection (genetic algorithm) page.
  4. ^ 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.
  5. ^ Many-objective optimization is a subfield of multiobjective optimization focusing on problems that have a large number of constraints (four or more constraints).

References

[edit]
  1. ^ "Kalyanmoy Deb". Honored Faculty - Michigan State University. Retrieved 17 January 2022.
  2. ^ "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.
  3. ^ "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.
  4. ^ "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.
  5. ^ Smith, Alice E. (October 2002). "Book Reviews: Multi-Objective Optimization Using Evolutionary Algorithms" (PDF). IEEE Transactions on Evolutionary Computation. 6 (5). IEEE: 526. doi:10.1109/TEVC.2002.804322. ISSN 1089-778X. S2CID 2867089. Archived (PDF) from the original on 13 August 2015. Retrieved 13 August 2015.
  6. ^ Cotta, Carlos; Merelo, Juan-Julián (3 December 2013). "The Complex Network of Evolutionary Computation Authors: an Initial Study". arXiv:physics/0507196.
  7. ^ "Infosys Prize - Laureates 2011 - Prof. Kalyanmoy Deb". Infosys Science Foundation. Retrieved 17 January 2022.
  8. ^ "Prizes and Awards". The World Academy of Sciences. 2016.
  9. ^ "Kalyanmoy Deb's Resume" (PDF). Kalyanmoy Deb's webpage. Retrieved 17 January 2022.
  10. ^ Goldberg, David E. "Curriculum Vitae" (PDF). ThreeJoy. Retrieved 17 January 2022.
  11. ^ Deb, Kalyanmoy (1991). Binary and Floating-Point Function Optimization using Messy Genetic Algorithms. ProQuest 303943729 – via ProQuest.
  12. ^ Goldberg, David E. (1989). Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley. p. 201. ISBN 0-201-15767-5.
  13. ^ Srinivas, N.; Deb, Kalyanmoy (1994). "Multiobjective optimization using nondominated sorting in genetic algorithms". Evolutionary Computation. 2 (3): 221–248. doi:10.1162/evco.1994.2.3.221. S2CID 13997318.
  14. ^ Seshadri, Aravind. "NSGA - II: A multi-objective optimization algorithm". MathWorks File Exchange. Retrieved 17 January 2022.
  15. ^ Kumar, Nitin; Panwar, Yatish; Mahesh, G. (10 May 2015). "Indian paper crosses 5000+ citations mark" (PDF). Current Science. 108 (9). Current Science Association: 1580. ISSN 0011-3891. Archived (PDF) from the original on 11 August 2015. Retrieved 11 August 2015.
  16. ^ Mudur, G.S. (11 May 2015). "6000-citation feat by 4 Indian researchers". The Telegraph. Calcutta, India. Archived from the original on 22 July 2015. Retrieved 11 August 2015.
  17. ^ Deb, Kalyanmoy; Jain, Himanshu (2013). "An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints". IEEE Transactions on Evolutionary Computation. 18 (4): 577–601. doi:10.1109/TEVC.2013.2281535. S2CID 206682597.
  18. ^ "Global computing association names 57 fellows for outstanding contributions that propel technology today". Association for Computing Machinery. 18 January 2023. Retrieved 18 January 2023.
[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Kalyanmoy_Deb&oldid=1245484718"