Jump to content

Maurice Clerc (mathematician): Difference between revisions

Edit links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
JulieFr (talk | contribs)
99 edits
No edit summary
Citation bot (talk | contribs)
Bots
5,433,006 edits
Altered title. Added doi-access. Removed URL that duplicated identifier. Removed parameters. | Use this bot. Report bugs. | Suggested by Jay8g | #UCB_toolbar
 
(41 intermediate revisions by 18 users not shown)
Line 1: Line 1:
{{Short description|French mathematician}}
{{Infobox person
{{Infobox person
| name = Maurice Clerc
| name = Maurice Clerc
| image = Maurice M. Clerc color photo portrait.jpg
| image = Maurice M. Clerc color photo portrait.jpg
| birth_date = 1949/04/24
| birth_date = {{birth date and age|1949|04|24}}
| nationality = French
| nationality = French
| occupation = Mathematician and writer
| occupation = Mathematician and writer
}}
}}


'''Maurice Clerc''' is a French [[mathematician]].
== Biography ==
=== Family and et studies ===
⚫
Maurice Marcel Clerc was born on April 24, 1949. He obtained his engineering degree in 1972, at the end of his graduate studies at the [[Institut industriel du Nord]] (renamed Centrale Lille in 1991) <ref>[https://repertoire.iesf.fr/#profile/8877a7eb6ba96f5bc3e4f326c4dcd579 Répertoire des Ingénieurs et scientifiques de France].</ref>.


== Early life and education ==
⚫
=== Professional career ===
⚫
Maurice Marcel Clerc was born on April 24, 1949, in [[Besançon]]. He finished his graduate studies and obtained his engineering degree in 1972 from the [[Institut industriel du Nord]] (renamed Centrale Lille in 1991).<ref>[https://repertoire.iesf.fr/#profile/8877a7eb6ba96f5bc3e4f326c4dcd579 Répertoire des Ingénieurs et scientifiques de France].</ref>
⚫
Maurice Clerc works in the Research and Development department of [[France Télécom]].


⚫
== Professional career ==
⚫
His early work focused on fuzzy representations<ref>Maurice Clerc, François Guérin et Xavier Chanet. « Représentations floues dans un mémoriel ». dans ''JIOSC (Journées internationales d'Orsay sur les sciences cognitives)'', édité par CNRS, 211‑22. Orsay, France: CNRS, 1994.</ref>{{,}}<ref>{{cite web|title=La logique floue pour les affaires et l'industrie|url=https://www.momox-shop.fr/earl-d-cox-la-logique-floue-pour-les-afaires-et-l-industrie-taschenbuch-M02841801276.html|author=Earl D. Cox|author2=(trad.) Maurice Clerc|website=momox-shop|date=1995|access-date=2021-12-28|publication-date=}}</ref>{{,}}<ref>{{Cite journal|last=Clerc|first=Maurice|date=1996|title=Déduction en Représentation Floue Hiérarchique. Un exemple|journal=In Cognito|volume=3}}</ref>. He is then recognized as a global specialist in [[particle swarm optimization]] (PSO) <ref>{{cite book|author=M. Clerc|url=https://www.wiley.com/en-ie/Particle+Swarm+Optimization-p-9781905209040|title=Particle Swarm Optimization|date=2006|language=en|agency=[[John Wiley & Sons|Wiley]]}}</ref>{{,}}<ref>{{cite book|author=Clerc|first=Maurice|url=http://www.iste.co.uk/book.php?id=853|title=Guided Randomness in Optimization|date=2015|language=en|agency=[[International Society for Technology in Education|ISTE]]}}</ref> jointly with avec [[James Kennedy (social psychologist)|James Kennedy]]. He is, together with the latter, lead co-author of the first detailed theoretical analysis of this method<ref>{{Cite journal|last=Clerc|first=M.|last2=Kennedy|first2=J.|date=2002|title=The particle swarm - explosion, stability, and convergence in a multidimensional complex space|url=http://dx.doi.org/10.1109/4235.985692|journal=IEEE Transactions on Evolutionary Computation|volume=6|issue=1|pages=58–73|doi=10.1109/4235.985692|issn=1089-778X}}</ref>, rewarded by [[Institute of Electrical and Electronics Engineers|IEEE]] in 2005<ref>{{cite web|title=Past Recipients - IEEE Computational Intelligence Society|url=https://cis.ieee.org/getting-involved/awards/past-recipients|website=cis.ieee.org|language=en|access-date=2021-11-14|publication-date=}}.</ref>.
⚫
Maurice Clerc worked in the Research and Development department of [[France Télécom]].


⚫
His early work focused on fuzzy representations.<ref>Maurice Clerc, François Guérin et Xavier Chanet. « Représentations floues dans un mémoriel ». dans ''JIOSC (Journées internationales d'Orsay sur les sciences cognitives)'', édité par CNRS, 211‑22. Orsay, France: CNRS, 1994.</ref><ref>{{cite web|title=La logique floue pour les affaires et l'industrie|url=https://www.momox-shop.fr/earl-d-cox-la-logique-floue-pour-les-afaires-et-l-industrie-taschenbuch-M02841801276.html|author=Earl D. Cox|author2=(trad.) Maurice Clerc|website=momox-shop|date=1995|access-date=2021-12-28}}</ref><ref>{{Cite journal|last=Clerc|first=Maurice|date=1996|title=Déduction en Représentation Floue Hiérarchique. Un exemple|journal=In Cognito|volume=3}}</ref> He was later recognized as a world specialist in [[particle swarm optimization]] (PSO)<ref>{{cite book|author=M. Clerc|url=https://www.wiley.com/en-ie/Particle+Swarm+Optimization-p-9781905209040|title=Particle Swarm Optimization|date=2006|language=en|publisher=[[John Wiley & Sons|Wiley]]}}</ref><ref>{{cite book|author=Clerc|first=Maurice|url=http://www.iste.co.uk/book.php?id=853|title=Guided Randomness in Optimization|date=2015|language=en|publisher=[[International Society for Technology in Education|ISTE]]}}</ref> jointly with [[James Kennedy (social psychologist)|James Kennedy]]. He is, together with the latter, the lead co-author of the first detailed theoretical analysis of this method,<ref>{{Cite journal|last1=Clerc|first1=M.|last2=Kennedy|first2=J.|date=2002|title=The particle swarm - explosion, stability, and convergence in a multidimensional complex space|url=http://dx.doi.org/10.1109/4235.985692|journal=IEEE Transactions on Evolutionary Computation|volume=6|issue=1|pages=58–73|doi=10.1109/4235.985692|issn=1089-778X}}</ref> rewarded by [[Institute of Electrical and Electronics Engineers|IEEE]] in 2005.<ref>{{cite web|title=Past Recipients - IEEE Computational Intelligence Society|url=https://cis.ieee.org/getting-involved/awards/past-recipients|archive-url=https://web.archive.org/web/20190115181936/https://cis.ieee.org/getting-involved/awards/past-recipients|url-status=dead|archive-date=January 15, 2019|website=[[IEEE]]|language=en|access-date=2021-11-14|publication-date=}}.</ref>
This article is in fact only the format of a study published online since 1999. He outlines and demonstrates convergence theorems in a five-dimensional space and, in particular, defines the constriction concept that has been largely used since in the context of PSO.


He outlined and demonstrated convergence theorems in a five-dimensional space and, in particular, defined the constriction concept that has since been largely used in the context of PSO.<ref>{{Cite journal|last1=Tripathi|first1=Jay Prakash|last2=Ghoshal|first2=Sanjoy|date=2017-07-01|title=Combining inertia and constriction technique in the PSO applied to fault identification in a hydraulic system|url=https://doi.org/10.1177/0954406216640302|journal=Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science|language=en|volume=231|issue=14|pages=2730–2740|doi=10.1177/0954406216640302|s2cid=112219954|issn=0954-4062}}</ref><ref>{{Cite book|last1=Pranava|first1=G.|last2=Prasad|first2=P. V.|title=2013 International Conference on Power, Energy and Control (ICPEC) |chapter=Constriction Coefficient Particle Swarm Optimization for Economic Load Dispatch with valve point loading effects |date=2013|chapter-url=https://ieeexplore.ieee.org/document/6527680|pages=350–354|doi=10.1109/ICPEC.2013.6527680|isbn=978-1-4673-6030-2|s2cid=31619417}}</ref>
In the early PSO versions of the positions of particles tended to “explode” to very large values, except to be constrained by arbitrarily limiting their speed.


⚫
The analysis defines value intervals for the coefficients, which makes it possible to generalize the algorithm to many types of problems. enabling a researcher or an application developer to use the same model, with the same coefficients, without arbitrary limitation of speeds. One can use the same basic code by just defining the objective function of the problem under consideration. This approach is more versatile than previous ones, and is now used in virtually all PSO variants. By the end of 2020 it got more than a thousand citations.<ref>{{Cite web|last1=Baas|first1=Jeroen|last2=Boyack|first2=Kevin|last3=Ioannidis|first3=John P. A.|date=2021-10-19|title=August 2021 data-update for "Updated science-wide author databases of standardized citation indicators"|url=https://elsevier.digitalcommonsdata.com/datasets/btchxktzyw/3|language=en|volume=3|publisher=Elsevier BV |doi=10.17632/btchxktzyw.3}}</ref>
Noticing periodic regularities in deterministic particle trajectories, Clerc analyses the dynamics of the stochastic system and proves that the trajectory of a particle can be controlled in a more sophisticated way, by applying a constriction coefficient, which allows the particle to adjust its search distance, decreasing it if necessary or increasing it if a new region is found.


⚫
Clerc introduced other innovations in the swarm intelligence paradigm, for example the «Swarm and Queen» approach.<ref>{{Cite book|last=Clerc|first=M.|title=Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) |chapter=The swarm and the queen: Towards a deterministic and adaptive particle swarm optimization |chapter-url=http://dx.doi.org/10.1109/cec.1999.785513|year=1999|pages=1951–1957|publisher=IEEE|doi=10.1109/cec.1999.785513|isbn=0-7803-5536-9|s2cid=119835760}}</ref>
The analysis defines value intervals for the coefficients, which make it possible to generalize the algorithm to many types of problems. Thus a researcher or an application developer can use the same model, with the same coefficients, without arbitrary limitation of speeds.


⚫
His work on the use of PSO for combinatorial problems, such as the Travelling Salesman Problem (TSP), is particularly innovative in that he completely redefines the concepts of “speed” and “distance” to address these types of problems.<ref>{{Citation|last=Clerc|first=Maurice|title=Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem|date=2004|url=http://dx.doi.org/10.1007/978-3-540-39930-8_8|work=New Optimization Techniques in Engineering|series=Studies in Fuzziness and Soft Computing|volume=141|pages=219–239|place=Berlin, Heidelberg|publisher=Springer Berlin Heidelberg|doi=10.1007/978-3-540-39930-8_8|isbn=978-3-642-05767-0|s2cid=118681996 |access-date=2021-12-31}}</ref>
⚫
From the same basic code, simply define the objective function of the problem to be treated. A more versatile approach than previous ones, which is now used in virtually all PSO variants. By the end of 2020 more than a thousand other authors' publications are referring to it<ref>{{Cite journal|last=Baas|first=Jeroen|last2=Boyack|first2=Kevin|last3=Ioannidis|first3=John P. A.|date=2021-10-19|title=August 2021 data-update for "Updated science-wide author databases of standardized citation indicators"|url=https://elsevier.digitalcommonsdata.com/datasets/btchxktzyw/3|language=en|volume=3|doi=10.17632/btchxktzyw.3}}</ref>.


⚫
Its definition of the concept of stagnation and the analysis have also led to improvements in the algorithm.<ref>{{Cite book|author=Schmitt, Berthold Immanuel|url=http://worldcat.org/oclc/908646543|title=Convergence analysis for particle swarm optimization|year=2015|isbn=978-3-944057-30-9|oclc=908646543}}</ref>
⚫
Clerc introduces other innovations in the swarm intelligence paradigm, for example with the «Swarm and Queen» approach<ref>{{Cite journal|last=Clerc|first=M.|title=The swarm and the queen: towards a deterministic and adaptive particle swarm optimization|url=http://dx.doi.org/10.1109/cec.1999.785513|journal=Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)|publisher=IEEE|doi=10.1109/cec.1999.785513}}</ref> ou with variable topology through which the population structure is modified in an adaptive way during the algorithm run.


⚫
He works with many people around the world, some notable ones being James Kennedy (see above), [[Riccardo Poli]] on the XPS (eXtended Particle ''Swarms'')<ref>{{cite web|title=XPS Particle Swarm|url=https://xps-swarm.essex.ac.uk/|access-date=2021-11-15|website=xps-swarm.essex.ac.uk|language=en|publication-date=}}</ref> project of the University of Essex, Patrick Siarry (professor at [[Paris-East Créteil University]]),<ref>{{Cite book|date=2016|editor-last=Siarry|editor-first=Patrick|title=Metaheuristics|url=http://dx.doi.org/10.1007/978-3-319-45403-0|doi=10.1007/978-3-319-45403-0|isbn=978-3-319-45401-6|s2cid=236324444 }}</ref><ref>{{Cite journal|last1=Clerc|first1=Maurice|last2=Siarry|first2=Patrick|date=2004|title=Une nouvelle métaheuristique pour l'optimisation difficile : la méthode des essaims particulaires|journal=J3eA|volume=3|pages=007|doi=10.1051/bib-j3ea:2004007|issn=1638-5705|doi-access=free}}</ref> Mahamed G. H. Omran, professor at the [[Gulf University for Science and Technology]] (Adaptive Population-based ''Simplex''),<ref>{{Cite journal|last1=Omran|first1=Mahamed G. H.|last2=Clerc|first2=Maurice|date=2017-08-30|title=APS 9: an improved adaptive population-based simplex method for real-world engineering optimization problems|url=http://dx.doi.org/10.1007/s10489-017-1015-z|journal=Applied Intelligence|volume=48|issue=6|pages=1596–1608|doi=10.1007/s10489-017-1015-z|s2cid=21702634|issn=0924-669X}}</ref><ref>{{cite web|title=Welcome — Adaptive Population based Simplex|url=http://aps-optim.info/MediaWiki/index.php?title=Welcome&setlang=en|access-date=2021-11-14|website=aps-optim.info|language=en|publication-date=}}</ref> and several teacher-researchers in India, including the [[:en:IIT Roorkee|Indian Institute of Technology]] (IIT) in [[Roorkee]].<ref>{{Cite journal|last1=Bansal|first1=Jagdish Chand|last2=Sharma|first2=Harish|last3=Jadon|first3=Shimpi Singh|last4=Clerc|first4=Maurice|date=2014-01-01|title=Spider Monkey Optimization algorithm for numerical optimization|url=http://dx.doi.org/10.1007/s12293-013-0128-0|journal=Memetic Computing|volume=6|issue=1|pages=31–47|doi=10.1007/s12293-013-0128-0|s2cid=5714781|issn=1865-9284}}</ref>
⚫
His work on the use of the PSO for combinatorial problems, such as the Commercial Traveler, is particularly innovative in that he completely redefines the concepts of “speed” and “distance” to address these types of problems<ref>{{Citation|last=Clerc|first=Maurice|title=Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem|date=2004|url=http://dx.doi.org/10.1007/978-3-540-39930-8_8|work=New Optimization Techniques in Engineering|pages=219–239|place=Berlin, Heidelberg|publisher=Springer Berlin Heidelberg|isbn=978-3-642-05767-0|access-date=2021-12-31}}</ref>.


⚫
He is involved in updating the Particle Swarm Central site.<ref>{{cite web|title=Particle Swarm Central|url=http://particleswarm.info/|website=particleswarm.info|language=en|access-date=2021-11-14|publication-date=}}</ref>
⚫
Its definition of the concept of stagnation and its analysis have also led to improvements in the algorithm<ref>{{Cite book|last=Verfasser|first=Schmitt, Berthold Immanuel|url=http://worldcat.org/oclc/908646543|title=Convergence analysis for particle swarm optimization|isbn=978-3-944057-30-9|oclc=908646543}}</ref>


⚫
Retired since 2004, he remains active in various fields of research, both in PSO related fields and other areas<ref>{{Cite journal |last=Clerc |first=Maurice |date=2024-11-28 |title=Iterative Optimization RCO: A "Ruler & Compass" Deterministic Method |url=https://www.mdpi.com/2227-7390/12/23/3755 |journal=Mathematics |language=en |volume=12 |issue=23 |pages=3755 |doi=10.3390/math12233755 |doi-access=free |issn=2227-7390}}</ref>.<ref>{{Cite journal|last1=Clerc|first1=Maurice|last2=Dattasharma|first2=Abhi|date=2014|title=Comparisons in optimisation: the Eff-Res approach|url=http://dx.doi.org/10.1504/ijsi.2014.066557|journal=International Journal of Swarm Intelligence|volume=1|issue=3|pages=266|doi=10.1504/ijsi.2014.066557|issn=2049-4041}}</ref><ref>{{Cite book|last=Clerc|first=Maurice|url=https://hal.archives-ouvertes.fr/hal-02891847|title=A general quantum method to solve the graph K-colouring problem|date=2020}}</ref> He regularly publishes articles and books, gives keynote speeches in conferences,<ref>{{cite web|title=SocProS'19|url=https://socpros19.scrs.in/|access-date=2021-11-14|website=socpros19.scrs.in|language=en|publication-date=}}</ref><ref>{{cite web|title=Keynote speakers {{!}} CIS 2020|url=https://www.cis2020.scrs.in/keynote_speakers|access-date=2021-11-14|website=www.cis2020.scrs.in|language=en|publication-date=}}</ref> and serves as a director and thesis jury.<ref>{{Cite thesis|title=Perfectionnement d'un algorithme adaptatif d'optimisation par essaim particulaire : application en génie médical et en électronique|url=https://www.theses.fr/2008PEST0035|publisher=Paris Est|date=2008-11-27|degree=These de doctorat|first=Yann|last=Cooren}}</ref><ref>{{cite web|last=Mauro Sebastian|first=Innocente|date=2010|title=Development and testing of a particle swarm optimizer to handle hard unconstrained and constrained problems.|url=https://cronfa.swan.ac.uk/Record/cronfa43043|access-date=2021-11-15|website=cronfa.swan.ac.uk|language=en}}</ref> He also occasionally works as an optimization consultant.<ref>{{Cite book|last1=Altman|first1=Zwi|last2=Sallem|first2=Soumaya|last3=Nasri|first3=Ridha|last4=Sayrac|first4=Berna|last5=Clerc|first5=Maurice|title=2014 IEEE Wireless Communications and Networking Conference Workshops (WCNCW) |chapter=Particle swarm optimization for Mobility Load Balancing SON in LTE networks |date=2014|chapter-url=https://ieeexplore.ieee.org/document/6934881|pages=172–177|doi=10.1109/WCNCW.2014.6934881|arxiv=1401.6621|isbn=978-1-4799-3086-9|s2cid=7180985}}</ref><ref>{{Cite journal|last1=Salman|first1=Ayed|last2=Omran|first2=Mahamed G. H.|last3=Clerc|first3=Maurice|last4=Alsharhan|first4=Salah|date=2016-01-01|title=Improving the performance of comprehensive learning particle swarm optimizer|url=https://content.iospress.com/articles/journal-of-intelligent-and-fuzzy-systems/ifs1794|journal=Journal of Intelligent & Fuzzy Systems|language=en|volume=30|issue=2|pages=735–746|doi=10.3233/IFS-151794|issn=1064-1246}}</ref>
⚫
He works with many people around the world. In particular James Kennedy (see above), Riccardo Poli on the XPS (eXtended Particle ''Swarms'')<ref>{{cite web|title=XPS Particle Swarm|url=https://xps-swarm.essex.ac.uk/|access-date=2021-11-15|website=xps-swarm.essex.ac.uk|language=en|publication-date=}}</ref> project of the University of Essex, Patrick Siarry, professor at the University Paris-Est Créteil<ref>{{Cite journal|date=2016|editor-last=Siarry|editor-first=Patrick|title=Metaheuristics|url=http://dx.doi.org/10.1007/978-3-319-45403-0|doi=10.1007/978-3-319-45403-0}}</ref>'''·'''<ref>{{Cite journal|last=Clerc|first=Maurice|last2=Siarry|first2=Patrick|date=2004|title=Une nouvelle métaheuristique pour l'optimisation difficile : la méthode des essaims particulaires|url=http://dx.doi.org/10.1051/bib-j3ea:2004007|journal=J3eA|volume=3|pages=007|doi=10.1051/bib-j3ea:2004007|issn=1638-5705}}</ref>, Mahamed G. H. Omran, professor at the [[:en:Gulf_University_for_Science_and_Technology|Gulf University du Koweït]] (Adaptive Population-based ''Simplex'')<ref>{{Cite journal|last=Omran|first=Mahamed G. H.|last2=Clerc|first2=Maurice|date=2017-08-30|title=APS 9: an improved adaptive population-based simplex method for real-world engineering optimization problems|url=http://dx.doi.org/10.1007/s10489-017-1015-z|journal=Applied Intelligence|volume=48|issue=6|pages=1596–1608|doi=10.1007/s10489-017-1015-z|issn=0924-669X}}</ref>{{,}}<ref>{{cite web|title=Welcome — Adaptive Population based Simplex|url=http://aps-optim.info/MediaWiki/index.php?title=Welcome&setlang=en|access-date=2021-11-14|website=aps-optim.info|language=en|publication-date=}}</ref>, several teacher-researchers in India, including the [[:en:IIT_Roorkee|Indian Institute of Technology]] (IIT) in Roorkee<ref>{{Cite journal|last=Bansal|first=Jagdish Chand|last2=Sharma|first2=Harish|last3=Jadon|first3=Shimpi Singh|last4=Clerc|first4=Maurice|date=2014-01-01|title=Spider Monkey Optimization algorithm for numerical optimization|url=http://dx.doi.org/10.1007/s12293-013-0128-0|journal=Memetic Computing|volume=6|issue=1|pages=31–47|doi=10.1007/s12293-013-0128-0|issn=1865-9284}}</ref>, etc.

⚫
He is involved in updating the Particle Swarm Central site<ref>{{cite web|title=Particle Swarm Central|url=http://particleswarm.info/|website=particleswarm.info|language=en|access-date=2021-11-14|publication-date=}}</ref>.

⚫
Retired since 2004, he remains active in various fields of research, related to PSO or not<ref>{{Cite journal|last=Clerc|first=Maurice|last2=Dattasharma|first2=Abhi|date=2014|title=Comparisons in optimisation: the Eff-Res approach|url=http://dx.doi.org/10.1504/ijsi.2014.066557|journal=International Journal of Swarm Intelligence|volume=1|issue=3|pages=266|doi=10.1504/ijsi.2014.066557|issn=2049-4041}}</ref>'''·'''<ref>{{Cite book|last=Clerc|first=Maurice|url=https://hal.archives-ouvertes.fr/hal-02891847|title=A general quantum method to solve the graph K-colouring problem|date=2020}}</ref> publications of articles and books, keynote speaker in conferences<ref>{{cite web|title=SocProS'19|url=https://socpros19.scrs.in/|access-date=2021-11-14|website=socpros19.scrs.in|language=en|publication-date=}}</ref>{{,}}<ref>{{cite web|title=Keynote speakers {{!}} CIS 2020|url=https://www.cis2020.scrs.in/keynote_speakers|access-date=2021-11-14|website=www.cis2020.scrs.in|language=en|publication-date=}}</ref>, director and thesis jury<ref>{{Cite thesis|title=Perfectionnement d'un algorithme adaptatif d'optimisation par essaim particulaire : application en génie médical et en électronique|url=https://www.theses.fr/2008PEST0035|publisher=Paris Est|date=2008-11-27|degree=These de doctorat|first=Yann|last=Cooren}}</ref>{{,}}<ref>{{cite web|last=Mauro Sebastian|first=Innocente|date=2010|title=Development and testing of a particle swarm optimizer to handle hard unconstrained and constrained problems.|url=https://cronfa.swan.ac.uk/Record/cronfa43043|access-date=2021-11-15|website=cronfa.swan.ac.uk|language=en|publication-date=}}</ref>. He also occasionally works as an optimization consultant<ref>{{Cite journal|last=Altman|first=Zwi|last2=Sallem|first2=Soumaya|last3=Nasri|first3=Ridha|last4=Sayrac|first4=Berna|last5=Clerc|first5=Maurice|date=2014|title=Particle swarm optimization for Mobility Load Balancing SON in LTE networks|url=https://ieeexplore.ieee.org/document/6934881|journal=2014 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)|pages=172–177|doi=10.1109/WCNCW.2014.6934881}}</ref>{{,}}<ref>{{Cite journal|last=Salman|first=Ayed|last2=Omran|first2=Mahamed G. H.|last3=Clerc|first3=Maurice|last4=Alsharhan|first4=Salah|date=2016-01-01|title=Improving the performance of comprehensive learning particle swarm optimizer|url=https://content.iospress.com/articles/journal-of-intelligent-and-fuzzy-systems/ifs1794|journal=Journal of Intelligent & Fuzzy Systems|language=en|volume=30|issue=2|pages=735–746|doi=10.3233/IFS-151794|issn=1064-1246}}</ref>.


== Publications ==
== Publications ==
=== Books ===
=== Books ===
Maurice Clerc is the author of three books:
Maurice Clerc is the author of four books:


* Particle Swarm Optimization<ref>{{Cite book|last=Clerc|first=Maurice|url=http://dx.doi.org/10.1002/9780470612163|title=Particle Swarm Optimization|date=2006-01-01|publisher=ISTE|isbn=978-0-470-61216-3|location=London, UK}}</ref>
* ''Particle Swarm Optimization''<ref>{{Cite book|last=Clerc|first=Maurice|url=http://dx.doi.org/10.1002/9780470612163|title=Particle Swarm Optimization|date=2006-01-01|publisher=ISTE|isbn=978-0-470-61216-3|location=London, UK|doi=10.1002/9780470612163|s2cid=118262007 }}</ref>
*Guided Randomness in Optimization<ref>{{Cite book|last=Maurice.|first=Clerc,|url=http://worldcat.org/oclc/910670595|title=Guided randomness in optimization|date=2015|publisher=Wiley-ISTE|isbn=978-1-119-13645-3|oclc=910670595}}</ref>
*''Guided Randomness in Optimization''<ref>{{Cite book|last=Maurice.|first=Clerc|url=http://worldcat.org/oclc/910670595|title=Guided randomness in optimization|date=2015|publisher=Wiley-ISTE|isbn=978-1-119-13645-3|oclc=910670595}}</ref>
*Iterative Optimizers<ref>{{Cite book|last=Clerc|first=Maurice|url=http://dx.doi.org/10.1002/9781119612476|title=Iterative Optimizers|date=2019-04-08|publisher=Wiley|isbn=978-1-78630-409-4}}</ref>
*''Iterative Optimizers''<ref>{{Cite book|last=Clerc|first=Maurice|url=http://dx.doi.org/10.1002/9781119612476|title=Iterative Optimizers|date=2019-04-08|publisher=Wiley|doi=10.1002/9781119612476|isbn=978-1-78630-409-4|s2cid=186571664}}</ref>
*''Graph Coloring - From Games to Deterministic and Quantum Approaches'', Routledge & CRC Press, 2025, 144 p. DOI: 10.1201/9781003477785, ISBN: 9781003477785.


=== Articles and conference texts ===
=== Articles and conference texts ===
* (2001) "Think locally, act locally: The Way of Life of A2PSO, and Adaptive Particle Swarm Optimizer" , France Télécom R&D.
* (2001) "Think locally, act locally: The Way of Life of A2PSO, and Adaptive Particle Swarm Optimizer", France Télécom R&D.
*"Stagnation Analysis in Particle Swarm Optimisation or What Happens When Nothing Happens", Technical report, University of Essex,‎ 2006.
*"Stagnation Analysis in Particle Swarm Optimisation or What Happens When Nothing Happens", Technical report, University of Essex, 2006.
*"Why does it work?", International Journal of Computational Intelligence Research 4, n° 2,‎ 2008, p. 79-91.
*"Why does it work?", International Journal of Computational Intelligence Research 4, n° 2, 2008, p.&nbsp;79-91.
*"Beyond Standard Particle Swarm Optimisation", International Journal of Swarm Intelligence Research 4,‎ 2010, p. 46-66.
*"Beyond Standard Particle Swarm Optimisation", International Journal of Swarm Intelligence Research 4, 2010, p.&nbsp;46-66.
*Handbook of Swarm Intelligence, vol. 8, Heidelberg, Springer, 2011 (<nowiki>ISBN 978-3-642-26689-8</nowiki>), "From Theory to Practice in Particle Swarm Optimization", p. 3-36.
*Handbook of Swarm Intelligence, vol. 8, Heidelberg, Springer, 2011 {{ISBN|978-3-642-26689-8}}, "From Theory to Practice in Particle Swarm Optimization", p.&nbsp;3-36.
*"Cooperation Mechanisms in Particle Swarm Optimisation", Nature Inspired Computing : Theory and Industrial Application,‎ 2013.
*"Cooperation Mechanisms in Particle Swarm Optimisation", Nature Inspired Computing : Theory and Industrial Application, 2013.
*"List Based Optimisers - Experiments and Open Questions", International Journal of Swarm Intelligence Research, vol. 4(4),‎ 2014.
*"List Based Optimisers - Experiments and Open Questions", International Journal of Swarm Intelligence Research, vol. 4(4), 2014.
*"Total memory optimiser: proof of concept and compromises", International Journal of Swarm Intelligence, vol. 3,‎ 2017.
*"Total memory optimiser: proof of concept and compromises", International Journal of Swarm Intelligence, vol. 3, 2017.

⚫
== Notes and references ==
{{reflist}}


== External links ==
== External links ==
⚫
{{Portal|Mathematics
⚫
[http://clerc.maurice.free.fr/ Personal technical site]{{Authority control|VIAF=49480155|ISNI=0000 0000 0208 5192|BNF=cb146324379}}
}}
⚫
* [http://clerc.maurice.free.fr/ Personal technical site]


{{Authority control}}
⚫
== Notes and references ==

{{Références}}
{{DEFAULTSORT:Clerc, Maurice}}
⚫
{{Portal|Mathematics}}
[[Category:21st-century mathematicians|Clerc,Maurice]]
[[Category:21st-century French mathematicians]]
[[Category:1949 births]]
[[Category:Living people]]
[[Category:University of Lille Nord de France alumni]]

Latest revision as of 20:35, 28 November 2024

Maurice Clerc
Born (1949-04-24) April 24, 1949 (age 75)
NationalityFrench
Occupation(s)Mathematician and writer

Maurice Clerc is a French mathematician.

Early life and education

[edit]

Maurice Marcel Clerc was born on April 24, 1949, in Besançon. He finished his graduate studies and obtained his engineering degree in 1972 from the Institut industriel du Nord (renamed Centrale Lille in 1991).[1]

Professional career

[edit]

Maurice Clerc worked in the Research and Development department of France Télécom.

His early work focused on fuzzy representations.[2][3][4] He was later recognized as a world specialist in particle swarm optimization (PSO)[5][6] jointly with James Kennedy. He is, together with the latter, the lead co-author of the first detailed theoretical analysis of this method,[7] rewarded by IEEE in 2005.[8]

He outlined and demonstrated convergence theorems in a five-dimensional space and, in particular, defined the constriction concept that has since been largely used in the context of PSO.[9][10]

The analysis defines value intervals for the coefficients, which makes it possible to generalize the algorithm to many types of problems. enabling a researcher or an application developer to use the same model, with the same coefficients, without arbitrary limitation of speeds. One can use the same basic code by just defining the objective function of the problem under consideration. This approach is more versatile than previous ones, and is now used in virtually all PSO variants. By the end of 2020 it got more than a thousand citations.[11]

Clerc introduced other innovations in the swarm intelligence paradigm, for example the «Swarm and Queen» approach.[12]

His work on the use of PSO for combinatorial problems, such as the Travelling Salesman Problem (TSP), is particularly innovative in that he completely redefines the concepts of “speed” and “distance” to address these types of problems.[13]

Its definition of the concept of stagnation and the analysis have also led to improvements in the algorithm.[14]

He works with many people around the world, some notable ones being James Kennedy (see above), Riccardo Poli on the XPS (eXtended Particle Swarms)[15] project of the University of Essex, Patrick Siarry (professor at Paris-East Créteil University),[16][17] Mahamed G. H. Omran, professor at the Gulf University for Science and Technology (Adaptive Population-based Simplex),[18][19] and several teacher-researchers in India, including the Indian Institute of Technology (IIT) in Roorkee.[20]

He is involved in updating the Particle Swarm Central site.[21]

Retired since 2004, he remains active in various fields of research, both in PSO related fields and other areas[22].[23][24] He regularly publishes articles and books, gives keynote speeches in conferences,[25][26] and serves as a director and thesis jury.[27][28] He also occasionally works as an optimization consultant.[29][30]

Publications

[edit]

Books

[edit]

Maurice Clerc is the author of four books:

  • Particle Swarm Optimization[31]
  • Guided Randomness in Optimization[32]
  • Iterative Optimizers[33]
  • Graph Coloring - From Games to Deterministic and Quantum Approaches, Routledge & CRC Press, 2025, 144 p. DOI: 10.1201/9781003477785, ISBN: 9781003477785.

Articles and conference texts

[edit]
  • (2001) "Think locally, act locally: The Way of Life of A2PSO, and Adaptive Particle Swarm Optimizer", France Télécom R&D.
  • "Stagnation Analysis in Particle Swarm Optimisation or What Happens When Nothing Happens", Technical report, University of Essex, 2006.
  • "Why does it work?", International Journal of Computational Intelligence Research 4, n° 2, 2008, p. 79-91.
  • "Beyond Standard Particle Swarm Optimisation", International Journal of Swarm Intelligence Research 4, 2010, p. 46-66.
  • Handbook of Swarm Intelligence, vol. 8, Heidelberg, Springer, 2011 ISBN 978-3-642-26689-8, "From Theory to Practice in Particle Swarm Optimization", p. 3-36.
  • "Cooperation Mechanisms in Particle Swarm Optimisation", Nature Inspired Computing : Theory and Industrial Application, 2013.
  • "List Based Optimisers - Experiments and Open Questions", International Journal of Swarm Intelligence Research, vol. 4(4), 2014.
  • "Total memory optimiser: proof of concept and compromises", International Journal of Swarm Intelligence, vol. 3, 2017.

Notes and references

[edit]
  1. ^ Répertoire des Ingénieurs et scientifiques de France.
  2. ^ Maurice Clerc, François Guérin et Xavier Chanet. « Représentations floues dans un mémoriel ». dans JIOSC (Journées internationales d'Orsay sur les sciences cognitives), édité par CNRS, 211‑22. Orsay, France: CNRS, 1994.
  3. ^ Earl D. Cox; (trad.) Maurice Clerc (1995). "La logique floue pour les affaires et l'industrie". momox-shop. Retrieved 2021-12-28.
  4. ^ Clerc, Maurice (1996). "Déduction en Représentation Floue Hiérarchique. Un exemple". In Cognito. 3.
  5. ^ M. Clerc (2006). Particle Swarm Optimization. Wiley.
  6. ^ Clerc, Maurice (2015). Guided Randomness in Optimization. ISTE.
  7. ^ Clerc, M.; Kennedy, J. (2002). "The particle swarm - explosion, stability, and convergence in a multidimensional complex space". IEEE Transactions on Evolutionary Computation. 6 (1): 58–73. doi:10.1109/4235.985692. ISSN 1089-778X.
  8. ^ "Past Recipients - IEEE Computational Intelligence Society". IEEE. Archived from the original on January 15, 2019. Retrieved 2021-11-14..
  9. ^ Tripathi, Jay Prakash; Ghoshal, Sanjoy (2017-07-01). "Combining inertia and constriction technique in the PSO applied to fault identification in a hydraulic system". Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science. 231 (14): 2730–2740. doi:10.1177/0954406216640302. ISSN 0954-4062. S2CID 112219954.
  10. ^ Pranava, G.; Prasad, P. V. (2013). "Constriction Coefficient Particle Swarm Optimization for Economic Load Dispatch with valve point loading effects". 2013 International Conference on Power, Energy and Control (ICPEC). pp. 350–354. doi:10.1109/ICPEC.2013.6527680. ISBN 978-1-4673-6030-2. S2CID 31619417.
  11. ^ Baas, Jeroen; Boyack, Kevin; Ioannidis, John P. A. (2021-10-19). "August 2021 data-update for "Updated science-wide author databases of standardized citation indicators"". Elsevier BV. doi:10.17632/btchxktzyw.3.
  12. ^ Clerc, M. (1999). "The swarm and the queen: Towards a deterministic and adaptive particle swarm optimization". Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406). IEEE. pp. 1951–1957. doi:10.1109/cec.1999.785513. ISBN 0-7803-5536-9. S2CID 119835760.
  13. ^ Clerc, Maurice (2004), "Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem", New Optimization Techniques in Engineering, Studies in Fuzziness and Soft Computing, vol. 141, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 219–239, doi:10.1007/978-3-540-39930-8_8, ISBN 978-3-642-05767-0, S2CID 118681996, retrieved 2021-12-31
  14. ^ Schmitt, Berthold Immanuel (2015). Convergence analysis for particle swarm optimization. ISBN 978-3-944057-30-9. OCLC 908646543.
  15. ^ "XPS Particle Swarm". xps-swarm.essex.ac.uk. Retrieved 2021-11-15.
  16. ^ Siarry, Patrick, ed. (2016). Metaheuristics. doi:10.1007/978-3-319-45403-0. ISBN 978-3-319-45401-6. S2CID 236324444.
  17. ^ Clerc, Maurice; Siarry, Patrick (2004). "Une nouvelle métaheuristique pour l'optimisation difficile : la méthode des essaims particulaires". J3eA. 3: 007. doi:10.1051/bib-j3ea:2004007. ISSN 1638-5705.
  18. ^ Omran, Mahamed G. H.; Clerc, Maurice (2017-08-30). "APS 9: an improved adaptive population-based simplex method for real-world engineering optimization problems". Applied Intelligence. 48 (6): 1596–1608. doi:10.1007/s10489-017-1015-z. ISSN 0924-669X. S2CID 21702634.
  19. ^ "Welcome — Adaptive Population based Simplex". aps-optim.info. Retrieved 2021-11-14.
  20. ^ Bansal, Jagdish Chand; Sharma, Harish; Jadon, Shimpi Singh; Clerc, Maurice (2014-01-01). "Spider Monkey Optimization algorithm for numerical optimization". Memetic Computing. 6 (1): 31–47. doi:10.1007/s12293-013-0128-0. ISSN 1865-9284. S2CID 5714781.
  21. ^ "Particle Swarm Central". particleswarm.info. Retrieved 2021-11-14.
  22. ^ Clerc, Maurice (2024-11-28). "Iterative Optimization RCO: A "Ruler & Compass" Deterministic Method". Mathematics. 12 (23): 3755. doi:10.3390/math12233755. ISSN 2227-7390.
  23. ^ Clerc, Maurice; Dattasharma, Abhi (2014). "Comparisons in optimisation: the Eff-Res approach". International Journal of Swarm Intelligence. 1 (3): 266. doi:10.1504/ijsi.2014.066557. ISSN 2049-4041.
  24. ^ Clerc, Maurice (2020). A general quantum method to solve the graph K-colouring problem.
  25. ^ "SocProS'19". socpros19.scrs.in. Retrieved 2021-11-14.
  26. ^ "Keynote speakers | CIS 2020". www.cis2020.scrs.in. Retrieved 2021-11-14.
  27. ^ Cooren, Yann (2008-11-27). Perfectionnement d'un algorithme adaptatif d'optimisation par essaim particulaire : application en génie médical et en électronique (These de doctorat thesis). Paris Est.
  28. ^ Mauro Sebastian, Innocente (2010). "Development and testing of a particle swarm optimizer to handle hard unconstrained and constrained problems". cronfa.swan.ac.uk. Retrieved 2021-11-15.
  29. ^ Altman, Zwi; Sallem, Soumaya; Nasri, Ridha; Sayrac, Berna; Clerc, Maurice (2014). "Particle swarm optimization for Mobility Load Balancing SON in LTE networks". 2014 IEEE Wireless Communications and Networking Conference Workshops (WCNCW). pp. 172–177. arXiv:1401.6621. doi:10.1109/WCNCW.2014.6934881. ISBN 978-1-4799-3086-9. S2CID 7180985.
  30. ^ Salman, Ayed; Omran, Mahamed G. H.; Clerc, Maurice; Alsharhan, Salah (2016-01-01). "Improving the performance of comprehensive learning particle swarm optimizer". Journal of Intelligent & Fuzzy Systems. 30 (2): 735–746. doi:10.3233/IFS-151794. ISSN 1064-1246.
  31. ^ Clerc, Maurice (2006-01-01). Particle Swarm Optimization. London, UK: ISTE. doi:10.1002/9780470612163. ISBN 978-0-470-61216-3. S2CID 118262007.
  32. ^ Maurice., Clerc (2015). Guided randomness in optimization. Wiley-ISTE. ISBN 978-1-119-13645-3. OCLC 910670595.
  33. ^ Clerc, Maurice (2019-04-08). Iterative Optimizers. Wiley. doi:10.1002/9781119612476. ISBN 978-1-78630-409-4. S2CID 186571664.
[edit]
Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Maurice_Clerc_(mathematician)&oldid=1260096085"