• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.486-488
• /
• 2018

최근에 운송량의 양적인 증대와 운송수단의 고급화, 가속화 추구로 물류운송 부문의 종합서비스 체계가 요구되고 있다. 특히 물류운송과 같은 분야에서는 운송비가 경영비용의 제일 큰 비중을 차지하고 있기 때문에 보다 효율적인 물류운송이 요구된다. 따라서 빅데이터를 이용한 물류운송 최적 경로선정 시스템을 설계 구현하여, 운송 분야에 최적화된 물류운송 시스템을 제안한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.193-196
• /
• 2002

Vehicle routing problem is known to be a NP-hard problem, and is traditionally solved by some heuristic approaches. This paper investigates the application of the computer method COMSOAL to the optimal vehicle routing selection problem. The COMSOAL (Computer Method of Sequencing Operations for Assembly Lines) is a computer heuristic originally developed to solve an assembly line balancing problem a few decades ago. The solution methodology of repeatedly running COMSOAL will result in many feasible solutions from which the best is chosen. This solution approach now becomes viable thanks to the significantly increased speed of recent computer technology. This paper discusses the adaptation of the COMSOAL approach to the known set of simple vehicle routing example problem. The results show that the COMSOAL can be a good possible approach to solve the vehicle routing problem.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2000.10a
• /
• pp.233-238
• /
• 2000

Many theories and researches about agricultural products transportation were proposed and introduced until now. These studies have insufficient consideration about factors like region of imported agricultural products and the different speed of each road. In this study the Optimal Routes Selection Model (ORSEM) included factors that aren't taken into account in past studies and consists of database using Internet. Finally the model was developed through advanced marketing potential function and optimization method. The ORSEM focalizes on transport network organization. This model was applied to physical distribution of agricultural products in South Korea and found optimum routes of agricultural products.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.11
• /
• pp.566-574
• /
• 2000

This paper propose a heuristic algorithm based on the Branch-Exchange (BE) method to solve Optimal feeder Routing(OFR) problem for the distribution system planning. The cost function of the OFR problem is consisted of the investment cost representing the feeder installation and the system operation cost representing the system power loss. We propose a properly designed heuristic strategy, which can handle the horizon-year expansion planning problem of power distribution network. We also used the loop selection method which can define the maximum loss reduction in the network to reduce calculation time, and proposed a new index of power loss which is designed to estimate the power loss reduction in the BE. The proposed index, can be considered with both sides, the low voltage side and voltage side branch connected with tie one. The performances of the proposed algorithms and loss index were shown with 32, 69 example bus system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.262-264
• /
• 2001

컴퓨터 네트웍 시스템에서 부각되고 있는 두 가지 중요한 추세는 아마도 ‘멀티미디어’와 ‘이동 컴퓨팅’일 것이다. 멀티캐스트는 멀티미디어 데이터가 차지하는 많은 네트웍 트래픽을 수신 컴퓨터들에게 효율적으로 분배함으로써 네트웍 트래픽을 줄일 수 있다. 그러나 이동 호스트를 지원하는 이동 네트웍에서의 멀티캐스팅은 빈번한 그룹 멤버쉽의 변화와 함께 그룹 멤버의 위치변화로 인해서 기존의 고정 호스트를 기본으로 설계된 멀티캐스트 프로토콜을 적용하는 것은 적합하지 못한다. 이런 점에서 Mobile IP를 기본 유니캐스팅 환경에서 채택하여 이동 호스트에게 멀티캐스트를 지원하기 위한 몇 가지 방법이 제시되었으나, 비최적 경로로의 데이터 전송, 비효율적인 데이터 중복 전송, 또는 빈번한 멀티캐스트 트리의 재구성으로 인한 오버헤드 등의 문제점을 내포하고 있다. 제안된 프로토콜에서는 이동 호스트에게 멀티캐스트 서비스를 제공하는 FMA(Foreign Multicast Agent)를 유동적으로 선정하고 이동 호스트가 가지는 타임아웃 값을 이용하여 이동성으로 인해 발생하는 문제점들을 완화시킴으로써, Mobile IP를 이용하는 이동 호스트에게 IP멀티캐스팅을 효과적으로 제공한다.

• Proceedings of the KIEE Conference
• /
• 2005.07c
• /
• pp.2441-2443
• /
• 2005

