• 한국철도학회논문집
• /
• 제12권6호
• /
• pp.1018-1023
• /
• 2009

본 연구는 도시철도 시스템에서 동일시간에 동력운전하는 열차수를 최소화하여 전기에너지소모의 최대치를 최소화하고자 한다. 이를 위하여 열차동력운전 분산 열차 시각표 작성에 대한 문제를 정의하였다. 정의된 문제를 혼합정수계획(Mixed Integer Programming)모형으로 정식화하고 문제의 해법으로 상용소프트웨어를 활용한 해법과 휴리스틱 해법 두 가지를 제시하였다. 실제 열차시각표에 적용하여 동시 동력운전 열차수를 25% 감소시켰으며 본 연구결과의 유용성을 확인하였다. 이를 통하여 기존 시각표의 서비스품질을 악화시키지 않는 에너지 효율적 열차시각표를 작성하였다.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.40-48
• /
• 2009

In this article, scheduling of a casting sequence is studied in a casting foundry which must deliver products according to the Just-in-time(JIT) production policy of a customer. When a foundry manufactures a variety of casts with an identical alloy simultaneously, it frequently faces the task of production scheduling. An optimal casting schedule should be emphasized in order to maximize the production rate and raw material efficiency under the constraints of limited resources; melting furnaces and operation time for a casting machine. To solve this practical problem-fulfilling the objectives of casting the assigned mixed orders for the highest raw material efficiency in a way specified by the customer's JIT schedule, we implement simple integer programming. A simulation to solve a real production problem in a typical casting plant proves that the proposed method provides a feasible solution with a high accuracy for a complex, multi-variable and multi-constraint optimization problem. Employing this simple methodology, a casting foundry having an automated casting machine can produce a mixed order of casts with a maximum furnace utilization within the due date, and provide them according to their customer's JIT inventory policy.

• 한국통신학회논문지
• /
• 제29권4B호
• /
• pp.455-463
• /
• 2004

이 논문은 파장 분할 다중화 (Wavelength Division Multiplexing, WDM) 기술의 링-그물 구조를 가진 망을 설계하는 알고리즘을 제시한다. 링-그물 망을 설계하는 문제는 OADM과 OXC 비용을 최소로 하면서 트래픽을 만족시키는 그물 라우팅과 링 토폴로지를 설계한다. 링 토폴로지는 OADM으로 구성되어 링 내의 노드간 트래픽을 처리하고, 그물 라우팅은 서로 다른 링에 있는 노드간에 발생하는 트래픽을 OXC를 이용해서 처리한다. 링 토풀로지와 그물 라우팅 문제를 동시에 해결하기 위해서 정수 계획법 (Integer Programming) 모델을 개발한다. 링-그물 문제는 NP-Hard이므로 실제 크기의 망 문제에서 주어진 시간내 좋은해를 생성하는 효과적인 타부 서치 휴리스틱을 제안한다. 타부 서치 휴리스틱 성능을 상업용 소프트웨어인 CPLEX 7.0 으로 구한 해와 비교한 결과 5초 내에 총비용의 오차 범위가 3% 이내인 우수해를 구한다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.1616-1640
• /
• 2006

In this paper, we deal with a network optimization problem arising from the deployment of Ethernet-based BcN access network. BcN convergence services require that access networks satisfy QoS measures. BcN services have two types of traffics: stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer programming model. The proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose tabu search heuristic algorithms for solving the problem, and simulate tabu result. We demonstrate the computational efficacy of the proposed algorithm by solving a network design problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4640-4661
• /
• 2018

To cope with the explosive growth of Internet services, Service Function Chaining (SFC) based on Software-defined Networking (SDN) is an emerging and promising technology that has been suggested to meet this challenge. Determining the placement of Virtual Network Functions (VNFs) and routing paths that optimize the network utilization and resource consumption is a challenging problem, particularly without violating service level agreements (SLAs). This problem is called the optimal SFC placement problem and an Integer Linear Programming (ILP) formulation is provided. A greedy heuristic solution is also provided based on an improved two-step mapping algorithm. The obtained experimental results show that the proposed algorithm can automatically place VNFs at the optimal locations and find the optimal routing paths for each online request. This algorithm can increase the average request acceptance rate by about 17.6% and provide more than 20-fold reduction of the computational complexity compared to the Greedy algorithm. The feasibility of this approach is demonstrated via NetFPGA-10G prototype implementation.

