Bio-inspired Optimization: metaheuristic algorithms for optimization

• URL: http://arxiv.org/abs/2003.11637v1
• Date: Mon, 24 Feb 2020 13:26:34 GMT
• Title: Bio-inspired Optimization: metaheuristic algorithms for optimization
• Authors: Pravin S Game, Dr. Vinod Vaze, Dr. Emmanuel M
• Abstract summary: In today's day and time solving real-world complex problems has become fundamentally vital and critical task. Traditional optimization methods are found to be effective for small scale problems. For real-world large scale problems, traditional methods either do not scale up or fail to obtain optimal solutions or they end-up giving solutions after a long running time.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In today's day and time solving real-world complex problems has become fundamentally vital and critical task. Many of these are combinatorial problems, where optimal solutions are sought rather than exact solutions. Traditional optimization methods are found to be effective for small scale problems. However, for real-world large scale problems, traditional methods either do not scale up or fail to obtain optimal solutions or they end-up giving solutions after a long running time. Even earlier artificial intelligence based techniques used to solve these problems could not give acceptable results. However, last two decades have seen many new methods in AI based on the characteristics and behaviors of the living organisms in the nature which are categorized as bio-inspired or nature inspired optimization algorithms. These methods, are also termed meta-heuristic optimization methods, have been proved theoretically and implemented using simulation as well used to create many useful applications. They have been used extensively to solve many industrial and engineering complex problems due to being easy to understand, flexible, simple to adapt to the problem at hand and most importantly their ability to come out of local optima traps. This local optima avoidance property helps in finding global optimal solutions. This paper is aimed at understanding how nature has inspired many optimization algorithms, basic categorization of them, major bio-inspired optimization algorithms invented in recent time with their applications.

Related papers

• Learning Multiple Initial Solutions to Optimization Problems [52.9380464408756]
  Sequentially solving similar optimization problems under strict runtime constraints is essential for many applications. We propose learning to predict emphmultiple diverse initial solutions given parameters that define the problem instance. We find significant and consistent improvement with our method across all evaluation settings and demonstrate that it efficiently scales with the number of initial solutions required.
  arXiv  Detail & Related papers  (2024-11-04T15:17:19Z)
• Learning Joint Models of Prediction and Optimization [56.04498536842065]
  Predict-Then-Then framework uses machine learning models to predict unknown parameters of an optimization problem from features before solving. This paper proposes an alternative method, in which optimal solutions are learned directly from the observable features by joint predictive models.
  arXiv  Detail & Related papers  (2024-09-07T19:52:14Z)
• Unraveling the Versatility and Impact of Multi-Objective Optimization: Algorithms, Applications, and Trends for Solving Complex Real-World Problems [4.023511716339818]
  Multi-Objective Optimization (MOO) techniques have become increasingly popular in recent years. This paper examines recently developed MOO-based algorithms. In real-world case studies, MOO algorithms address complicated decision-making challenges.
  arXiv  Detail & Related papers  (2024-06-29T15:19:46Z)
• Solving the Food-Energy-Water Nexus Problem via Intelligent Optimization Algorithms [46.48853432592689]
  Food-Energy-Water systems are intricately linked among food, energy and water that impact each other. They usually involve a huge number of decision variables and many conflicting objectives to be optimized. In this paper, we solve a Food-Energy-Water optimization problem by using the state-of-art intelligent optimization methods and compare their performance.
  arXiv  Detail & Related papers  (2024-04-10T06:19:19Z)
• Large Language Models as Optimizers [106.52386531624532]
  We propose Optimization by PROmpting (OPRO), a simple and effective approach to leverage large language models (LLMs) as prompts. In each optimization step, the LLM generates new solutions from the prompt that contains previously generated solutions with their values. We demonstrate that the best prompts optimized by OPRO outperform human-designed prompts by up to 8% on GSM8K, and by up to 50% on Big-Bench Hard tasks.
  arXiv  Detail & Related papers  (2023-09-07T00:07:15Z)
• Socio-cognitive Optimization of Time-delay Control Problems using Evolutionary Metaheuristics [89.24951036534168]
  Metaheuristics are universal optimization algorithms which should be used for solving difficult problems, unsolvable by classic approaches. In this paper we aim at constructing novel socio-cognitive metaheuristic based on castes, and apply several versions of this algorithm to optimization of time-delay system model.
  arXiv  Detail & Related papers  (2022-10-23T22:21:10Z)
• A Framework for Inherently Interpretable Optimization Models [0.0]
  Solution of large-scale problems that seemed intractable decades ago are now a routine task. One major barrier is that the optimization software can be perceived as a black box. We propose an optimization framework to derive solutions that inherently come with an easily comprehensible explanatory rule.
  arXiv  Detail & Related papers  (2022-08-26T10:32:00Z)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• Learning to Optimize Under Constraints with Unsupervised Deep Neural Networks [0.0]
  We propose a machine learning (ML) method to learn how to solve a generic constrained continuous optimization problem. In this paper, we propose an unsupervised deep learning (DL) solution for solving constrained optimization problems in real-time.
  arXiv  Detail & Related papers  (2021-01-04T02:58:37Z)
• Opytimizer: A Nature-Inspired Python Optimizer [0.0]
  It aims at selecting a feasible set of parameters in an attempt to solve a particular problem. We propose a Python-based meta-heuristic optimization framework as Opyyy as Opheurisizer.
  arXiv  Detail & Related papers  (2019-12-30T16:50:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.