• Title/Summary/Keyword: bi-level optimization

Search Result 27, Processing Time 0.028 seconds

The smooth topology optimization for bi-dimensional functionally graded structures using level set-based radial basis functions

  • Wonsik Jung;Thanh T. Banh;Nam G. Luu;Dongkyu Lee
    • Steel and Composite Structures
    • /
    • v.47 no.5
    • /
    • pp.569-585
    • /
    • 2023
  • This paper proposes an efficient approach for the structural topology optimization of bi-directional functionally graded structures by incorporating popular radial basis functions (RBFs) into an implicit level set (ILS) method. Compared to traditional element density-based methods, a level set (LS) description of material boundaries produces a smoother boundary description of the design. The paper develops RBF implicit modeling with multiquadric (MQ) splines, thin-plate spline (TPS), exponential spline (ES), and Gaussians (GS) to define the ILS function with high accuracy and smoothness. The optimization problem is formulated by considering RBF-based nodal densities as design variables and minimizing the compliance objective function. A LS-RBF optimization method is proposed to transform a Hamilton-Jacobi partial differential equation (PDE) into a system of coupled non-linear ordinary differential equations (ODEs) over the entire design domain using a collocation formulation of the method of lines design variables. The paper presents detailed mathematical expressions for BiDFG beams topology optimization with two different material models: continuum functionally graded (CFG) and mechanical functionally graded (MFG). Several numerical examples are presented to verify the method's efficiency, reliability, and success in accuracy, convergence speed, and insensitivity to initial designs in the topology optimization of two-dimensional (2D) structures. Overall, the paper presents a novel and efficient approach to topology optimization that can handle bi-directional functionally graded structures with complex geometries.

Application of Adaptive Particle Swarm Optimization to Bi-level Job-Shop Scheduling Problem

  • Kasemset, Chompoonoot
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.1
    • /
    • pp.43-51
    • /
    • 2014
  • This study presents an application of adaptive particle swarm optimization (APSO) to solving the bi-level job-shop scheduling problem (JSP). The test problem presented here is $10{\times}10$ JSP (ten jobs and ten machines) with tribottleneck machines formulated as a bi-level formulation. APSO is used to solve the test problem and the result is compared with the result solved by basic PSO. The results of the test problem show that the results from APSO are significantly different when compared with the result from basic PSO in terms of the upper level objective value and the iteration number in which the best solution is first identified, but there is no significant difference in the lower objective value. These results confirmed that the quality of solutions from APSO is better than the basic PSO. Moreover, APSO can be used directly on a new problem instance without the exercise to select parameters.

Optimization of Train Working Plan based on Multiobjective Bi-level Programming Model

  • Hai, Xiaowei;Zhao, Chanchan
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.487-498
    • /
    • 2018
  • The purpose of the high-speed railway construction is to better satisfy passenger travel demands. Accordingly, the design of the train working plan must also take a full account of the interests of passengers. Aiming at problems, such as the complex transport organization and different speed trains coexisting, combined with the existing research on the train working plan optimization model, the multiobjective bi-level programming model of the high-speed railway passenger train working plan was established. This model considers the interests of passengers as the center and also takes into account the interests of railway transport enterprises. Specifically, passenger travel cost and travel time minimizations are both considered as the objectives of upper-level programming, whereas railway enterprise profit maximization is regarded as the objective of the lower-level programming. The model solution algorithm based on genetic algorithm was proposed. Through an example analysis, the feasibility and rationality of the model and algorithm were proved.

Restoration of a Bi-level Waveform by Estimation of Edge Locations (에지 위치 추정을 통한 이진 파형의 복원)

  • Kim, Jeong-Tae
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.7
    • /
    • pp.327-331
    • /
    • 2006
  • We have proposed an image restoration method for a bi-level waveforms whose number of edges is known to us. Based on the information, we parametrize a bi-level waveform using the locations of edges and restore the waveform by estimating the parameter. We estimated the locations by maximizing the correlation coefficients between the hi-level waveform and the measured waveform. In experiments using two dimensional barcode images of the PDF417 specification, the proposed method showed better performance than conventional methods in the sense that the proposed method was able to decode barcode images that were not decoded by the conventional methods.

Fast Correction of Nonuniform Illumination on Bi-level Images using Block Based Intensity Normalization (블록 기반 밝기 표준화를 통한 이진영상의 고속 불균일 조명 보정)

  • Joung, Ji-Hye;Kim, Jeong-Tae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.12
    • /
    • pp.1926-1931
    • /
    • 2012
  • We investigated a novel fast non-uniform illumination correction method for bi-level images. The proposed method divides a bi-level image into sub-images and roughly estimates block-wise illumination by low pass filtered maximum values of sub-images. After that, we apply bilinear interpolation using the block-wise illumination to estimate non-uniform illumination, and compensate for the effect of non-uniform illumination using the estimated illumination. Since the proposed method is not based on computation intensive iterative optimization, the proposed method can be used effectively for applications that require fast correction of non-uniform illumination. In simulations, the proposed method showed more than 20 times faster speed than existing entropy minimization method. Moreover, in simulations and experiments, the restored images by the proposed method were more close to true images than images restored by conventional method.

