• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2282-2303
• /
• 2021

To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

• Structural Engineering and Mechanics
• /
• 제62권6호
• /
• pp.749-758
• /
• 2017

In structural mechanics, traditional analyses methods usually employ matrix operations for obtaining displacement and internal forces of the structure under the external effects, such as distributed loads, earthquake or wind excitations, and temperature changing inter alia. These matrices are derived from the well-known principle of mechanics called minimum potential energy. According to this principle, a system can be in the equilibrium state only in case when the total potential energy of system is minimum. A close examination of the expression of the well-known equilibrium condition for linear problems, $P=K{\Delta}$, where P is the load vector, K is the stiffness matrix and ${\Delta}$ is the displacement vector, it is seen that, basically this principle searches the displacement set (or deformed shape) for a system that minimizes the total potential energy of it. Instead of using mathematical operations used in the conventional methods, with a different formulation, meta-heuristic algorithms can also be used for solving this minimization problem by defining total potential energy as objective function and displacements as design variables. Based on this idea the technique called Total Potential Optimization using Meta-heuristic Algorithms (TPO/MA) is proposed. The method has been successfully applied for linear and non-linear analyses of trusses and truss-like structures, and the results have shown that the approach is much more successful than conventional methods, especially for analyses of non-linear systems. In this study, the application of TPO/MA, with Harmony Search as the selected meta-heuristic algorithm, to cables net system is presented. The results have shown that the method is robust, powerful and accurate.

• Journal of Electrical Engineering and Technology
• /
• 제5권2호
• /
• pp.179-190
• /
• 2010

This paper describes a new stochastic heuristic algorithm in engineering problem optimization especially in power system applications. An improved particle swarm optimization (PSO) called adaptive particle swarm optimization (APSO), mixed with simulated annealing (SA), is introduced and referred to as APSO-SA. This algorithm uses a novel PSO algorithm (APSO) to increase the convergence rate and incorporate the ability of SA to avoid being trapped in a local optimum. The APSO-SA algorithm efficiency is verified using some benchmark functions. This paper presents the application of APSO-SA to find the optimal location, type and size of flexible AC transmission system devices. Two types of FACTS devices, the thyristor controlled series capacitor (TCSC) and the static VAR compensator (SVC), are considered. The main objectives of the presented method are increasing the voltage stability index and over load factor, decreasing the cost of investment and total real power losses in the power system. In this regard, two cases are considered: single-type devices (same type of FACTS devices) and multi-type devices (combination of TCSC, SVC). Using the proposed method, the locations, type and sizes of FACTS devices are obtained to reach the optimal objective function. The APSO-SA is used to solve the above non.linear programming optimization problem for better accuracy and fast convergence and its results are compared with results of conventional PSO. The presented method expands the search space, improves performance and accelerates to the speed convergence, in comparison with the conventional PSO algorithm. The optimization results are compared with the standard PSO method. This comparison confirms the efficiency and validity of the proposed method. The proposed approach is examined and tested on IEEE 14 bus systems by MATLAB software. Numerical results demonstrate that the APSO-SA is fast and has a much lower computational cost.

• Steel and Composite Structures
• /
• 제25권6호
• /
• pp.663-670
• /
• 2017

The problem of layup optimization of the composite laminates involves a very complex multidimensional solution space which is usually non-exhaustively explored using different heuristic computational methods such as genetic algorithms (GA). To ensure the convergence to the global optimum of the applied heuristic during the optimization process it is necessary to evaluate a lot of layup configurations. As a consequence the analysis of an individual layup configuration should be fast enough to maintain the convergence time range to an acceptable level. On the other hand the mechanical behavior analysis of composite laminates for any geometry and boundary condition is very convoluted and is performed by computational expensive numerical tools such as finite element analysis (FEA). In this respect some studies propose very fast FEA models used in layup optimization. However, the lower bound of the execution time of FEA models is determined by the global linear system solving which in some complex applications can be unacceptable. Moreover, in some situation it may be highly preferred to decrease the optimization time with the cost of a small reduction in the analysis accuracy. In this paper we explore some machine learning techniques in order to estimate the failure of a layup configuration. The estimated response can be qualitative (the configuration fails or not) or quantitative (the value of the failure factor). The procedure consists of generating a population of random observations (configurations) spread across solution space and evaluating using a FEA model. The machine learning method is then trained using this population and the trained model is then used to estimate failure in the optimization process. The results obtained are very promising as illustrated with an example where the misclassification rate of the qualitative response is smaller than 2%.

