• Title/Summary/Keyword: optimization problem

Search Result 4,342, Processing Time 0.025 seconds

MONOTONIC OPTIMIZATION TECHNIQUES FOR SOLVING KNAPSACK PROBLEMS

  • Tran, Van Thang;Kim, Jong Kyu;Lim, Won Hee
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.3
    • /
    • pp.611-628
    • /
    • 2021
  • In this paper, we propose a new branch-reduction-and-bound algorithm to solve the nonlinear knapsack problems by using general discrete monotonic optimization techniques. The specific properties of the problem are exploited to increase the efficiency of the algorithm. Computational experiments of the algorithm on problems with up to 30 variables and 5 different constraints are reported.

Optimal design of reinforced concrete plane frames using artificial neural networks

  • Kao, Chin-Sheng;Yeh, I-Cheng
    • Computers and Concrete
    • /
    • v.14 no.4
    • /
    • pp.445-462
    • /
    • 2014
  • To solve structural optimization problems, it is necessary to integrate a structural analysis package and an optimization package. There have been many packages that can be employed to analyze reinforced concrete plane frames. However, because most structural analysis packages suffer from closeness of systems, it is very difficult to integrate them with optimization packages. To overcome the difficulty, we proposed a possible alternative, DAMDO, which integrates Design, Analysis, Modeling, Definition, and Optimization phases into an integration environment as follows. (1) Design: first generate many possible structural design alternatives. Each design alternative consists of many design variables X. (2) Analysis: employ the structural analysis software to analyze all structural design alternatives to obtain their internal forces and displacements. They are the response variables Y. (3) Modeling: employ artificial neural networks to build the models Y=f(X) to obtain the relationship functions between the design variables X and the response variables Y. (4) Definition: employ the design variables X and the response variables Y to define the objective function and constraint functions. (5) Optimization: employ the optimization software to solve the optimization problem consisting of the objective function and the constraint functions to produce the optimum design variables. The RC frame optimization problem was examined to evaluate the DAMDO approach, and the empirical results showed that it can be solved by the approach.

Regional Science and Technology Resource Allocation Optimization Based on Improved Genetic Algorithm

  • Xu, Hao;Xing, Lining;Huang, Lan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1972-1986
    • /
    • 2017
  • With the advent of the knowledge economy, science and technology resources have played an important role in economic competition, and their optimal allocation has been regarded as very important across the world. Thus, allocation optimization research for regional science and technology resources is significant for accelerating the reform of regional science and technology systems. Regional science and technology resource allocation optimization is modeled as a double-layer optimization model: the entire system is characterized by top-layer optimization, whereas the subsystems are characterized by bottom-layer optimization. To efficaciously solve this optimization problem, we propose a mixed search method based on the orthogonal genetic algorithm and sensitivity analysis. This novel method adopts the integrated modeling concept with a combination of the knowledge model and heuristic search model, on the basis of the heuristic search model, and simultaneously highlights the effect of the knowledge model. To compare the performance of different methods, five methods and two channels were used to address an application example. Both the optimized results and simulation time of the proposed method outperformed those of the other methods. The application of the proposed method to solve the problem of entire system optimization is feasible, correct, and effective.

Design of Wheel Profile to Reduce Wear of Railway Wheel (곡선부에서 차륜 마모 저감을 위한 차륜답면 형상 설계)

  • Choi, Ha-Young;Lee, Dong-Hyong;Song, Chang-Yong;Lee, Jong-Soo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.29 no.6
    • /
    • pp.607-612
    • /
    • 2012
  • The wear problem of wheel flange occurs at sharp curves of rail. This paper proposes a procedure for optimum design of a wheel profile wherein flange wear is reduced by improving an interaction between wheel and rail. Application of optimization method to design problem mainly depends on characteristics of design space. This paper compared local optimization method with global optimization according to sensitivity value of objective function for design variables to find out which optimization method is appropriable to minimize wear of wheel flange. Wheel profile is created by a piecewise cubic Hermite interpolating polynomial and dynamic performances are analyzed by a railway dynamic analysis program, VAMPIRE. From the optimization results, it is verified that the global optimization method such as genetic algorithm is more suitable to wheel profile optimization than the local optimization of SQP (Sequential Quadratic Programming) in case of considering the lack of empirical knowledge for initial design value.