최근 세계 여러 나라에서는 적정한 신뢰도나 경제성을 고려해 직류송전방식에 대한 관심이 날로 높아져 가고 있다. 우리나라도 부하가 밀집된 수도권으로 올라오는 송전선로의 병목현상으로 역률이나 주파수 등의 변화가 점점 심해지면서 전력계통의 신뢰도와 안정성에 문제가 발생할 수 있다. 본 연구에서는 우리나라 계통의 부하집중지역인 수도권을 대상으로 최적 직류 송전 경로를 임의로 선정하여, 직류 송전 방식을 건설하였을 때와 가공 송선 방식을 건설하였을 때의 건설비, 운영비, 유지보수 비용 등의 경제성을 비교 검토하고 이에 따른 장점과 단점을 분석함으로써 직류송전방식의 타당성을 검토해 본다.

• Proceedings of the KIEE Conference
• /
• 2005.07b
• /
• pp.1799-1801
• /
• 2005

최근 세계 여러 나라에서는 적정한 신뢰도나 경제성을 고려해 직류송전방식에 대한 관심이 날로 높아져 가고 있다. 우리나라도 부하가 밀집된 수도권으로 올라오는 송전선로의 병목현상으로 역률이나 주파수 등의 변화가 점점 심해지면서 전력계통의 신뢰도와 안정성에 문제가 발생할 수 있다. 본 연구에서는 우리나라 계통의 부하집중지역인 수도권을 대상으로 최적 직류 송전 경로를 임의로 선정하여, 직류 송전 방식을 건설하였을 때와 가공 송전 방식을 건설하였을 때의 건설비, 운영비, 유지보수 비용 등의 경제성을 비교 검토하고 이에 따른 장점과 단점을 분석함으로써 직류송전방식의 타당성을 검토해 본다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.135-143
• /
• 2012

This paper suggests the optimal blood distribution center algorithm that satisfies the minimum total transportation cost and within the allowable distribution time $T^*$. Zhang and Yang proposes shifting the location of each point that has less than the average distance of two maximum distance points from each point. But they cannot decide the correct facility location because they miscompute the shortest distance. This algorithm computes the shortest distance $l_{ij}$ from one area to another areas. Then we select the $v_i$ area to thecandidate distribution center location such that $_{max}l_{ij}{\leq}L^*$ and the $v_i$ such that $l_{ij}-L^*$ area that locates in ($v_i,v_k$) and ($v_j,v_l$) from $P_{ij}=v_i,v_k,{\cdots},v_l,v_j$ path and satisfies the $_{max}l_{ij}{\leq}L^*$ condition. Finally, we decide the candidate distribution area that has minimum transportation cost to optimal distribution area.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.1
• /
• pp.105-113
• /
• 2002

In this study, the steady state performance analysis program was developed for a turboprop engine, and its performance was analyzed at uninstalled and installed conditions. For the purpose of evaluation the developed program was compared with the performance data provided by the engine manufacturer and analysis results of GASTURB8.0 program. It was confirmed that the developed program was reliable because the results by the developed program were well agreed with those by GASTURB8.0 within %%. The linear and non-linear GPA(Gas Path Analysis) programs for performance diagnotics were developed, and selection of optimal measurement variables was studied. Furthermore, in order to investigate effects of the number and the kind of measurement variables, the linear and non-linear GPAs were analyzed with various measurement set. If the measurement parameters were properly selected, the reliable and economic faults detection might be possible even thought the small number of measuring parameters were used.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.17-25
• /
• 2011

At the computer games, we can experience a variety of environments using a virtual object. It is similar to that be trained in War-game simulator of the defense. Actual soldiers and a computer-generated virtual group(Computer Generated Force: CGF) in 3-D virtual battlefield environment are training. However, path finding algorithm, one of the techniques of simulation models, to the current level only considers the shortest time path. So, this current level at the special situation of the army in the battlefield for selecting the optimal path is limited. The focus of this paper is to select the least-cost path using the deadline with several different mission conditions(METT+TC). For the only shortest time path algorithm and the least-cost path algorithm using dealine,($d_t$, one of METT+TC elements), Its usefulness is verifying the change of the move spent time(t) for all possible paths and the fighting power of the combat troops(Troops ability, a) through a comparison of the total cost of moves(c(t)). According to the results, when considering the deadline, the proposed algorithm saves about 62.5% of the maximum cost.