• Title/Summary/Keyword: optimal assignment

Search Result 336, Processing Time 0.023 seconds

Rubust controller for inverter using CRA (CRA를 이용한 인버터 강인제어기 설계)

  • Lee, Jin-Mok;Park, Ga-Woo;Lee, Jae-Moon;Jung, Hun-Sun;Noh, Se-Jin;Choi, Jae-Ho
    • Proceedings of the KIPE Conference
    • /
    • 2007.07a
    • /
    • pp.98-100
    • /
    • 2007
  • This paper proposes a robust digital controller for PWM voltage source inverter using CRA method. The usual inverter controller for the operation of constant voltage and constant frequency consists of a double looped PI controller for the outer voltage controller and the inner current controller, of which the order of characteristic polynomial is high and so the gain tuning is difficult. Considering the limited switching frequency of the devices and sampling frequency of the digital controller, the gain tuning is usually based on the engineering experiences with the try and error method. In this paper, the error-space approach is used to get the system model including the controller with low order, and the characteristic ratio assignment (CRA) method is proposed for the design of robust controller which has the advantage to design the optimal gain to meet the referenced response and overshoot within the limit range. The PSiM simulation and experience results are shown to verify the validity of the proposed controller.

  • PDF

A Simultaneous Delivery and Pick-up Heterogeneous Vehicle Routing Problem with Separate Loading Area (다품종 독립 적재공간을 갖는 배달과 수거를 동시에 고려한 차량경로문제)

  • Kim, Gak-Gyu;Kim, Seong-Woo;Kim, Seong-Woo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.39 no.6
    • /
    • pp.554-561
    • /
    • 2013
  • As a special topic of the vehicle routing problems (VRP), VRPSDP extends the vehicle routing problem as considering simultaneous pickup and delivery for goods. The past studies have mainly dealt with a only weight constraint of a loading capacity for heterogeneous products. However. this study suggests VRPSDP considering separate loading area according to characteristics of loading species. The objective is to design a set of minimum distance routes for the vehicle routing assignment with independent capacity for heterogeneous species. And then we present a another HVRPSDP model which is easy to utilizes in a unique circumstance that is a guarantee of executing a task simultaneously from the various areas under restricted time and raising an application of vehicles that returns at the depot for the next mission like the military group. The optimal results of the suggested mathematical models are solved by the ILOG CPLEX software ver. 12.4 that is provided by IBM company.

CRA Based Robust Controller Design for PWM Converter (CRA 기법을 이용한 PWM 컨버터의 강인제어기 설계)

  • Kim, Soo-Cheol;Kim, Hyung-Chul;Chung, Gyo-Bum;Choi, Jae-Ho
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.12 no.2
    • /
    • pp.183-190
    • /
    • 2007
  • In this paper, a robust controller for PWM converter is proposed. The proposde converter controller consists of a PI controller for DC output voltage and a current controller using error-space approach for maintaining the sinusoidal current waveform and unity power factor. Conventionally, the try and error method has been used to design the current controller considering the switching frequency of the devices and sampling frequency of the digital controller. But this proposed method is based on characteristic ratio assignment(CRA) method which has the advantage to design the optimal gain to meet the referenced response and overshoot within the limit range. First, the CRA based current controller algorithm is explained. Then the validity of proposed controller is verified through the PSiM simulation and experience results.

Aggregate Planning Using Least Cost First Assignment Algorithm of Transportation Problem (운송 문제의 최소비용 우선 배정 알고리즘을 적용한 총괄계획)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.5
    • /
    • pp.181-188
    • /
    • 2021
  • In preparing a aggregate production plan(APP), the transportation method generally uses a linear planning(LP) software package for TSM(transportation simplex method), which seeks initial solutions with either NCM, LCM, or VAM specialized in transportation issues and optimizes them with either SSM or MODI. On the other hand, this paper proposes a transportation method that easily, quickly, and accurately prepares a APP without software package assistance. This algorithm proposed simply assigned to least cost-first, and minimized the inventory periods. Applying the proposed algorithm to 6-benchmarking data, this algorithm can be obtained better optimal solution than VAM or LP for 4 data, and we obtain the same results for the remained 2 data.

