The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Multi-objective Flower Algorithm for Optimization
Open accessAbstract
Flower pollination algorithm is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, we extend this flower algorithm to solve multi-objective optimization problems in engineering. By using the weighted sum method with random weights, we show that the proposed multi-objective flower algorithm can accurately find the Pareto fronts for a set of test functions. We then solve a bi-objective disc brake design problem, which indeed converges quickly.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
A New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
Self-citationSurvey of multi-objective optimization methods for engineering
Marler, R. T., & Arora, J. S. (2004) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-003-0368-6 · Cited by 4,710
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Schaffer, J. D. (1985) · international conference on Genetic algorithms · Cited by 3,326
Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543
13 Flower Pollination Algorithm for Global OptimizationPreprint
Yang, X. (2012) · Cited by 2,272
Self-citationBat algorithm: a novel approach for global engineering optimization
Yang, X., & Hossein Gandomi, A. (2012) · Engineering Computations · doi:10.1108/02644401211235834 · Cited by 1,751
Self-citationFlower Pollination Algorithm for Global Optimization
Yang, X.-S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32894-7_27 · Cited by 1,630
Self-citationMulti-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
Coello Coello, C. A., & Reyes-Sierra, M. (2006) · International Journal of Computational Intelligence Research · doi:10.5019/j.ijcir.2006.68 · Cited by 1,365
Engineering Optimization: An Introduction with Metaheuristic Applications
Yang, X. (2010) · Middlesex University Research Repository (Middlesex University Of London) · Cited by 1,063
Self-citationBat algorithm: a novel approach for global engineering optimization
Yang, X., & Gandomi, A. H. (2012) · Middlesex University Research Repository (Middlesex University Of London) · Cited by 1,057
Self-citationMultiobjective optimization Test Instances for the CEC 2009 Special Session and Competition
Zhang, Q., Zhou, A., Zhao, S.-Z., et al. (2009) · Cited by 951
Bat algorithm for multi-objective optimisation
Yang, X. S. (2011) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2011.042259 · Cited by 861
Self-citationLévy flights, non-local search and simulated annealing
Pavlyukevich, I. (2007) · Journal of Computational Physics · doi:10.1016/j.jcp.2007.06.008 · Cited by 672
Flower Constancy: Definition, Cause, and Measurement
Waser, N. M. (1986) · The American Naturalist · doi:10.1086/284507 · Cited by 623
DEMO: Differential Evolution for Multiobjective Optimization
Robič, T., & Filipič, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31880-4_36 · Cited by 616
A Swarm Metaphor for Multiobjective Design Optimization
Ray, T., & Liew, K. M. (2002) · Engineering Optimization · doi:10.1080/03052150210915 · Cited by 431
Multiobjective optimization using a Pareto differential evolution approach
Madavan, N. K. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004404 · Cited by 275
Review of meta-heuristics and generalised evolutionary walk algorithm
Yang, X. S. (2011) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2011.039907 · Cited by 206
Self-citationTHE PARETO DIFFERENTIAL EVOLUTION ALGORITHM
ABBASS, H. A., & SARKER, R. (2002) · International Journal on Artificial Intelligence Tools · doi:10.1142/s0218213002001039 · Cited by 166
Benchmark Problems in Structural Optimization
Gandomi, A. H., & Yang, X. (2011) · Studies in computational intelligence · doi:10.1007/978-3-642-20859-1_12 · Cited by 152
Self-citationGandomi, A. H., Yang, X., Talatahari, S., & Deb, S. (2011) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2011.11.010 · Cited by 132
Self-citationUnderstanding flowers and flowering: an integrated approach
(2014) · Choice Reviews Online · doi:10.5860/choice.185593 · Cited by 112
Multi-objective differential evolution: theory and applications
Sanderson, A. C., Graves, R. J., & Feng, X. (2004) · Cited by 21
Cited by
Nature-Inspired Optimization Algorithms
(2021) · Elsevier eBooks · doi:10.1016/c2019-0-03762-4 · Cited by 755
Flower pollination algorithm: A novel approach for multiobjective optimization
Yang, X.-S., Karamanoglu, M., & He, X. (2014) · Engineering Optimization · doi:10.1080/0305215x.2013.832237 · Cited by 629
Self-citationNature-inspired optimization algorithms: Challenges and open problems
Yang, X.-S. (2020) · Journal of Computational Science · doi:10.1016/j.jocs.2020.101104 · Cited by 429
Self-citationA Brief Review of Nature-Inspired Algorithms for Optimization
Fister, I., Yang, X., Fister, I., Brest, J., & Fister, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.4186 · Cited by 388
Self-citationA new hybrid bee pollinator flower pollination algorithm for solar PV parameter estimation
Ram, J. P., Babu, T. S., Dragicevic, T., & Rajasekar, N. (2017) · Energy Conversion and Management · doi:10.1016/j.enconman.2016.12.082 · Cited by 263
Metadata
- Authors
- Yang, X.-S., Karamanoglu, M., & He, X.
- Venue
- Procedia Computer Science
- Publisher
- Elsevier BV
- Published
- 2013
- Volume
- 18
- Pages
- 861-868
- ISSN
- 1877-0509 (ISSN-L)
- OpenAlex
- W2004061489
- Cited by
- 363
- References
- 28
- FWCI
- 24.89
- Type
- conference paper
- Language
- en
- Open access
- diamond
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.