• Title/Summary/Keyword: optimal algorithm

Search Result 6,806, Processing Time 0.039 seconds

A Model and Algorithm for Optimizing the Location of Transit Transfer Centers (대중교통 환승센터 입지선정 모형 연구)

  • Yoo, Gyeong-Sang
    • Journal of Korean Society of Transportation
    • /
    • v.30 no.1
    • /
    • pp.125-133
    • /
    • 2012
  • This paper deals with the passenger transfer trips counted from smart bus-card data from Seoul transit network to understand the current operational condition of the system. Objective of this study is to relocate the location of the transit transfer centers. It delivers a bi-level programing model. The upper model is a linear 0-1 binary integer program having the objective of total travel cost minimization constrained by the number of transfer centers and the total construction budget. The lower model is an user equilibrium assignment model determining the passengers' route choice according to the transfer center locations. The proposed bi-level programming model was tested in an example network. The result showed that the proposed was able to find the optimal solution.

Development of a Nuclear Steam Generator Tube Inspection/maintenance Robot

  • Shin, Ho-Cheol;Kim, Seung-Ho;Seo, Yong-Chil;Jung, Kyung-Min;Jung, Seung-Ho;Choi, Chang-Hwan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2508-2513
    • /
    • 2003
  • This paper presents a nuclear steam generator tube inspection/maintenance robot system. The robot assists in automatic non-destructive testing and the repair of nuclear steam generator tubes welded into a thick tube sheet that caps a hemispherical or quarter-sphere plenum which is a high-radiation area. For easy carriage and installation, the robot system consists of three separable parts: a manipulator, a water-chamber entering and leaving device for the manipulator and a manipulator base pose adjusting device. A software program to control and manage the robotic system has been developed on the NT based OS to increase the usability. The software program provides a robot installation function, a robot calibration function, a managing and arranging function for the eddy-current test, a real time 3-D graphic simulation function which offers remote reality to operators and so on. The image information acquired from the camera attached to the end-effecter is used to calibrate the end-effecter pose error and the time-delayed control algorithm is applied to calculate the optimal PID gain of the position controller. The developed robotic system has been tested in the Ulchin NPP type steam generator mockup in a laboratory.

  • PDF

A Study on the Structural Analysis & Design Optimization Using Automation System Integrated with CAD/CAE (통합된 CAD/CAE 자동화 System을 이용한 구조 강도 해석 및 설계 최적화에 관한 연구)

  • Won June-Ho;Kim Jong-Soo;choi Joo-Ho;Yoon Jong-Min
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2005.04a
    • /
    • pp.55-62
    • /
    • 2005
  • In this paper, a CAB/CAE integrated optimal design system is developed, in which design and analysis process is automated using CAD/CAE softwares, for a complicated model for which parametric modeling provided by CAD software is not possible. CAD modeling process is automated by using UG/OPEN API function and UG/Knowledge Fusion provided by Unigraphics. The generated model is transferred to the analysis code ANSYS in parasolid format. Visual DOC software is used for optimization. The system is developed for PLS(Plasma Lighting System), which is a next generation illumination system that is used to illuminate stadium or outdoor advertizing panel. The PLS system consists of more then 20 components, which requires a lot of human efforts in modeling and analysis. The analysis for PLS includes static load, wind load and impact load analysis. As a result of analysis, it is found that the most critical component is a tilt assembly, which links lower & upper body assembly. For more reliable analysis, experiment is conducted using MTS and compared with the Finite element analysis result. The objective in the optimization is to minimize the material volume under allowable stresses. The design variables are three parameters in the tilt assembly that are chosen to be the most sensitive in stress values of twelve parameters. Gradient based method and RSM(Response Surface Method) are used for the algorithm and the results are compared. As a result of optimization, the maximum stress is reduced by 57%.

  • PDF

Preliminary Design Procedure of MR Dampers for Controlling Seismic Response of Building Structures (건축구조물의 지진응답제어를 위한 MR 감쇠기 예비설계절차)

  • Lee, Sang-Hyun;Min, Kyung-Won;Lee, Roo-Jee;Kim, Joong-Koo
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.8 no.5 s.39
    • /
    • pp.55-64
    • /
    • 2004
  • In this paper, the preliminary design procedure of magnetorheological (MR) dampers is developed for controlling the building response induced by seismic excitation. The dynamic characteristics and control effects of the modeling methods of MR dampers such as Bingham, biviscous, hysteretic biviscous, simple Bouc?Wen, Bouc?Wen with mass element, and phenomenological models are investigated. Of these models, hysteretic biviscous model which is simple and capable describing the hysteretic characteristics, is used for numerical studies. The capacity of MR damper is determined as a portion of not the building weight but the lateral restoring force. A method is proposed for optimal placement and number of MR dampers, and its effectiveness is verified by comparing it with the simplified sequential search algorithm. Numerical results indicate that the capacity, number and the placement can be reasonably determined using the proposed design procedure.

Minimization of Packet Delay in a Mobile Data Collector (MDC)-based Data Gathering Network (MDC 기반 데이터 수집 네트워크에서의 패킷지연 최소화)

  • Dasgupta, Rumpa;Yoon, Seokhoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.4
    • /
    • pp.89-96
    • /
    • 2016
  • In this paper, we study mobile data collector (MDC) based data-gathering schemes in wireless sensor networks. In Such networks, MDCs are used to collect data from the environment and transfer them to the sink. The majority of existing data-gathering schemes suffer from high data-gathering latency because they use only a single MDC. Although some schemes use multiple MDCs, they focus on maximizing network lifetime rather than minimizing packet delay. In order to address the limitations of existing schemes, this paper focuses on minimizing packet delay for given number of MDCs and minimizing the number of MDCs for a given delay bound of packets. To achieve the minimum packet delay and minimum number of MDCs, two optimization problems are formulated, and traveling distance and traveling time of MDCs are estimated. The interior-point algorithm is used to obtain the optimal solution for each optimization problem. Numerical results and analysis are presented to validate the proposed method.