Analysis and Operation System of the Information System of the Pilot and Tugs (도·예선 정보체계 분석 및 운영 시스템 개발)

  • Woo-Lee;Sang-Hyun Kim;Seung-Hong Oh;Min-Woo Son;Won-Jung Kim
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.1
    • /
    • pp.143-148
    • /
    • 2023
  • Currently, pilots and tugs perform the function of minimizing or eliminating property damage by preventing accidents on ships, ports, and human life by supporting docking/unloading and access and departure of ships. The piloting/tuging system is an essential function for the smooth functioning of the port, and it is the system that has the greatest influence on the cargo volume of the port. In this study, we developed an pilot and tugs information system analysis and operating system that can improve port operation efficiency, reduce the waiting time of ships, optimize the operation of ships, and allocate optimal pilots and tugs by utilizing the operation information of the tugbosts.

Branch and Bound Algorithm for Single Machine Scheduling with Step-Improving Jobs (계단형 향상 작업을 갖는 단일설비 스케줄링을 위한 분기한정 알고리즘)

  • Jun-Ho Lee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.47 no.2
    • /
    • pp.48-56
    • /
    • 2024
  • We examine a single machine scheduling problem with step-improving jobs in which job processing times decrease step-wisely over time according to their starting times. The objective is to minimize total completion time which is defined as the sum of completion times of jobs. The total completion time is frequently considered as an objective because it is highly related to the total time spent by jobs in the system as well as work-in-progress. Many applications of this problem can be observed in the real world such as data gathering networks, system upgrades or technological shock, and production lines operated with part-time workers in each shift. Our goal is to develop a scheduling algorithm that can provide an optimal solution. For this, we present an efficient branch and bound algorithm with an assignment-based node design and tight lower bounds that can prune branch and bound nodes at early stages and accordingly reduce the computation time. In numerical experiments well designed to consider various scenarios, it is shown that the proposed algorithm outperforms the existing method and can solve practical problems within reasonable computation time.

Dynamic channel allocation between low-orbit satellite networks and terrestrial services using genetic algorithm (유전 알고리즘을 활용한 저궤도 위성 네트워크와 지상 서비스 간 동적 채널 할당)

  • Yeongi Cho;Han-Shin Jo
    • Journal of IKEEE
    • /
    • v.28 no.3
    • /
    • pp.440-444
    • /
    • 2024
  • This paper presents a solution to the frequency coexistence problem between low earth orbit (LEO) satellite networks and other services by utilizing genetic algorithms. Non-terrestrial network (NTN) utilizing LEO satellites have mobility and need to address interference issues that may occur when sharing frequencies with terrestrial services according to propagation rules. In this study, we model the interference scenario based on the NTN operation scenario proposed by 3GPP, and derive the optimal channel allocation scheme for NTNs to protect terrestrial services while satisfying the minimum quality of service (QoS) through genetic algorithm. The simulation results show that the proposed method outperforms the existing fixed assignment method and graph coloring method, and enables efficient frequency sharing.

A Review about the Need for Modelling Toll Road with Different Value of Travel Time (유료도로의 교통수요분석에 있어서 통행시간가치 차등화 필요성 검토)

  • Kim, Jae-Yeong;Son, Ui-Yeong;Jeong, Chang-Yong
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.4
    • /
    • pp.31-40
    • /
    • 2009
  • Some road charges toll to finance the cost or to manage traffic congestion. With a growth of PPI projects, toll roads would be increase continuously. Tolls have a considerable influence on user's route choice, and sometimes can affect to the departure time and even to mode choice. For modelling toll roads, user's WTP or VOT has an important role and it is general that VOT is equivalent to the wages of workers. The current way of modelling technique yields various toll price elasticity from low to high. When there exist few alternative routes, unrealistic result that all traffic assigned to some shortest path may occur. The toll price elasticity can be influenced by alternative route and congestion level, but some result shows nearly unrealistic patterns. The model to forecast more realistic toll road demand is very essential for estimating toll revenue, choice of optimal toll level & collecting location and establishing toll charge strategy. This paper reviewed some literatures about toll road modelling and tested case study about the assignment technique with different VOT. The case study shows that using different VOT yields more realistic result than the use of single VOT.

