• Title/Summary/Keyword: Iterative Approach

Search Result 495, Processing Time 0.033 seconds

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

  • Lee, Chung-Won
    • Proceedings of the KOR-KST Conference
    • /
    • 2000.02a
    • /
    • 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
    • /
    • v.31 no.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
    • /
    • v.39 no.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
    • /
    • v.14 no.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.

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

  • Kang, Min-Sup;Jeon, Byong-Chan
    • The KIPS Transactions:PartC
    • /
    • v.17C no.2
    • /
    • pp.145-152
    • /
    • 2010
  • In this paper, we first propose a fast division algorithm in GF($2^{163}$) using standard basis representation, and then it is mapped into divider for GF($2^{163}$) with iterative hardware structure. The proposed algorithm is based on the binary ExtendedGCD algorithm, and the arithmetic operations for modular reduction are performed within only one "while-statement" unlike conventional approach which uses two "while-statement". In this paper, we use reduction polynomial $f(x)=x^{163}+x^7+x^6+x^3+1$ that is recommended in SEC2(Standards for Efficient Cryptography) using standard basis representation, where degree m = 163. We also have implemented the proposed iterative architecture in FPGA using Verilog HDL, and it operates at a clock frequency of 85 MHz on Xilinx-VirtexII XC2V8000 FPGA device. From implementation results, we will show that computation speed of the proposed scheme is significantly improved than the existing two approaches.

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

  • 양영순;박창규;유원선
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.41 no.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 (투사 및 역투사 방법에 따른 컴퓨터단층촬영 영상 비교)

  • Oh, Ohsung;Lee, Seung Wook
    • Journal of radiological science and technology
    • /
    • v.37 no.4
    • /
    • pp.323-330
    • /
    • 2014
  • Image reconstruction is one of the most important processes in CT (Computed tomography) technology. For fast scanning and low dose to the objects, iterative reconstruction is becoming more and more important. In the implementation of iterative reconstruction, projection and backprojection processes are considered to be indispensable parts. However, many approaches for projection and backprojection may result severe image artifacts due to their discrete characteristics and affects the reconstructed image quality. Thus, new approaches for projection and backprojection are highly demanded these days. In this paper, distance-driven approach was evaluated and compared with other conventional methods. The numerical simulator was developed to make the phantoms, and projection and backprojection images were compared using these approaches. As a result, it turned out that there are less artifacts during projection and backprojection in parallel and fan beam geometry.

Radioactive waste sampling for characterisation - A Bayesian upgrade

  • Pyke, Caroline K.;Hiller, Peter J.;Koma, Yoshikazu;Ohki, Keiichi
    • Nuclear Engineering and Technology
    • /
    • v.54 no.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
    • /
    • v.11 no.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 (설계민감도를 이용한 분말단조 공정에서의 최적 예비성형체 설계)

  • 정석환;황상무
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1998.03a
    • /
    • 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