• Journal of the military operations research society of Korea
• /
• v.12 no.2
• /
• pp.37-55
• /
• 1986

Vehicle fleet planning problem is generic name given to a whole class of practical decision making problems which find the vehicle routes and schedules to accomplish the reqired service to customers using vehicles. In this paper the various problems are classified into the three groups according to their characteristics: (1) vehicle routing problems, (2) vehicle scheduling problems, and (3) vehicle routing and scheduling problems. The State of the art of each group is described and the future research directions are presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.111-122
• /
• 2000

This paper considers remanufacturing planning problems under deterministic environments. As increasing the environmental pressures in manufacturing, various methods for reducing wasted or postponing the time to be waste are considered. This paper considers remanufacturing planning problems on a single facility, where the wastes(or used products) are remanufactured to satisfy the given demand on the remanufactured products. The objective is to find the optimal remanufacturing and purchasing planning of the wastes which minimize total cost subject to satisfaction all the given demand on the remanufactured products. Two problems that the amount of wastes is a given constant or a decision variable are considered, respectively. For the problems, the extreme point solutions are characterized, and dynamic programming algorithms are developed with numerical examples.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.4
• /
• pp.13-26
• /
• 1999

When we try to design a production planning system for a manufacturing company, it is a time consuming task to analyze various planning activities and identify inter-relationship among a lot of decisions made for the production planning. Most of the research efforts have been concentrated to well-organized independent decision-making problems that may usually be identified only after analyzing the characteristics of the decision-making process as a whole. In this paper, a methodology is suggested to characterize the whole process of the production planning for a manufacturing company and reduce the complexity of decision-making problems. The methodology is based on an experience of developing a production planning software for an automobile component manufacturer in korea. First, it is explained how to identify and represent the dependency among various decision-making variables. And a methodology is proposed to analyze the identified dependency among decision variables and identify decision-making process. Lastly, a practical example is provided to illustrate the analysis procedure in this paper.

• IE interfaces
• /
• v.16 no.3
• /
• pp.280-290
• /
• 2003

Many firms are trying to optimize their production and distribution functions separately, but possible savings by this approach may be limited. Nowadays, it is more important to analyze these two functions simultaneously by trading off the costs associated with the whole. In this paper, I treat a production and distribution planning problem for single-period inventory products comprised of a single production facility and multiple customers, with the aim of optimally coordinating important and interrelated decisions of production sequencing and vehicle routing. Then, I propose a hybrid genetic algorithm incorporating several local optimization techniques, HGAP, for integrated production-distribution planning. Computational results on test problems show that HGAP is effective and generates substantial cost savings over Hurter and Buer's decoupled planning approach in which vehicle routing is first developed and a production sequence is consequently derived. Especially, HGAP performs better on the problems where customers are dispersed with multi-item demand than on the problems where customers are divided into several zones based on single-item demand.

• The Journal of Korea Robotics Society
• /
• v.1 no.1
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• Journal of the Korean Institute of Rural Architecture
• /
• v.3 no.3
• /
• pp.47-55
• /
• 2001

For several years by discussion and research, the designing plan and detail plans of year 2000 has been unified. By this result the District Standard Planning as well as the following existing town to control all sorts of living surrounding problems and to make a delightful arranged town are the purpose, which is carrying out all over the country. It is true that the expectation was high to the District Standard Planning. Because of this plan it could use and control the District special quality. Such as, it could rise the ability of beautiful sight and make a advisable town. But in this study the first preceding subject is a problem by the constructing work that the restriction and the standard application has been strong. So the District Standard Planning had many problems. And also by the problems here, as a immoderate volition and stiffen about the operation, the system and equipment lack about the environment improving work, problems with areas by the exciting plannings, the attitude of the executive agency that can't accept the inhabitants will. From these backgrounds we thought the research has not to be standardize in only newtown concept, but has to breath with the exciting towns and the rural areas that the District Planning has been applied. And to revive the special quality of the area and local government by a positive and logical research. Consequently in this study, we researched about the problems of architectures that had issues with the District Standard Planning of architectural part of operation guide which has been assisted form Single-Detached House in Eomsa District Dooma-Myun Nonsan which is located in Chungnam province.

• Journal of the Korean Institute of Educational Facilities
• /
• v.16 no.5
• /
• pp.27-33
• /
• 2009

The existing universities enlarged the scope, filled up the facilities. And many new universities are founded by increase of university students, the change of curriculum and extension of installations for new curriculum. However, the planning for university campus hinders desirable activities in campus and also the origin function of university, because of the problems caused by an application of a uniform planning standard that lacks in logical analysis and such a short step as the occasion demands for the growth and the change of the university campus changing more rapidly than any other field in society. This dissertation is for space program beginning from architectural explanation and basic planning concluding a general structure-planning for land utility, circulation planning, and building layout planning in order to find the practical solution for the applicable campus plan. The contents of this dissertation is summarized below. First, I studied the characteristics of the university, the structure of the university facilities and the expansion the development process of the campus. Second, through the case study of domestic campus planning, I analyzed the characteristics and the problems about space programming, facility layout planning, circulation planning and exterior space planning. Third, in the basis of the above analyses, I set up the directions of comprehensive campus master plan.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.8
• /
• pp.2016-2025
• /
• 1994

A hierarchical planning strategy for dextrous manipulation of multifingered hands with soft finger contact model is proposed. Dextrous manipulation planning can be divided into a high-level stage which specifies the position/orientation trajectories of the fingertips on the object and a low-level stage which determines the contact forces and joint trajectories for the fingers. In the low-level stage, various nonlinear optimization problems are formulated according to the contact modes and integrated into a manipulation planning algorithm to find contact forces and joint velocities at each time step. Montana's contact equations are used for the high-level planning. Quasi-static simulation results are presented and illustrated by employing a three-fingered hand manipulating a sphere to demonstrate the validity of the proposed low-level planning strategy.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.17 no.3
• /
• pp.27-37
• /
• 2021

Highly informative heuristics in AI planning can help to a more efficient search a solutions. However, in general, to obtain informative heuristics from planning problem specifications requires a lot of computational effort. To address this problem, we propose a Partial Planning Graph(PPG) and Mixed Heuristics for solving planning problems more efficiently. The PPG is an improved graph to be applied to can find a partial heuristic value for each goal condition from the relaxed planning graph which is a means to get heuristics to solve planning problems. Mixed Heuristics using PPG requires size of each graph is relatively small and less computational effort as a partial plan generated for each goal condition compared to the existing planning graph. Mixed Heuristics using PPG can find partial interactions for each goal conditions in an effective way, then consider them in order to estimate the goal state heuristics. Therefore Mixed Heuristics can not only find interactions for each goal conditions more less computational effort, but also have high accuracy of heuristics than the existing max and additive heuristics. In this paper, we present the PPG and the algorithm for computing Mixed Heuristics, and then explain analysis to accuracy and the efficiency of the Mixed Heuristics.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.2
• /
• pp.291-297
• /
• 2012

In this paper, potential field algorithm was used for path planning in dynamic environment. This algorithm is used to plan a robot path because of its elegant mathematical analysis and simplicity. However, there are some problems. The problems are problem of collision risk, problem of avoidance path, problem of time consumption. In order to solve these problems, we fused potential field with fuzzy system. The input of the fuzzy system is set using relative velocity and location of robot and obstacle. The output of the fuzzy system is set using the weighting factor of repulsive potential function. The potential field algorithm is improved by using fuzzy potential field algorithm and, path planning in various environment has been done.