• Title/Summary/Keyword: Optimal Algorithm

Search Result 6,866, Processing Time 0.04 seconds

Development of Route Planning System for Intermodal Transportation Based on an Agent Collecting Schedule Information (운송스케줄 정보수집 에이전트 기반 복합운송 경로계획 시스템)

  • Choi, Hyung-Rim;Kim, Hyun-Soo;Park, Byung-Joo;Kang, Moo-Hong
    • Information Systems Review
    • /
    • v.10 no.1
    • /
    • pp.115-133
    • /
    • 2008
  • The third-party logistics industry mainly delivers goods from a place to an arrival place on behalf of the freight owner. To handle the work, they need a transportation route including transportation equipment between the starting place and the arrival place, schedule information for departure/arrival and transportation cost. Actually, automatic searching for an optimal transportation route, which considers arrival and departure points for intermodal transportation, is not a simple problem. To search efficiently transportation route, the collection of schedule information for intermodal transportation and transportation route generation have become critical and vital issues for logistics companies. Usually, they manually make a plan for a transportation route by their experience. Because of this, they are limited in their ability if there is too much cargo volume and a great many transactions. Furthermore, their dependence on the conventional way in doing business causes an inefficient selection of transporters or transportation routes. Also, it fails to provide diverse alternatives for transportation routes to the customers, and as a result, increases logistics costs. In an effort to solve these problems, this study aims to develop a route planning system based on agent, which can collect scattered schedule information on the Web. The route planning system also has an algorithm for transportation route generation in intermodal transportation.

Roles of B-dot Controller and Failure Analysis for Dawn-dusk LEO Satellite (6시 저궤도 위성에서 B-dot 제어기 역할과 고장분석)

  • Rhee, Seung-Wu;Kim, Hong-Joong;Son, Jun-Won
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.41 no.3
    • /
    • pp.200-209
    • /
    • 2013
  • In this paper, the types of B-dot controller and the review results of B-dot controller stability are summarized. Also, it is confirmed that B-dot controller is very useful and essential tool when a dawn-dusk low earth orbit(LEO) large satellite has especially to capture the Sun for a required power supply in a reliable way after anomaly and that its algorithm is very simple for on-board implementation. New physical interpretation of B-dot controller is presented as a result of extensive theoretical investigation introducing the concept of transient control torque and steady state control torque. Also, the failure effect analysis results of magnetic torquers as well as a simulation verification are included. And the design recommendation for optimal design is provided to cope with the failure of magnetic torquer. Nonlinear simulation results are included to justify its capability as well as its performance for an application to a dawn-dusk LEO large satellite.

Minimum Cost Path for Private Network Design (개인통신망 설계를 위한 최소 비용 경로)

  • Choe, Hong-Sik;Lee, Ju-Yeong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1373-1381
    • /
    • 1999
  • 이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

Development of a Core management Algorithm for Optimal Design of AMBIDEXTER Transient Cores (AMBIDEXTER 천이노심 설계최적화를 위한 노심관리 알고리즘 개발)

  • Yu, Geuk-Jong;Sin, Dong-Hun;So, Sun-Gyu;Lee, Yeong-Jun;Kim, Jin-Seong;O, Se-Gi
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 2004.10a
    • /
    • pp.99-100
    • /
    • 2004
  • AMBIDEXTER-NEC의 천이노심은 $^{Nat}Th$$^{Nat}U$의 주입만으로 전 출력의 Break-even 노심에 도달하기위한 중간 단계이다. 선행연구에서 수행한 전 출력노심인 평형노심의 핵종수밀도에 도달하기 위해서 평형노심에서의 기저물질, 잠재핵분열성물질, 핵분열물질의 수밀도를 각 SEU-기반, Pu-기반, ADS-기반에서 그대로 유지하여 초기노심을 구성하였다. 또 각 시나리오에 대해 최대첨두출력과 원자로의 안전성을 고려해 Excess Reactivity를 5mk 내에서 초기노심을 결정하였다. 각 노심은 주 핵분열성물질 $^{235}U$, $^{239}Pu$$^{233}U$의 핵반응단면적 특성에 따라 평균 전환율이 각각 0.95, 0.83 및 1 .21 로서 핵연료물질의 적절한 선택만으로도 전환로, 연소로 및 증식로로 설계할 수 있음을 보여준다. 이러한 $Th/^{233}U$, U/Pu 핵연료주기를 사용하는 AMBIDEXTER-NEC 용융염핵연료 원자로의 초기노심에서 시작한 천이노심은 평형노심에장전할 충분한 $^{233}U$ 양을 확보해야 하므로 천이노심의 목표는 평형노심 $^{233}U$의 요구량에 최소한의 기간에 가장 적은 외부주입을 통해 도달하는 것이다. 천이노심에서 임계가 유지되는 AMBIDEXTER-NEC 원자로시스템의 3군 핵종변환 코드인 HELIOS-SQUID-AMBIBURN 체제를 개발하였고 그림 1.에 나타내었다. 이 알고리즘은 각 초기노심 중원소의 미시단면적, 중원소를 제외한 원소들의 거시단면적, 임계도를 만족하는 중성자속 및 외부주입율을 계산하여 SQUID 및 AMBIBURN 입력자료를 제공한다. 또한 일정시간 중원소의 핵종농도, 외부주입율과 중성자속이 일정하다는 가정 하 에 반복수행 하고 SEU-기반과 Pu-기반의 경우에는 각각 핵변환을 거쳐 재순환되는 $^{233}U$$^{239}Pu$의 양을 바로 주입하는 최대재순환 경우와 평형노심 요구 장전량에 이를 때까지 시설 내 저장하는 최소재순환 경우로 상황을 모사하였다. 그림 2 는 각 시나리오별 초기노심에서부터 200FPD까지 단위 용융염 체적당 $^{233}U$의 수밀도 시간변화를 나타낸 것이다. 그림을 보면 50일 이후부터는 수밀도의 변화가 일정한 기울기를 보이고 있고 재처리공정에서 $^{233}Pa$를 분리하는 최소재순환의 경우에는 최대재순환보다 2-3%정도에 지나지않아 그림에서 나타내지않았다. SEU-기반 및 Pu-기반에서 $^{233}U$의 증가율이 각각 2.54E+13, 2.81E+13 #/cc/d 로 Pu 기반이 조금 더 큰 증가율을 나타내고 있지만 평형노심 농도 1.04E+20 #/cc/d 에 도달하기 위해서는 두 경우 모두 매우 긴 시간이 걸릴 것을 예상할 수 있다. 요컨대 250MWth AMBIDEXTER-NEC가 평형노심을 이루기 위해 필요로 하는 $^{233}U$을 생산하는데 제안한 SEU-기반, Pu-기반 시나리오는 천이노심주기기간이 전형적인 원자로 수명 3-40년 보다 매우 큰 것으로 나타났다. 따라서 장전될 $^{233}U$의 확보를 위한 최적옵션은 초기노심부터 ADS와 같은 외부생산시설로부터 전량을 공급 받아 운전하는 것이라 판단된다.

  • PDF

