• 한국통신학회논문지
• /
• 제30권7C호
• /
• pp.624-632
• /
• 2005

이 논문에서는 BICM-OFDM(Bit Interleaved Coded modulation-Orthogonal Frequency Division Multiplexing) 시스템을 위한 비트 할당 기법에 대하여 연구한다. 부채널의 상태에 따라 부반송파의 전송 매개 변수를 조절하면 OFDM 시스템의 성능을 크게 개선시킬 수 있다. 여기서는 BICM-OFDM 시스템을 위한 적응 전송 기법으로 데이터 전송률을 일정하게 유지하면서 비트 오류율이 최소가 되도록 부반송파에 비트를 할당한다. 또한, 할당하는 비트 수가 정수인 제한 조건 하에서 최적의 해를 얻기 위해 이산 라그랑지 승수 방법을 사용한다. 모의실험을 통해 제안한 비트 할당 기법의 계산량이 크지 않으며, BICM-OFDM 시스템에 제안한 기법을 사용하면 약 $2\~3$ dB의 신호대 잡음비의 이득을 얻을 수 있음을 보인다.

• 대한전기학회논문지
• /
• 제37권5호
• /
• pp.272-281
• /
• 1988

The problem of optimal transmission system planning is to find the most economical locations and time of transmission line construction under the various constraints such as available rights-of-way, finances, the technical characteristics of power system, and the reliability criterion of power supply, and so on. In this paper the constraint of right-of-way is represented as a finite set of available rights-of-way. And the constructed for a unit period. The electrical constraints are represented in terms of line overload and steady state stability margin. And the reliability criterion is dealt with the suppression of failure cost and with single-contingency analysis. In general, the transmission planning problem requires integer solutions and its objective function is nonlinear. In this paper the objective function is defined as a sum of the present values of construction cost and the minimum operating cost of power system. The latter is represented as a sum of generation cost and failure cost considering the change of yearly load, economic dispatch, and the line contingency. For the calculation of operating cost linear programming is adopted on the base of DC load flow calculation, and for the optimization of main objective function nonlinear Branch-and-Bound algorithm is used. Finally, for improving the efficiency of B & B algorithm a new sensitivity analysis algorithm is proposed.

• 산업경영시스템학회지
• /
• 제33권2호
• /
• pp.48-55
• /
• 2010

Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 추계학술대회 논문집 전력기술부문
• /
• pp.297-300
• /
• 2004

This paper proposes a method for choosing the best composite power system expansion plan considering probabilistic reliability criterion. The proposed method was modeled as the minimization of the investment budget (economics) for constructing new transmission lines subject to not only deterministic(demand constraint) but also probabilistic reliability criterion(LOLE) with considering the uncertainties of the system elements. This is achieved by modeling the power system expansion problem as an integer programming one. The method solves for the optimal strategy using a probabilistic theory based branch and bound method that utilizes a network flow approach and the maximum flow-minimum cut set theorem. Although the proposed method is applied to a simple sample study, the test results demonstrate a fact that the proposed method is suitable for solving the power system expansion planning problem subject to practical uncertainties for future.

• 한국산업정보학회논문지
• /
• 제27권6호
• /
• pp.105-114
• /
• 2022

본 연구에서는 조수조건이 고려된 벌크항만의 하역 최적화를 위한 정수계획모형을 제안한다. 특히, 본 연구에서는 실제 벌크항만의 운영 환경과 조건들을 반영하여 체선료(Demurrage Cost)와 조출료(Dispatch Money)를 모두 고려한 하역비용 최소화를 목적함수로 설정하고, 벌크항만의 서비스 수준을 결정하는 최소재고 제약조건 또한 고려한다. 일반적으로 비선형 함수 형태로 표현되는 체선료 계산식을 선형화(Linearize)하여 스케줄 해상도를 향상하고, 조수조건을 고려한 선석할당 문제의 경우 전통 자원할당 모형에서 필수적인 Big-M 제약식이 대체 가능함을 확인한다. 실험결과를 통해 기존 모형 대비 계산복잡도와 전역최적성이 크게 향상 가능함을 검증한다.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2007년도 추계학술대회 논문집
• /
• pp.1731-1737
• /
• 2007

