FIRELY OPTIMIZATION METHOD FOR SOLVING COMBINATORIAL LOGIC PROB- LEMS ON GRAPHS

2021 ◽  
Vol 115 ◽  
pp. 14-19
Author(s):  
Vladimir Kureichik ◽  
◽  
Victoria Bova ◽  
Vladimir Kureichik Jr. ◽  
◽  
...  
Keyword(s):  
Time Complexity ◽  
Optimization Method ◽  
Worst Case ◽  
Local Optima ◽  
Search Area ◽  
Firefly Optimization

The article describes the solution of NP-complex combinatorial-logical problems on graphs. The authors pro-pose to use a bioinspired approach based on a modified firefly optimization method. As a modification of the proposed approach, the work introduces procedures for dynamically changing the search area, which allows avoiding local optima. A series of tests and experiments have shown that this method is promising. The time complexity of the developed algorithm in the best case ≈ O(nlogn), in the worst case - О(n2).

scholarly journals Delay Bound Optimization in NoC Using a Discrete Firefly Algorithm

Electronics ◽  
2019 ◽  
Vol 8 (12) ◽  
pp. 1507
Author(s):  
Gaoming Du ◽  
Chao Tian ◽  
Zhenmin Li ◽  
Duoli Zhang ◽  
Chuan Zhang ◽  
...  
Keyword(s):  
Firefly Algorithm ◽  
Optimization Method ◽  
Video Object ◽  
Worst Case ◽  
Delay Bound ◽  
Proposed Model ◽  
Discrete Firefly Algorithm ◽  
Firefly Optimization ◽  
On Chip ◽  
Bound Optimization

The delay bound in system on chips (SoC) represents the worst-case traverse time of on-chip communication. In network on chip (NoC)-based SoC, optimizing the delay bound is challenging due to two aspects: (1) the delay bound is hard to obtain by traditional methods such as simulation; (2) the delay bound changes with the different application mappings. In this paper, we propose a delay bound optimization method using discrete firefly optimization algorithms (DBFA). First, we present a formal analytical delay bound model based on network calculus for both unipath and multipath routing in NoCs. We then set every flow in the application as the target flow and calculate the delay bound using the proposed model. Finally, we adopt firefly algorithm (FA) as the optimization method for minimizing the delay bound. We used industry patterns (video object plane decoder (VOPD), multiwindow display (MWD), etc.) to verify the effectiveness of delay bound optimization method. Experiments show that the proposed method is both effective and reliable, with a maximum optimization of 42.86%.

On the time complexity of worst-case system identification

1994 ◽  
Vol 39 (5) ◽  
pp. 944-950 ◽  
Author(s):  
K. Poolla ◽  
A. Tikku
Keyword(s):  
System Identification ◽  
Time Complexity ◽  
Worst Case ◽  
Case System

Benchmarking and Field-Testing of the Distributed Quasi-Newton Derivative-Free Optimization Method for Field Development Optimization

2021 ◽  
Author(s):  
Faruk Alpak ◽  
Yixuan Wang ◽  
Guohua Gao ◽  
Vivek Jain
Keyword(s):  
Optimization Problems ◽  
Field Testing ◽  
Optimization Method ◽  
Training Data ◽  
Local Optima ◽  
Field Development ◽  
Derivative Free Optimization ◽  
Derivative Free ◽  
Data Points ◽  
Quasi Newton

Abstract Recently, a novel distributed quasi-Newton (DQN) derivative-free optimization (DFO) method was developed for generic reservoir performance optimization problems including well-location optimization (WLO) and well-control optimization (WCO). DQN is designed to effectively locate multiple local optima of highly nonlinear optimization problems. However, its performance has neither been validated by realistic applications nor compared to other DFO methods. We have integrated DQN into a versatile field-development optimization platform designed specifically for iterative workflows enabled through distributed-parallel flow simulations. DQN is benchmarked against alternative DFO techniques, namely, the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method hybridized with Direct Pattern Search (BFGS-DPS), Mesh Adaptive Direct Search (MADS), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA). DQN is a multi-thread optimization method that distributes an ensemble of optimization tasks among multiple high-performance-computing nodes. Thus, it can locate multiple optima of the objective function in parallel within a single run. Simulation results computed from one DQN optimization thread are shared with others by updating a unified set of training data points composed of responses (implicit variables) of all successful simulation jobs. The sensitivity matrix at the current best solution of each optimization thread is approximated by a linear-interpolation technique using all or a subset of training-data points. The gradient of the objective function is analytically computed using the estimated sensitivities of implicit variables with respect to explicit variables. The Hessian matrix is then updated using the quasi-Newton method. A new search point for each thread is solved from a trust-region subproblem for the next iteration. In contrast, other DFO methods rely on a single-thread optimization paradigm that can only locate a single optimum. To locate multiple optima, one must repeat the same optimization process multiple times starting from different initial guesses for such methods. Moreover, simulation results generated from a single-thread optimization task cannot be shared with other tasks. Benchmarking results are presented for synthetic yet challenging WLO and WCO problems. Finally, DQN method is field-tested on two realistic applications. DQN identifies the global optimum with the least number of simulations and the shortest run time on a synthetic problem with known solution. On other benchmarking problems without a known solution, DQN identified compatible local optima with reasonably smaller numbers of simulations compared to alternative techniques. Field-testing results reinforce the auspicious computational attributes of DQN. Overall, the results indicate that DQN is a novel and effective parallel algorithm for field-scale development optimization problems.