Optimal Density Assignment to 2D Diode Array Detector for Different Dose Calculation Algorithms in Patient Specific VMAT QA

  • Park, So-Yeon;Park, Jong Min;Choi, Chang Heon;Chun, Minsoo;Han, Ji Hye;Cho, Jin Dong;Kim, Jung-in
    • Journal of Radiation Protection and Research
    • /
    • v.42 no.1
    • /
    • pp.9-15
    • /
    • 2017
  • Background: The purpose of this study is to assign an appropriate density to virtual phantom for 2D diode array detector with different dose calculation algorithms to guarantee the accuracy of patient-specific QA. Materials and Methods: Ten VMAT plans with 6 MV photon beam and ten VMAT plans with 15 MV photon beam were selected retrospectively. The computed tomography (CT) images of MapCHECK2 with MapPHAN were acquired to design the virtual phantom images. For all plans, dose distributions were calculated for the virtual phantoms with four different materials by AAA and AXB algorithms. The four materials were polystyrene, 455 HU, Jursinic phantom, and PVC. Passing rates for several gamma criteria were calculated by comparing the measured dose distribution with calculated dose distributions of four materials. Results and Discussion: For validation of AXB modeling in clinic, the mean percentages of agreement in the cases of dose difference criteria of 1.0% and 2.0% for 6 MV were $97.2%{\pm}2.3%$, and $99.4%{\pm}1.1%$, respectively while those for 15 MV were $98.5%{\pm}0.85%$ and $99.8%{\pm}0.2%$, respectively. In the case of 2%/2 mm, all mean passing rates were more than 96.0% and 97.2% for 6 MV and 15 MV, respectively, regardless of the virtual phantoms of different materials and dose calculation algorithms. The passing rates in all criteria slightly increased for AXB as well as AAA when using 455 HU rather than polystyrene. Conclusion: The virtual phantom which had a 455 HU values showed high passing rates for all gamma criteria. To guarantee the accuracy of patent-specific VMAT QA, each institution should fine-tune the mass density or HU values of this device.

A Effective Ant Colony Algorithm applied to the Graph Coloring Problem (그래프 착색 문제에 적용된 효과적인 Ant Colony Algorithm에 관한 연구)

  • Ahn, Sang-Huck;Lee, Seung-Gwan;Chung, Tae-Choong
    • The KIPS Transactions:PartB
    • /
    • v.11B no.2
    • /
    • pp.221-226
    • /
    • 2004
  • Ant Colony System(ACS) Algorithm is new meta-heuristic for hard combinational optimization problem. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. Recently, various methods and solutions are proposed to solve optimal solution of graph coloring problem that assign to color for adjacency node($v_i, v_j$) that they has not same color. In this paper introducing ANTCOL Algorithm that is method to solve solution by Ant Colony System algorithm that is not method that it is known well as solution of existent graph coloring problem. After introducing ACS algorithm and Assignment Type Problem, show the wav how to apply ACS to solve ATP And compare graph coloring result and execution time when use existent generating functions(ANT_Random, ANT_LF, ANT_SL, ANT_DSATUR, ANT_RLF method) with ANT_XRLF method that use XRLF that apply Randomize to RLF to solve ANTCOL. Also compare graph coloring result and execution time when use method to add re-search to ANT_XRLF(ANT_XRLF_R) with existent generating functions.