• Journal of the Korea Safety Management & Science
• /
• v.22 no.4
• /
• pp.45-52
• /
• 2020

Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Network(SCN). One of keys issues in the current SCN research area involves minimizing both production and distribution costs. This study deals with finding an optimal solution for minimizing the total cost of production and distribution problems in supply chain network. First, we presented an integrated mathematical model that satisfies the minimum cost in the supply chain. To solve the presented mathematical model, we used a genetic algorithm with an excellent searching ability for complicated solution space. To represent the given model effectively, the matrix based real-number coding schema is used. The difference rate of the objective function value for the termination condition is applied. Computational experimental results show that the real size problems we encountered can be solved within a reasonable time.

• Journal of the Korean Mathematical Society
• /
• v.36 no.5
• /
• pp.1009-1020
• /
• 1999

The minimum permanent and the set of minimizing matrices over the face of the polytope n of all doubly stochastic matrices of order n determined by any staircase matrix was determined in [4] in terms of some parameter called frame. A staircase matrix can be described very simply as a Ferrers matrix by its row sum vector. In this paper, some simple exposition of the permanent minimization problem over the faces determined by Ferrers matrices of the polytope of n are presented in terms of row sum vectors along with simple proofs.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.8
• /
• pp.79-86
• /
• 2001

A method for actively minimizing dynamic reaction forces in a flexible structure subject to persistent excitations is presented. One difficulty with the method, however, is that forces and moments do not converge as quickly as displacements in mathematical discretization of continuous systems, so a controller based on a truncated model of a continuous system can produce poor results. A technique using residual flexibility matrix is presented for correcting the truncated force representation. A controller designed for reaction force minimization, using the residual flexibility matrix, is applied to a model of a flexible structure, and the results are presented. Implications of various reaction force penalty combinations on the resulting control performance are also discussed.

• Journal of electromagnetic engineering and science
• /
• v.4 no.3
• /
• pp.102-106
• /
• 2004

A novel Genetic Algorithm(GA)-based method is suggested to transform a coupling matrix to another, without the procedure of Matrix Rotation. This can remove tedious work like pivoting and deciding rotation angles needed for each of the iterations. The error function for the GA is simply formed and used as part of error minimization for obtaining the solution. An 8th order dual-mode elliptic integral function response filter is taken as an example to validate the present method.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.5
• /
• pp.52-62
• /
• 1993

This paper describes the implementation of a layout generation system for the gate matrix style to implement multi-level logic. To achieve improved layouts from general net lists, the proposed system performs flexible net binding for series nets. Also the system reassings gates by the heuristic information that shorter net lengths are better for the track minimization. By track minimizing with subdividing layout column information, the system decreases the number of necessary layout tracks. Experimental results show that the system generates more area-reduced (approximately 7.46%) layouts than those by previous gate matrix generation systems using net list inputs.

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.903-916
• /
• 1996

In this paper we investigate the minimum permanents and minimizing matrices on the faces $\omega(D)$ of $\omega_n$ for two fully indecomposable (0, 1) matrices D which are slight changes of both a convertible matrix and the matrix with zero trace.

• Journal of applied mathematics & informatics
• /
• v.2 no.2
• /
• pp.3-12
• /
• 1995

Evaluation of permanents of some(0,1) circulants is known to be of major importance for designers of certain speech scrambling systems. In this paper we gicve a lower bound for the number of scaram-bling patterns we deal with by minimizing the permanent function over some matrix polyhedra.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.211-223
• /
• 2013

We consider permanent function on the faces of the polytope of certain doubly stochastic matrices, whose nonzero entries coincide with those of fully indecomposable square (0, 1)-matrices containing identity submatrix. We determine the minimum permanents and minimizing matrices on the given faces of the polytope using the contraction method.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.2
• /
• pp.199-211
• /
• 2004

For positive integers $\kappa$ and p$\geq$3, let(equation omitted) where $J_{p}$ is the p${\times}$p matrix whose entries are all 1. Then, we determine the minimum permanents and minimizing matrices over (1) the face of $\Omega$(D) and (2) the face of $\Omega$($D^{*}$), where (equation omitted).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.87-96
• /
• 1998

Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.