Customized Configuration with Template and Options (맞춤구성을 위한 템플릿과 Option 기반의 추론)

  • 이현정;이재규
    • Journal of Intelligence and Information Systems
    • /
    • v.8 no.1
    • /
    • pp.119-139
    • /
    • 2002
  • In electronic catalogs, each item is represented as an independent unit while the parts of the item can be composed of a higher level of functionality. Thus, the search for this kind of product database is limited to the retrieval of most similar standard commodities. However, many industrial products need to configure optional parts to fulfill the required specifications. Since there are many paths in finding the required specifications, we need to develop a search system via the configuration process. In this system, we adopt a two-phased approach. The first phase finds the most similar template, and the second phase adjusts the template specifications toward the required set of specifications by the Constraint and Rule Satisfaction Problem approach. There is no guarantee that the most similar template can find the most desirable configuration. The search system needs backtracking capability, so the search can stop at a satisfied local optimal satisfaction. This framework is applied to the configuration of computers and peripherals. Template-based reasoning is basically the same as case-based reasoning. The required set of specifications is represented by a list of criteria, and matched with the product specifications to find the closest ones. To measure the distance, we develop a thesaurus of values, which can identify the meaning of numbers, symbols, and words. With this configuration, the performance of the search by configuration algorithm is evaluated in terms of feasibility and admissibility.

  • PDF

Broadband Multi-Layered Radome for High-Power Applications (고출력 환경에 적용 가능한 광대역 다층 구조 레이돔)

  • Lee, Ki Wook;Lee, Kyung Won;Moon, Bang Kwi;Choi, Samyeul;Lee, Wangyong;Yoon, Young Joong
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.29 no.1
    • /
    • pp.50-60
    • /
    • 2018
  • In this paper, we developed a broadband multi-layered radome applicable for high-power applications. In this regard, we presented the wave propagation characteristics of the broadband multi-layered radome with the ABCD matrix and obtained the optimal thickness and the material constant for each layer by an optimization algorithm called "particle swarm optimization," implemented by a commercial numerical modeling tool. Further, we redesigned it in view of mechanical properties to reflect environmental conditions such as wind, snow, and ice. The power transmission property was reanalyzed based on the recalculated data of each layer's thickness to consider the limitations of the fabrication of a large structure. Under the condition of a peak electric field strength that is 10 dB above the critical electric field strength in air breakdown, we analyzed the air breakdown by radio frequency(RF) in the designed radome using the commercial full-wave electromagnetic tool. The radome was manufactured and tested by continuous wave(CW) RF small signal and large signal in an anechoic chamber. The test results showed good agreement with those attained by simulation.