Optimum design of cantilever retaining walls under seismic loads using a hybrid TLBO algorithm

  • Temur, Rasim
    • Geomechanics and Engineering
    • /
    • v.24 no.3
    • /
    • pp.237-251
    • /
    • 2021
  • The main purpose of this study is to investigate the performance of the proposed hybrid teaching-learning based optimization algorithm on the optimum design of reinforced concrete (RC) cantilever retaining walls. For this purpose, three different design examples are optimized with 100 independent runs considering continuous and discrete variables. In order to determine the algorithm performance, the optimization results were compared with the outcomes of the nine powerful meta-heuristic algorithms applied to this problem, previously: the big bang-big crunch (BB-BC), the biogeography based optimization (BBO), the flower pollination (FPA), the grey wolf optimization (GWO), the harmony search (HS), the particle swarm optimization (PSO), the teaching-learning based optimization (TLBO), the jaya (JA), and Rao-3 algorithms. Moreover, Rao-1 and Rao-2 algorithms are applied to this design problem for the first time. The objective function is defined as minimizing the total material and labor costs including concrete, steel, and formwork per unit length of the cantilever retaining walls subjected to the requirements of the American Concrete Institute (ACI 318-05). Furthermore, the effects of peak ground acceleration value on minimum total cost is investigated using various stem height, surcharge loads, and backfill slope angle. Finally, the most robust results were obtained by HTLBO with 50 populations. Consequently the optimization results show that, depending on the increase in PGA value, the optimum cost of RC cantilever retaining walls increases smoothly with the stem height but increases rapidly with the surcharge loads and backfill slope angle.

A Physical-layer Security Scheme Based on Cross-layer Cooperation in Dense Heterogeneous Networks

  • Zhang, Bo;Huang, Kai-zhi;Chen, Ya-jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2595-2618
    • /
    • 2018
  • In this paper, we investigate secure communication with the presence of multiple eavesdroppers (Eves) in a two-tier downlink dense heterogeneous network, wherein there is a macrocell base station (MBS) and multiple femtocell base stations (FBSs). Each base station (BS) has multiple users. And Eves attempt to wiretap a macrocell user (MU). To keep Eves ignorant of the confidential message, we propose a physical-layer security scheme based on cross-layer cooperation to exploit interference in the considered network. Under the constraints on the quality of service (QoS) of other legitimate users and transmit power, the secrecy rate of system can be maximized through jointly optimizing the beamforming vectors of MBS and cooperative FBSs. We explore the problem of maximizing secrecy rate in both non-colluding and colluding Eves scenarios, respectively. Firstly, in non-colluding Eves scenario, we approximate the original non-convex problem into a few semi-definite programs (SDPs) by employing the semi-definite relaxation (SDR) technique and conservative convex approximation under perfect channel state information (CSI) case. Furthermore, we extend the frame to imperfect CSI case and use the Lagrangian dual theory to cope with uncertain constraints on CSI. Secondly, in colluding Eves scenario, we transform the original problem into a two-tier optimization problem equivalently. Among them, the outer layer problem is a single variable optimization problem and can be solved by one-dimensional linear search. While the inner-layer optimization problem is transformed into a convex SDP problem with SDR technique and Charnes-Cooper transformation. In the perfect CSI case of both non-colluding and colluding Eves scenarios, we prove that the relaxation of SDR is tight and analyze the complexity of proposed algorithms. Finally, simulation results validate the effectiveness and robustness of proposed scheme.

