• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 추계학술대회 논문집 전력기술부문
• /
• pp.100-102
• /
• 2007

본 논문에서는 혼합정수 선형계획 법을 이용하여 장기 전력계통 계획수립시 최적의 설비를 투자할 수 있는 기법을 제안하였다. 발전설비와 송변전설비는 하나의 망으로 연결되어 상호 보완적 영향을 주기 때문에 계통계획시 두 설비를 동시에 평가하는 것이 무엇보다 중요하다. 또한 계획기간 전체에 대해 투자비를 고려하여 비용을 최소화해야 한다. 이를 위해 선형계획법을 계통계획에 도입하여 최소비용의 투자비를 가지고 공급 신뢰도 기준를 만족할 수 있는 최적 장기 전력계통 계획 수립기법을 개발하였다. 개발된 기법을 Garver 6모선 계통 및 제3차 전력수급기본계획에 대해 모의하여 결과의 타당성을 검증하였다.

• 대한산업공학회지
• /
• 제25권1호
• /
• pp.47-55
• /
• 1999

This paper develops an efficient heuristic algorithm for scheduling workforce level that can accommodate all the requested maintenance jobs. Each job has its own release and due dates as well as man-day requirement, and must be scheduled in a non-interrupted time interval, namely, without preemption. Duration of each job is not fixed, but to be determined within given specific range. The objective is to minimize workforce level to complete all the requested maintenance jobs. We show that the problem can be seen as a variant of the two-dimensional bin-packing problem with some additional constraints. A non-linear mixed integer programming model for the problem is developed, and an efficient heuristic algorithm based on bin-packing algorithms is proposed. In order to evaluate goodness of the solution obtained from the proposed algorithm, a scheme for getting a good lower bound for the optimum solution is presented and analyzed. The computational experiment shows that the proposed algorithm performs quite satisfactorily.

• 대한산업공학회지
• /
• 제23권3호
• /
• pp.581-595
• /
• 1997

The procedure of grouping the machines and parts to form cells is called manufacturing cell design. The manufacturing cell design is an important step in the development and implementation of advanced manufacturing systems. For the successful implementation of the manufacturing systems, identification of independent manufacturing cells, i.e., cells where parts are completely processed in the cell and no intercell movements, is necessary in the design phase. In this paper, we developed a mixed integer programming model and genetic algorithm based procedure to solve the independent manufacturing cells design problem considering the alternative process plans and machines duplication. Several manufacturing parameters such as, production volume, machine capacity, processing time, number of cells and cell size, are considered in the process. The model determines the process plan for parts, port families and machine cells simultaneously. The model has been verified with the numerical examples.

• 산업공학
• /
• 제24권4호
• /
• pp.362-372
• /
• 2011

Container pick-up scheduling problem is to minimize the total container handling time, which consists of the traveling distance and the setup time of yard cranes in a container yard. Yard cranes have to pick-up the containers which are stacked in the yard-bays to satisfy the work schedule requirement of quay crane, which loads and unloads containers on or from container ships. This paper allows the movement of multiple yard cranes among storage blocks. A mixed integer programming model has been formulated and a genetic algorithm (GA) has been proposed to solve problems of large sizes. Computational results show that the proposed GA is an effective method.

• 대한산업공학회지
• /
• 제34권2호
• /
• pp.205-215
• /
• 2008

convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.

• 한국항행학회논문지
• /
• 제12권5호
• /
• pp.429-436
• /
• 2008

본 논문에서는 무선인지통신망에서 스펙트럼 센싱을 위한 협업 센싱을 하는 경우에 센싱 시간 및 협업 센싱 단말 수의 최적값들을 결정하는 방식에 대해서 다룬다. 협업 스펙트럼 센싱에서는 전송 중인 CU (Cognitive User) 외에 휴지중인 다른 CU들이 활성화되어 센싱에 참여함으로써 센싱 시간을 줄일 수 있다. 이로 인한 전송 CU의 전송률 이득과 CU들의 센싱으로 인한 에너지 소모간의 관계를 모두 고려하는 혼합 정수 계획법 문제를 풀어서 최적값들을 구할 수 있다.

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.146-154
• /
• 2014

This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.417-427
• /
• 2017

Power allocation is an important factor for cognitive radio networks to achieve higher communication capacity and faster equilibrium. This paper considers power allocation problem to each cognitive user to maximize capacity of the cognitive systems subject to the constraints on the total power of each cognitive user and the interference levels of the primary user. Since this power control problem can be formulated as a mixed-integer nonlinear programming (NP) equivalent to variational inequality (VI) problem in convex polyhedron which can be transformed into complementary problem (CP), we utilize modified projection method to solve this CP problem instead of finding NP solution and give a power control allocation algorithm with a subcarrier allocation scheme. Simulation results show that the proposed algorithm performs well and effectively reduces the system power consumption with almost maximum capacity while achieve Nash equilibrium.

• 한국경영과학회지
• /
• 제24권4호
• /
• pp.63-80
• /
• 1999

In the container transportation of inland depots the empty container is an important issue. The truck dispatching problem in this paper is considered under restriction about empty containers. When a full container arrives in a depot by truck, after unloading operation the full container is changed to an empty container. After loading operation an empty container is changed to a full container. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We would like to find the truck dispatching method minimizing empty truck movements and empty container movements. In this paper, a mixed integer programming model is developed to obtain the optimal truck dispatching in container transportation and heuristic is developed to give a good solution in much shorter time. The numerical examples are studied and the proposed heuristic is also compared with the result of numerical examples.

• 한국경영과학회지
• /
• 제23권2호
• /
• pp.47-65
• /
• 1998

We consider a multiperiod capacity planning problem for determining a mix of flexible and dedicated capacities under budget restriction. These capacities are controlled by purchasing flexible machines and/or new dedicated machines and disposing old dedicated machines. Acquisition and replacement schedules are determined and operations are assigned to the flexible or dedicated machines for the objective of minimizing the sum of discounted costs of acquisition and operation of flexible machines, new dedicated machines, and old dedicated machines. In this research, the Problem is formulated as a mixed integer linear Program and solved by a Lagrangian relaxation approach. A subgradient optimization method is employed to obtain lower bounds and a multiplier adjustment method is devised to improve the bounds. We develop a linear programming based Lagrangian heuristic algorithm to find a good feasible solution of the original problem. Results of tests on randomly generated test problems show that the algorithm gives relatively good solutions in a reasonable amount of computation time.