• 대한산업공학회지
• /
• 제25권1호
• /
• pp.47-55
• /
• 1999

This paper develops an efficient heuristic algorithm for scheduling workforce level that can accommodate all the requested maintenance jobs. Each job has its own release and due dates as well as man-day requirement, and must be scheduled in a non-interrupted time interval, namely, without preemption. Duration of each job is not fixed, but to be determined within given specific range. The objective is to minimize workforce level to complete all the requested maintenance jobs. We show that the problem can be seen as a variant of the two-dimensional bin-packing problem with some additional constraints. A non-linear mixed integer programming model for the problem is developed, and an efficient heuristic algorithm based on bin-packing algorithms is proposed. In order to evaluate goodness of the solution obtained from the proposed algorithm, a scheme for getting a good lower bound for the optimum solution is presented and analyzed. The computational experiment shows that the proposed algorithm performs quite satisfactorily.

• Journal of Mechanical Science and Technology
• /
• 제19권3호
• /
• pp.811-819
• /
• 2005

In this study, we present a new efficient hybrid-mixed composite laminated curved beam element. The present element, which is based on the Hellinger-Reissner variational principle and the first-order shear deformation lamination theory, employs consistent stress parameters corresponding to cubic displacement polynomials with additional nodeless degrees in order to resolve the numerical difficulties due to the spurious constraints. The stress parameters are eliminated and the nodeless degrees are condensed out to obtain the ($6{\times}6$) element stiffness matrix. The present study also incorporates the straightforward prediction of interlaminar stresses from equilibrium equations. Several numerical examples confirm the superior behavior of the present composite laminated curved beam element.

• 대한산업공학회지
• /
• 제36권2호
• /
• pp.78-86
• /
• 2010

