• Korean Management Science Review
• /
• v.29 no.3
• /
• pp.183-192
• /
• 2012

For the past several decades, personnel scheduling and rostering problem has been one of the most popular research topics in optimization area. Among the numerous applications, airline (aviation) industry has been given most attention due to the economic scale and impact. Most of the literatures about the staff scheduling problem in airline industry are dealing with the air crew, pilots and flight attendances, and the rest of the literatures are about the ground staff, by whom cleaning, maintenance, fueling of aircraft and handling luggage are done from landing to taking off. None of the literatures found by the authors are dealing with the airline ground crew. In this paper roster of airline ground crew, who is responsible for issuing boarding pass, checking baggage, etc, is introduced, formulated and solved using CPLEX. Some expressions of the mathematical formulations, which are not suitable input format of the CPLEX, were transformed. Numerical examples are presented for the validation of proposed scheduling system.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.295-297
• /
• 2005

본 논문에서는 지금까지 각각 독립적으로 운전되었던 동북아시아(대한민국, 북한, 러시아) 전력시스템이 계통 연계를 통하여 얻을 수 있는 경제적 효과에 대한 평가 프로그램의 개발에 대하여 설명한다. 본 평가 프로그램의 목적는 향후 동북아 전력시스템의 계통 연계시 각 나라들의 발전소 건설 및 운용, 그리고 연계설비(Tie line)의 투자비용을 최소화할 수 있는 방안을 찾아 내는 것이다. 이를 통해 독립적으로 운전되는 것에 비해 계통연계를 통한 것이 보다 높은 경제적인 효과를 거둘 수 있음을 최종적으로 보이고자 한다. 문제를 좀 더 쉽고 빠르며 효과적으로 풀기 위하여 신규 발전설비와 연계선로에 대한 계획측면의 변수와 발전양와 선로에 흐르는 조류양의 제약 그리고 각 노드에서의 전력수급 조건 둥의 운전측면의 변수를 함께 포함시킨 선형 계획법 (LP, Linear Programming) 모델 로 정식화한 뒤 최적화 프로그램인 CPLEX를 통하여 해를 구한다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.485-498
• /
• 1996

For a tree T rooted at a concentrator location in a telecommunication system, we assume that the capacity H for the concentrator is given and a profit $c_v$, and a demand $d_v$, on each node $\upsilon$ of T are also given. Then, the capacitated subtree of a tree problem (CSTP) is to find a subtree of T rooted at the concentrator location so as to maximize the total profit, the sum of profits over the subtree, under the constraint satisfying that the sum of demands over the subtree does not exceed H. In this paper, we develop a pseudopolynomial-time algorithm for CSTP, the depth-first dynamic programming algorithm. We show that a CSTP can be solved by our algorithm in $\theta$ (nH) time, where n is the number of nodes in T. Our algorithm has its own advantage and outstanding computational performance incomparable with other approaches such as CPLEX, a general integer programming solver, when it is incorporated to solve a Local Access Telecommunication Network design problem. We report the computational results for the depth-first dynamic programming algorithm and also compare them with those for CPLEX. The comparison shows that our algorithm is competitive with CPLEX for most cases.

• Journal of the military operations research society of Korea
• /
• v.29 no.2
• /
• pp.61-80
• /
• 2003

A fire sequencing problem is considered. Fire sequencing problem is a kind of scheduling problem that seeks to minimize the overall time span under a result of weapon­target allocation problem. The assigned weapons should impact a target simultaneously and a weapon cannot transfer the firing against another target before all planned rounds are consumed. The computational complexity of the fire sequencing problem is strongly NP­complete even if the number of weapons is two, so it is difficult to get the optimal solution in a reasonable time by the mathematical programming approach. Therefore, a genetic algorithm is adopted as a solution method, in which the representation of the solution, crossover and mutation strategies are applied on a specific condition. Computational results using randomly generated data are presented. We compared the solutions given by CPLEX and the genetic algorithm. Above $7(weapon){\times}15(target)$ size problems, CPLEX could not solve the problem even if we take enough time to solve the problem since the required memory size increases dramatically as the number of nodes expands. On the other hand, genetic algorithm approach solves all experimental problems very quickly and gives good solution quality.

• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.43-49
• /
• 2008

The track of high-speed railway get deteriorated according as using it. In that case, the maintenance jobs are needed for improvement of track quality. A scheduling problem for the track maintenance of high-speed railway is to determine the jobs should be performed daily. In the problem, the set of jobs for maintenance is given. Each job has it's parameters such as due date, emergency level, and processing time. In addition, jobs can be worked during a certain fixed time when the train doesn't move. In this study, we developed a mathematical model of the scheduling problem for the maintenance of high-speed railway and solved the problem using the ILOG CPLEX library.

• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.51-61
• /
• 2008

In these days, domestic manufacturers are faced with managerial difficulties such as the increasing competition in their industry and the increasing power of customers. In this situation, they have to satisfy their customers with high quality of their products and meeting due date of their orders. Production of the order within due date is an important factor for improving enterprise competitiveness. The causes of occurrence of tardiness may be wrong product scheduling, unexpected events in field and so on, a way to minimize tardiness is use of alternative machines, overwork, outsourcing and etc.. In this study, we deal with a scheduling problem that can minimize tardiness using alternative machines. This paper provides a mathematical program and a heuristic method for job shop scheduling for minimizing tardiness with alternative machines. And a proposed heuristic method is verified comparing with optimal solution obtained by ILOG CPLEX.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.216-219
• /
• 2000

본 연구는 WDM Mesh 망에서 SDH 수요가 주어졌을 때, 여러 개의 SDH 수요를 효과적으로 routing하는 방법을 통해 grooming 효과를 극대화시켜 전체 Mesh망에서 사용되어지는 총 Lightpath의 수를 줄이는 것을 목적으로 한다. 그리고 이렇게 해서 구해진 Lightpath의 수를 각 링크의 용량제약으로 하여 SDH 수요의 routing 비용을 최소화하는 것을 부차적인 목적으로 한다. 이것을 수리모형으로 바꾸면, Network Synthesis 문제와 Integer Multicommodity 문제로 모형화 할 수 있다. 해법으로는 Path-Formulation을 통한 분지평가법을 사용하였다. 전산실험결과를 보면 상용 패키지인 CPLEX를 이용하여 푼 것에 비해 수행속도 면에서 훨씬 빠르게 나타났고, 문제의 사이즈가 커짐에 따라 CPLEX를 사용하여 해결할 수 없는 문제에 대해서도 해를 구할 수 있었다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.81-98
• /
• 1997

Given a rooted tree T with profits and node demands, the capacitated subtree of a tree problem (GSTP) consists of finding a rooted subtree of maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find an upper bound on the optimal value of CSTP in O(n$^{2}$) time, where n is the number of nodes in T. We then present our branch and bound algorithm for solving CSTP and illustrate the algiruthm by using an example. Finally, we implement our branch-and-bound algorithm and compare the computational results with those for both CPLEX and a dynamic programming algorithm. The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, where n and H are the range of [50, 500] and [5000, 10000], respectively.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.89-93
• /
• 2009

홍수기에 집중되는 하천유출량을 갈수기에 적절히 활용하기 위한 대표적인 시설이 댐이다. 제한된 용수공급량을 적절히 분배해 용수수요량을 만족시키면서 미래 갈수기시 용수공급을 위한 댐 저류량을 조절하는 것이 댐 운영의 중요한 목적 중 하나이다. 본 연구에서는 댐 저류량에 따라 댐 계획방류량을 일정비율 줄여주는 Hedging Rule을 5단계로 적용하여 댐의 상시만수위 저류량에 대한 실제 저류량의 편차 절대치 합, 수요에 대한 용수공급 부족량의 합, 그리고 하천유지유량에 대한 하천유량 부족량의 합을 목적함수로 하여 혼합정수 선형계획법(MILP, Mixed Integer Linear Programming)으로 식을 구성하였다. 한강수계의 다목적댐인 충주, 횡성, 소양강 댐과 용수전용댐인 광동 댐, 그리고 발전용 댐이지만 비교적 큰 저류용량을 가진 화천 댐을 댐 연계 운영 대상으로 하여 수자원장기종합계획의 2003년 유출량 및 수요량 자료와 댐운영실무편람의 댐 계획방류량 자료를 10일 단위로 입력하여 GAMS/CPLEX를 이용해 최적화하였다. 그 결과 생공용수 수요량 99.99%, 농업용수 수요량 99.91%, 그리고 하천유지용수 수요량 99.24%를 충족시키면서, 댐 저류율이 66.54%에서 86.39%로 증가하였다.

• Journal of the military operations research society of Korea
• /
• v.36 no.3
• /
• pp.135-145
• /
• 2010

The submarine is very threatening and secretive weapon system that achieves missions under the sea. However, the submarine is faced with danger that can be attacked from the enemy when is detected by sensor or rose to the surface. This study will be planned optimal path to maximize the survival rate that considers submarine navigation capability in underwater and search activity of hostile warships. A mathematical programming model and a heuristic algorithm will be suggested in this study. The mathematical programming model is verified by using ILOG CPLEX. The submarine path, unit time(distance) of navigation, survival rate, and computation time is computed by using a heuristic algorithm.