• 대한안전경영과학회지
• /
• 제13권3호
• /
• pp.107-114
• /
• 2011

Traveling salesman problem is to minimize the total cost for a traveling salesman who wants to make a tour given finite number of cities along with the cost of travel between each pair them, visiting each cities exactly once before returning home. Traveling salesman problem is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study suggests a hybrid parallel genetic algorithm(HPGA) for traveling salesman problem The suggested algorithm combines parallel genetic algorithm, nearest neighbor search, and 2-opt. The suggested algorithm has been tested on 7 problems in TSPLIB and compared the results of existing methods(heuristics, meta-heuristics, hybrid, and parallel). Experimental results shows that HPGA could obtain good solution in total travel distance minimization.

• 한국국방경영분석학회지
• /
• 제16권2호
• /
• pp.83-95
• /
• 1990

This paper addresses the problem of determining the optimal number of spares for a system consisting of multi-item parts. In commercial sector, the cost minimization is mainly considered as an objective functions in most inventory models. However, in the military inventory systems, it is more stressed on maximizing the system availability than minimizing the system cost because the field commander always wants the system to be in perfect working condition to prepare against an emergence case. In this point of view, this paper develops an inventory model which decides the optimal number of spares by minimizing units short and simultaneously achieving a certain level of system availability. Solution algorithms are derived using the generalized Lagrange multiplier approach and marginal analysis approach. Sample data and output results are provided and sensitivity analysis is performed as the level of system availability changes in order to decide the optimal number of spares and availability in terms of economic sense.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 추계학술대회 논문집 전력기술부문
• /
• pp.220-223
• /
• 2003

This paper presents VSCOPF(Votage Stability Constrained Optimal Power Flow) algorithm based on SLP(Successive Linear Programming) to interpret the large scale system. Voltage stability index used to this paper is L index to be presented by function form. The objective function consists of load shedding cost minimization. Voltage stability indicator constraint was incorporated in traditional OPF formulation. as well as the objective function and constraints are linearlized and the optimal problem is performed by SLP(Successive Linear Programming). In this paper, the effect of voltage stability limit constraint is showed in the optimal load curtailment problems. As a result, an optimal solution is calculated to minimize load shedding cost guaranteeing voltage security level. Numerical examples using IEEE 39-bus system is also presented to illustrate the capabilities of the proposed formulation.

• Journal of Electrical Engineering and Technology
• /
• 제9권3호
• /
• pp.812-819
• /
• 2014

The proposed technical work attempts to compare the two key technologies of power distribution, i.e. direct current (DC) and alternating current (AC) in a fiscal manner. The DC versus AC debate has been around since the earliest days of electric power. Here, at least four types of a low voltage DC (LVDC) distribution are examined as an alternative to the existing medium voltage AC (MVAC) distribution with an economic assessment technique for a project investment. Besides, the sensitivity analysis will be incorporated in the overall economic analysis model to cover uncertainties of the input data. A detailed feasibility study indicates that many of the common benefits claimed for an LVDC distribution will continue to grow more profoundly as it is foreseen to arise with the increased integration of renewable energy sources and the proliferation of energy storage associated with the enhanced utilization of uninterruptible power supply (UPS) systems.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2002년도 학술발표회 논문집(II)
• /
• pp.829-836
• /
• 2002

The paper presents a multi-objective genetic algorithm approach to the design of a water distribution network. The objectives considered are minimization of network cost and maximization of a reliability measure. In this study, a new reliability measure, called network resilience, is introduced. This measure mimics a designer's desire of providing excess power at nodes and designing reliable loops with practicable pipe diameters. The proposed method produces a set of Pareto-optimal solutions in the search space of cost and network resilience. Genetic algorithms are observed to be poor in handling constraints. To handle constraints in a better way, a constraint handling technique that does not require a penalty coefficient and applicable to water distribution systems is presented. The present model is applied to two example problems, which were widely reported. Pipe failure analysis carried out on some of the solutions obtained revealed that the network resilience based approach gave better results in terms of network reliability.