Holistic Joint Optimal Cooperative Spectrum Sensing and Transmission Based on Cooperative Communication in Cognitive Radio

  • Zhong, Weizhi;Chen, Kunqi;Liu, Xin;Zhou, Jianjiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1301-1318
    • /
    • 2017
  • In order to utilize the licensed channel of cognitive radio (CR) when the primary user (PU) is detected busy, a benefit-exchange access mode based on cooperative communication is proposed to allow secondary user (SU) to access the busy channel through giving assistance to PU's communication in exchange for some transmission bandwidth. A holistic joint optimization problem is formulated to maximize the total throughput of CR system through jointly optimizing the parameters of cooperative spectrum sensing (CSS), including the local sensing time, the pre-configured sensing decision threshold, the forward power of cooperative communication, and the bandwidth and transmission power allocated to SUs in benefit-exchange access mode and traditional access mode, respectively. To solve this complex problem, a combination of bi-level optimization, interior-point optimization and exhaustive optimization is proposed. Simulation results show that, compared with the tradition throughput maximizing model (TTMM), the proposed holistic joint optimization model (HJOM) can make use of the channel effectively even if PU is busy, and the total throughput of CR obtains a considerable improvement by HJOM.

Comparison between Cournot-Nash and Stackelberg Game in Bi-level Program (Bi-level program에서 Cournot-Nash게임과 Stackelberg게임의 비교연구)

  • Lim, Yong-Taek;Lim, Kang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.7 s.78
    • /
    • pp.99-106
    • /
    • 2004
  • This paper presents some comparisons between Cournot-Nash and Stackelberg game in bi-level program, composed of both upper level program and lower level one. The upper level can be formulated to optimize a specific objective function, while the lower formulated to express travelers' behavior patterns corresponding to the design parameter of upper level problem. This kind of hi-level program is to determine a design parameter, which leads the road network to an optimal state. Bi-level program includes traffic signal control, traffic information provision, congestion charge and new transportation mode introduction as well as road expansion. From the view point of game theory, many existing algorithms for bi-level program such as IOA (Iterative Optimization Assignment) or IEA (Iterative Estimation Assignment) belong to Cournot-Nash game. But sensitivity-based algorithms belongs to Stackelberg one because they consider the reaction of the lower level program. These two game models would be compared by using an example network and show some results that there is no superiority between the models in deterministic case, but in stochastic case Stackelberg approach is better than that of Cournot-Nash one as we expect.

A Methodology of Path based User Equilibrium Assignment in the Signalized Urban Road Networks (도시부 도로 네트워크에서 교통신호제어와 결합된 경로기반 통행배정 모형 연구)

  • Han, Dong-Hee;Park, Jun-Hwan;Lee, Young-Ihn;Lim, Kang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.2
    • /
    • pp.89-100
    • /
    • 2008
  • In an urban network controlled by traffic signals, there is an interaction between the signal timing and the routes chosen by individual road users. This study develops a bi level programming model for traffic signal optimization in networks with path based traffic assignment. In the bi level programming model, genetic algorithm approach has been proposed to solve upper level problem for a signalized road network. Path based traffic assignment using column generation technique which is proposed by M.H. Xu, is applied at the lower-level. Genetic Algorithm provieds a feasible set of signal timings within specified lower and upper bounds signal timing variables and feeds into lower level problem. The performance of this model is investigated in numerical experiment in a sample network. In result, optimal signal settings and user equilibrium flows are made.

An Approximation Method in Collaborative Optimization for Engine Selection coupled with Propulsion Performance Prediction

  • Jang, Beom-Seon;Yang, Young-Soon;Suh, Jung-Chun
    • Journal of Ship and Ocean Technology
    • /
    • v.8 no.2
    • /
    • pp.41-60
    • /
    • 2004
  • Ship design process requires lots of complicated analyses for determining a large number of design variables. Due to its complexity, the process is divided into several tractable designs or analysis problems. The interdependent relationship requires repetitive works. This paper employs collaborative optimization (CO), one of the multidisciplinary design optimization (MDO) techniques, for treating such complex relationship. CO guarantees disciplinary autonomy while maintaining interdisciplinary compatibility due to its bi-level optimization structure. However, the considerably increased computational time and the slow convergence have been reported as its drawbacks. This paper proposes the use of an approximation model in place of the disciplinary optimization in the system-level optimization. Neural network classification is employed as a classifier to determine whether a design point is feasible or not. Kriging is also combined with the classification to make up for the weakness that the classification cannot estimate the degree of infeasibility. For the purpose of enhancing the accuracy of a predicted optimum and reducing the required number of disciplinary optimizations, an approximation management framework is also employed in the system-level optimization.

Regional Information-based Route Optimization Scheme in Nested Mobile Network (중첩된 이동 네트워크 환경에서 지역적 정보를 이용한 경로 최적화 방안)

  • Kim Joon woo;Park Hee dong;Lee Kang won;Choi Young soo;Cho You ze;Cho Bong kwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.178-185
    • /
    • 2005
  • NEMO basic support is a solution that provides network mobility in the Internet topology. Yet, when multiple mobile networks are nested, this basic solution suffers ken pinball-routing and a severe routing overhead. Therefore, several solutions for route optimization in a nested mobile network have already been suggested by the IETF NEMO WG. However, the current paper proposes Regional Information-based Route Optimization (RIRO) in which mobile routers maintain a Nested Router List (NRL) to obtain next-hop information, and packets are transmitted with a new routing header called an RIRO Routing Header (RIRO-RH). We showed that RIRO had the minimum packet overhead that remained constant, irrespective of how deep the mobile network was nested, in comparison with two earlier proposed schemes - Reverse Routing Header (RRH) and Bi-directional tunnel between HA and Top-Level mobile router (BHT).