• Title/Summary/Keyword: optimality bounds

Search Result 18, Processing Time 0.026 seconds

Parameter estimation of four-parameter viscoelastic Burger model by inverse analysis: case studies of four oil-refineries

  • Dey, Arindam;Basudhar, Prabir Kr.
    • Interaction and multiscale mechanics
    • /
    • v.5 no.3
    • /
    • pp.211-228
    • /
    • 2012
  • This paper reports the development of a generalized inverse analysis formulation for the parameter estimation of four-parameter Burger model. The analysis is carried out by formulating the problem as a mathematical programming formulation in terms of identification of the design vector, the objective function and the design constraints. Thereafter, the formulated constrained nonlinear multivariable problem is solved with the aid of fmincon: an in-built constrained optimization solver module available in MatLab. In order to gain experience, a synthetic case-study is considered wherein key issues such as the determination and setting up of variable bounds, global optimality of the solution and minimum number of data-points required for prediction of parameters is addressed. The results reveal that the developed technique is quite efficient in predicting the model parameters. The best result is obtained when the design variables are subjected to a lower bound without any upper bound. Global optimality of the solution is achieved using the developed technique. A minimum of 4-5 randomly selected data-points are required to achieve the optimal solution. The above technique has also been adopted for real-time settlement of four oil refineries with encouraging results.

Redesigning Radio Networks Considering Frequency Demands and Frequency Reassignment Cost (주파수 수요와 주파수 재할당 비용을 고려한 무선통신 네트워크 재설계)

  • Han, Junghee
    • Journal of Information Technology Services
    • /
    • v.10 no.1
    • /
    • pp.117-133
    • /
    • 2011
  • In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

Dominance, Potential Optimality, and Strict Preference Information in Multiple Criteria Decision Making

  • Park, Kyung-Sam;Shin, Dong-Eun
    • Management Science and Financial Engineering
    • /
    • v.17 no.2
    • /
    • pp.63-84
    • /
    • 2011
  • The ordinary multiple criteria decision making (MCDM) approach requires two types of input, alternative values and criterion weights, and employs two schemes of alternative prioritization, dominance and potential optimality. This paper allows for incomplete information on both types of input and gives rise to the dominance relationships and potential optimality of alternatives. Unlike the earlier studies, we emphasize that incomplete information frequently takes the form of strict inequalities, such as strict orders and strict bounds, rather than weak inequalities. Then the issues of rising importance include: (1) The standard mathematical programming approach to prioritize alternatives cannot be used directly, because the feasible region for the permissible decision parameters becomes an open set. (2) We show that the earlier methods replacing the strict inequalities with weak ones, by employing a small positive number or zeroes, which closes the feasible set, may cause a serious problem and yield unacceptable prioritization results. Therefore, we address these important issues and develop a useful and simple method, without selecting any small value for the strict preference information. Given strict information on both types of decision parameters, we first construct a nonlinear program, transform it into a linear programming equivalent, and finally solve it via a two-stage method. An application is also demonstrated herein.

A hybrid simulated annealing and optimality criteria method for optimum design of RC buildings

  • Li, Gang;Lu, Haiyan;Liu, Xiang
    • Structural Engineering and Mechanics
    • /
    • v.35 no.1
    • /
    • pp.19-35
    • /
    • 2010
  • This paper proposes a hybrid heuristic and criteria-based method of optimum design which combines the advantages of both the iterated simulated annealing (SA) algorithm and the rigorously derived optimality criteria (OC) for structural optimum design of reinforced concrete (RC) buildings under multi-load cases based on the current Chinese design codes. The entire optimum design procedure is divided into two parts: strength optimum design and stiffness optimum design. A modified SA with the strategy of adaptive feasible region is proposed to perform the discrete optimization of RC frame structures under the strength constraints. The optimum stiffness design is conducted using OC method with the optimum results of strength optimum design as the lower bounds of member size. The proposed method is integrated into the commercial software packages for building structural design, SATWE, and for finite element analysis, ANSYS, for practical applications. Finally, two practical frame-shear-wall structures (15-story and 30-story) are optimized to illustrate the effectiveness and practicality of the proposed optimum design method.

Minimum-Time Trajectory Planning Ensuring Collision-Free Motions for Two Robots with Geometric Path Constraints (공간상의 길이 주어진 두 대의 로보트를 위한 최소시간 충돌회피 경로 계획)

  • ;Zeung Nam Bien
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.5
    • /
    • pp.357-368
    • /
    • 1991
  • Collision-free trajectory planning for two robots is considered. The two robot system handled in the paper is given specified geometric paths for two robots, and the task is repeating. Then, the robot dynamics is transformed as a function of the traveled lengths along the paths, and the bounds on acceleration and velocity are described in the phase plane be taking the constraints on torques and joint velocities into consideration. Collision avoidance and time optimality are considered simultaneously in the coordination space and the phase plane, respectively. The proof for the optimality of the proposed algorithm is given, and a simulation result is included to show the usefulness of the proposed method.

  • PDF

