This paper presents a decision support based, dynamic approach to optimal threat evaluation and defensive resource scheduling. The algorithm provides flexibility and optimality by swapping between two objective functi...
详细信息
ISBN:
(纸本)9783642040696
This paper presents a decision support based, dynamic approach to optimal threat evaluation and defensive resource scheduling. The algorithm provides flexibility and optimality by swapping between two objective functions, based on preferential and subtractive defense strategies, as and when required. Analysis part of this paper presents the strengths and weaknesses of the proposed algorithm over an alternative greedy algorithm as applied to different offline scenarios.
Genetic algorithm(GA) has a good robust and global optimization capability In this paper, a supercavitation regime problem is transformed into an equivalent shape optimization problem by defining the objective functio...
详细信息
ISBN:
(纸本)9781424447541
Genetic algorithm(GA) has a good robust and global optimization capability In this paper, a supercavitation regime problem is transformed into an equivalent shape optimization problem by defining the objective function as a square error integral of pressure difference Through combining the commercial CFD soft ANSYS with GA, this problem has been solved efficiently Comparisons show that genetic algorithm is feasible and effective used in supercavitation flow-analysis, the method is good for the reduction of computational complexity and more digestible Meanwhile the frame can be expanded to study the cavitator optimization in which the regime optimization can be as a sub-optimization.
This paper presents an efficient algorithm for distribution system restoration based on fuzzy data mining. The computation time can be decreased greatly by dividing the computation into two parts: one is the part of o...
详细信息
ISBN:
(纸本)9781424425860
This paper presents an efficient algorithm for distribution system restoration based on fuzzy data mining. The computation time can be decreased greatly by dividing the computation into two parts: one is the part of off-line calculation, in which by using the historical FTU measured records the selecting rules of optimal disconnection switches in all loops existed in distributed networks are calculated by fuzzy data mining. The other is the part of on-line calculation, in which just the tie switches are optimized by some optimization algorithms, and the corresponding optimal disconnection switches in each loop created by two or more closed tie switches can be estimated according to the selecting rules and the actual data measured by FTU. Simulation result indicates that the proposed method is of high calculation speed,it can guarantee the quality of solution at the same time.
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet developing visualizations is often a ...
详细信息
ISBN:
(纸本)3540749691
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet developing visualizations is often a tedious activity requiring significant time and expertise. This paper presents a framework for the visualization of constraint-based local search (CBLS) algorithms. Given a high-level model and a declarative visualization specification, the CBLS visualizer systematically produces animations to visualize constraints and objectives, violations, and conflicts, as well as the temporal behavior of these measures. The visualization specification is declarative and typically composed of a triple (what,where,how) indicating what to display, where, and with which graphical objects. The visualizer architecture is compositional and extensible. It provides building blocks which can be assembled freely by the user and focuses almost exclusively on static aspects, the dynamic aspects being automated by the use of invariants. The paper highlights various functionalities of the visualizer and describes a blueprint for its implementation.
The current state of the art in computational fluid dynamics provides reasonable reacting-flow predictions and is already used in industry to evaluate new concepts of gas turbine engines. In parallel, optimization tec...
详细信息
The current state of the art in computational fluid dynamics provides reasonable reacting-flow predictions and is already used in industry to evaluate new concepts of gas turbine engines. In parallel, optimization techniques have reached maturity and several industrial activities benefit from enhanced search algorithms. However, coupling a physical computational fluid dynamics model with an optimization algorithm to yield a decision-making tool needs to be undertaken with care to take advantage of the current computing power while satisfying the gas turbine industrial constraints. Among the many delicate issues for such tools to contribute efficiently to the gas turbine industry, combustion is probably the most challenging, and optimization algorithms are not easily applicable to such problems. In our study, a fully encapsulated algorithm addresses the issue by making use of a new multiobjective optimization strategy based on an iteratively enhanced metamodel (kriging) coupled to a design-of-experiments method and a fully parallel three-dimensional computational fluid dynamics solver to model turbulent reacting flows. With this approach, the computer cost needed for thousands of computational fluid dynamics computations is greatly reduced while ensuring an automatic error reduction of the approximated response function. Preliminary assessments of the search algorithm against simple analytical test functions prove the strategy to be efficient and robust. Application to a three-dimensional industrial aeronautical combustion chamber demonstrates the approach to be feasible with currently available computing power. One result of the optimization is that possible design changes can improve performance and durability of the studied engine. With the advent of massively parallel architectures, the intersection between these two advanced techniques seems a logical path to yield fully automated decision-making tools for the design of gas turbine engines.
Flapping motion parameters of airfoils in a biplane configuration are optimized for maximum thrust and/or propulsive efficiency. Unsteady, viscous flowfields over airfoils flapping in a combined plunge and pitch are c...
详细信息
Flapping motion parameters of airfoils in a biplane configuration are optimized for maximum thrust and/or propulsive efficiency. Unsteady, viscous flowfields over airfoils flapping in a combined plunge and pitch are computed with a parallel flow solver on moving and deforming overset grids. The amplitudes of the sinusoidal pitch and plunge motions and the phase shift between them are optimized for a range of flapping frequencies. A gradient-based optimization algorithm is implemented in a parallel computing environment. The deforming overset grids employed remove the restriction on the flapping motion of airfoils, and improve the optimization results obtained earlier. In the Strouhal number range 0.17 < Sr < 0.25, an airfoil in a biplane configuration produces more thrust than a single airfoil. Yet, at a higher Strouhal number, the airfoil in a biplane configuration produced less thrust at a significantly lower efficiency than a single flapping airfoil.
In this paper, we consider a multi-objective network design problem with static routing wavelength assignment (RWA) in WDM networks. The design objective is to maximize the number of accepted communication requests (s...
详细信息
ISBN:
(纸本)9781424444168
In this paper, we consider a multi-objective network design problem with static routing wavelength assignment (RWA) in WDM networks. The design objective is to maximize the number of accepted communication requests (source-destination pairs) and to minimize the number of wavelength channel required subject to a limited number of wavelength channels available on each network link and at least 80% of all commodities must be accepted. We consider our Multi-Objective WDM network design problem in various cases. The network model is solved using a new and efficient approach called "Genetic algorithm for Routing and Minimum Degree First Wavelength Assignment (GA-MDF)". We compare our simulation results with those of the traditional approach that is Fixed-Alternate Routing and First-Fit Wavelength Assignment (FAR-FF). The result comparisons show that GA-MDF is superior both in terms of the amount of accepted commodity requests and CPU computation time.
Database classification is a data preprocessing technique for multi-database mining. To reduce search costs in the data from all databases, we need to identify those databases which are most likely relevant to a data ...
详细信息
ISBN:
(纸本)9783642022692
Database classification is a data preprocessing technique for multi-database mining. To reduce search costs in the data from all databases, we need to identify those databases which are most likely relevant to a data mining application. Based on the related research, the algorithm GreedyClass and BestClassification [7] are improved in order to optimize the time complexity of algorithm and to obtain the best classification from in given databases. Theoretical analysis and experimental results show the efficiency of the proposed algorithm.
Load-path-based topology optimization is used to synthesize a compliant adaptive aircraft wing leading edge, which deforms in a prescribed way when subject to a single point internal actuation. The load-path-based opt...
详细信息
Load-path-based topology optimization is used to synthesize a compliant adaptive aircraft wing leading edge, which deforms in a prescribed way when subject to a single point internal actuation. The load-path-based optimization method requires the specification of a parent lattice. Increasing the complexity of this lattice means the number of parameters required for a complete representation of the structure in the topology optimization becomes prohibitive, although it is desirable to enable a full exploration of the design space. A new method based on graph theory and network analysis is proposed, which enables a substantial reduction in the required number of parameters to represent the parent lattice. The results from this load-path-based approach are compared with those obtained from the better-known density-based topology optimization method.
This paper studied the algorithm of logistics center location problems with time restrictions by Matlab optimization function. A location model with time restrictions was developed, an exact algorithm based on the ...
详细信息
This paper studied the algorithm of logistics center location problems with time restrictions by Matlab optimization function. A location model with time restrictions was developed, an exact algorithm based on the 'fmincon' function in Matlab optimization toolbox was put forward to solve the model, and an example was calculated to verify the model and algorithm. The results indicate that this algorithm is simple to be programmed and quick to be calculated, it not only can solve the location problems with time restrictions, but also can solve the traditional location problems without time restrictions. So the new algorithm is more effective than the gravity approach in solving the logistics center location problems.
暂无评论