• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.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.

• Steel and Composite Structures
• /
• v.22 no.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.

• Journal of Sensor Science and Technology
• /
• v.26 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.577-584
• /
• 2005

Optimal methods for designing multiplierless minimal complexity FIR filters with cascaded prefilter-equalizer structures are proposed for narrowband communication systems. Assuming that an FIR filter consists of a cyclotomic polynomial(CP) prefilter and an interpolated second order polynomial(ISOP) equalizer, in the proposed method the prefilter and equalizer are simultaneously designed using mixed integer linear programming(MILP). The resulting filter is a cascaded filter with minimal complexity. Design examples demonstrate that the proposed methods produce a more computationally efficient cascaded prefilter-equalizer than other existing filters.

• Journal of the Korean Society for Library and Information Science
• /
• v.51 no.2
• /
• pp.237-253
• /
• 2017

There are many systematic approaches to manage Interlibrary loan (ILL) efficiently. In this paper, we propose an operating method reducing user-waiting in ILL. Users are usually informed to wait around two to three days in a regional ILL service. The reason of the waiting is that there is inefficiency in running material-delivery vehicles. A mixed integer programming is employed to resolve this issue. It provides an optimal vehicle-route maximizing material-deliveries subject to time availability. We used an actual data of a regional ILL system to provide optimal vehicle routes under different time settings.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.1
• /
• pp.105-113
• /
• 2000

This paper proposes the optimal design method of PSF(pulse shaping filter) with fixed-point coefficients, often used in digital communication system. Though RCF (Raised Cosine Filter) and Root-Squared RCF have less attenuation in stopband and are designed with floating point coefficients, those are selected by the reason that the design is simple. In this paper, 1 introduce the optimal design method for fixed point PSF including Root Squared type by using mixed integer linear programming. Through some design examples, it is shown that the proposed method better performs in ISI and requires less complexity. The complexity of the proposed filter is reduced to 20% as compared to conventional RCF and Root Squared RCF. For IS-95, that is the standard of CDMA system, the proposed filter reduces ISI up to 75% compared to the standard transmission filter.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.3 no.1
• /
• pp.10-19
• /
• 2002

The purpose of this paper is to describe the design of a general multipurpose batch process or plant in terms of a series of mathematical programing models, and to develop approach solution methodologies. The proposed model for a single period is based on the formulation (MINLP; Mixed Integer Nonlinear Programming) of Papageorgaki and Reklaitis [1], but was linearized (MILP; Mixed Integer Linear Programming) so as to obtain an exact and practical solution, and to allow treatment of uncertainties to be considered in expanding the plant. As a solution strategy a modified Benders' Decomposition was introduced and was tested on three example problems. The optimizing solver, OSL code provided by the IBM Corporation, was used for solving the problems. The solution method was successful in that it showed remarkable reduction in the computing times as compared with the direct solution method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.373-380
• /
• 2007

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.

• Journal of Convergence for Information Technology
• /
• v.11 no.8
• /
• pp.207-211
• /
• 2021

This paper addresses a two-stage flexible flow shop scheduling problem in which there is one machine in stage 1 and two identical machines in stage 2. The objective is the minimization of the total completion time. The problem is formulated by a mixed integer quadratic programming (MIQP) and a hybrid simulated annealing (HSA) is proposed to solve the MIQP. The HSA adopts the exploration capabilities of a genetic algorithm and incorporates a simulated annealing to reduce the premature convergence. Extensive computational tests on randomly generated problems are carried out to evaluate the performance of the HSA.