• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.445-448
• /
• 2000

This paper considers a scheduling algorithm for high-speed routers, where the router has an N x N port input-queued switch and the input queues are composed of N VOQ(Virtual Output Queue)s at each input port. The major concern of the paper is on the scheduling mechanism for the router. The paper discusses the preferred levels of the performance measures and then develope a non-linear mixed integer programming. Additionally, the paper suggests a heuristic scheduling algorithm for efficient and effective switching.

• Journal of Korean Society of Transportation
• /
• v.18 no.1
• /
• pp.87-97
• /
• 2000

Signal optimization model is divided bandwidth-maximizing model and delay-minimizing model. Bandwidth-maximizing model express model formulation as MILP(Mixed Integer Linear Programming) and delay-minimizing model like TRANSYT-7F use "hill climbing" a1gorithm to optimize signal times. This study Proposed optimization model using genetic algorithm one of evolution algorithm breaking from existing optimization model This Proposed model were tested by several scenarios and evaluated through NETSIM with TRANSYT-7F\`s outputs. The result showed capability that can obtain superior solution.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.305-308
• /
• 2007

In this paper we suggest an efficient evolutionary approach based on topological sort techniques for precedence constrained TSPs. The determination of optimal sequence has much to offer to downstream project management and opens up new opportunities for supply chains and logistics. Experimental results show that the suggested approach is a good alternative to locate optimal solution for complicated precedence constrained sequencing as in optimization method for instance.

• Management Science and Financial Engineering
• /
• v.1 no.1
• /
• pp.21-37
• /
• 1995

This paper suggests a procedure of decomposing a multi-stage dynamic location problem into stages with respect stage. The problem can be formulated as a mixed integer programming problem, which is difficult to be solved directly. We perform a series of transformations in order to divide the problem into stages. In the process, the assumption of PSO (production-system-only) plays a critical role. The resulting subproblem becomes a typical single-stage dynamic location problem, whose efficient algorithms have been developed efficiently. An extension of this study is to find a method to integrate the solutions of subproblems for a final solution of the problem.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.279-282
• /
• 2001

This paper is concerned with Vehicle Routing Problem to minimize the total delivery waiting time of customers. The delivery waiting time is the time taken to travel from the depot to the customer, which is important for the delivery of the perishing products or foods requiring freshness. We construct a mixed integer linear programming formulation of this problem, and CR(Clustering first Routing second) heuristic and SPH(set partitioning heuristic) are suggested. the results of computational experiments showed that these heuristics find successfully favorable solutions, in much shorter time than optimal.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.63-75
• /
• 1995

The uncapacitated facility location problem considered here is to determine facility location sites, minimizing the total cost of establishing facilities and serving customer demand points which require primary and back-up services. To solve this problem effectively, we propose two things in this study. First, we propose an idea of Benders' decomposition approach as a solution method of the problem. Second, we implement the problem on GAMS. Using GAMS (general Algebraic Modeling System) can utilize an mixed-integer programming solver such as ZOOM/XMP and provide a completely general automated implementation with a proposed solution method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.304-308
• /
• 1998

With the advances in concurrent engineering, schedulability has become an important design issue in machine loading and routing procedure. In this paper, four rules to improve schedulability of loading and routing are formulated as a mixed-integer programming model based on machine, routing and tool flexibilities. In this model, these rules are represented as an objective function or constraints. The impact of rules on the quality of schedules for the result of loading and routing is measured with makespan, throughput and average machine utilization.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.1
• /
• pp.1-18
• /
• 1993

The family disaggregation model of hierarchical production planning (HPP) is the problem of (0 -1) mixed integer programming that minimizes the total sum of setup costs and inventory holding costs over the planning horizon. This problem is hard in a practical sense since optimal solution algorithms have failed to solve it within reasonable computation times. Thus effective familoy disaggregation algorithm should be developed for HPP. The family disaggregation algorithm developed in this paper consists of the first stage of finding initial solutions and the second stage of improving initial solutions. Some experimental results are given to verify the effectiveness of developed disaggregation algorithm.

• Proceedings of the KIEE Conference
• /
• 2005.11b
• /
• pp.174-176
• /
• 2005

The introduction of competition in the electricity market requires a new paradigm in the capacity planning. This paper presents a methodology on a transmission planning considering dispatch in the government view point. The proposed model is mixed integer programming that minimized operation and construction costs. The proposed idea is exorcised on a case study.

• Journal of the military operations research society of Korea
• /
• v.5 no.2
• /
• pp.3-14
• /
• 1979

본 논문은 체계적인 연산법(Algorithm)을 연구, 개발하여 여산산출에 중요한 역할을 하는 mixed integer programming 문제를 계산하기 위하여 첫째로, 많은 투자수단 또는 계획중 가장 합리적인 (이익율이 높은) 수단을 정하는 Weingartner의 여산산출모델 (Capital Budgeting Model)을 간단히 검토해 보고, 둘째로 위의 검토에서 얻어진 개념에 따른 이 모델의 문제점들을 모색해 보며 마지막으로 기획분야의 어떤 기간동안 자원확보(확대)를 가능케 하는 여산산출 문제를 해결할 수 있는 방안이나 체계적 연산법을 개발해 보고자 한다. 이러한 휴계적 연산법은 (함축적인 또는 부분적인) 열권방식 (Enumeration Technique)을 이용함으로써 위에 제시된 문제를 해결하는데 용역 할 것이다.