The traveling purchaser problem(TPP) is a generalization of the well-known traveling salesman problem(TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. TPP also could be extended to the vehicle routing problem(VRP) by incorporating additional constraints such as multi-purchaser, capacity, distance and time restrictions. In the last decade, TPP has received some attention of the researchers in the operational research area. However it has not received the equivalent interest as much as TSP and VRP. Therefore, there does not exist a review of the TPP. The purpose of this paper is to review the TPP and to describe solution procedures proposed for this problem. We also introduce the ILP formulation for the multiple TPP(mTPP) which is generalized type of TPP. We compare the system performance according to change from TPP to mTPP.

• 경영과학
• /
• 제12권2호
• /
• pp.43-62
• /
• 1995

For a complex scheduling system like time table construction, its optimal solution, if exists, is hard to obtain. In this paper, the scheduling environment is reasonably confined as where objects have their own events competing for better slots on boards, and objects have their own board slot preferences and belong to one or more classes of the society which globally constrains them. Here, two phase method is suggested, where the first phase is human-like preference driven and the second phase is for fine tuning by considering all the factors given. Designed and implemented in our system HI-SCHED are dynamic object switching, temporal-constraint-driven intelligent backtracking, case-based revisions, object-based approach, and so on. Some satisfaction degrees are also defined to measure the usefulness of our method. In addition, look-ahead dynamic object switching is considered, and additional global constraints are introduced and processed. A simple scheme is also used to verify the usefulness of the post processing scheme.

• Structural Engineering and Mechanics
• /
• 제43권6호
• /
• pp.771-794
• /
• 2012

This paper presents a multi-objective evolutionary algorithm for combinatorial optimisation and applied for design optimisation of fiber reinforced composite structures. The proposed algorithm closely follows the implementation of Pareto Archive Evolutionary strategy (PAES) proposed in the literature. The modifications suggested include a customized neighbourhood search algorithm in place of mutation operator to improve intensification mechanism and a cross over operator to improve diversification mechanism. Further, an external archive is maintained to collect the historical Pareto optimal solutions. The design constraints are handled in this paper by treating them as additional objectives. Numerical studies have been carried out by solving a hybrid fiber reinforced laminate composite cylindrical shell, stiffened composite cylindrical shell and pressure vessel with varied number of design objectives. The studies presented in this paper clearly indicate that well spread Pareto optimal solutions can be obtained employing the proposed algorithm.

• 대한교통학회지
• /
• 제8권1호
• /
• pp.17-24
• /
• 1990

The first-best pricing rule which achieves economic efficiency is to equate price with marginal cost. Since public transport demand is derived from some other demand, the user cost as well as the producer cost are considered in its pricing. The optimal price is derived from a derivative of the total social cost with respect to demand. In case of the bus, if there is enough capacity for demand increase, the optimal price is determined by the marginal producer cost resulting from bus sped decrease and by the marginal user cost resulting from journey time increase. Both are caused by boarding and fare collecting time of an additional passenger. Because of the budget constraints, the marginal cost pricing cannot be applied in practice. Then price discrimination as the second-best pricing is introduced. The Ramsey pricing, to charge different prices for different demand elasticities, and nonuniform prices such as travelcards can be applied. However, there is practical difficulty in implementing these prices because of great informational requirements, the costs of administration and the ease to users.

• 한국컴퓨터정보학회논문지
• /
• 제21권10호
• /
• pp.135-142
• /
• 2016

In this paper, we propose a plan for the introduction of a knowledge-based system proposed by the traditional computing sciences, in order to operate the computer system computerized hospital workers effectively. Hospital computational features of the operating system for this purpose, were made about the working conditions, computational difficulties of the hospital administrator. It is necessary for a knowledge management system for results-effective IT system operational review findings apply to the hospital, where a hospital computer system having features and hospitals computational workers must be resolved on the technical and environmental constraints with It became aware of the need. This study further shows that an effective hospital computer system to derive additional operating a variety of issues to consider for the base and the introduction of a knowledge management system can gradually solve the problem.

• 제어로봇시스템학회논문지
• /
• 제22권3호
• /
• pp.217-225
• /
• 2016

In this paper, we propose an improved path planning method and obstacle avoidance algorithm for two-wheel mobile robots, which can be effectively applied in an environment where obstacles can be represented by circles. Firstly, we briefly introduce the rapidly exploring random tree (RRT) and single polar polynomial (SPP) algorithm. Secondly, we present additional two methods for applying our proposed method. Thirdly, we propose a global path planning, smoothing and obstacle avoidance method that combines the RRT and SPP algorithms. Finally, we present a simulation using our proposed method and check the feasibility. This shows that proposed method is better than existing methods in terms of the optimality of the trajectory and the satisfaction of the kinematic constraints.

• Journal of Mechanical Science and Technology
• /
• 제18권2호
• /
• pp.253-261
• /
• 2004

A simple and effective filtering method to control the member size of an optimized structure is proposed for topology optimization. In the present approach, the original objective sensitivities are replaced with their relative values evaluated within a filtering area. By adjusting the size of the filtering area, the member size of an optimized structure or the level of its topological complexity can be controlled even within a given finite element mesh. In contrast to the checkerboard-free filter, the present filter focuses on high-frequency components of the sensitivities. Since the present filtering method does not add a penalty term to the objective function nor require additional constraints, it is not only efficient but also simple to implement. Mean compliance minimization and eigenfrequency maximization problems are considered to verify the effectiveness of the present approach.

• Structural Engineering and Mechanics
• /
• 제13권4호
• /
• pp.437-453
• /
• 2002

In this paper, dynamic stiffness and flexibility for circular membranes are analytically derived using an efficient mixed-part dual boundary element method (BEM). We employ three approaches, the complex-valued BEM, the real-part and imaginary-part BEM, to determine the dynamic stiffness and flexibility. In the analytical formulation, the continuous system for a circular membrane is transformed into a discrete system with a circulant matrix. Based on the properties of the circulant, the analytical solutions for the dynamic stiffness and flexibility are derived. In deriving the stiffness and flexibility, the spurious resonance is cancelled out. Numerical aspects are discussed and emphasized. The problem of numerical instability due to division by zero is avoided by choosing additional constraints from the information of real and imaginary parts in the dual formulation. For the overdetermined system, the least squares method is considered to determine the dynamic stiffness and flexibility. A general purpose program has been developed to test several examples including circular and square cases.