Optimization Problem
Optimization problems, aiming to find the best solution among many possibilities, are central to numerous scientific and engineering disciplines. Current research emphasizes developing efficient algorithms, including metaheuristics, neural networks leveraging Karush-Kuhn-Tucker conditions, and bilevel optimization approaches, to tackle increasingly complex problems, such as those with multiple objectives, constraints, and dynamic environments. These advancements are improving the speed and accuracy of solutions across diverse fields, from machine learning and resource allocation to traffic control and scientific discovery, enabling better decision-making and system design. Furthermore, research is actively exploring methods to enhance the explainability and fairness of optimization solutions.
Papers
A socio-physics based hybrid metaheuristic for solving complex non-convex constrained optimization problems
Ishaan R Kale, Anand J Kulkarni, Efren Mezura-Montes
Cooperative coevolutionary Modified Differential Evolution with Distance-based Selection for Large-Scale Optimization Problems in noisy environments through an automatic Random Grouping
Rui Zhong, Masaharu Munetomo