• International conference on construction engineering and project management
• /
• The 9th International Conference on Construction Engineering and Project Management
• /
• 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.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 한국전산구조공학회 2005년도 춘계 학술발표회 논문집
• /
• pp.335-342
• /
• 2005

Using higher order Mindlin plates and piezoelectric materials, eigenvalue problems are considered. Since piezoelectric crystal resonators produce a proper amount of electric signal for a thickness-shear frequency, the objective is to decouple the thickness-shear mode from the others. Design variables are the bulk material densities corresponding to the mass of masking plates for electrodes. The design sensitivity expressions for the thickness-shear frequency and mode shape vector are derived using direct differentiation method(DDM). Using the developed design sensitivity analysis (DSA) method, we formulate a topology optimization problem whose objective function is to maximize the thickness-shear component of strain energy density at the thickness-shear mode. Constraints are the allowable volume and area of masking plate. Numerical examples show that the optimal design yields an improved mode shape and thickness-shear energy.

• Journal of Korea Multimedia Society
• /
• 제22권8호
• /
• pp.887-896
• /
• 2019

In this paper, we discuss an optimization approach for time-synchronizations in networked simulators. This method is a sub-technology that is required to combine heterogeneous simulators into a single simulation. In previous time-synchronization studies, they had built a network system among networked simulators. The network system collects network packets and adds time-stamps to the networked packets based on the time that occurs in events of simulation objects in the individual simulators. Then, it sorts them in chronological order. Finally, the network system applies time-synchronization to each simulator participating in interworking sequentially. However, the previous approaches have a limitation in that other participating simulators should wait for while processing an event in a simulator in a time stamp order. In this paper, we attempt to solve the problem by optimizing time-synchronizations in networked simulation environments. In order to prove the practicality of our approach, we have conducted an experiment. Finally, we discuss the contributions of this paper.

• Journal of Korea Society of Industrial Information Systems
• /
• 제29권1호
• /
• pp.49-62
• /
• 2024

In this paper, a sustainable closed-loop supply chain (SCLSC) network model is proposed for domestic mobile phone industry. Economic, environmental and social factors are respectively considered for reinforcing the sustainability of the SCLSC network model. These three factors aim at minimizing total cost, minimizing total amount of CO₂ emission, and maximizing total social influence resulting from the establishment and operation of facilities at each stage of the SCLSC network model. Since they are used as each objective function in modeling, the SCLSC network model can be a multi-objective optimization problem. A mathematical formulation is used for representing the SCLSC network model and a hybrid meta-heuristic approach is proposed for efficiently solving it. In numerical experiment, the performance of the proposed hybrid meta-heuristic approach is compared with those of conventional meta-heuristic approaches using some scales of the SCLSC network model. Experimental results shows that the proposed hybrid meta-heuristic approach outperforms conventional meta-heuristic approaches.

• Journal of Korea Multimedia Society
• /
• 제6권1호
• /
• pp.136-147
• /
• 2003

To achieve an optimal performance for a given problem, we need an integrative process of the parameter optimization via learning and the structure optimization via model selection. In this paper, we propose an efficient optimization method for improving generalization performance by considering the property of each sub-method and by combining them with common theoretical properties. First, weight parameters are optimized by natural gradient teaming with adaptive regularization, which uses a diverse error function. Second, the network structure is optimized by eliminating unnecessary parameters with natural pruning. Through iterating these processes, candidate models are constructed and evaluated based on the Bayesian Information Criterion so that an optimal one is finally selected. Through computational experiments on benchmark problems, we confirm the weight parameter and structure optimization performance of the proposed method.

• Journal of Korean Society for Quality Management
• /
• 제39권1호
• /
• pp.98-108
• /
• 2011

Clustering is an useful method to classify objects into subsets that have some meaning in the context of a particular problem and has been applied in variety of fields, customer relationship management, data mining, pattern recognition, and biotechnology etc. This paper addresses the unknown K clustering problems and presents a new approach based on a coevolutionary algorithm to solve it. Coevolutionary algorithms are known as very efficient tools to solve the integrated optimization problems with high degree of complexity compared to classical ones. The problem considered in this paper can be divided into two sub-problems; finding the number of clusters and classifying the data into these clusters. To apply to coevolutionary algorithm, the framework of algorithm and genetic elements suitable for the sub-problems are proposed. Also, a neighborhood-based evolutionary strategy is employed to maintain the population diversity. To analyze the proposed algorithm, the experiments are performed with various test-bed problems which are grouped into several classes. The experimental results confirm the effectiveness of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제11권1호
• /
• pp.606-623
• /
• 2019

The path following problem of a ship sailing in restricted waters under wind effect is investigated based on Robust $H_{\infty}$ Guaranteed Cost Control (RHGCC). To design the controller, the ship maneuvering motion is modeled as a linear uncertain system with norm-bounded time-varying parametric uncertainty. To counteract the bank and wind effects, the integral of path error is augmented to the original system. Based on the extended linear uncertain system, sufficient conditions for existence of the RHGCC are given. To obtain an optimal robust $H_{\infty}$ guaranteed cost control law, a convex optimization problem with Linear Matrix Inequality (LMI) constraints is formulated, which minimizes the guaranteed cost of the close-loop system and mitigates the effect of external disturbance on the performance output. Numerical simulations have confirmed the effectiveness and robustness of the proposed control strategy for the path following goal of a ship sailing in restricted waters under wind effect.

• International Journal of Aeronautical and Space Sciences
• /
• 제15권1호
• /
• pp.74-81
• /
• 2014

This article documents the design of a novel two-loop acceleration autopilot based on $\mathcal{L}_1$ adaptive output feedback control for tail-controlled missiles. The inner loop is an adaptive angle-of-attack tracking loop and the outer loop is the traditional PI controller for error compensation. A systematic low-pass filter design procedure is provided for minimum phase system and is applied to the inner loop design while the parameters of the outer loop are obtained from the multi-objective optimization problem. The effectiveness of the proposed autopilot is verified through numerical simulations under various conditions.

• Journal of the Korean Data and Information Science Society
• /
• 제28권6호
• /
• pp.1271-1278
• /
• 2017

Although the $L_0$-penalty is the most natural choice to identify the sparsity structure of the model, it has not been widely used due to the computational bottleneck. Recently, the adaptive ridge procedure is developed to efficiently approximate a $L_q$-penalized problem to an iterative $L_2$-penalized one. In this article, we proposed to apply the adaptive ridge procedure to solve the $L_0$-penalized weighted support vector machine (WSVM) to facilitate the corresponding optimization. Our numerical investigation shows the advantageous performance of the $L_0$-penalized WSVM compared to the conventional WSVM with $L_2$ penalty for both simulated and real data sets.