Search results

In this paper, the previously developed idea of generalized optimization of circuits for deterministic methods has been extended to genetic algorithm (GA) to demonstrate new possibilities for solving an optimization problem that enhance accuracy and significantly reduce computing time.

The disadvantages of GAs are premature convergence to local minima and an increase in the computer operation time when setting a sufficiently high accuracy for obtaining the minimum. The idea of generalized optimization of circuits, previously developed for the methods of deterministic optimization, is built into the GA and allows one to implement various optimization strategies based on GA. The shape of the fitness function, as well as the length and structure of the chromosomes, is determined by a control vector artificially introduced within the framework of generalized optimization. This study found that changing the control vector that determines the method for calculating the fitness function makes it possible to bypass local minima and find the global minimum with high accuracy and a significant reduction in central processing unit (CPU) time.

The structure of the control vector is found, which makes it possible to reduce the CPU time by several orders of magnitude and increase the accuracy of the optimization process compared with the traditional approach for GAs.

It was demonstrated that incorporating the idea of generalized optimization into the body of a stochastic optimization method leads to qualitatively new properties of the optimization process, increasing the accuracy and minimizing the CPU time.

The purpose of this paper is to state new formulation of the programme‐styled framework of pansystems research and related expansions.

Pansystems‐generalized extremum principle (0**: (dy/dx=0)**) is presented with recognitions to various logoi of philosophy, mathematics, technology, systems, cybernetics, informatics, relativity, biology, society, resource, communications and related topics: logic, history, humanities, aesthetics, journalism, IT, AI, TGBZ* <truth*goodness*beauty*Zen*>, etc. including recent rediscoveries of 50 or so pansystems logoi.

A keynote of the paper is to develop the deep logoi of the analytic mathematics, analytic mechanics, variational principles, Hilbert's sixth/23rd problems, pan‐axiomatization to encyclopedic principles and various applications. The 0**‐universal connections embody the transfield internet‐styled academic tendency of pansystems exploration.

The paper includes topics: history megawave, pansystems sublation‐modes, pan‐metaphysics, pansystems dialogs with logoi of 100 thinkers or so, and pansystems‐sublation for a series of logoi concerning the substructure of encyclopedic dialogs such as systems, derivative, extremum, quantification, variational principle, equation, symmetry, OR, optimization, approximation, yinyang, combination, normality‐abnormality, framework, modeling, simulation, relativity, recognition, practice, methodology, mathematics, operations and transformations, quotientization, product, clustering, Banach completeness theorem, Weierstrass approximation theorem, Jackson approximation theorem, Taylor theorem, approximation transformation theorems due to Walsh‐Sewell mathematical school, Hilbert problems, Cauchy theorem, theorems of equation stability, function theory, logic, paradox, axiomatization, cybernetics, dialectics, multistep decision, computer, synergy, vitality and the basic logoi for history, ethics, economics, society OR, aesthetics, journalism, institution, resource and traffics, AI, IT, etc.

The purpose of this paper is to define the process of analog circuit optimization on the basis of the control theory application. This approach produces many different strategies of optimization and determines the problem of searching of the best strategy in sense of minimal computer time. The determining of the best strategy of optimization and a searching of possible structure of this strategy with a minimal computer time is a principal aim of this work.

Different kinds of strategies for circuit optimization have been evaluated from the point of view of operations’ number. The generalized methodology for the optimization of analog circuit was formulated by means of the optimum control theory. The main equations for this methodology were elaborated. These equations include the special control functions that are introduced artificially. This approach generalizes the problem and generates an infinite number of different strategies of optimization. A problem of construction of the best algorithm of optimization is defined as a typical problem of the control theory. Numerical results show the possibility of application of this approach for optimization of electronic circuits and demonstrate the efficiency and perspective of the proposed methodology.

Examples show that the better optimization strategies that are appeared in limits of developed approach have a significant time gain with respect to the traditional strategy. The time gain increases when the size and the complexity of the optimized circuit are increasing. An additional acceleration effect was used to improve the properties of presented optimization process.

The obtained results show the perspectives of new approach for circuit optimization. A large set of various strategies of circuit optimization serves as a basis for searching the better strategies with a minimum computer time. The gain in processor time for the best strategy reaches till several thousands in comparison with traditional approach.

Clarifies the relationship between the Bellman principle of optimality and the recursive functional equation of dynamic programming by optimum operators of pansystems methodology. Instead of the Bellman principle of optimality, two generalized principles of optimality are proposed by which a necessary and sufficient condition for the fundamental equation is obtained. A discrete generalized dynamic programming model is set up in detail. Some discrete optimization problems which cannot be treated by ordinary dynamic programming may be solved by the generalized model with the construction of appropriate optimum operators.

The purpose of this paper is to present an academic programme of pansystems research with a lot of new concepts, principles, methods. Universal consideration of philosophy‐mathematics‐technology is set forth with mega‐combination. The emphasis on the transfield internet‐like investigations is developed. Many theory‐methods of pansystems get further concise optimization.

