• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.196-203
• /
• 2022

The resource constrained scheduling problem (RCSP) constitutes one of the most challenging problems in Project Management, as it combines multiple parameters, contradicting objectives (project completion within certain deadlines, resource allocation within resource availability margins and with reduced fluctuations), strict constraints (precedence constraints between activities), while its complexity grows with the increase in the number of activities being executed. Due to the large solution space size, this work investigates the application of Genetic Algorithms to approximate the optimal resource alolocation and obtain optimal trade-offs between different project goals. This analysis uses the cost of exceeding the daily resource availability, the cost from the day-by-day resource movement in and out of the site and the cost for using resources day-by-day, to form the objective cost function. The model is applied in different case studies: 1 project consisting of 10 activities, 4 repetitive projects consisting of 40 activities in total and 16 repetitive projects consisting of 160 activities in total, in order to evaluate the effectiveness of the algorithm in different-size solution spaces and under alternative optimization criteria by examining the quality of the solution and the required computational time. The case studies 2 & 3 have been developed by building upon the recurrence of the unit/sub-project (10 activities), meaning that the initial problem is multiplied four and sixteen times respectively. The evaluation results indicate that the proposed model can efficiently provide reliable solutions with respect to the individual goals assigned in every case study regardless of the project scale.

• Nuclear Engineering and Technology
• /
• v.53 no.11
• /
• pp.3612-3624
• /
• 2021

At present, in the case of pump fast optimization, there is a problem of rapid, accurate and effective prediction of cavitation performance. In "A Cavitation Performance Prediction Method for Pumps PART1-Proposal and Feasibility" [1], a new cavitation performance prediction method is proposed, and the feasibility of this method is demonstrated in combination with experiments of a mixed flow pump. However, whether this method is applicable to vane pumps with different specific speeds and whether the prediction results of this method are accurate is still worthy of further study. Combined with the experimental results, the research evaluates the sensitivity and accuracy at different flow rates. For a certain operating condition, the method has better sensitivity to different flow rates. This is suitable for multi-parameter multi-objective optimization of pump impeller. For the test mixed flow pump, the method is more accurate when the area ratios are 13.718% and 13.826%. The cavitation vortex flow is obtained through high-speed camera, and the correlation between cavitation flow structure and cavitation performance is established to provide more scientific support for cavitation performance prediction. The method is not only suitable for cavitation performance prediction of the mixed flow pump, but also can be expanded to cavitation performance prediction of blade type hydraulic machinery, which will solve the problem of rapid prediction of hydraulic machinery cavitation performance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.9
• /
• pp.854-862
• /
• 2012

The optimal design of batch-storage network by using periodic square wave model provides analytical lot sizing equations for a complex supply chain network characterized as multi-supplier, multi-product, multi-stage, non-serial, multi-customer, cyclic system including recycling and/or remanufacturing. The network structure includes multiple currency flows as well as material flows. The processes are represented by multiple feedstock/product materials with fixed composition which are very suitable for production processes. In this study, transportation processes that carry multiple materials with unknown composition are added and the time frame is changed from single period into multiple periods in order to represent nonperiodic parameter variations. The objective function of the optimization involves minimizing the opportunity costs of annualized capital investments and currency/material inventories minus the benefit to stockholders in the numeraire currency. The expressions for the Kuhn-Tucker conditions of the optimization problem are reduced to a multiperiod subproblem for average flow rates and analytical lot-sizing equations. The multiperiod lot sizing equations are different from single period ones. The effects of corporate income taxes, interest rates and exchange rates are incorporated.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.425-429
• /
• 1987

This paper describes a collision avoidance method for planning safe trajectories for multi-robot system in common work space. Usually objects have been approximated to convex polyhedra in most previous researches, but in case using such the approximation method it is difficult to represent objects analytically in terms of functions and also to describe tile relationship between the objects. In this paper, in order to solve such problems a modeling method which approximates objects to cylinder ended by hemispheres and or sphere is used and the maximum distance functions is defined which call be calculated simply. Using an objective function with inequality constraints which are related to minimum distance functions, work range and maximum allowable angular velocities of the robots, tile collision avoidance for two robots is formulated to a constrained function optimization problem. With a view to solve tile problem a penalty function having simple form is defined and used. A simple numerical example involving two PUMA-type robots is described.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.45-47
• /
• 2022

