• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.7-11
• /
• 2007

This paper considers a shipment planning of products from manufacturers to a third-party warehouse for demands with production time windows where a demand must be replenished in its time window. The underling lot-sizing model also assumes cargo delivery cost in each inbound replenishment to the warehouse. For this model, an optimal O($nT^4$) is presented where n is the number of demands and T is the length of the planning horizon.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.19-27
• /
• 2006

To survive in the current shipbuilding industry it is of vital importance for shipyards to achieve an optimal utilization of resources, make an achievable planning and ensure that this planning is kept. Possible problems should be eliminated before production starts and if unexpected disturbances occur in the actual production the right measures should be taken. Due to the dynamic nature of the production process, the continuous variation in products and the complexity of both, all this can hardly be achieved with conventional static planning and analysis systems. Simulation provides a solution here, since this enables the modelling and evaluation of the dynamic relations between product and production process. After a global introduction to production simulation in general and the application of simulation at the Flensburger shipyard, this paper presents a tool that has been developed to simulate the various complex assembly processes taking place at shipyards. Subsequently the simulation model for the subassembly production at Flensburger, in which this tool is applied, will be discussed.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.233-235
• /
• 2003

This paper describes a new methodology to get pareto-optimal generation planning for decision-making. To get optimal generation planning consider total quantity of contamination for the specified term, authors employ dynamic programming. And, in the course of dynamic programming, pareto optimal solution can be obtained. So, a most proper solution can be selected by derision-maker. The usefulness is verified by applying It to the test system.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.4 s.193
• /
• pp.84-92
• /
• 2007

Dynamic process planning requires not only more flexible capabilities of a CAPP system but also higher utility of the generated process plans. In order to meet the requirements, this paper develops an algorithm that can select machines for the machining operations by calculating the machine loads. The developed algorithm is based on the multi-objective genetic algorithm that gives rise to a set of optimal solutions (in general, known as the Pareto-optimal solutions). The objective is to satisfy both the minimization number of part movements and the maximization of machine utilization. The algorithm is characterized by a new and efficient method for nondominated sorting through K-means algorithm, which can speed up the running time, as well as a method of two stages for genetic operations, which can maintain a diverse set of solutions. The performance of the algorithm is evaluated by comparing with another multiple objective genetic algorithm, called NSGA-II and branch and bound algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.3
• /
• pp.315-322
• /
• 2009

Penetration and installation of a new dynamic technology known as Flexible AC Transmission Systems (FACTS) in a practical and dynamic network requires and force expert engineer to develop robust and flexible strategy for planning and control. Unified Power Flow Controller (UPFC) is one of the recent and effective FACTS devices designed for multi control operation to enhance the power system security. This paper presents a dynamic strategy based on Particle Swarm Optimization (PSO) for optimal parameters setting of UPFC to enhance the system loadability. Firstly, we perform a multi power flow analysis with load incrementation to construct a global database to determine the initial efficient bounds associated to active power and reactive power target vector. Secondly a PSO technique applied to search the new parameters setting of the UPFC within the initial new active power and reactive power target bounds. The proposed approach is implemented with Matlab program and verified with IEEE 30-Bus test network. The results show that the proposed approach can converge to the near optimum solution with accuracy, and confirm that flexible multi-control of this device coordinated with efficient location enhance the system security of power system by eliminating the overloaded lines and the bus voltage violation.

• Structural Engineering and Mechanics
• /
• v.39 no.3
• /
• pp.427-447
• /
• 2011

The progressive collapse phenomenon is generally regarded as dynamic. Due to the impracticality of nonlinear dynamic computations for practitioners, an interest arises for the development of equivalent static pushover procedures. The present paper proposes a methodology to identify such a procedure for sudden column removals, using energetic evaluations to determine the pushover loads to apply. In a dynamic context, equality between the cumulated external and internal works indicates a vanishing kinetic energy. If such a state is reached, the structure is sometimes assumed able to withstand the column removal. Approximations of these works can be estimated using a static computation, leading to an estimate of the displacements at the zero kinetic energy configuration. In comparison with other available procedures based on such criteria, the present contribution identifies loading patterns to associate with the zero-kinetic energy criterion to avoid a single-degree-of-freedom idealisation. A parametric study over a family of regular steel structures of varying sizes uses non-linear dynamic computations to assess the proposed pushover loading pattern for the cases of central and lateral ground floor column failure. The identified quasi-static loading schemes are shown to allow detecting nearly all dynamically detected plastic hinges, so that the various beams are provided with sufficient resistance during the design process. A proper accuracy is obtained for the plastic rotations of the most plastified hinges almost independently of the design parameters (loads, geometry, robustness), indicating that the methodology could be extended to provide estimates of the required ductility for the beams, columns, and beam-column connections.

• Journal of Korean Society of Transportation
• /
• v.5 no.1
• /
• pp.47-58
• /
• 1987

A commodity distribution problem with intertemporal storage facilities and dynamic transportation networks is proposed. mathematical integer programming methods and multiobjective programming techniques are used in the model formulation. Dynamic characteristics of commodity distribution problems are taken into account in the model formulation. storage facility location problems and transportation link addition problems are incorporated into the intertemporal multicommodity distribution problem. The model is capable of generating the most efficient and rational commodity distribution system. Therefore it can be utilized to provided the most effective investment plan for the transportation infrastructure development as well as to evaluate the existing commodity distribution system. The model determines simultaneously the most efficient locations, sizes, and activity levels of storage facilities as well as new highway links. It is extended to multiobjective planning situations for the purpose of generating alternative investment plans in accordance to planning situations. sine the investment in transportation network improvement yields w\several external benefits for a regional economy, the induced benefit maximization objective is incorporated into the cost minimization objective. The multiobjective model generates explicitly the trade-off between cost savings and induced benefits of the investment in transportation network improvement.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.4
• /
• pp.414-424
• /
• 2008

Disassembly scheduling is the problem of determining the quantity and timing of disassembling used or end-of-life products while satisfying the demand of their parts or components over a given planning horizon. This paper considers the two-level disassembly structure that describes a direct relationship between the used product and its parts or components. To formulate the problem mathematically, we first suggest an integer programming model, and then reformulate it to a dynamic programming model after characterizing properties of optimal solutions. Based on the dynamic programming model, we develop a polynomial exact algorithm and illustrate it with an example problem.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.110-117
• /
• 2015

In mobile social network, it is a critical challenge to select an optimal set of devices to supply high quality service constantly under dynamic network topology and the limit of device capacity in mobile ad-hoc network (MANET). In this paper, a multi-devices composition and maintenance problem is proposed with ubiquitous service model and network model. In addition, a multi-devices composition and maintenance approach with dynamic planning is proposed to deal with this problem, consisting of service discovery, service composition, service monitor and service recover. At last, the simulation is implemented with OPNET and MATLAB and the result shows this mechanism is better applied to support complex ubiquitous service.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.4
• /
• pp.126-135
• /
• 1997

A sensorless motion planner which succeeds in grasping a polygonal part firmly into a desired orientation has been developed through the dynamic analysis. The analytical results on the impact process with friction are used for modeling the contact motionduring the parallel-jaw grasp operation, which is com- posed of the pushing and the squeezing process. The developed planner succeeds in grasping a part into a specified orientation in the face of uncertainties of initial position and orientation of the part, motion direction of the finger, and the physical parameters such as the coefficients of friction and restitution. The motion planner has been fully implemented into a viable package on the computer system, and verified experimentally. The motion of parts is recorded using a high-speed video camera, and then compared to the results of the planner and the graphic simulation results that illustrate the simulated motion of the grasp operation.