Search results

The purpose of this paper is to develop an optimal approach for optimizing the dynamic behavior of incremental linear actuators.

First, a parameterized design model is built. Second, a dynamic model is implemented. This model takes into account the thrust force computed from a finite element model. Finally, the multiobjective optimization approach is applied to the dynamic model to optimize control as well as design parameters.

The Pareto front resulting from the optimization approach (or the parallel optimization approach,) is better than the Pareto, which is obtained from the only application of MultiObjective Genetic Algorithm (MOGA) method (or parallel MOGA with the same number of optimization approach objective function evaluations). The only use of MOGA can reach the region near an optimal Pareto front, but it consumes more computing time than the multiobjective optimization approach. At each flowchart stage, parallelization leads to a significant reduction of computing time which is halved when using two-core machine.

In order to solve the multiobjective problem, a hybrid algorithm based on MOGA is developed.

The transverse flux heating (TFH) concept offers very high electrical efficiency in combination with unique technological flexibility. Numerous advantages make this method beyond competition to be applied in e.g. processing lines. However, all potential advantages of TFH can be realized in practice only by optimal design of the inductor shape using numerical modelling and optimization techniques. This paper aims to describe a hierarchical approach to the optimal design of a one-sided induction coil, which will be used for one-sided TFH of continuous moving thin metal strip to achieve a homogeneous temperature distribution along the strip width.

Depending on the design step, 2D or 3D FEM simulations using ANSYS® Mechanical including the electromagnetics package are used. The harmonic electromagnetic solution is coupled to a transient thermal model which takes the strip movement into account. All models use the symmetries of the inductor workpiece arrangement to keep the calculation times as low as possible.

Due to the geometry of a TFH coil, the models can image a quarter or half of the arrangement. Preliminary investigations of different inductor head shapes can be carried out quickly and then further improved on more complex models in combination with the use of optimization algorithms.

Using hierarchical structure for designing a one-sided TFH coil, offers an efficient and quick way to create a coil which is adapted to the application.

The one-sided inductor design is considered, and the results are generally valid.

In this paper, an online convex optimization method for the exoatmospheric ascent trajectory of space interceptors is proposed. The purpose of this paper is to transform the original trajectory optimization problem into a sequence of convex optimization subproblems.

For convenience in calculating accuracy and efficiency, the complex nonlinear terminal orbital elements constraints are converted into several quadratic equality constraints, which can be better computed by a two-step correction method during the iteration. First, the nonconvex thrust magnitude constraint is convexified by the lossless convexification technique. Then, discretization and successive linearization are introduced to transform the original problem into a sequence of one convex optimization subproblem, considering different flight phases. Parameters of trust-region and penalty are also applied to improve the computation performance. To correct the deviation in real time, the iterative guidance method is applied before orbit injection.

Numerical experiments show that the algorithm proposed in this paper has good convergence and accuracy. The successive progress can converge in a few steps and 3–4 s of CPU time. Even under engine failure or mission change, the algorithm can yield satisfactory results.

The convex optimization method presented in this paper is expected to generate a reliable optimal trajectory rapidly in different situations and has great potential for onboard applications of space interceptors.

The originality of this paper lies in the proposed online trajectory optimization method and guidance algorithm of the space inceptors, especially for onboard applications in emergency situations.

The purpose of this paper is to elaborate the effective method of adaptation of the external penalty function to the genetic algorithm.

In the case of solving the optimization tasks with constraints using the external penalty function, the penalty term has a larger value than the primary objective function. The sigmoidal transformation is introduced to solve this problem. A new method of determining the value of the penalty coefficient in subsequent iterations associated with the changing penalty has been proposed. The proposed approach has been applied to the optimization of an electromagnetic linear actuator, and the mathematical model of the devices contains equations of the magnetic field, by taking into account the nonlinearity of ferromagnetic material.

The proposed new approach of the penalty function method consists in the reduction of the external penalty function in successive penalty iterations instead of its increase as it is in the classical method. In addition, the method of normalization of constraints during the formulation of optimization problem has a significant impact on the obtained results of optimization calculations.

The proposed approach can be applied to solve constrained optimization tasks in designing of electromagnetic devices.

This chapter presents selected multiobjective methods for multiperiod portfolio optimization problem. Portfolio models are formulated as multicriteria mixed integer programs. Reference point method together with weighting approach is proposed. The portfolio selection problem considered is based on a multiperiod model of investment, in which the investor buys and sells securities in successive investment periods. The problem objective is to allocate the wealth on different securities to optimize the portfolio expected return, the probability that the return is not less than a required level. Multiobjective methods were used to find tradeoffs between risk, return, and the number of securities in the portfolio. In computational experiments the data set of daily quotations from the Warsaw Stock Exchange were used.

This study aims to deal with a project portfolio selection problem aiming to maximize the net present value of the project portfolio and minimize the resource usage variation between successive time periods.

A bi-objective mixed integer programming model is presented under resource constraints. The parameters related to outlays and net cash flows of existing and new projects are considered to be uncertain. An augmented ε-constraint (AUGMECON) method is used to solve the proposed model, and a fuzzy approach is used to find the most preferred Pareto-optimal solutions among those generated by AUGMECON method. The effectiveness of the proposed solution method is compared with three other multi-objective optimization methods. Finally, some sensitivity analyses are performed to assess the effect of changing a number of parameters on the values of objective functions.