Mobile edge computing (MEC), which enables mobile terminals to offload computational tasks to a server located at the user's edge, is considered an effective way to reduce the heavy computational burden and achieve efficient computational offloading. In this paper, we study a multi-user MEC system in which multiple user devices (UEs) can offload computation to the MEC server via a wireless channel. To solve the resource allocation and task offloading problem, we take the total cost of latency and energy consumption of all UEs as our optimization objective. To minimize the total cost of the considered MEC system, we propose an DRL-based method to solve the resource allocation problem in wireless MEC. Specifically, we propose a Asynchronous Advantage Actor-Critic (A3C)-based scheme. Asynchronous Advantage Actor-Critic (A3C) is applied to this framework and compared with DQN, and Double Q-Learning simulation results show that this scheme significantly reduces the total cost compared to other resource allocation schemes

• Proceedings of the Korea Concrete Institute Conference
• /
• 2003.05a
• /
• pp.853-858
• /
• 2003

A new method is proposed to obtain bond-slip model for an adhesive joint between FRP and concrete. Interface element, which can describe the bond behavior, is developed in order to overcome the restriction that complex constitutive relations cannot be modeled in analytic solution. Calibrating numerical bond-slip model to experimental results, multi-objective optimization problem is constructed by physical programming method, and is solved using genetic algorithm. The validity of proposed method is demonstrated by comparing known analytic solution and numerically optimized solution.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.21-28
• /
• 1999

The TSP(Traveling Salesman Problem) is one of the most widely studied problems in combinatorial optimization. The most common interpretation of TSP is finding a shortest Hamiltonian tour of all cities. The objective of this paper proposes a new heuristic algorithm MCH(Multi-Convex hulls Heuristic). MCH is a algorithm for finding good approximate solutions to practical TSP. The MCH algorithm is using the characteristics of the optimal tour. The performance results of MCH algorithm are superior to others algorithms (NNH, CCA) in CPU time.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.9
• /
• pp.1779-1786
• /
• 2002

When the topology optimization is applied to the design of compliant mechanism, unexpected displacements of input and output port are generated since the displacement control is not included in the formulation. To devise a more precise mechanism, displacement constraint is formulated using the mutual potential energy concept and added to multi-objective function defined with flexibility and stiffness of a structure. The optimization problem is resolved by using Finite Element Method(FEM) and Sequential Linear Programming(SLP). Design examples of compliant mechanism with displacement constraint are presented to validate the proposed design method.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1441-1446
• /
• 2003

The design optimization of the plate heat exchanger with staggered pin arrays for a fixed volume is performed numerically. The flow and thermal fields are assumed to be a streamwise-periodic flow and heat transfer with constant wall temperature and they are solved by using the finite volume method. The optimization is carried out by using the sequential linear programming (SLP) method and the weighting method is used for solving the multi-objective problem. The results show that the optimal design variables for the weighting coefficient of 0.5 are as follows; S=6.497mm, P=5.496mm, $D_1=0.689mm$, and $D_2=2.396mm$. The Pareto optimal solutions are also presented.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.49 no.10
• /
• pp.659-664
• /
• 2000

This paper presents a new design method for improving the torque performance of a switched reluctance motor (SRM) for high speed applications. The drawback of the conventional design method based on the overall static average torque maximization is that the torque control performance is degraded at high speed. On the other hand, the proposed method optimizes the torque profile by diving it into several regions so that it is suitable for high speed operation. This multi-objective optimization problem is solved by using a fuzzy optimization algorithm which incorporates a finite element method. The torque performance of the motor for various speed ranges is investigated and the optimally designed motor show a better performance at high speed.