• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.676-684
• /
• 2009

Decision making at the early stages of a construction project has a significant impact on the project, and various scenarios created based on the owner's requirements should be considered for the decision making. At the early stages of a construction project, the information regarding the project is usually limited and uncertain. As such, it is difficult to plan and manage the project (especially cost planning). Thus, in this study, a cost model that could be varied according to the owner's requirements was developed. The cost model that was developed in this study is based on the case-based reasoning (CBR) methodology. The model suggests cost estimation with the most similar historical case as a basis for the estimation. In this study, the optimization process was also conducted, using genetic algorithms that reflect the changes in the number of project characteristics and in the database in the model according to the owner's decision making. Two optimization parameters were established: (1) the minimum criteria for scoring attribute similarity (MCAS); and (2) the range of attribute weights (RAW). The cost model proposed in this study can help building owners and managers estimate the project budget at the business planning stage.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.1
• /
• pp.15-39
• /
• 2009

Advanced planning and scheduling (APS) refers to a manufacturing management process by which raw materials and production capacity are optimally allocated to meet demand. APS is especially well-suited to environments where simpler planning methods cannot adequately address complex trade-offs between competing priorities. However, most scheduling problems of APS in the real world face both inevitable constraints such as due date, capability, transportation cost, set up cost and available resources. In this survey paper, we address three crucial issues in APS, including basic scheduling model, job-shop scheduling (JSP), assembly line balancing (ALB) model, and integrated scheduling models for manufacturing and logistics. Several evolutionary algorithms which adapt to the problems are surveyed and proposed; some test instances based on the practical problems demonstrate the effectiveness and efficiency of evolutionary approaches.

• Journal of Navigation and Port Research
• /
• v.40 no.2
• /
• pp.51-56
• /
• 2016

Expressways mean the primary arterial highways with a high level of efficiency and safety. However, Gyeongbu and Namhae expressways connected with Busan ports are showing travel time delay by increased traffic including the medium/large-sized vehicles of about 20% compared to those of about 13% regardless of the peak periods. This study, thus, intends to analyze lane traffic characteristics in the basic 8-lane segments of the above-mentioned expressways, compute the planning and buffer times based on travel time reliability, find the lane speed showing a higher correlation with planning time between the lane speeds in the basic 8-lane segments, and finally suggest a correlation model for predicting the planning time in expressways.

• Journal of Korean Society for Quality Management
• /
• v.22 no.1
• /
• pp.188-204
• /
• 1994

Most of computer-aided process planning(CAPP) systems have been developed to automate the process planning function. In this paper, we describe an analytical model for a CAPP system in order to improve the performance of production system in flexible manufacturing systems(FMSs) for computer intergrated manufacturing(CIM) architecture. This paper proposes an optimal process planning that minimizes the load time by minimizing the cycle time and the number of workstations using Kang and Hahm's heuristic approach so as to improve the performance of production system under the batch production of discrete products. We also perform simulation using SIMAN language to campare the line utilization of each for various product types. The proposed algorithm can be implemented in existing FMSs for on-line control of product quantity using programmable logic controllers(PLC) and communication devices.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.120.3-120
• /
• 2001

We propose a new method of path planning for cleaning robots. Path planning problem for cleaning robots is different from conventional path planning problems in which finding a collision-free trajectory from a start point to a goal point is focused. In the case of cleaning robots, however, a planned path should cover all area to be cleaned. To resolve this problem in a systematic way, we propose a method based on a graph model as follows: at first, partition a given map into proper regions, then transform a divided region to a vertex and a connectivity between regions to an edge of a graph. Finally, a region is divided into sub-regions so that the graph has a unary tree which is the simplest Hamilton path. The effectiveness of the proposed method is shown by computer simulation results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.2
• /
• pp.323-341
• /
• 1997

Traditionally, the Process Planning problems and the Scheduling problems have been considered as independent ones. However, we can take much advantages by solving the two problems simultaneously. In this paper, we deal with the enlarged problem that takes into account both the process planning and the scheduling problems. And we present a solution algorithm for the problem assuming that the given process plan data is represented by AND/OR graph. A mathematical model(mixed ILP model) whose objective is the minimization of the makespan, is formulated. We found that we can get the optimal solutions of the small-size problems within reasonable time limits, but not the large-size problems. So we devised an algorithm based on the decomposition strategy to solve the large-scale problems (realistic problems) within practical time limits.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.1012-1014
• /
• 1998

This paper presents a database design for power system operational planning system of the integrated system for power system operational planning and analysis that will be more economical and stable of power system operation. An alias of the integrated system is Highly Integrated Total Energy System(HITES). We first describe the requirements for the Power System Planning System of HTES. Database design is processed in two phases(conceptual design and physical design), and CDM(Conceptual Data Model) and PDM(Physical Data Model) are generated by Powerdesigner(CASE tool for database design). In the future, the constructed database needs to be tested and tuning.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.8-14
• /
• 2007

This paper addresses the allocation planning of the storage location in a warehouse system that the dedicated storage method is used. In the discrete finite time period model, the demands for storage location of products are dynamic for time periods. The planning is to determine the reallocation time period and the storage location of the products in reallocation time period, which minimizes costs. The cost factors are the reallocation cost, the travel cost within warehouse and the surplus storage location cost. A model is formulated, and the property of optimal solution is characterized. The dynamic programming algorithm is developed, and a numerical example is shown.

• Journal of the military operations research society of Korea
• /
• v.16 no.2
• /
• pp.151-167
• /
• 1990

Considerable research has concentrated on medium-range production planning model in that it can contain long and short-term decision making in contents. Since medium-range production planning deals in situations with setup time or/and costs, solution methodology is classified by (1) optimization method using a sort of integer programming approach and network formulation (2) heuristic method offering an computationally easy, approximate solution. But, solution methodology is different in type of demand generation, existence of capacity and dependant demand. Therefore this paper reviewed the medium range production planning according to above mentioned three factors, and suggested for further work direction.

• IE interfaces
• /
• v.20 no.2
• /
• pp.204-215
• /
• 2007

This paper addresses vehicle routing planning in freight container transportation systems where a number of loaded containers are to be delivered to their destination places. The system under consideration is static in that all transportation requirements are predetermined at the beginning of a planning horizon. A two-phased procedure is presented for freight container transportation. In the first phase, the optimal model is presented to determine optimal total time to perform given transportation requirements and the minimum of number of vehicles required. Based on the results from the optimal model, in the second phase, ASA(Accelerated Simulated Annealing) algorithm is presented to perform all transportation requirements with the least number of vehicles by improving initial vehicle routing planning constructed by greedy method. It is found that ASA algorithm has an excellent global searching ability through various experiments in comparison with existing methods.