• 대한원격탐사학회지
• /
• 제20권3호
• /
• pp.189-196
• /
• 2004

This paper describes what an operational change detection tool requires and the software which was designed and developed according to the requirements. The top requirement for the application of the software to operational change detection was identified: minimization of false detections, missing detections and operational cost. In order to meet such a requirement, the software was designed with the concept that the ultimate decision and isolation of changes must be performed manually by visual interpretation and all automatic algorithms and/or visualization techniques must be defined as support functions. In addition, the modular structure of the proposed software enables the addition of a new support function with the minimum development cost and minimum change of the operational environment.

• 국제학술발표논문집
• /
• The 3th International Conference on Construction Engineering and Project Management
• /
• pp.1060-1067
• /
• 2009

The selection and operation of tower cranes at construction sites are dependent on the personal experience of engineers in charge of lifting work. It often causes to overestimate the safety factor resulting in increase of construction cost, or underestimate it resulting in disastrous accident. Therefore, selection of tower cranes needs to consider cost, safety and maximum lifting condition. This study, for resolving such problems, was intended to propose the algorithm designed for even the inexperienced person to select the optimal lifting equipment in timely manner. The algorithm presented herein is an optimization algorithm that enables automatic arrangement of tower crane and minimization of costs by analyzing such conditions as vertical height and lifting load, etc.

• 한국컴퓨터정보학회논문지
• /
• 제16권8호
• /
• pp.165-176
• /
• 2011

본 연구에서는 재생산 기업의 회수 인센티브와 소매점에서의 회수 인센티브를 고려하여 최적 총 주문량과 이 두개의 최적 인센티브에 대한 결정을 연구한다. '회수율은 기업이 제공하는 인센티브와 밀접한 관련이 있다.'는 가정하에 이 회수율을 두 경로로 가는 각각의 함수로 표현하였다. 재고 모델로는 확정적인 EOQ(경제적 주문 수량)모델을 사용하여 기업의 최소 비용함수를 수식으로 표현하였다. 또한 이 모델을 가지고 볼록성(convexity)을 증명하여 기업이 수여하는 최적 인센티브와 소매점이 수여하는 최적 인센티브 그리고 총 주문수량(보충량)을 최적화하였다. 그리고 각각의 매개변수들을 민감도 분석하여 각각의 결정변수의 변화 추이를 살펴보면서 매개변수와의 관계를 알아보았다. 기업과 소매점은 비용을 감소시키기 위해 인센티브를 낮추려 한다. 하지만 이것은 회수량을 감소시켜 새로운 제품 생산량을 증가시킴으로 비용을 증가하게 한다. 이 논문은 국내외 재생산 기업이 이러한 상충관계(Trade off)를 고려하여 최적 인센티브와 최적 주문량을 결정하는데 있어 도움이 될 것으로 기대한다.

• Journal of Information Processing Systems
• /
• 제9권2호
• /
• pp.301-314
• /
• 2013

In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.

• 한국공간정보시스템학회 논문지
• /
• 제11권1호
• /
• pp.79-86
• /
• 2009

제약 데이터베이스의 투플은 제약 논리식으로 구성되었으며, 공간 데이터의 표현 및 질의를 비교적 간결하게 처리할 수 있다. 제약 데이터베이스를 통한 공간 데이터의 실렉션, 합집합, 교집합 등의 질의 연산 처리는 간단하게 관련 투플 간에 제약식을 포함시켜 주면 된다. 그러나 중복되거나 불필요한 데이터가 증가할 수 있으며, 그에 따른 질의 비용이 증가될 수도 있다. 이 논문에서는 제약 데이터베이스에서의 질의처리 결과에 대한 문제점을 밝히고, 효율적인 질의처리를 위해서 결과 릴레이션에 대한 투플 최소화 정리기법의 제안 및 그 효과를 분석했다. 우리는 투플 최소화 기법을 이용하여 제약 릴레이션의 불필요한 제약식을 제거함에 따른 질의처리의 효율성이 개선됨을 확인할 수 있었다.