IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i5p665-d351249.html
   My bibliography  Save this article

Niching Multimodal Landscapes Faster Yet Effectively: VMO and HillVallEA Benefit Together

Author

Listed:
  • Ricardo Navarro

    (Faculty of Science and Engineering, Iwate University, Ueda 4-3-5, Morioka, Iwate 020-0066, Japan)

  • Chyon Hae Kim

    (Faculty of Science and Engineering, Iwate University, Ueda 4-3-5, Morioka, Iwate 020-0066, Japan)

Abstract

Variable Mesh Optimization with Niching (VMO-N) is a framework for multimodal problems (those with multiple optima at several search subspaces). Its only two instances are restricted though. Being a potent multimodal optimizer, the Hill-Valley Evolutionary Algorithm (HillVallEA) uses large populations that prolong its execution. This study strives to revise VMO-N, to contrast it with related approaches, to instantiate it effectively, to get HillVallEA faster, and to indicate methods (previous or new) for practical use. We hypothesize that extra pre-niching search in HillVallEA may reduce the overall population, and that if such a diminution is substantial, it runs more rapidly but effective. After refining VMO-N, we bring out a new case of it, dubbed Hill-Valley-Clustering-based VMO (HVcMO), which also extends HillVallEA. Results show it as the first competitive variant of VMO-N, also on top of the VMO-based niching strategies. Regarding the number of optima found, HVcMO performs statistically similar to the last HillVallEA version. However, it comes with a pivotal benefit for HillVallEA: a severe reduction of the population, which leads to an estimated drastic speed-up when the volume of the search space is in a certain range.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:5:p:665-:d:351249
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/5/665/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/5/665/
    Download Restriction: no
    ---><---

    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)

    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. 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.
    2. 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.
    3. 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.
    4. Dillenburger, Steven P. & Cochran, Jeffery K. & Cammarano, Vincent R., 2013. "Minimizing supply airdrop collateral damage risk," Socio-Economic Planning Sciences, Elsevier, vol. 47(1), pages 9-19.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Tankam-Chedjou, Israël & Grognard, Frédéric & Tewa, Jean Jules & Touzeau, Suzanne, 2021. "Optimal and sustainable management of a soilborne banana pest," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    12. Jorge Daniel Mello-Román & Adolfo Hernández & Julio César Mello-Román, 2021. "Improved Predictive Ability of KPLS Regression with Memetic Algorithms," Mathematics, MDPI, vol. 9(5), pages 1-13, March.
    13. Hamm, Lonnie & Brorsen, B. Wade, 2002. "Global Optimization Methods," 2002 Annual Meeting, July 28-31, 2002, Long Beach, California 36631, Western Agricultural Economics Association.
    14. Shelley D. Dionne & Hiroki Sayama & Francis J. Yammarino, 2019. "Diversity and Social Network Structure in Collective Decision Making: Evolutionary Perspectives with Agent-Based Simulations," Complexity, Hindawi, vol. 2019, pages 1-16, March.
    15. 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.
    16. E. A. Tsvetkov & R. A. Krymov, 2022. "Pure Random Search with Virtual Extension of Feasible Region," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 575-595, November.
    17. Rinnooy Kan, A. H. G. & Timmer, G. T., 1985. "Stochastic Global Optimization Methods Part I: Clustering Methods," Econometric Institute Archives 272329, Erasmus University Rotterdam.
    18. de Oliveira Nogueira, Tiago & Palacio, Gilderlânio Barbosa Alves & Braga, Fabrício Damasceno & Maia, Pedro Paulo Nunes & de Moura, Elineudo Pinho & de Andrade, Carla Freitas & Rocha, Paulo Alexandre C, 2022. "Imbalance classification in a scaled-down wind turbine using radial basis function kernel and support vector machines," Energy, Elsevier, vol. 238(PC).
    19. Taymaz, Erol, 1993. "A Calibration Algorithm for Micro-Simulation Models," Working Paper Series 374, Research Institute of Industrial Economics.
    20. Xiong, Xiaoping & Qing, Guohua, 2023. "A hybrid day-ahead electricity price forecasting framework based on time series," Energy, Elsevier, vol. 264(C).

    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:gam:jmathe:v:8:y:2020:i:5:p:665-:d:351249. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.