The proposed approach helps corporations make optimal decisions for rebalancing their project portfolio, through launching some new candidate projects and upgrading some of the existing projects.

A novel bi-objective optimization model is proposed for designing a project portfolio problem under budget constraints and profit risk controls. Two types of projects including existing and new projects are considered in the problem. Minimization of resource usage variation between successive periods is considered in the model as one objective function. An AUGMECON method is used to solve the proposed bi-objective mathematical model. A fuzzy approach is applied to find the best Pareto-optimal solutions of AUGMECON method. Results of the proposed solution approach are compared with three other multi-objective decision-making methods in different numerical examples.

This paper evaluates a Successive Response Surface Method (SRSM) specifically developed for simulation‐based design optimization, e.g. that of explicit nonlinear dynamics in crashworthiness design. Linear response surfaces are constructed in a subregion of the design space using a design of experiments approach with a D‐optimal experimental design. To converge to an optimum, a domain reduction scheme is utilized. The scheme requires only one user‐defined parameter, namely the size of the initial subregion. During optimization, the size of this region is adapted using a move reversal criterion to counter oscillation and a move distance criterion to gauge accuracy. To test its robustness, the results using the method are compared to SQP results of a selection of the well‐known Hock and Schittkowski problems. Although convergence to a small tolerance is slow when compared to SQP, the SRSM method does remarkably well for these sometimes pathological analytical problems. The second test concerns three engineering problems sampled from the nonlinear structural dynamics field to investigate the method's handling of numerical noise and non‐linearity. It is shown that, despite its simplicity, the SRSM method converges stably and is relatively insensitive to its only user‐required input parameter.

The purpose of this paper is to develop an optimal bidding strategy for a generation company (GenCo) in the network constrained electricity markets and to analyze the impact of network constraints and opponents bidding behavior on it.

A bi‐level programming (BLP) technique is formulated in which upper level problem represents an individual GenCo payoff maximization and the lower level represents the independent system operator's market clearing problem for minimizing customers' payments. The objective function of BLP problem used for bidding strategy by economic withholding is highly nonlinear, and there are complementarity terms to represent the market clearing. Fuzzy adaptive particle swarm optimization (FAPSO), which is a modern heuristic approach, is applied to obtain the global solution of the proposed BLP problem for single hourly and multi‐hourly market clearings. Opponents' bidding behavior is modeled with probabilistic estimation.

It is very difficult to obtain the global solution of this BLP problem using the deterministic approaches, even for a single hourly market clearing. However, the effectiveness of this new heuristic approach (FAPSO) has been established with four simulation cases on IEEE 30‐bus test system considering multi‐block bidding and multi‐hourly market clearings. The joint effect of network congestion and strategic bidding by opponents offer additional opportunities of increase in payoff of a GenCo.

FAPSO having dynamically adjusted particle swarm optimization inertia weight uses fuzzy evaluation to effectively follow the frequently changing conditions in the successive trading sessions of a real electricity market. This approach is applied to find the optimal bidding strategy of a GenCo competing with five GenCos in IEEE 30‐bus test system.

This paper is possibly the first attempt to evaluate an optimal bidding strategy for a GenCo through economic withholding in a network constrained electricity market using FAPSO.

This paper aims to develop a novel trajectory optimization algorithm which is capable of producing high accuracy optimal solution with superior computational efficiency for the hypersonic entry problem.

A two-stage trajectory optimization framework is constructed by combining a convex-optimization-based algorithm and the pseudospectral-nonlinear programming (NLP) method. With a warm-start strategy, the initial-guess-sensitive issue of the general NLP method is significantly alleviated, and an accurate optimal solution can be obtained rapidly. Specifically, a successive convexification algorithm is developed, and it serves as an initial trajectory generator in the first stage. This algorithm is initial-guess-insensitive and efficient. However, approximation error would be brought by the convexification procedure as the hypersonic entry problem is highly nonlinear. Then, the classic pseudospectral-NLP solver is adopted in the second stage to obtain an accurate solution. Provided with high-quality initial guesses, the NLP solver would converge efficiently.

Numerical experiments show that the overall computation time of the two-stage algorithm is much less than that of the single pseudospectral-NLP algorithm; meanwhile, the solution accuracy is satisfactory.

Due to its high computational efficiency and solution accuracy, the algorithm developed in this paper provides an option for rapid trajectory designing, and it has the potential to evolve into an online algorithm.

The paper provides a novel strategy for rapid hypersonic entry trajectory optimization applications.

The paper highlights the process of electric vehicles optimal design as an inverse problem and presents the global constrained optimization as the best way to solve it.

The electric vehicle optimal design is carried out by a new approach. It consists an electric vehicle design model managed by constrained optimization techniques. It includes sizing models for all drive train components and a vehicle dynamic model build in a new “design way” as an energy‐based model using the response surface methodology. The sensitivity of first simple sizing models can be evaluated by the experimental design method, giving information about the most important part of the model that must be improved.

The result shows the superiority of the constrained optimization technique that treats simultaneously the global optimization and the model adjustment. This method of simultaneous resolution is much more powerful than the successive resolution of each subproblem. The proposed “design approach” used for electric vehicle optimal design offer a large potential in the field of the complex systems design.

The electric vehicle design process is treated on a vehicle design model based on a design approach. It allows determining the drive train components specifications for imposed vehicle performances, taking into account the dynamic model of the vehicle and all components interactions. Furthermore, considering fine components sizing models, the components can be sized taking into account the whole system behavior in an optimal global design.