• Title/Summary/Keyword: optimization problem

Search Result 4,342, Processing Time 0.032 seconds

Hopfield neuron based nonlinear constrained programming to fuzzy structural engineering optimization

  • Shih, C.J.;Chang, C.C.
    • Structural Engineering and Mechanics
    • /
    • v.7 no.5
    • /
    • pp.485-502
    • /
    • 1999
  • Using the continuous Hopfield network model as the basis to solve the general crisp and fuzzy constrained optimization problem is presented and examined. The model lies in its transformation to a parallel algorithm which distributes the work of numerical optimization to several simultaneously computing processors. The method is applied to different structural engineering design problems that demonstrate this usefulness, satisfaction or potential. The computing algorithm has been given and discussed for a designer who can program it without difficulty.

Optimization Algorithm for Real-time Load Dispatch Problem Using Shut-off and Swap Method (발전정지와 교환방법을 적용한 실시간급전문제 최적화 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.4
    • /
    • pp.219-224
    • /
    • 2017
  • In facing the lack of a deterministic algorithm for economic load dispatch optimization problem, only non-deterministic heuristic algorithms have been suggested. Worse still, there is a near deficiency of research devoted to real-time load dispatch optimization algorithm. In this paper, therefore, I devise a shut-off and swap algorithm to solve real-time load dispatch optimization problem. With this algorithm in place, generators with maximum cost-per-unit generation power are to be shut off. The proposed shut-off criteria use only quadratic function in power generation cost function without valve effect nonlinear absolute function. When applied to the most prevalent economic load dispatch benchmark data, the proposed algorithm is proven to largely reduce the power cost of known algorithms.

Radio Resource Management Scheme for Heterogeneous Wireless Networks Based on Access Proportion Optimization

  • Shi, Zheng;Zhu, Qi
    • Journal of Communications and Networks
    • /
    • v.15 no.5
    • /
    • pp.527-537
    • /
    • 2013
  • Improving resource utilization has been a hot issue in heterogeneous wireless networks (HWNs). This paper proposes a radio resource management (RRM) method based on access proportion optimization. By considering two or more wireless networks in overlapping regions, users in these regions must select one of the networks to access when they engage in calls. Hence, the proportion of service arrival rate that accesses each network in the overlapping region can be treated as an optimized factor for the performance analysis of HWNs. Moreover, this study considers user mobility as an important factor that affects the performance of HWNs, and it is reflected by the handoff rate. The objective of this study is to maximize the total throughput of HWNs by choosing the most appropriate factors. The total throughput of HWNs can be derived on the basis of a Markov model, which is determined by the handoff rate analysis and distribution of service arrival rate in each network. The objective problem can actually be expressed as an optimization problem. Considering the convexity of the objective function, the optimization problem can be solved using the subgradient approach. Finally, an RRM optimization scheme for HWNs is proposed. The simulation results show that the proposed scheme can effectively enhance the throughput of HWNs, i.e., improve the radio resource utilization.

A Study on the Comparison of Performances Between Direct Method and Approximation Method in Structural Optimization (구조최적설계시 직접법 및 근사법 알고리즘의 성능 비교에 관한 연구)

  • 박영선;이상헌;박경진
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.2
    • /
    • pp.313-322
    • /
    • 1994
  • Structural optimization has been developed by two methods. One is the direct method which applies the Nonlinear Programming (NLP) algorithm directly to the structural optimization problem. This method is known to be very excellent mathematically. However, it is very expensive for large-scale problems due to the one-dimensional line search. The other method is the approximation method which utilizes the engineering senses very well. The original problem is approximated to a simple problem and an NLP algorithm is adopted for solving the approximated problems. Practical solutions are obtained with low cost by this method. The two methods are compared through standard structural optimization problems. The Finite element method with truss and beam elements is used for the structural and sensitivity analyses. The results are analyzed based on the convergence performances, the number is function calculations, the quality of the cost functions, and etc. The applications of both methods are also discussed.

Topology Optimization for Large-displacement Compliant Mechanisms Using Element Free Galerkin Method

  • Du, Yixian;Chen, Liping
    • International Journal of CAD/CAM
    • /
    • v.8 no.1
    • /
    • pp.1-10
    • /
    • 2009
  • This paper presents a topology optimization approach using element-free Galerkin method (EFGM) for the optimal design of compliant mechanisms with geometrically non-linearity. Meshless method has an advantage over the finite element method(FEM) because it is more capable of handling large deformation resulted from geometrical nonlinearity. Therefore, in this paper, EFGM is employed to discretize the governing equations and the bulk density field. The sensitivity analysis of the optimization problem is performed by incorporating the adjoint approach with the meshless method. The Lagrange multipliers method adjusted for imposition of both the concentrated and continuous essential boundary conditions in the EFGM is proposed in details. The optimization mathematical formulation is developed to convert the multi-criteria problem to an equivalent single-objective problem. The popularly applied interpolation scheme, solid isotropic material with penalization (SIMP), is used to indicate the dependence of material property upon on pseudo densities discretized to the integration points. A well studied numerical example has been applied to demonstrate the proposed approach works very well and the non-linear EFGM can obtain the better topologies than the linear EFGM to design large-displacement compliant mechanisms.

Structural optimal control based on explicit time-domain method

  • Taicong Chen;Houzuo Guo;Cheng Su
    • Structural Engineering and Mechanics
    • /
    • v.85 no.5
    • /
    • pp.607-620
    • /
    • 2023
  • The classical optimal control (COC) method has been widely used for linear quadratic regulator (LQR) problems of structural control. However, the equation of motion of the structure is incorporated into the optimization model as the constraint condition for the LQR problem, which needs to be solved through the Riccati equation under certain assumptions. In this study, an explicit optimal control (EOC) method is proposed based on the explicit time-domain method (ETDM). By use of the explicit formulation of structural responses, the LQR problem with the constraint of equation of motion can be transformed into an unconstrained optimization problem, and therefore the control law can be derived directly without solving the Riccati equation. To further optimize the weighting parameters adopted in the control law using the gradient-based optimization algorithm, the sensitivities of structural responses and control forces with respect to the weighting parameters are derived analytically based on the explicit expressions of dynamic responses of the controlled structure. Two numerical examples are investigated to demonstrate the feasibility of the EOC method and the optimization scheme for weighting parameters involved in the control law.

Multi-factor Evolution for Large-scale Multi-objective Cloud Task Scheduling

  • Tianhao Zhao;Linjie Wu;Di Wu;Jianwei Li;Zhihua Cui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.4
    • /
    • pp.1100-1122
    • /
    • 2023
  • Scheduling user-submitted cloud tasks to the appropriate virtual machine (VM) in cloud computing is critical for cloud providers. However, as the demand for cloud resources from user tasks continues to grow, current evolutionary algorithms (EAs) cannot satisfy the optimal solution of large-scale cloud task scheduling problems. In this paper, we first construct a large- scale multi-objective cloud task problem considering the time and cost functions. Second, a multi-objective optimization algorithm based on multi-factor optimization (MFO) is proposed to solve the established problem. This algorithm solves by decomposing the large-scale optimization problem into multiple optimization subproblems. This reduces the computational burden of the algorithm. Later, the introduction of the MFO strategy provides the algorithm with a parallel evolutionary paradigm for multiple subpopulations of implicit knowledge transfer. Finally, simulation experiments and comparisons are performed on a large-scale task scheduling test set on the CloudSim platform. Experimental results show that our algorithm can obtain the best scheduling solution while maintaining good results of the objective function compared with other optimization algorithms.

An Ant Colony Optimization Algorithm to Solve Steiner Tree Problem (스타이너 트리 문제를 위한 Ant Colony Optimization 알고리즘의 개발)

  • Seo, Min-Seok;Kim, Dae-Cheol
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.3
    • /
    • pp.17-28
    • /
    • 2008
  • The Steiner arborescence problem is known to be NP-hard. The objective of this problem is to find a minimal Steiner tree which starts from a designated node and spans all given terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step, graph reduction rules eliminate useless nodes and arcs which do not contribute to make an optimal solution. In the second step. ant colony algorithm with use of Prim's algorithm is used to solve the Steiner arborescence problem in the reduced graph. The proposed method based on a two-step procedure is tested in the five test problems. The results show that this method finds the optimal solutions to the tested problems within 50 seconds. The algorithm can be applied to undirected Steiner tree problems with minor changes. 18 problems taken from Beasley are used to compare the performances of the proposed algorithm and Singh et al.'s algorithm. The results show that the proposed algorithm generates better solutions than the algorithm compared.

DNA Computing Adopting DNA coding Method to solve effective Knapsack Problem (효과적인 배낭 문제 해결을 위해 DNA 코딩 방법을 적용한 DNA 컴퓨팅)

  • Kim Eun-Gyeong;Lee Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.6
    • /
    • pp.730-735
    • /
    • 2005
  • Though Knapsack Problem appears to be simple, it is a NP-hard problem that is not solved in polynomial time as combinational optimization problems. To solve this problem, GA(Genetic Algorithms) was used in the past. However, there were difficulties in real experiments because the conventional method didn't reflect the precise characteristics of DNA. In this paper we proposed ACO (Algorithm for Code Optimization) that applies DNA coding method to DNA computing to solve problems of Knapsack Problem. ACO was applied to (0,1) Knapsack Problem; as a result, it reduced experimental errors as compared with conventional methods, and found accurate solutions more rapidly.

On the Formulation and Optimal Solution of the Rate Control Problem in Wireless Mesh Networks

  • Le, Cong Loi;Hwang, Won-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5B
    • /
    • pp.295-303
    • /
    • 2007
  • An algorithm is proposed to seek a local optimal solution of the network utility maximization problem in a wireless mesh network, where the architecture being considered is an infrastructure/backbone wireless mesh network. The objective is to achieve proportional fairness amongst the end-to-end flows in wireless mesh networks. In order to establish the communication constraints of the flow rates in the network utility maximization problem, we have presented necessary and sufficient conditions for the achievability of the flow rates. Since wireless mesh networks are generally considered as a type of ad hoc networks, similarly as in wireless multi-hop network, the network utility maximization problem in wireless mesh network is a nonlinear nonconvex programming problem. Besides, the gateway/bridge functionalities in mesh routers enable the integration of wireless mesh networks with various existing wireless networks. Thus, the rate optimization problem in wireless mesh networks is more complex than in wireless multi-hop networks.