IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v168y2006i2p354-369.html
   My bibliography  Save this article

An evolutionary programming algorithm for continuous global optimization

Author

Listed:
  • Yang, Yao Wen
  • Xu, Jian Feng
  • Soh, Chee Kiong

Abstract

No abstract is available for this item.

Suggested Citation

  • Yang, Yao Wen & Xu, Jian Feng & Soh, Chee Kiong, 2006. "An evolutionary programming algorithm for continuous global optimization," European Journal of Operational Research, Elsevier, vol. 168(2), pages 354-369, January.
    • Handle: RePEc:eee:ejores:v:168:y:2006:i:2:p:354-369
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00347-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Francisco J. Solis & Roger J.-B. Wets, 1981. "Minimization by Random Search Techniques," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 19-30, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Guiqiang & Jin, Yi & Akram, M.W. & Chen, Xiao & Ji, Jie, 2018. "Application of bio-inspired algorithms in maximum power point tracking for PV systems under partial shading conditions – A review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 81(P1), pages 840-873.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Prietula, Michael J. & Watson, Harry S., 2008. "When behavior matters: Games and computation in A Behavioral Theory of the Firm," Journal of Economic Behavior & Organization, Elsevier, vol. 66(1), pages 74-94, April.
    2. Liu, Congzheng & Letchford, Adam N. & Svetunkov, Ivan, 2022. "Newsvendor problems: An integrated method for estimation and optimisation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 590-601.
    3. Mojtaba Akbari & Saber Molla-Alizadeh-Zavardehi & Sadegh Niroomand, 2020. "Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network," Operational Research, Springer, vol. 20(1), pages 447-471, March.
    4. Pronzato, Luc & Walter, Eric & Venot, Alain & Lebruchec, Jean-Francois, 1984. "A general-purpose global optimizer: Implimentation and applications," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 26(5), pages 412-422.
    5. Liu, Xueying & Fu, Meiling, 2015. "Cuckoo search algorithm based on frog leaping local search and chaos theory," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 1083-1092.
    6. Ran Etgar & Yuval Cohen, 2022. "Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 249-271, March.
    7. Ricardo Navarro & Chyon Hae Kim, 2020. "Niching Multimodal Landscapes Faster Yet Effectively: VMO and HillVallEA Benefit Together," Mathematics, MDPI, vol. 8(5), pages 1-37, April.
    8. Regis, Rommel G., 2010. "Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1187-1202, December.
    9. Xiong, Xiaoping & Qing, Guohua, 2023. "A hybrid day-ahead electricity price forecasting framework based on time series," Energy, Elsevier, vol. 264(C).
    10. Soumya D. Mohanty & Ethan Fahnestock, 2021. "Adaptive spline fitting with particle swarm optimization," Computational Statistics, Springer, vol. 36(1), pages 155-191, March.
    11. Giulia Pedrielli & K. Selcuk Candan & Xilun Chen & Logan Mathesen & Alireza Inanalouganji & Jie Xu & Chun-Hung Chen & Loo Hay Lee, 2019. "Generalized Ordinal Learning Framework (GOLF) for Decision Making with Future Simulated Data," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(06), pages 1-35, December.
    12. Tvrdik, Josef & Krivy, Ivan & Misik, Ladislav, 2007. "Adaptive population-based search: Application to estimation of nonlinear regression parameters," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 713-724, October.
    13. Albeanu, Grigore, 1997. "A Monte Carlo approach for controlled search," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 43(2), pages 223-228.
    14. Jie Fu & Jian Liu & Dongkai Xie & Zhe Sun, 2023. "Application of Fuzzy PID Based on Stray Lion Swarm Optimization Algorithm in Overhead Crane System Control," Mathematics, MDPI, vol. 11(9), pages 1-18, May.
    15. J. L. Redondo & J. Fernández & P. M. Ortigosa, 2017. "FEMOEA: a fast and efficient multi-objective evolutionary algorithm," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(1), pages 113-135, February.
    16. Garcia-Martinez, C. & Lozano, M. & Herrera, F. & Molina, D. & Sanchez, A.M., 2008. "Global and local real-coded genetic algorithms based on parent-centric crossover operators," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1088-1113, March.
    17. Ernestas Filatovas & Algirdas Lančinskas & Olga Kurasova & Julius Žilinskas, 2017. "A preference-based multi-objective evolutionary algorithm R-NSGA-II with stochastic local search," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 859-878, December.
    18. C. P. Stephens & W. Baritompa, 1998. "Global Optimization Requires Global Information," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 575-588, March.
    19. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    20. Hvattum, Lars Magnus & Glover, Fred, 2009. "Finding local optima of high-dimensional functions using direct search methods," European Journal of Operational Research, Elsevier, vol. 195(1), pages 31-45, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:168:y:2006:i:2:p:354-369. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.