TMC (Tracker Motion Controller) Using Sensors and GPS Implementation and Performance Analysis (센서와 GPS를 이용한 TMC의 구현 및 성능 분석)

  • Ko, Jae-Hong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.2
    • /
    • pp.828-834
    • /
    • 2013
  • In this paper, TMC (Tracker Motion Controller) as one of the many research methods for condensing efficiency improvements can be condensed into efficient solar system configuration to improve the power generation efficiency of the castle with Concentrated solar silicon and photovoltaic systems (CPV)experiments using PV systems. Microprocessor used on the solar system, tracing the development of solar altitude and latitude of each is calculated in real time. Also accept the value from the sensor, motor control and communication with the central control system by calculating the value of the current position of the sun, there is a growing burden on the applicability. Through the way the program is appropriate for solar power systems and sensors hybrid-type algorithm was implemented in the ARM core with built-in TMC, Concentrated CPV system compared to the existing PV systems, through the implementation of the TMC in the country's power generation efficiency compared and analyzed. Sensor method using existing experimental results Concentrated solar power systems to communicate the value of GPS location tracking method hybrid solar horizons in the coordinate system of the sun's azimuth and elevation angles calculated by the program in the calculations of astronomy through experimental resultslook clear day at high solar irradiation were shown to have a large difference. Stopped after a certain period of time, the sun appears in the blind spot of the sensor, the sensor error that can occur from climate change, however, do not have a cloudy and clear day solar radiation sensor does not keep track of the position of the sun, rather than the sensor of excellence could be found. It is expected that research is constantly needed for the system with ongoing research for development of solar cell efficiency increases to reduce the production cost of power generation, high efficiency condensing type according to the change of climate with the optimal development of the ability TMC.

A Study on the Applicability of Deep Learning Algorithm for Detection and Resolving of Occlusion Area (영상 폐색영역 검출 및 해결을 위한 딥러닝 알고리즘 적용 가능성 연구)

  • Bae, Kyoung-Ho;Park, Hong-Gi
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.11
    • /
    • pp.305-313
    • /
    • 2019
  • Recently, spatial information is being constructed actively based on the images obtained by drones. Because occlusion areas occur due to buildings as well as many obstacles, such as trees, pedestrians, and banners in the urban areas, an efficient way to resolve the problem is necessary. Instead of the traditional way, which replaces the occlusion area with other images obtained at different positions, various models based on deep learning were examined and compared. A comparison of a type of feature descriptor, HOG, to the machine learning-based SVM, deep learning-based DNN, CNN, and RNN showed that the CNN is used broadly to detect and classify objects. Until now, many studies have focused on the development and application of models so that it is impossible to select an optimal model. On the other hand, the upgrade of a deep learning-based detection and classification technique is expected because many researchers have attempted to upgrade the accuracy of the model as well as reduce the computation time. In that case, the procedures for generating spatial information will be changed to detect the occlusion area and replace it with simulated images automatically, and the efficiency of time, cost, and workforce will also be improved.

Development of Information Technology Infrastructures through Construction of Big Data Platform for Road Driving Environment Analysis (도로 주행환경 분석을 위한 빅데이터 플랫폼 구축 정보기술 인프라 개발)

  • Jung, In-taek;Chong, Kyu-soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.3
    • /
    • pp.669-678
    • /
    • 2018
  • This study developed information technology infrastructures for building a driving environment analysis platform using various big data, such as vehicle sensing data, public data, etc. First, a small platform server with a parallel structure for big data distribution processing was developed with H/W technology. Next, programs for big data collection/storage, processing/analysis, and information visualization were developed with S/W technology. The collection S/W was developed as a collection interface using Kafka, Flume, and Sqoop. The storage S/W was developed to be divided into a Hadoop distributed file system and Cassandra DB according to the utilization of data. Processing S/W was developed for spatial unit matching and time interval interpolation/aggregation of the collected data by applying the grid index method. An analysis S/W was developed as an analytical tool based on the Zeppelin notebook for the application and evaluation of a development algorithm. Finally, Information Visualization S/W was developed as a Web GIS engine program for providing various driving environment information and visualization. As a result of the performance evaluation, the number of executors, the optimal memory capacity, and number of cores for the development server were derived, and the computation performance was superior to that of the other cloud computing.

Development of Improved Clustering Harmony Search and its Application to Various Optimization Problems (개선 클러스터링 화음탐색법 개발 및 다양한 최적화문제에 적용)

  • Choi, Jiho;Jung, Donghwi;Kim, Joong Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.3
    • /
    • pp.630-637
    • /
    • 2018
  • Harmony search (HS) is a recently developed metaheuristic optimization algorithm. HS is inspired by the process of musical improvisation and repeatedly searches for the optimal solution using three operations: random selection, memory recall (or harmony memory consideration), and pitch adjustment. HS has been applied by many researchers in various fields. The increasing complexity of real-world optimization problems has created enormous challenges for the current technique, and improved techniques of optimization algorithms and HS are required. We propose an improved clustering harmony search (ICHS) that uses a clustering technique to group solutions in harmony memory based on their objective function values. The proposed ICHS performs modified harmony memory consideration in which decision variables of solutions in a high-ranked cluster have higher probability of being selected than those in a low-ranked cluster. The ICHS is demonstrated in various optimization problems, including mathematical benchmark functions and water distribution system pipe design problems. The results show that the proposed ICHS outperforms other improved versions of HS.