차량운용문제 혹은 열차반복문제는 수송계획, 열차운행계획에서 작성된 열차운행시각에 기초하여 편성유형 또는 차종에 따라 주어진 제약조건(선회조건, 검수조건, 기지복귀조건 등)을 반영하여 최적의 차량운용 다이아, 운용순서를 구성하는 문제이다. 일반적으로 이 문제는 집합분할(Set Partition)문제로 모델링하여 열생성(Column Generation) 기법을 사용하여 제약조건에 맞는 운용을 생성하였다. 하지만, 본 연구에서는 지하철과 같이 열차운행의 빈도는 높고 물리적 네트웍은 간단하며 시종착역의 수가 적을 경우 많은 대안 경로(Alternative Routing)들이 생성되는 특징 및 일반 철도와는 다른 역에서의 공간적 제약에 따른 차량 선회 제약을 고려하여 차량운용수를 최소화할 수 있는 지하철 차량운용 문제에 대한 수학적인 모델을 제시하고자 한다. 먼저, 차량선회제약만을 고려하여 최소비용 흐름 모형으로 네트워크 모형을 구성하였다. 최소비용 흐름 모형을 결과로 생성된 운용을 바탕으로 각 운용의 운행거리를 정규화(Normalize)하는 휴리스틱 기법을 제안하였다. 또한, 이 방법론을 실제와 유사한 지하철 열차 스케줄에 적용하였고 약 14%의 차량소요 감소 및 최대 영업거리 약 11%, 표준영업거리편차 약 5% 감소를 통하여 본 연구결과의 유용성을 확인하였다.

• 산업경영시스템학회지
• /
• 제38권4호
• /
• pp.109-116
• /
• 2015

This paper is concerned with the single vendor single buyer integrated production inventory problem. To make this problem more practical, space restriction and lead time proportional to lot size are considered. Since the space for the inventory is limited in most practical inventory system, the space restriction for the inventory of a vendor and a buyer is considered. As product's quantity to be manufactured by the vendor is increased, the lead time for the order is usually increased. Therefore, lead time for the product is proportional to the order quantity by the buyer. Demand is assumed to be stochastic and the continuous review inventory policy is used by the buyer. If the buyer places an order, then the vendor will start to manufacture products and the products will be transferred to the buyer with equal shipments many times. The mathematical formulation with space restriction for the inventory of a vendor and a buyer is suggested in this paper. This problem is constrained nonlinear integer programming problem. Order quantity, reorder points for the buyer, and the number of shipments are required to be determined. A Lagrangian relaxation approach, a popular solution method for constrained problem, is developed to find lower bound of this problem. Since a Lagrangian relaxation approach cannot guarantee the feasible solution, the solution method based on the Lagrangian relaxation approach is proposed to provide with a good feasible solution. Total costs by the proposed method are pretty close to those by the Lagrangian relaxation approach. Sensitivity analysis for space restriction for the vendor and the buyer is done to figure out the relationships between parameters.

• 산업경영시스템학회지
• /
• 제41권4호
• /
• pp.9-21
• /
• 2018

In South Korea, Jeju Island has a role as a test bed for electric vehicles (EVs). All conventional cars on the island are supposed to be replaced with EVs by 2030. Accordingly, how to effectively set up EV charging stations (EVCSs) that can charge EVs is an urgent research issue. In this paper, we present a case study on planning the locations of EVCS for Jeju Island, South Korea. The objective is to determine where EVCSs to be installed so as to balance the load of EVCSs while satisfying demands. For a public service with EVCSs by some government or non-profit organization, load balancing between EVCS locations may be one of major measures to evaluate or publicize the associated service network. Nevertheless, this measure has not been receiving much attention in the related literature. Thus, we consider the measure as a constraint and an objective in a mixed integer programming model. The model also considers the maximum allowed distance that drivers would detour to recharge their EV instead of using the shortest path to their destination. To solve the problem effectively, we develop a heuristic algorithm. With the proposed heuristic algorithm, a variety of numerical analysis is conducted to identify effects of the maximum allowed detour distance and the tightness of budget for installing EVCSs. From the analysis, we discuss the effects and draw practical implications.