• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.177-198
• /
• 1994

We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.1-7
• /
• 1996

The grouping of parts into families and machines into cells poses an important problem for the improvement of productivity and quality in the design and planning of the flexible manufacturing system(FMS). This paper proposes a new algorithm of forming machine-part groups in case of the bottleneck machine problem and shows the numerical example. This algorithm could be applied to the large scale machine-part grouping problem.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.25-28
• /
• 2013

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.2
• /
• pp.139-144
• /
• 1999

The present paper is concerned with the robust decentralized stabilization problem of large-scale systems with time delays in the interconnections using sliding mode control. Based on Lyapunov stability theorem and H$_{\infty}$ theory, an existence condition of the sliding mode and a robust decentralized sliding mode controller are newly derived for large-scale systems under mismatched uncertainties. Finally, a numerical example is given to verify the validity of the results developed in this paper.

• Structural Engineering and Mechanics
• /
• v.3 no.3
• /
• pp.289-297
• /
• 1995

A finite element algorithm for consideration of contact constraints is presented. It is characterized by introducing the geometric constraints, resulting from contact conditions, directly into the algebraic system of equations for the incremental displacements of an incremental iterative solution procedure. The usefulness of the proposed algorithm for efficient solutions of contact problems involving large displacements and large strains is demonstrated in the numerical investigation.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.1-10
• /
• 2009

This paper presents a topology optimization approach using element-free Galerkin method (EFGM) for the optimal design of compliant mechanisms with geometrically non-linearity. Meshless method has an advantage over the finite element method(FEM) because it is more capable of handling large deformation resulted from geometrical nonlinearity. Therefore, in this paper, EFGM is employed to discretize the governing equations and the bulk density field. The sensitivity analysis of the optimization problem is performed by incorporating the adjoint approach with the meshless method. The Lagrange multipliers method adjusted for imposition of both the concentrated and continuous essential boundary conditions in the EFGM is proposed in details. The optimization mathematical formulation is developed to convert the multi-criteria problem to an equivalent single-objective problem. The popularly applied interpolation scheme, solid isotropic material with penalization (SIMP), is used to indicate the dependence of material property upon on pseudo densities discretized to the integration points. A well studied numerical example has been applied to demonstrate the proposed approach works very well and the non-linear EFGM can obtain the better topologies than the linear EFGM to design large-displacement compliant mechanisms.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.570-576
• /
• 2004

It is very difficult to efficiently solve a large-scaled maximal covering problem(MCP) by a genetic algorithm. In this paper, we present new crossover and mutation operators specially designed for genetic algorithms to solve large-scaled MCPs efficiently. We also introduce a novel genetic algorithm employing unexpressed genes. Unexpressed genes are the genes which are not expressed and thus do not affect the evaluation of the individuals. These genes play the role of reserving information susceptible to be lost by the application of genetic operations but is suspected to be potentially useful in later generations. The genetic algorithm employing unexpressed genes enjoys the advantage of being able to maintain diversity of the population and thus can search more efficiently to solve large-scaled MCPs. Experiments with large-scaled real MCP data has shown that our genetic algorithm employing unexpressed genes significantly outperforms tabu search which is one of the popularly used local neighborhood search algorithms for optimization.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.114-121
• /
• 2015

Large-scale wireless sensor networks are constructed by using a large number of sensor nodes that are non-uniformly deployed over a wide area. As a result, the data collected by the sensor nodes are similar to that from one another since a high density of the sensor nodes may cause an overlap. As a result of the characteristics of the traffic, data is collected from a plurality of sensor nodes by a sink node, and when the sensor nodes transmit their collected data to the sink node, the sensor nodes around the sink node have a higher amount of traffic than the sensor nodes far away from the sink node. Thus, the former sensor encounter bottlenecks due to traffic congestion and have an energy hole problem more often than the latter ones, increasing energy consumption. This paper proposes a congestion control scheme that considers traffic flows in order to control traffic congestion of the sensor nodes that are non-uniformly deployed over a large-scale wireless sensor network.

• Journal of Positioning, Navigation, and Timing
• /
• v.4 no.4
• /
• pp.181-186
• /
• 2015

A High-degree Cubature Kalman Filter (CKF) is proposed to deal with the Strapdown Inertial Navigation System (SDINS) alignment problem. In-flight Alignment (IFA) is an effective method to compensate for attitude errors of the navigation system. While providing precise attitude error compensation, however, the external source aided alignment often creates a nonlinear filtering problem caused by a large misalignment angle. Introduced recently, Cubature Kalman Filter is a suitable technique for various nonlinear problems. In this paper, a higher degree CKF is applied to this accuracy-is-everything SDINS IFA problem. The simulation results show that the proposed technique outperformed a traditional nonlinear filter in terms of precision and alignment time.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.7
• /
• pp.78-88
• /
• 1997

A three dimensional-two spatical dimensions plus time-image segmentation is widely used in a very low bit rate image sequence coding because it can solve the region correspondence problem. Mathematical morphology is a very efficient tool for the segmentation because it deals well with geometric features such as size, shape, contrast and connectivity. But if the motion in the image sequence is large in time axis, the conventional 3D morphological segmentation algorithm have difficulty in solving region correspondence problem. To alleviate this problem, we propose the hierarchical image sequence segmentation algorithm that uses the region motion information. Since the motion of a region in previous level affects that in current level uses the previous motion information to increase region correspondence. Simulation result shows improved performance for sequence frames with large motion.