• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.299-310
• /
• 1998

Actually mixed assembly line is mixed with open and close type workstation. This workstation is called hybridworkstation. The propose of this paper is to determine the sequencing of model that minimize line length for actual(hybridworkstation) mixed model assembly line. we developed three mathematical formulation of the problem to minimize the overall length of a line with hybrid station. Mathematical formulation classified model by operato schedule. Mixed model assembly line is combination program and NP-hard program. Thus computation time is often a critical factor in choosing a method of determining the sequence. This study suggests a tabu search technique which can provide a near optimal solution in real time and use the hill climbing heuristic method for selecting initial solution. Modified tabu search method is compared with MIP(Mixed Integer Program). Numerical results are reported to demonstrate the efficiency of the method.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2012.05a
• /
• pp.341-343
• /
• 2012

This study introduces a method for computation of process and operation gap in the specific construction operation(i.e., RC frame construction applying a block-grouping scheme) using CYCLONE-based simulation modeling and analysis technique. Since uncertainty of construction environment exists, a thoughtful production planning is required to effectively deal with a risk resulting in schedule delay in advance. This study presents the concepts of a time delay occurred in a process level and operation level in a operation model, and a method of measuring gap-times in each level while the simulation progresses. It helps a site manager to decide how many segmentation in a construction block is suitable for eliminating unproductive time-delays under the constrained resources (e.g., laborer, equipment). A case study presents a network model representing a three segmented RC frame work, and result obtained from the simulation experiment.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.686-692
• /
• 2002

Disassembly scheduling is the problem of determining the ordering and disassembly schedules of used products while satisfying the demand of their parts of components over a certain planning horizon. The objective is to minimize the sum of purchase, setup, disassembly operation and inventory holding costs. This paper considers products with assembly structure, i.e. products without parts commonality, and suggests a heuristic in which an initial solution is obtained in the form of the minimal latest disassembly schedule, and then improved considering trade-offs among different cost factors. To show the performance of the heuristic suggested in this paper, computational experiments were done on the modified existing examples and the results show that the heuristic can give optimal of very near optimal solutions within very short computation times.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.3
• /
• pp.245-252
• /
• 2010

This paper proposes a constrained multi-area dispatch scheduling algorithm applicable to interconnected power system operations. The dispatch scheduling formulated as an MIP problem can be efficiently computed by GBD algorithm. GBD guarantees adequate computation speed and solution convergence by reducing the dimension of the dispatch scheduling problem. In addition, the regional decomposition technique based on ADM is introduced to obtain efficient inter-temporal OPF solution. It can find the most economic dispatch schedule incorporating power transactions without each regional utility's private information open.

• Proceedings of the KSR Conference
• /
• 2002.05a
• /
• pp.41-46
• /
• 2002

This paper deals with the exchange of tourists and the operation of sightseeing train encouraged by the inter- Korean cross-border railway project. First of all, how the inter-Korean cross-border railway project has developed will be discussed. After this, tile present tourism state, facilities, the state of railways and roads of North Korea, and major tourist attraction around the Kyonguisun will be shown. And then, several aspects on the agreements between the Korean National Railroad (KORAIL) and North Korean railroad system will be summarized. And, finally, the economic effect of the line including the operation schedule of the Kyonguisun sightseeing train, the demand forecast, the computation of railway fare, and profit sharing will be depicted.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.4
• /
• pp.371-378
• /
• 1999

This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems of radial type. Simulated Annealing algorithm among optimization techniques can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing algorithm, we may use advanced Simulated Annealing algorithm. All constaints are divided into two constraint group by using perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approaches results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.9
• /
• pp.9-20
• /
• 2019

In this paper, we study the university timetabling problem, which consists of two subproblems, the university course timetabling problem and the examination timetabling problem. Given a set of classrooms, students, teachers, and lectures, the problem is to assign a number of courses (and examinations) to suitable timeslots and classrooms while satisfying the given set of constraints. We discuss the modeling and solution approaches to construct course and examination timetables for one of the largest Korean university. By using binary integer programming formulations, we describe these two complex real-world problems. Then, we propose a solution method, called NOGOOD, to solve the examination timetabling model. The computation results show that NOGOOD finds the optimal examination schedule for the given instance. Although we consider a specific instance of the university timetabling problem, the methods we use can be applicable to modeling and solving other timetabling problems.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.127-139
• /
• 2023

Numerous genuine issues, for example, financial exchange expectation, climate determining and so forth has inalienable arbitrariness related with them. Receiving a probabilistic system for forecast can oblige this dubious connection among past and future. Commonly the interest is in the contingent likelihood thickness of the arbitrary variable included. One methodology for expectation is with time arrangement and auto relapse models. In this work, liner expectation technique and approach for computation of forecast coefficient are given and likelihood of blunder for various assessors is determined. The current methods all need in some regard assessing a boundary of some accepted arrangement. In this way, an elective methodology is proposed. The elective methodology is to gauge the restrictive thickness of the irregular variable included. The methodology proposed in this theory includes assessing the (discretized) restrictive thickness utilizing a Markovian definition when two arbitrary factors are genuinely needy, knowing the estimation of one of them allows us to improve gauge of the estimation of the other one. The restrictive thickness is assessed as the proportion of the two dimensional joint thickness to the one-dimensional thickness of irregular variable at whatever point the later is positive. Markov models are utilized in the issues of settling on an arrangement of choices and issue that have an innate transience that comprises of an interaction that unfurls on schedule on schedule. In the nonstop time Markov chain models the time stretches between two successive changes may likewise be a ceaseless irregular variable. The Markovian methodology is especially basic and quick for practically all classes of classes of issues requiring the assessment of contingent densities.

• Asia pacific journal of information systems
• /
• v.12 no.4
• /
• pp.193-213
• /
• 2002

The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, negotiation, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. Recently, Internet based Electronic Commerce is recognized as one of the alternatives for strengthening sales power of small and medium companies. However, small and medium manufacturers can't adjust properly to the new environment because they are in short of money, personnel, and technology. To cope with this problem, this paper deals with development of part sales agent coupled with virtual manufacturing in Internet environment that consist of selection agent, advertisement agent, selection agent, negotiation agent, and virtual manufacturing system. This paper develops a time-bounded negotiation mechanism for small and medium manufacturers in agent-based automated negotiation between customers and negotiation agents. Furthermore, to select optimal order set maximized profit, we first formulate the order selection problem with mixed integer programming, but the computation time of IP is not acceptable for real world scale problem. To overcome this problem and dynamic nature of virtual manufacturing, we suggest a genetic algorithm approach, which shows a reasonable computation time for real world case and good incremental problem solving capability.