The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
État de l'art des méthodes “d'optimisation globale”
Abstract
We present a review of the main “global methods. The paper comprises one introduction and two parts. In the introduction, we recall some generalities about non linear constraint-less optimization and we list some classifications which have been proposed for the global optimization methods. We then describe, in the first part, various “classical global optimization methods, most of which available long before the appearance of Simulated Annealing (a key event in this field). There exists plenty of papers and books dealing with these methods, and studying in particular their convergence properties. The second part of the paper is devoted to more recent or atypical methods, mostly issued from combinatorial optimization. The three main methods are “metaheuristics: Simulated Annealing (and derived techniques), Tabu Search and Genetic Algorithms; we also describe three other less known methods. For these methods, theoretical studies of convergence are less abundant in the literature, and the use of convergence results is by far more limited in practice. However, the fitting of some of these techniques to continuous variables problems gave very promising results; that question is not discussed in detail in the paper, but useful references allowing to deepen the subject are given.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Stochastic global optimization methods part I: Clustering methods
Rinnooy Kan, A. H. G., & Timmer, G. T. (1987) · Mathematical Programming · doi:10.1007/bf02592070 · Cited by 463
Cited by
Chapter 3 Stochastic and dynamic networks and routing
Powell, W. B., Jaillet, P., & Odoni, A. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80107-0 · Cited by 334
Echelon Reorder Points, Installation Reorder Points, and the Value of Centralized Demand Information
Chen, F. (1998) · Management Science · doi:10.1287/mnsc.44.12.s221 · Cited by 315
Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
Jans, R., & Degraeve, Z. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.12.008 · Cited by 297
Metadata
- Authors
- Berthiau, G., & Siarry, P.
- Venue
- RAIRO - Operations Research
- Publisher
- EDP Sciences
- Published
- 2001-07
- Volume
- 35
- Issue
- 3
- Pages
- 329-365
- ISSN
- 0399-0559 (ISSN-L)
- 1290-3868
- OpenAlex
- W1581877305
- Cited by
- 210
- References
- 3
- FWCI
- 11.64
- Type
- journal article
- Language
- fr
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.