• 제목/요약/키워드: Iterative Approach

검색결과 497건 처리시간 0.025초

Combined Traffic Signal Control and Traffic Assignment : Algorithms, Implementation and Numerical Results

  • Lee, Chung-Won
    • 대한교통학회:학술대회논문집
    • /
    • 대한교통학회 2000년도 제37회 학술발표회논문집
    • /
    • pp.89-115
    • /
    • 2000
  • Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

  • PDF

A NON-OVERLAPPING DOMAIN DECOMPOSITION METHOD FOR A DISCONTINUOUS GALERKIN METHOD: A NUMERICAL STUDY

  • Eun-Hee Park
    • Korean Journal of Mathematics
    • /
    • 제31권4호
    • /
    • pp.419-431
    • /
    • 2023
  • In this paper, we propose an iterative method for a symmetric interior penalty Galerkin method for heterogeneous elliptic problems. The iterative method consists mainly of two parts based on a non-overlapping domain decomposition approach. One is an intermediate preconditioner constructed by understanding the properties of the discontinuous finite element functions and the other is a preconditioning related to the dual-primal finite element tearing and interconnecting (FETI-DP) methodology. Numerical results for the proposed method are presented, which demonstrate the performance of the iterative method in terms of various parameters associated with the elliptic model problem, the finite element discretization, and non-overlapping subdomain decomposition.

Large-scaled truss topology optimization with filter and iterative parameter control algorithm of Tikhonov regularization

  • Nguyen, Vi T.;Lee, Dongkyu
    • Steel and Composite Structures
    • /
    • 제39권5호
    • /
    • pp.511-528
    • /
    • 2021
  • There are recently some advances in solving numerically topology optimization problems for large-scaled trusses based on ground structure approach. A disadvantage of this approach is that the final design usually includes many bars, which is difficult to be produced in practice. One of efficient tools is a so-called filter scheme for the ground structure to reduce this difficulty and determine several distinct bars. In detail, this technique is valuable for practical uses because unnecessary bars are filtered out from the ground structure to obtain a well-defined structure during the topology optimization process, while it still guarantees the global equilibrium condition. This process, however, leads to a singular system of equilibrium equations. In this case, the minimization of least squares with Tikhonov regularization is adopted. In this paper, a proposed algorithm in controlling optimal Tikhonov parameter is considered in combination with the filter scheme due to its crucial role in obtaining solution to remove numerical singularity and saving computational time by using sparse matrix, which means that the discrete optimal topology solutions depend on choosing the Tikhonov parameter efficiently. Several numerical examples are investigated to demonstrate the efficiency of the filter parameter control algorithm in terms of the large-scaled optimal topology designs.