• 대한산업공학회지
• /
• 제34권3호
• /
• pp.362-372
• /
• 2008

Manufacturers, or vendors, and their customers continue to adopt vendor-managed inventory(VMI) program to improve supply chain performance through collaboration achieved by consolidating replenishment responsibility upstream with vendors. In this paper, we construct a mixed integer linear programming model and propose a genetic algorithm for the integrated inventory and routing problems with lost sales maximizing the total profit in the VMI supply chains which comprise of a single manufacturer and multi-retailer. The proposed GA is compared with the mathematical model on the various sized test problems with respect to the solution quality and computation time. As a result, the GA demonstrates the capability of reaching solutions that are very close to those obtained by the mathematical model for small problems and stay within 3.2% from those obtained by the mathematical model for larger problems, with a much shorter computation time. Finally, we investigate the effects of the cost and operation variables on the total profit of the problem as well as the GA performance through the sensitivity analyses.

• 대한산업공학회지
• /
• 제34권4호
• /
• pp.481-488
• /
• 2008

This paper deals with a scheduling problem for two-machine flow shop, in which the preceding machine is a batch processing machine that can process a number of jobs simultaneously. To minimize makespan of the system, we present a mixed integer linear programming formulation for the problem, and using this formulation, it is shown that an optimal solution for small problem can be obtained by a commercial optimization software. However, since the problem is NP-hard and the size of a real problem is very large, we propose a number of heuristic algorithms including genetic algorithm to solve practical big-sized problems in a reasonable computational time. To verify performances of the algorithms, we compare them with lower bound for the problem. From the results of these computational experiments, some of the heuristic algorithms show very good performances for the problem.

• Steel and Composite Structures
• /
• 제22권5호
• /
• pp.1163-1192
• /
• 2016

This paper presents the cost optimization of a composite I beam floor system, designed to be made from a reinforced concrete slab and steel I sections. The optimization was performed by the mixed-integer non-linear programming (MINLP) approach. For this purpose, a number of different optimization models were developed that enable different design possibilities such as welded or standard steel I sections, plastic or elastic cross-section resistances, and different positions of the neutral axes. An accurate economic objective function of the self-manufacturing costs was developed and subjected to design, resistance and deflection (in)equality constraints. Dimensioning constraints were defined in accordance with Eurocode 4. The Modified Outer-Approximation/Equality-Relaxation (OA/ER) algorithm was applied together with a two-phase MINLP strategy. A numerical example of the optimization of a composite I beam floor system, as presented at the end of this paper, demonstrates the applicability of the proposed approach. The optimal result includes the minimal produced costs of the structure, the optimal concrete and steel strengths, and dimensions.

• 센서학회지
• /
• 제26권4호
• /
• pp.274-279
• /
• 2017

LCD(Liquid Crystal Display) panel cutting problem is a sort of two dimensional cutting stock problem. A cutting stock problem is problem that it minimizes the loss of the stock when a stock is cut into various parts. In the most research of the two dimensional cutting stock problem, it is supposed that the relative angle of a stock and parts is not important. Usually the angle is regarded as horizontal or perpendicular. In the manufacturing of polarizing film of LCD, the relative angle should be maintained at some specific angle because of the physical and/or chemical characteristics of raw material. We propose a mathematical model for solving this problem, a two-dimensional non-Guillotine cutting stock problem that is restricted by an arranged angle. Some example problems are solved by the C++ program using ILOG CPLEX classes. We could get the verification and validation of the suggested model based on the solutions.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.419-427
• /
• 2007

In wavelength-division-multiplexing(WDM) networks a link failure may cause the failure of several high-bit-rate optical channels, thereby leading to large data loss. Recently, various protection and restoration mechanisms have been proposed to efficiently deal with this problem in mesh networks. Among them, dedicated path protection(DPP) is a promising candidate because of its ultra-fast restoration time and robustness. In this work we investigate the issue of planning and optimization of WDM networks with DPP. Integer linear programming(ILP), in particular, is one of the most common exact method to solve the design optimization problem for protected WDM networks. Traditional ILP formalizations to solve this problem rely on the classical flow or route formulation approaches, but both these approaches suffer from a excessively high computational burden. In this paper, we present a variable-aggregation method that has the ability of significantly reducing the complexity of the traditional flow formulation. We compare also the computational burden of flow formulation with variable aggregation both with the classical flow and route formulations. The comparison is carried out by applying the three alternative methods to the optimization of two case-study networks.