A comparative study of low-complexity MMSE signal detection for massive MIMO systems

  • Zhao, Shufeng;Shen, Bin;Hua, Quan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1504-1526
    • /
    • 2018
  • For uplink multi-user massive MIMO systems, conventional minimum mean square error (MMSE) linear detection method achieves near-optimal performance when the number of antennas at base station is much larger than that of the single-antenna users. However, MMSE detection involves complicated matrix inversion, thus making it cumbersome to be implemented cost-effectively and rapidly. In this paper, we first summarize in detail the state-of-the-art simplified MMSE detection algorithms that circumvent the complicated matrix inversion and hence reduce the computation complexity from ${\mathcal{O}}(K^3)$ to ${\mathcal{O}}(K^2)$ or ${\mathcal{O}}(NK)$ with some certain performance sacrifice. Meanwhile, we divide the simplified algorithms into two categories, namely the matrix inversion approximation and the classical iterative linear equation solving methods, and make comparisons between them in terms of detection performance and computation complexity. In order to further optimize the detection performance of the existing detection algorithms, we propose more proper solutions to set the initial values and relaxation parameters, and present a new way of reconstructing the exact effective noise variance to accelerate the convergence speed. Analysis and simulation results verify that with the help of proper initial values and parameters, the simplified matrix inversion based detection algorithms can achieve detection performance quite close to that of the ideal matrix inversion based MMSE algorithm with only a small number of series expansions or iterations.

Regression models for interval-censored semi-competing risks data with missing intermediate transition status (중간 사건이 결측되었거나 구간 중도절단된 준 경쟁 위험 자료에 대한 회귀모형)

  • Kim, Jinheum;Kim, Jayoun
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.7
    • /
    • pp.1311-1327
    • /
    • 2016
  • We propose a multi-state model for analyzing semi-competing risks data with interval-censored or missing intermediate events. This model is an extension of the 'illness-death model', which composes three states, such as 'healthy', 'diseased', and 'dead'. The state of 'diseased' can be considered as an intermediate event. Two more states are added into the illness-death model to describe missing events caused by a loss of follow-up before the end of the study. One of them is a state of 'LTF', representing a lost-to-follow-up, and the other is an unobservable state that represents the intermediate event experienced after LTF occurred. Given covariates, we employ the Cox proportional hazards model with a normal frailty and construct a full likelihood to estimate transition intensities between states in the multi-state model. Marginalization of the full likelihood is completed using the adaptive Gaussian quadrature, and the optimal solution of the regression parameters is achieved through the iterative Newton-Raphson algorithm. Simulation studies are carried out to investigate the finite-sample performance of the proposed estimation procedure in terms of the empirical coverage probability of the true regression parameter. Our proposed method is also illustrated with the dataset adapted from Helmer et al. (2001).

Energy-efficient Routing in MIMO-based Mobile Ad hoc Networks with Multiplexing and Diversity Gains

  • Shen, Hu;Lv, Shaohe;Wang, Xiaodong;Zhou, Xingming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.700-713
    • /
    • 2015
  • It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%.

A Hazardous Substance Monitoring Sensor Network Using Multiple Robot Vehicle (다수의 무인기를 이용한 유해 물질 감시 센서 네트워크)

  • Chun, Jeongmyong;Kim, Samok;Lee, Sanghu;Yoon, Seokhoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.147-155
    • /
    • 2015
  • In this paper, we consider a mobile sensor network for monitoring a polluted area where human beings cannot access. Due to the limited sensing range of individual unmanned vehicles, they need to cooperate to achieve an effective sensing coverage and move to a more polluted region. In order to address the limitations of sensing and communication ranges, we propose a hazardous substance monitoring network based on virtual force algorithms, and develop a testbed. In the considered monitoring network, each unmanned vehicle achieves an optimal coverage and move to the highest interest area based on neighboring nodes sensing values and locations. By using experiments based on the developed testbed, we show that the proposed monitoring network can autonomously move toward a more polluted area and obtain a high weighted coverage.

Memory-Efficient Implementation of Ultra-Lightweight Block Cipher Algorithm CHAM on Low-End 8-Bit AVR Processors (저사양 8-bit AVR 프로세서 상에서의 초경량 블록 암호 알고리즘 CHAM 메모리 최적화 구현)

  • Seo, Hwajeong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.3
    • /
    • pp.545-550
    • /
    • 2018
  • Ultra-lightweight block cipher CHAM, consisting of simple addition, rotation, and eXclusive-or operations, enables the efficient implementations over both low-end and high-end Internet of Things (IoT) platforms. In particular, the CHAM block cipher targets the enhanced computational performance for the low-end IoT platforms. In this paper, we introduce the efficient implementation techniques to minimize the memory consumption and optimize the execution timing over 8-bit AVR IoT platforms. To achieve the higher performance, we exploit the partly iterated expression and arrange the memory alignment. Furthermore, we exploit the optimal number of register and data update. Finally, we achieve the high RANK parameters including 29.9, 18.0, and 13.4 for CHAM 64/128, 128/128, and 128/256, respectively. These are the best implementation results in existing block ciphers.