scholarly journals Optimization Design of the Over-All Dimensions of Centrifugal Compressor Stage

1988 ◽  
Author(s):  
Wang Qinghuan ◽  
Sun Zhiqin
Keyword(s):  
Centrifugal Compressor ◽  
Computer Aided Design ◽  
Optimization Design ◽  
Optimization Method ◽  
Complex Method ◽  
Compressor Stage ◽  
Local Optima ◽  
Centrifugal Compressor Stage ◽  
Optimum Solution ◽  
Nonlinear Objective Function

A new procedure employed in computer-aided design of centrifugal compressor stage to determine its over-all dimensions is described in this paper. By the use of the COMPLEX METHOD, the arbitrary number of variables to be optimized can be specified to remove the hidden danger of the local optima which stems from adopting a few, for example two or three, variables to be optimized. This procedure is available for any complicated implicit nonlinear objective function and ensures establishment of a true optimum solution. Numerical calculations have been carried out by using the computer program described here to check the ability of the optimization method. The results obtained by the calculations agree fairly well with that obtained by experiments.

scholarly journals Feature Recognition for Manufacturability Analysis

1994 ◽  
Author(s):  
William C. Regli ◽  
Satyandra K. Gupta ◽  
Dana S. Nau
Keyword(s):  
Time Complexity ◽  
Material Removal ◽  
Feature Recognition ◽  
Solid Modeling ◽  
Cad Model ◽  
Worst Case ◽  
Machining Features ◽  
Automated Recognition ◽  
Wide Range ◽  
Complete Set

Abstract While automated recognition of features has been attempted for a wide range of applications, no single existing approach possesses the functionality required to perform manufacturability analysis. In this paper, we present a methodology for taking a CAD model of a part and extracting a set of machinable features that contains the complete set of alternative interpretations of the part as collections of MRSEVs (Material Removal Shape Element Volumes, a STEP-based library of machining features). The approach handles a variety of features including those describing holes, pockets, slots, and chamfering and filleting operations. In addition, the approach considers accessibility constraints for these features, has an worst-case algorithmic time complexity quadratic in the number of solid modeling operations, and modifies features recognized to account for available tooling and produce more realistic volumes for manufacturability analysis.

A Robust Optimization Method for Systems With Significant Nonlinear Effects

1993 ◽  
Author(s):  
Jyh-Cheng Yu ◽  
Kosuke Ishii
Keyword(s):  
Heat Treatment ◽  
Robust Optimization ◽  
Nonlinear Effects ◽  
Optimization Method ◽  
Post Heat Treatment ◽  
Worst Case ◽  
Estimation Scheme ◽  
Optimization Methodology ◽  
Major Factors ◽  
The Cost

Abstract This paper describes a robust optimization methodology for design involving either complex simulations or actual experiments. The proposed procedure optimizes the worst case response that consists of a weighted sum of expected mean and response variance. The estimation scheme for expected mean and variance adopts the modified 3-point Gauss quadrature integration to assure superior accuracy for systems with significant nonlinear effects. We apply the proposed method to the robust design of geometric parameters of heat treated parts to minimize the cost of post heat treatment operations. The paper investigates the major factors influencing geometric distortions due to heat treatment and the rules of thumb in design. The study focuses on relating dimensional distortion to the design of part geometry. To illustrate the utility of the proposed method, we present the formulation of a case study on allocation of dimensions of preheat treated (green) shafts to minimize the cost of post heat treatment operations. The final result is not presented yet pending the completion of further experiments.

Meta-Heuristic Parameter Optimization for ANN and Real-Time Applications of ANN

2022 ◽  
pp. 166-201
Author(s):  
Asha Gowda Karegowda ◽  
Devika G.
Keyword(s):  
Neural Networks ◽  
Real Time ◽  
Parameter Optimization ◽  
Heuristic Algorithms ◽  
Search Space ◽  
Optimization Method ◽  
Classification Problems ◽  
Local Optima ◽  
Consistent Solution ◽  
Real Time Applications

Artificial neural networks (ANN) are often more suitable for classification problems. Even then, training of ANN is a surviving challenge task for large and high dimensional natured search space problems. These hitches are more for applications that involves process of fine tuning of ANN control parameters: weights and bias. There is no single search and optimization method that suits the weights and bias of ANN for all the problems. The traditional heuristic approach fails because of their poorer convergence speed and chances of ending up with local optima. In this connection, the meta-heuristic algorithms prove to provide consistent solution for optimizing ANN training parameters. This chapter will provide critics on both heuristics and meta-heuristic existing literature for training neural networks algorithms, applicability, and reliability on parameter optimization. In addition, the real-time applications of ANN will be presented. Finally, future directions to be explored in the field of ANN are presented which will of potential interest for upcoming researchers.

