imported>Citation bot Add: s2cid, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Abductive | Category:Wikipedia articles with RID identifiers | via #UCB_Category 1701/2422 |
robot: Update article (please report if you notice any mistake or error in this edit) |
||
| Line 1: | Line 1: | ||
{{Short description|Indian computer scientist academic}} | |||
{{Use dmy dates|date=December 2018}} | {{Use dmy dates|date=December 2018}} | ||
{{Use Indian English|date=December 2018}} | {{Use Indian English|date=December 2018}} | ||
{{Infobox | {{Infobox academic | ||
| name = Kalyanmoy Deb | | name = Kalyanmoy Deb | ||
| image = | | image = | ||
| caption = | | caption = | ||
| birth_place = [[Tripura]], | | birth_place = [[Tripura]], India | ||
| discipline = [[Multi-objective optimization|Multiobjective optimization]] and [[evolutionary algorithm]]s | |||
| | |||
| work_institution = Department of Electrical and Computer Engineering, [[Michigan State University]] | | work_institution = Department of Electrical and Computer Engineering, [[Michigan State University]] | ||
| alma_mater = [[IIT Kharagpur]], [[University of Alabama | | alma_mater = [[IIT Kharagpur]], [[University of Alabama]] | ||
| | | awards = | ||
| thesis_title = Binary and Floating-Point Function Optimization using Messy Genetic Algorithms | |||
| thesis_year = 1991 | |||
| doctoral_advisor = [[David E. Goldberg]] | |||
}} | }} | ||
'''Kalyanmoy Deb''' is an [[ | '''Kalyanmoy Deb''' is an Indian [[computer scientist]]. Deb is the Herman E. & Ruth J. Koenig Endowed Chair in Communication Systems in the Department of Electrical and Computing Engineering at [[Michigan State University]].<ref>{{cite web |title=Kalyanmoy Deb |url=https://msu.edu/honoredfaculty/directory/deb-kalyanmoy.html |website=Honored Faculty - Michigan State University |access-date=17 January 2022}}</ref> Deb is also a professor in the Department of Computer Science and Engineering and the Department of Mechanical Engineering at [[Michigan State University]].<ref>{{Cite web|title = Kalyanmoy Deb named Koenig endowed chair at Michigan State University|url = https://www.egr.msu.edu/news/2013/08/21/kalyanmoy-deb-named-koenig-endowed-chair-michigan-state-university|access-date = 17 January 2022|date = 21 August 2013|website = Michigan State University, College of Engineering|publisher = [[Michigan State University]]|url-status = live}}</ref> | ||
Deb established the Kanpur Genetic Algorithms Laboratory at | Deb established the Kanpur Genetic Algorithms Laboratory at [[Indian Institute of Technology Kanpur|IIT Kanpur]] in 1997 and the Computational Optimization and Innovation (COIN) Laboratory at [[Michigan State University|Michigan State]] in 2013.<ref>{{Cite web|title = Kanpur Genetic Algorithms Laboratory|url = http://www.iitk.ac.in/kangal/kangal.shtml|website = Kanpur Genetic Algorithms Laboratory|access-date = 13 August 2015|archive-url = https://web.archive.org/web/20140930150357/http://www.iitk.ac.in/kangal/kangal.shtml|archive-date = 30 September 2014|url-status = live|publisher = Indian Institute of Technology, Kanpur|year = 2005}}</ref><ref>{{Cite web|title = Computational Optimization and Innovation Laboratory (COIN Lab)|url = http://www.egr.msu.edu/~kdeb|website = Michigan State University, College of Engineering|access-date = 11 August 2015|archive-url = https://web.archive.org/web/20150309131716/http://www.egr.msu.edu/~kdeb/COIN.shtml|archive-date = 9 March 2015|url-status = live}}</ref> In 2001, [[John Wiley & Sons|Wiley]] published a textbook written by Deb titled ''Multi-Objective Optimization using Evolutionary Algorithms'' as part of its series titled "Systems and Optimization".<ref>{{Cite journal|url = http://ieeexplore.ieee.org/ielx5/4235/22327/01041561.pdf|title = Book Reviews: Multi-Objective Optimization Using Evolutionary Algorithms|last = Smith|first = Alice E.|date = October 2002|journal = IEEE Transactions on Evolutionary Computation|doi = 10.1109/TEVC.2002.804322|access-date = 13 August 2015|volume = 6|issue = 5|page = 526|archive-url = https://web.archive.org/web/20150813001946/http://ieeexplore.ieee.org/ielx5/4235/22327/01041561.pdf|archive-date = 13 August 2015|url-status = live|issn = 1089-778X|publisher = IEEE|s2cid = 2867089}}</ref> 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 [[centrality|central]] authors in the community and was designated as a "[[Sociometry|sociometric]] superstar" of the field.<ref>{{Cite arXiv |eprint=physics/0507196|title = The Complex Network of Evolutionary Computation Authors: an Initial Study|date = 3 December 2013|last1 = Cotta|first1 = Carlos|last2 = Merelo|first2 = Juan-Julián}}</ref> Deb has several honors, including the [[Shanti Swarup Bhatnagar Award|Shanti Swarup Bhatnagar award]] in engineering sciences (2005), the [[Thomson Reuters Citation Laureates|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 analysis|multiple-criteria decision making]] would not exist in its current form in 2008. Deb has been awarded the [[Infosys Prize|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 [[Mathematical optimization#Optimization algorithms|optimization algorithms]]."<ref>{{Cite web|title = Infosys Prize - Laureates 2011 - Prof. Kalyanmoy Deb |url = https://www.infosys-science-foundation.com/prize/laureates/2011/kalyanmoy-deb.asp |website = Infosys Science Foundation |access-date = 2022-01-17}}</ref> He is also a recipient of the 2012 [[TWAS Prize]] from the [[The World Academy of Sciences|World Academy of Sciences]].<ref name="Prizes and Awards">{{Cite web |url=http://twas.org/article/2012-twas-prize-winners-announced |title=Prizes and Awards |date=2016 |publisher=The World Academy of Sciences}}</ref> | ||
Deb | ==Background and career== | ||
Deb received his B.Tech. in [[Mechanical engineering|Mechanical Engineering]] (1985) from [[IIT Kharagpur]] and his MS (1989) and PhD (1991) in Engineering Mechanics from the [[University of Alabama]].<ref>{{cite web| url=https://www.egr.msu.edu/~kdeb/deb_resume.pdf |title=Kalyanmoy Deb's Resume |website=Kalyanmoy Deb's webpage |access-date=17 January 2022}}</ref> His PhD advisor was [[David E. Goldberg]],<ref>{{cite web |last1=Goldberg |first1=David E. |title=Curriculum Vitae |url=https://threejoy.com/wp-content/uploads/2019/10/Dave-Goldberg-Vita.pdf |website=ThreeJoy |access-date=17 January 2022}}</ref> and his PhD thesis was titled ''Binary and Floating-Point Function Optimization using Messy Genetic Algorithms''.<ref name=thesis>{{cite book |last1=Deb |first1=Kalyanmoy |title=Binary and Floating-Point Function Optimization using Messy Genetic Algorithms |date=1991 |url=https://www.proquest.com/docview/303943729|via=ProQuest |id={{ProQuest|303943729}} }}</ref> From 1991 to 1992 he was a postdoc at [[University of Illinois at Urbana-Champaign|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== | ||
< | ===NSGA=== | ||
Deb is a highly cited researcher, with 138,000+ Google Scholar citations and an [[h-index|''h''-index]] of 116. A large fraction of his citations come from his work on [[Pareto efficiency|nondominated]]-sorting<ref>{{cite book |last1=Goldberg |first1=David E. |title=Genetic Algorithms in Search, Optimization & Machine Learning |date=1989 |publisher=Addison-Wesley |isbn=0-201-15767-5 |page=201}}</ref> [[genetic algorithm]]s for [[Multi-objective optimization|multiobjective optimization]]. In 1994, Deb and coauthor Nidamarthi Srinivas introduced one of<ref group=note>Previous [[Pareto efficiency|nondominated]]-sorting [[genetic algorithm]]s 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).</ref> the first [[Pareto efficiency|nondominated]]-sorting [[genetic algorithm]]s, which they termed "NSGA".<ref name=NSGA>{{cite journal |last1=Srinivas |first1=N. |last2=Deb |first2=Kalyanmoy |title=Multiobjective optimization using nondominated sorting in genetic algorithms |journal=Evolutionary Computation |date=1994 |volume=2 |issue=3 |pages=221–248|doi=10.1162/evco.1994.2.3.221 |s2cid=13997318 }}</ref> | |||
===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 [[Genetic algorithm#Methodology|individual]], which "calculates a measure of how close an individual is to its neighbors."<ref>{{cite web |last1=Seshadri |first1=Aravind |title=NSGA - II: A multi-objective optimization algorithm |url=https://www.mathworks.com/matlabcentral/fileexchange/10429-nsga-ii-a-multi-objective-optimization-algorithm |website=MathWorks File Exchange |access-date=17 January 2022}}</ref> They also introduced a faster<ref group=note>Faster compared to Srinivas and Deb's implementation in NSGA (1994).</ref> way to implement [[Pareto efficiency|nondominated]] sorting, by for every [[Genetic algorithm#Methodology|individual]] keeping track of which other [[Genetic algorithm#Methodology|individuals]] it [[Pareto efficiency|strictly dominates]]. By incorporating crowding distance, [[Genetic algorithm#Elitism|elitism]],<ref group=note>See also the section [[Selection (genetic algorithm)#Elitist selection|Elitist selection]] in the [[Selection (genetic algorithm)]] page.</ref> and the faster implementation of [[Pareto efficiency|nondominated]] sorting into the original NSGA, Deb and his coauthors modified the original NSGA and made it faster and more reliable.<ref group=note>Incorporating the faster implementation of [[Pareto efficiency|nondominated]] sorting and [[Genetic algorithm#Elitism|elitist]] [[Selection (genetic algorithm)|selection]] made the algorithm faster. Incorporating crowding distance and [[Genetic algorithm#Elitism|elitist]] [[Selection (genetic algorithm)|selection]] made the algorithm more reliable.</ref> 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.<ref>{{Cite journal|url = http://www.currentscience.ac.in/Volumes/108/09/1580.pdf|title = Indian paper crosses 5000+ citations mark|last1 = Kumar|first1 = Nitin|date = 10 May 2015|journal = [[Current Science]]|access-date = 11 August 2015|issn = 0011-3891|last2 = Panwar|first2 = Yatish|last3 = Mahesh|first3 = G.|publisher = Current Science Association|volume = 108|issue = 9|page = 1580|archive-url = https://web.archive.org/web/20150811083706/http://www.currentscience.ac.in/Volumes/108/09/1580.pdf|archive-date = 11 August 2015|url-status = live}}</ref><ref>{{Cite web|title = 6000-citation feat by 4 Indian researchers|url = http://www.telegraphindia.com/1150511/jsp/nation/story_19384.jsp|access-date = 11 August 2015|last = Mudur|first = G.S.|newspaper = [[The Telegraph (Calcutta)|The Telegraph]]|date = 11 May 2015|location = Calcutta, India|archive-url = https://web.archive.org/web/20150722151609/http://www.telegraphindia.com/1150511/jsp/nation/story_19384.jsp|archive-date = 22 July 2015|url-status = live}}</ref> | |||
===NSGA-III=== | |||
In 2013, Deb and coauthor Himanshu Jain proposed a modification of NSGA-II for solving many-objective optimization problems with 10+ objectives.<ref group=note>''Many-objective optimization'' is a subfield of [[Multi-objective optimization|multiobjective optimization]] focusing on problems that have a large number of constraints (four or more constraints).</ref><ref>{{cite journal |last1=Deb |first1=Kalyanmoy |last2=Jain |first2=Himanshu |title=An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints |journal=IEEE Transactions on Evolutionary Computation |date=2013 |volume=18 |issue=4 |pages=577–601|doi=10.1109/TEVC.2013.2281535 |s2cid=206682597 }}</ref> They termed this modification "NSGA-III". | |||
==Awards== | |||
{{BLP unsourced section|date=January 2022}} | |||
*Shanti Swarup Bhatnagar (2005) | |||
*Infosys Awards (2010) | |||
*J.C.Bose National Fellow (2011) | |||
*IEEE Fellow (2011) | |||
*ACM Sr. Member (2012) | |||
*Edgeworth-Pareto Award (2008) | |||
*Honorary Doctorate Degree, Univ. of Jyvaskyla, Finland (2013) | |||
*The World Academy of Sciences (2012) | |||
*CajAstur "Mamdani" Prize, European Soft Computing Center (2011) | |||
*Finish Distinguished Professor (FiDiPro) (2007–2009) | |||
*Friedrich Wilhelm Bessel Award, AvH, Germany (2003) | |||
*Humboldt Fellow, AvH, Germany (1998) | |||
==Notes== | |||
{{reflist|group=note}} | |||
==References== | |||
{{reflist}} | |||
==External links== | ==External links== | ||
*[http://www.in-cites.com/media/podcasts/KalyanmoyDeb.mp3 Kalyanmoy Deb: Current Classic Paper in Engineering Podcast (November, 2010)] | *[http://www.in-cites.com/media/podcasts/KalyanmoyDeb.mp3 Kalyanmoy Deb: Current Classic Paper in Engineering Podcast (November, 2010)] | ||
*[http://www.esi-topics.com/fbp/2004/february04-KalyanmoyDeb.html Interview with Deb by ESI Special Topics] | *[http://www.esi-topics.com/fbp/2004/february04-KalyanmoyDeb.html Interview with Deb by ESI Special Topics] | ||
{{SSBPST recipients in Engineering Science}} | {{SSBPST recipients in Engineering Science}} | ||
Latest revision as of 01:53, 29 May 2022
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 in Communication Systems 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 | edit source]
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 | edit source]
NSGA[edit | edit source]
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 | edit source]
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 | edit source]
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 | edit source]
 |
- Shanti Swarup Bhatnagar (2005)
- Infosys Awards (2010)
- J.C.Bose National Fellow (2011)
- IEEE Fellow (2011)
- ACM Sr. Member (2012)
- Edgeworth-Pareto Award (2008)
- Honorary Doctorate Degree, Univ. of Jyvaskyla, Finland (2013)
- The World Academy of Sciences (2012)
- CajAstur "Mamdani" Prize, European Soft Computing Center (2011)
- Finish Distinguished Professor (FiDiPro) (2007–2009)
- Friedrich Wilhelm Bessel Award, AvH, Germany (2003)
- Humboldt Fellow, AvH, Germany (1998)
Notes[edit | edit source]
- ↑ 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[edit | edit source]
- ↑ "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.
{{cite web}}: CS1 maint: url-status (link) - ↑ "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.
- ↑ 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.
- ↑ Cotta, Carlos; Merelo, Juan-Julián (3 December 2013). "The Complex Network of Evolutionary Computation Authors: an Initial Study". 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.
- ↑ Deb, Kalyanmoy (1991). Binary and Floating-Point Function Optimization using Messy Genetic Algorithms. ProQuest 303943729 – via ProQuest.
- ↑ Goldberg, David E. (1989). Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley. p. 201. ISBN 0-201-15767-5.
- ↑ 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.
- ↑ Seshadri, Aravind. "NSGA - II: A multi-objective optimization algorithm". MathWorks File Exchange. Retrieved 17 January 2022.
- ↑ 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.
- ↑ 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.
- ↑ 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.