The concrete contents of the paper include: historical megawave, philosophical stratagems, meta‐mathematics, meta‐methodology, technological realistic principles, unification and differentiation of encyclopedic branches, systems science, information theory, cybernetics, biosystems, generalized vitality, computer and IT, thinking science, logic, OR, AI, PR, DM, modernization of yinyang analysis combining dialectics, sociology, economics, meta‐relativity, generalized quantification and scale theory, general process of birth‐growth‐ageing‐disease‐death, the inheritance and development of 300 scholars' researches, etc.

All of the topics concerned with are reduced to the actualizations of PVOR – pansystems variational OR: V−d(xy)=^*0^*/PRR′P′/0^**, which is an integrated synthesis of 20‐PanStemCells of PanConcepts and PanMethod, and embodies a specific pansystems summarization for the core of the true and the good. Furthermore, the formula “Pansystems Researches=^*(PVOR/0^**/Pan54787721/Everything)+^*0^*=^*Pan–netlike connections of thoughts and methods” is expanded with concrete applications.

Provides information on pansystems research.

This study aims to assist the project manager in minimising the material logistics cost of road project by planning the optimal movement of aggregate across three stages of supply chain: sourcing, processing and distribution.

The paper conceptualises the raw material consumption in a road project as a logistics network distribution problem. A linear programming (LP) formulation is constructed with appropriate decision variables by integrating the three stages of material movement. The series of LP scenarios are solved using an LP solver to decide the optimal movement of the aggregate to be consumed in different layers of road segments.

The results obtained from the model show that planning material logistics of an entire road project using optimisation provides substantial saving in logistics costs than using common sense. Further, the magnitude of cost saving improves as the complexity of the model increases in term of enormous feasible options.

The model shown in this paper may serve as a basis for planning the logistics of raw materials consumed in the road projects. The small improvement in material flows by optimising supply chain shows sensible cost benefit to the project manager and hence control and monitor the overall cost and activities of the project. The output of the model is also expected to help the project team as an input in the decision-making processes such as appropriate material sourcing contract, capacity assessment of material processing facility and transportation planning.

While the optimisation models are widely used and popular among the many industrial applications, this research shows distinct application of such a model in managing the logistics of the road construction project.

This paper proposes a bar‐system graph representation for structural topology optimization using a genetic algorithm (GA).

Based on graph theory, a graph is first used to represent a skeletal structure consisting of joining paths in the design domain, each of which is represented by a chain subgraph with finite number of vertices. Based on the edges of this graph, a bar‐system representation is proposed to define all the bars and the resulting topology is obtained by mapping each bar with its corresponding thickness to the design domain which is discretized into a regular mesh. The design variables are thus reduced to the spatial distribution of the vertices and the thickness of each bar. This method combines the advantages of both continuum and ground structure optimization methods.

The overall procedure is applied to classical structural topology optimization problems and its good performance is illustrated in the numerical examples.

It is suggested that the present representation method is both physically meaningful and computationally effective in the framework of topological optimum design using GAs.

Usually, an optimal topology is obtained by optimizing the material distribution within a prescribed domain; for example, a rectangular domain with a specified length and width for a plane problem. However, the dimensions (i.e. aspect ratio) of a rectangular design domain have significant influence on the resultant optimal topology. In this paper, a minimum Averaged Compliance Density (ACD) based method for topology optimization of structures is proposed. Unlike the conventional topology optimization method, the ACD is taken as the objective function, and the topology and domain dimensions of the structure are optimized simultaneously. As an example, the topology of a cantilever beam with large aspect ratio will be optimized, which is often difficult for traditional topology optimization algorithms. Through optimizing the topology and the dimensions of the design domain, a base structure is obtained, which is repeated to yield the whole, assembled beam. The influence of the relative values of shear force and moment is analyzed numerically. Results show that as the value of the bending moment increases relative to the shear force, the optimal topology changes from a truss‐like structure to a vertically stiffened box‐like structure.

In this study, we analyze the power of the individual return-to-volatility security performance heuristic (ri/stdi) to simplify the identification of securities to buy and, consequently, to form the optimal no short sales mean–variance portfolios. The heuristic ri/stdi is powerful enough to identify the long and shorts sets. This is due to the positive definiteness of the variance–covariance matrix – the key is to use the heuristic sequentially. At the investor level, the heuristic helps investors to decide what securities to consider first. At the portfolio level, the heuristic may help us find out whether it is a good idea to invest in equity to begin with. Our research may also help to integrate individual security analysis into portfolio optimization through improved security rankings.

The framework, panorama, related applications and development of pansystems thinking are introduced and some problems concerning generalized systems, derivatives, symmetry and quantification are investigated, a sort of difference‐identity theory within the framework of pansystems thinking is cultivated, and a new type of clustering method with many intertransformations among some important pansystems concepts is presented. Related contents include: pansystems combination of mathematics, systems, dialectics and poetry thinking, methodology to comprehend laws by pansymmetries or by moving networks, the pansystems views of generalized order, quotientization and series‐parallel relations, control‐reachability, duality transformation, discoupling principle, communication theorems, general parental relations, etc.