Performance Prediction by an SVM with a Firefly Optimization Method

2020 ◽  
pp. 2150017
Author(s):  
Yongquan Yan
Keyword(s):  
Support Vector Machine ◽  
Economic Loss ◽  
Optimization Method ◽  
Parameter Selection ◽  
Support Vector ◽  
Software Aging ◽  
Memory Prediction ◽  
Firefly Optimization ◽  
Aging Phenomena ◽  
Selection Of

Since software system is becoming more and more complex than before, performance degradation and even abrupt download, which are called software aging phenomena, bring about a great deal of economic loss. To counter these problems, some methods are used. Support vector machine is an effective method to tackle software aging problems, but its performance is influenced by the selection of hyper-parameters. A method is proposed to optimize the hyper-parameter selection of support vector machine in this work. The proposed method which is used as a training algorithm to optimize the parameter selection of support vector machine, utilizes the global exploration power of firefly method to achieve faster convergence and also a better accuracy. In the experiment, we use two metrics to test the effect of the proposed method. The results indicate that the presented method owns the highest accuracy in both the available memory prediction and heap memory prediction of Web server for software aging predictions.

Planning the Shortest Path in Cluttered Environments: A Review and a Planar Convex Hull-Based Approach

2019 ◽  
Vol 19 (4) ◽  
Author(s):  
Nafiseh Masoudi ◽  
Georges M. Fadel ◽  
Margaret M. Wiecek
Keyword(s):  
Path Planning ◽  
Shortest Path ◽  
Time Complexity ◽  
Optimal Path ◽  
Optimal Solution ◽  
Free Graph ◽  
Worst Case ◽  
Cluttered Environments ◽  
Planar Convex ◽  
Polyhedral Obstacles

Abstract Routing or path-planning is the problem of finding a collision-free and preferably shortest path in an environment usually scattered with polygonal or polyhedral obstacles. The geometric algorithms oftentimes tackle the problem by modeling the environment as a collision-free graph. Search algorithms such as Dijkstra’s can then be applied to find an optimal path on the created graph. Previously developed methods to construct the collision-free graph, without loss of generality, explore the entire workspace of the problem. For the single-source single-destination planning problems, this results in generating some unnecessary information that has little value and could increase the time complexity of the algorithm. In this paper, first a comprehensive review of the previous studies on the path-planning subject is presented. Next, an approach to address the planar problem based on the notion of convex hulls is introduced and its efficiency is tested on sample planar problems. The proposed algorithm focuses only on a portion of the workspace interacting with the straight line connecting the start and goal points. Hence, we are able to reduce the size of the roadmap while generating the exact globally optimal solution. Considering the worst case that all the obstacles in a planar workspace are intersecting, the algorithm yields a time complexity of O(n log(n/f)), with n being the total number of vertices and f being the number of obstacles. The computational complexity of the algorithm outperforms the previous attempts in reducing the size of the graph yet generates the exact solution.

Topology Optimization Under Independent Multi-Load With Uncertainty

2016 ◽  
Author(s):  
Hae Chang Gea ◽  
Xing Liu ◽  
Euihark Lee ◽  
Limei Xu
Keyword(s):  
Topology Optimization ◽  
Optimization Problem ◽  
Optimization Method ◽  
Engineering Practice ◽  
Worst Case ◽  
Load Uncertainty ◽  
Topology Optimization Problem ◽  
Level Problem ◽  
Upper Level ◽  
Mean Compliance

In this paper, topology optimization under multiple independent loadings with uncertainty is presented. In engineering practice, load uncertainty can be found in many applications. From the literature, researchers have focused mainly on problems containing only a single uncertain external load. However, such idealistic problems may not be very useful in engineering practice. Problems involving multi-loadings with uncertainty are more commonly found in engineering applications. This paper presents a method to solve a system which contains multiple independent loadings with load uncertainty. First, a two-level optimization problem is formulated. The upper level problem is a typical topology optimization problem to minimize the mean compliance in the design using the worst case conditions. The lower level optimization problem is to solve for the worst loadings corresponding to the critical structure response. At the lower level formulation, an unknown-but-bounded model is used to define uncertain loadings. There are two challenges in finding the worst loading case: non-convexity and multi-loadings. The non-convexity problem is addressed by reformulating the problem as an inhomogeneous eigenvalue problem by applying the KKT optimality conditions and the multi-uncertain loadings problem is solved by an iterative method. After the worst loadings are generated, the upper level problem can be solved by a general topology optimization method. The effectiveness of the proposed method is demonstrated by numerical examples.

Sign in / Sign up

Export Citation Format

Share Document