A Unified Approach to Discrete Time Robust Filtering Problem (이산시간 강인 필터링 문제를 위한 통합 설계기법)

  • Ra, Won-Sang;Jin, Seung-Hee;Yoon, Tae-Sung;Park, Jin-Bae
    • Proceedings of the KIEE Conference
    • /
    • 1999.07b
    • /
    • pp.592-595
    • /
    • 1999
  • In this paper, we propose a unified method to solve the various robust filtering problem for a class of uncertain discrete time systems. Generally, to solve the robust filtering problem, we must convert the convex optimization problem with uncertainty blocks to the uncertainty free convex optimization problem. To do this, we derive the robust matrix inequality problem. This technique involves using constant scaling parameter which can be optimized by solving a linear matrix inequality problem. Therefore, the robust matrix inequality problem does not conservative. The robust filter can be designed by using this robust matrix inequality problem and by considering its solvability conditions.

  • PDF

An Integration of Local Search and Constraint Programming for Solving Constraint Satisfaction Optimization Problems (제약 만족 최적화 문제의 해결을 위한 지역 탐색과 제약 프로그래밍의 결합)

  • Hwang, Jun-Ha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.5
    • /
    • pp.39-47
    • /
    • 2010
  • Constraint satisfaction optimization problem is a kind of optimization problem involving cost minimization as well as complex constraints. Local search and constraint programming respectively have been used for solving such problems. In this paper, I propose a method to integrate local search and constraint programming to improve search performance. Basically, local search is used to solve the given problem. However, it is very difficult to find a feasible neighbor satisfying all the constraints when we use only local search. Therefore, I introduced constraint programming as a tool for neighbor generation. Through the experimental results using weighted N-Queens problems, I confirmed that the proposed method can significantly improve search performance.

Strategy for Task Offloading of Multi-user and Multi-server Based on Cost Optimization in Mobile Edge Computing Environment

  • He, Yanfei;Tang, Zhenhua
    • Journal of Information Processing Systems
    • /
    • v.17 no.3
    • /
    • pp.615-629
    • /
    • 2021
  • With the development of mobile edge computing, how to utilize the computing power of edge computing to effectively and efficiently offload data and to compute offloading is of great research value. This paper studies the computation offloading problem of multi-user and multi-server in mobile edge computing. Firstly, in order to minimize system energy consumption, the problem is modeled by considering the joint optimization of the offloading strategy and the wireless and computing resource allocation in a multi-user and multi-server scenario. Additionally, this paper explores the computation offloading scheme to optimize the overall cost. As the centralized optimization method is an NP problem, the game method is used to achieve effective computation offloading in a distributed manner. The decision problem of distributed computation offloading between the mobile equipment is modeled as a multi-user computation offloading game. There is a Nash equilibrium in this game, and it can be achieved by a limited number of iterations. Then, we propose a distributed computation offloading algorithm, which first calculates offloading weights, and then distributedly iterates by the time slot to update the computation offloading decision. Finally, the algorithm is verified by simulation experiments. Simulation results show that our proposed algorithm can achieve the balance by a limited number of iterations. At the same time, the algorithm outperforms several other advanced computation offloading algorithms in terms of the number of users and overall overheads for beneficial decision-making.

Active and Passive Beamforming for IRS-Aided Vehicle Communication

  • Xiangping Kong;Yu Wang;Lei Zhang;Yulong Shang;Ziyan Jia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.5
    • /
    • pp.1503-1515
    • /
    • 2023
  • This paper considers the jointly active and passive beamforming design in the IRS-aided MISO downlink vehicle communication system where both V2I and V2V communication paradigms coexist. We formulate the problem as an optimization problem aiming to minimize the total transmit power of the base station subject to SINR requirements of both V2I and V2V users, total transmit power of base station and IRS's phase shift constraints. To deal with this non-convex problem, we propose a method which can alternately optimize the active beamforming at the base station and the passive beamforming at the IRS. By using first-order Taylor expansion, matrix analysis theory and penalized convex-concave process method, the non-convex optimization problem with coupled variables is converted into two decoupled convex sub-problems. The simulation results show that the proposed alternate optimization algorithm can significantly decrease the total transmit power of the vehicle base station.