Successive Synthesis of Well-Defined Star-Branched Polymers by an Iterative Approach Based on Living Anionic Polymerization

  • Higashihara Tomoya;Inoue Kyoichi;Nagura Masato;Hirao Akira
    • Macromolecular Research
    • /
    • 제14권3호
    • /
    • pp.287-299
    • /
    • 2006
  • To successively synthesize star-branched polymers, we developed a new iterative methodology which involves only two sets of the reactions in each iterative process: (a) an addition reaction of DPE or DPE-functionalized polymer to a living anionic polymer, and (b) an in-situ reaction of 1-(4-(4-bromobutyl)phenyl)-1-phenylethylene with the generated 1,1-diphenylalkyl anion to introduce one DPE functionality. With this methodology, 3-, 4-, and 5-arm, regular star-branched polystyrenes, as well as 3-arm ABC, 4-arm ABCD, and a new 5-arm ABCDE, asymmetric star-branched polymers, were successively synthesized. The A, B, C, D, and E arm segments were poly(4-trimethylsilylstyrene), poly(4-methoxystyrene), poly(4-methylstyrene), polystyrene, and poly(4-tert-butyldimethylsilyloxystyrene), respectively. All of the resulting star-branched polymers were well-defined in architecture and precisely controlled in chain length, as confirmed by SEC, $^1H$ NMR, VPO, and SLS analyses. Furthermore, we extended the iterative methodology by the use of a new functionalized DPE derivative, 1-(3-chloromethylphenyl)-1-((3-(1-phonyletheny1)phenyl) ethylene, capable of introducing two DPE functionalities via one DPE anion reaction site in the reaction (b). The number of arm segments of the star-branched polymer synthesized by the methodology could be dramatically increased to 2, 6, and up to 14 by repeating the iterative process.

개선된 이진 확장 GCD 알고리듬 기반 GF(2163)상에서 Iterative 나눗셈기 설계 (Design of Iterative Divider in GF(2163) Based on Improved Binary Extended GCD Algorithm)

  • 강민섭;전병찬
    • 정보처리학회논문지C
    • /
    • 제17C권2호
    • /
    • pp.145-152
    • /
    • 2010
  • 본 논문에서는 표준기저(standard basis) 표기법을 이용하여 GF($2^{163}$) 상에서개선된 나눗셈 알고리듬을 제안하고, 제안한 알고리듬을 기반으로 한 반복 하드웨어 구조(iterative hardware structure)를 갖는 고속 나눗셈기를 설계한다. 제안한알고리듬은 이진 확장 GCD 알고리듬을 기본으로 하고 있으며, 모듈러감소 (modular reduction)를 위한 모든 산술연산은 기존의 방법과 달리 하나의 while루프 내에서 수행된다. 제안된 알고리듬을 기본으로 하여 설계된 나눗셈기는 모듈러 연산을 위한 각 모듈이 하나의 클럭에 의해서제어되므로 계산 속도가 매우 빠르다. 여기에서 사용하는 감소 다항식(reduction polynomial)은 SEC2 (Standards for Efficient Cryptography) 에서 권장하는 $f(x)=x^{163}+x^7+x^6+x^3+1$이며, 차수(degree) m은 163을 사용한다. 제안한 알고리듬은 Verilog HDL(Hardware Description Language)을 사용하여 FPGA로 구현되었으며, Xilinx-VirtexII XC2V8000 FPGA 상에서 85MHz로 동작함을 확인하였다. 또한, 구현 결과 및 성능 평가를 통하여 제안한 알고리듬의 종래의 두 알고리듬보다 성능이크게 개선됨을 보인다.

확정론적 기법 및 확률론적 기법을 적용한 선박 초기 설계 방법에 관한 연구 (A Study on the Preliminary Ship Design Method using Deterministic Approach and Probabilistic Approach)

  • 양영순;박창규;유원선
    • 대한조선학회논문집
    • /
    • 제41권3호
    • /
    • pp.49-59
    • /
    • 2004
  • The paper describes the preliminary ship design method using deterministic approach and probabilistic approach. In deterministic approach, there are computational aspects to applying not only the integration concurrently of principal dimension decisions and hull form variations but also hydrostatic coefficients that applied to optimization iterative process. Therefore, this paper developed that actual design concept at the preliminary ship design more than sequential design which separated in principal dimension decisions and hull form variations. Furthermore, a probabilistic approach at the preliminary ship design is applied to efficiently solve design information uncertainty that compared to deterministic approach.

투사 및 역투사 방법에 따른 컴퓨터단층촬영 영상 비교 (Comparison Study on Projection and Backprojection Methods for CT Simulation)

  • 오오성;이승욱
    • 대한방사선기술학회지:방사선기술과학
    • /
    • 제37권4호
    • /
    • pp.323-330
    • /
    • 2014
  • 컴퓨터단층촬영에서 영상 재구성은 가장 중요한 과정 중 하나다. 그 중에서도 빠른 주사시간과 낮은 조사량을 위하여 반복적 재구성(iterative reconstruction)은 점점 중요시 되고 있다. 그리고 이러한 반복적 재구성을 적용하기 위해서 투사 및 역투사 과정은 필수적인 과정이 된다. 그로 인하여 최근 distance-driven approach가 투사 및 역투사 방법으로 제안되었고 주목받고 있다. 본 연구에서는 이 distance-driven approach의 특성을 이해하기 위한 여러 가지 시뮬레이션을 수행하였고 다른 두 가지의 투사 및 역투사 방법과 비교하였다. 우선, 정사각형 팬텀을 이용하여 한 각도에서 투사 및 역투사를 통한 기본적인 특성을 비교 및 분석하였다. 그 후, Shepp-Logan 팬텀을 이용하여 세 가지 투사 및 역투사 방법이 최종 재구성 영상화질에 미치는 영향을 분석하였다. 영상재구성법은 여과 후 역투사와 반복적 재구성(SART)의 두 가지 방법에 대하여 각각 세 가지 투사 및 역투사를 적용하였다. 시뮬레이션 결과 distance-driven approach는 투사 및 역투사시 최소의 아티팩트가 생가는 것을 정사각형 팬텀 시뮬레이션을 통해 확인할 수 있었다. 그리고 이를 이용하여 Shepp-Logan 팬텀의 영상재구성 결과에 적용한 결과 여과 후 역투사와와 반복적 재구성 두 가지 방법 모두에서 distance-driven approach를 통한 재구성영상의 화질이 다른 방법에 비하여 가장 우수함을 확인할 수 있었다. 본 연구를 통해서 distance-driven approach의 투사 및 역투사의 성능을 비교 분석 확인하였다.

Radioactive waste sampling for characterisation - A Bayesian upgrade

  • Pyke, Caroline K.;Hiller, Peter J.;Koma, Yoshikazu;Ohki, Keiichi
    • Nuclear Engineering and Technology
    • /
    • 제54권1호
    • /
    • pp.414-422
    • /
    • 2022
  • Presented in this paper is a methodology for combining a Bayesian statistical approach with Data Quality Objectives (a structured decision-making method) to provide increased levels of confidence in analytical data when approaching a waste boundary. Development of sampling and analysis plans for the characterisation of radioactive waste often use a simple, one pass statistical approach as underpinning for the sampling schedule. Using a Bayesian statistical approach introduces the concept of Prior information giving an adaptive sample strategy based on previous knowledge. This aligns more closely with the iterative approach demanded of the most commonly used structured decision-making tool in this area (Data Quality Objectives) and the potential to provide a more fully underpinned justification than the more traditional statistical approach. The approach described has been developed in a UK regulatory context but is translated to a waste stream from the Fukushima Daiichi Nuclear Power Station to demonstrate how the methodology can be applied in this context to support decision making regarding the ultimate disposal option for radioactive waste in a more global context.

Comparison of Algorithms for Two-way Stratification Design

  • Kim, Sun-Woong
    • Communications for Statistical Applications and Methods
    • /
    • 제11권1호
    • /
    • pp.139-151
    • /
    • 2004
  • Kim et al. (2002) developed public use SAS-based software for two-way stratification design, which is called SOCSLP We describe the details of a new approach implemented using SOCSLP and key differences between the approach and the sampling schemes of Sitter and Skinner (1994) and Winkler (2001). In addition, a numerical example is given to compare those methods with respect to the probabilities of selecting sample arrays.

설계민감도를 이용한 분말단조 공정에서의 최적 예비성형체 설계 (Optimal Preform Design in Powder Forging by the Design Sensitivity)

  • 정석환;황상무
    • 한국소성가공학회:학술대회논문집
    • /
    • 한국소성가공학회 1998년도 춘계학술대회논문집
    • /
    • pp.113-116
    • /
    • 1998
  • A derivative based approach to process optimal design in powder forging is presented. The process model, the formulation for process optimal design, and the schemes for the evaluation of the design sensitivity, and an iterative procedure for the optimization are described in detail. The validity of the schemes for the evaluation of the design sensitivity is examined by performing numerical tests. The capability of the proposed approach to deal with diverse process parameters and objective functions is demonstrated through applications to some selected process design problems.

  • PDF