Application of DCOC for Minimum Cost Design of PPC Structrues (PPC 구조의 최소경비설계를 위한 DCOC방법의 응용)

  • 조홍동;이상근;구봉근;한상훈
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1997.10a
    • /
    • pp.171-178
    • /
    • 1997
  • This paper describes the application of discretized continuum-type optimality criteria (DCOC) for the multispan partially prestressed concrete beams. The cost of construction as objective function which includes the costs of concrete, prestressing steel, non-prestressing steel and formwork is minimized. The design constraints include limits on the maximum deflection, flexural and shear strengths, in addition to ductility requirements, and upper and lower bounds on design variables as stipulated by the design code. Based on Kuhn-Tucker necessary conditions, the optimality criteria are explicitly derived in terms of the design variables-effective depth, eccentricity of prestressing steel and non-prestressing steel ratio. The prestressing profile is prescribed by parabolic functions. The self-weight of the structure is included in the equilibrium equation of the real system, as is the secondary effect resulting from the prestressing force. Two numerical examples of multispan PPC beams with rectangular cross-section are solved to show the applicability and efficiency fo the DCOC-based technique.

  • PDF

Optimum Design of Reinforced Concrete Continuous Beams using DCOC (이산성 연속형 최적규준(DCOC)방법에 의한 RC연속보의 최적설계)

  • 조홍동;이상근;구봉근;한상훈
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 1996.10a
    • /
    • pp.440-446
    • /
    • 1996
  • In this study, a procedure for the economic design of reinforced concrete beams under several design constraints is outlined on the basis of discretized continuum-type optimality criteria (DCOC). The costs to be minimized involve those of concrete, reinforcing steel and formwork. The design constraints include limits on the maximum deflection in a given span, on bending and shear strengths, in addition to upper and lower bounds on design variables. An explicit mathematical derivation of optimality criteria is given based on the well known Kuhn-Tucker mecessary conditions, followed by an iterative procedure for designs when the design variables are the depth and the steel ratio. Self-weight of the spans is also included in the equilibrium equation of the real system and in the optimatlity criteria.

  • PDF

Tabu Search Heuristic Algorithm for Designing Broadband Convergence Networks (BcN 서비스 가입자 망 설계를 위한 타부서치 휴리스틱 알고리즘 개발)

  • Lee, Youngho;Yun, Hyunjung;Lee, Sunsuk;Park, Noik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.2
    • /
    • pp.205-215
    • /
    • 2008
  • convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.

Development of DCOC Algorithm Considering the Variation of Effective Depth in the Optimum Design of PRC Continuous Beam (PRC연속보 최적설계에서 단면의 유효깊이 변화를 고려한 DCOC알고리즘 개발)

  • 조홍동;한상훈
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.15 no.2
    • /
    • pp.281-291
    • /
    • 2002
  • This paper describes the minimum cost design of prestressed reinforced concrete (PRC) hem with rectangular section. The cost of construction as objective function which includes the costs of concrete, prestressing steel, non prestressing steel, and formwork is minimized. The design constraints include limits on the minimum deflection, flexural and shear strengths, in addition to ductility requirements, and upper-Lower bounds on design variables as stipulated by the specification. The optimization is carried out using the methods based on discretized continuum-type optimality criteria(DCOC). Based on Kuhn-Tucker necessary conditions, the optimality criteria are explicitly derived in terms of the design variables - effective depth, eccentricity of prestressing steel and non prestressing steel ratio. The prestressing profile is prescribed by parabolic functions. In this paper the effective depth is considered to be freely-varying and one uniform for the entire multispan beam respectively. Also the maximum eccentricity of prestressing force is considered in every span. In order to show the applicability and efficiency of the derived algorithm, several numerical examples of PRC continuous beams are solved.

Minimum Cost Design of Reinforced Concrete Beam Using DCOC (DCOC를 이용한 철근 콘크리트보의 최소경비설계)

  • 조홍동;한상훈
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.13 no.4
    • /
    • pp.417-425
    • /
    • 2000
  • This paper describes the application of discretized continuum-type optimality criteria(DCOC) and the development of optimum design program for the reinforced concrete continuous beams with rectangular cross-section. The cost of construction as objective function which includes the costs of concrete, reinforcing steel and formwork is minimized. The design constraints include limits on the maximum deflection, flexural and shear strengths, in addition to ductility requirements, and upper and lower bounds on design variables as stipulated by the design Code. Based on Kuhn-Tucker necessary conditions, the optimality criteria are explicitly derived in terms of the design variables-effective depth, and steel ratio. The self-weight of the beam is included in the equilibrium equation of the real system. An iterative procedure and computer program for updating the design variables are developed. Two numerical examples of reinforced concrete continuous beams are presented to show the applicability and efficiency of the DCOC-based technique.

  • PDF