• 한국항공우주학회지
• /
• 제44권11호
• /
• pp.989-996
• /
• 2016

본 연구는 비선형 응답모델과 실수기반의 혼합형 유전자 알고리즘을 적용하여 로터의 트?-발란스(RTB) 기법을 개발하는 데 목적이 있다. 트?-발란스 조절 파라미터의 변화에 따른 트림해석 결과를 이용하여 2차의 근사함수를 이용하는 비선형 응답모델을 개발하였다. 트?편차와 기체의 진동응답을 최소화하기 위해 균형추 무게, 트림 탭(Trim Tab) 및 피치링크 길이를 최적화하기 위한 비선형계획 문제를 정식화하였다. 정식화 결과는 수렴성 향상을 위해 군집최적화 기법을 실변수기반의 유전자 알고리즘에 통합한 혼합형 유전자 기법을 사용함으로써 효율적인 해석이 가능하였다. 비선형 모델을 이용한 본 연구의 방법을 선형모델의 결과와 비교하여 본 연구의 방법을 검증하였으며 비선형모델을 사용하는 경우 선형모델의 결과보다 향상된 응답특성을 계산할 수 있음을 밝혔다.

• 한국정밀공학회지
• /
• 제14권4호
• /
• pp.72-77
• /
• 1997

In the temperature analysis of hot metal forming process, the heat transfer conditions between the work-piece and the tool have improtant influences upon the temperature distribution. The accuracy of thermal analysis depends on the proper description of boundary conditions including heat transfer. At the contact surface of two materials with different temperatures, this requires the knowledge of the overall heat transfer coefficient. In order to determine the overall heat transfer coefficient, a technique is developed. The technique involves temperature measurement by using thermocouples during hot upsetting operations and finite element computation. The overall heat transfer coefficient is determined using a non-linear optimization technique.

• 한국의학물리학회지:의학물리
• /
• 제2권2호
• /
• pp.121-128
• /
• 1991

뇌정위적 방사선 수술 시 정확한 3차원적 선량분포에 대한 정보가 필요한다. 3차원적 치료계획은 최적선량분포를 얻기위한 것이며 환자 데이타, 선량분포, 방사선 조사 요소들에 대한 3차원적인 관계를 다루어야만 한다. 원형 조사면에 대한 single 조사면 선량 데이타와 3차원 선량 알고리듬을 이용하여 non-coplanar moving arcs 에 대한 3차원적 선량모델이 개발되었다. 뇌정위적 방사선 수술시 3차원 선량 알고리듬의 적용과 여러경우에 대한 응용에 대하여 논의되어진다.

• Interaction and multiscale mechanics
• /
• 제1권1호
• /
• pp.103-121
• /
• 2008

This paper presents an optimization-based method for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain braced frame. Based on a non-stochastic modeling of uncertainty, we assume that the parameters both of brace stiffnesses and external forces are uncertain but bounded. A brace member represents the sum of the stiffness of the actual brace and the contributions of some non-structural elements, and hence we assume that the axial stiffness of each brace is uncertain. By using the $\mathcal{S}$-lemma, we formulate a semidefinite programming (SDP) problem which provides an outer approximation of the minimal bounding ellipsoid. The minimum bounding ellipsoids are computed for a braced frame under several uncertain circumstances.

• ETRI Journal
• /
• 제31권1호
• /
• pp.86-88
• /
• 2009

In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.89-97
• /
• 2006

This paper presents a novel approach for non-iterative surface smoothing with feature preservation on arbitrary meshes. Laplacian operator is performed in a global way over the mesh. The surface smoothing is formulated as a quadratic optimization problem, which is easily solved by a sparse linear system. The cost function to be optimized penalizes deviations from the global Laplacian operator while maintaining the overall shape of the original mesh. The features of the original mesh can be preserved by adding feature constraints and barycenter constraints in the system. Our approach is simple and fast, and does not cause surface shrinkage and distortion. Many experimental results are presented to show the applicability and flexibility of the approach.