• Industrial Engineering and Management Systems
• /
• v.6 no.2
• /
• pp.136-145
• /
• 2007

The selection of suppliers and the determination of order quantities to be placed with those suppliers are important decisions in a supply chain. In this research, a non-linear mixed integer programming model is presented to select suppliers and determine the order quantities. The model considers the purchasing cost which takes into account quantity discount, the cost of transportation, the fixed cost for establishing suppliers, the cost for holding inventory, and the cost of receiving poor quality parts. The capacity constraints for suppliers, quality and lead-time requirements for the parts are also taken into account in the model. Since the purchasing cost, which is a decreasing step function of order quantities, introduces discontinuities to the non-linear objective function, it is not easy to employ traditional optimization methods. Thus, a heuristic algorithm, called particle swarm optimization (PSO), is used to find the (near) optimal solution. However, PSO usually generates initial solutions randomly. To improve the PSO solution quality, a heuristic procedure is proposed to find an initial solution based on the average unit cost including transportation, purchasing, inventory, and poor quality part cost. The results show that PSO with the proposed initial solution heuristic provides better solutions than those with PSO algorithm only.

• Smart Structures and Systems
• /
• v.14 no.5
• /
• pp.943-960
• /
• 2014

A visually servoed paired structured light system (ViSP) was recently proposed as a novel estimation method of the 6-DOF (Degree-Of-Freedom) relative displacement in civil structures. In order to apply the ViSP to massive structures, multiple ViSP modules should be installed in a cascaded manner. In this configuration, the estimation errors are propagated through the ViSP modules. In order to resolve this problem, a displacement estimation error back-propagation (DEEP) method was proposed. However, the DEEP method has some disadvantages: the displacement range of each ViSP module must be constrained and displacement errors are corrected sequentially, and thus the entire estimation errors are not considered concurrently. To address this problem, a pose-graph optimized displacement estimation (PODE) method is proposed in this paper. The PODE method is based on a graph-based optimization technique that considers entire errors at the same time. Moreover, this method does not require any constraints on the movement of the ViSP modules. Simulations and experiments are conducted to validate the performance of the proposed method. The results show that the PODE method reduces the propagation errors in comparison with a previous work.

• Advances in Computational Design
• /
• v.2 no.4
• /
• pp.313-331
• /
• 2017

In this study, teaching-learning based optimization (TLBO) is improved by incorporating model of multiple teachers, adaptive teaching factor, self-motivated learning, and learning through tutorial. Modified TLBO (MTLBO) is applied for simultaneous topology, shape, and size optimization of space and planar trusses to study its effectiveness. All the benchmark problems are subjected to stress, displacement, and kinematic stability constraints while design variables are discrete and continuous. Analyses of unacceptable and singular topologies are prohibited by seeing element connectivity through Grubler's criterion and the positive definiteness. Performance of MTLBO is compared to TLBO and state-of-the-art algorithms available in literature, such as a genetic algorithm (GA), improved GA, force method and GA, ant colony optimization, adaptive multi-population differential evolution, a firefly algorithm, group search optimization (GSO), improved GSO, and intelligent garbage can decision-making model evolution algorithm. It is observed that MTLBO has performed better or found nearly the same optimum solutions.

• Advances in Computational Design
• /
• v.3 no.4
• /
• pp.385-404
• /
• 2018

The study investigated an area of sustainable structural design that is often overlooked in practical engineering applications. Specifically, a novel method to simultaneously optimise the cost and embodied carbon performance of steel building structures was explored in this paper. To achieve this, a parametric design model was developed to analyse code compliant structural configurations based on project specific constraints and rigorous testing of various steel beam sections, floor construction typologies (precast or composite) and column layouts that could not be performed manually by engineering practitioners. Detailed objective functions were embedded in the model to compute the cost and life cycle carbon emissions of the different material types used in the structure. Results from a comparative numerical analysis of a real case study illustrated that the proposed optimisation approach could guide structural engineers towards areas of the solution space with realistic design configurations, enabling them to effectively evaluate trade-offs between cost and carbon performance. This significant contribution implied that the optimisation model could reduce the time required for the design and analysis of multiple structural configurations especially during the early stages of a project. Overall, the paper suggested that the deployment of automated design procedures can enhance the quality as well as the efficiency of the optimisation analysis.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.16-22
• /
• 2019

After Dantzig and Rasmer introduced Vehicle Routing Problem in 1959, this field has been studied with numerous approaches so far. Classical Vehicle Routing Problem can be described as a problem of multiple number of homogeneous vehicles sharing a same starting node and having their own routes to meet the needs of demand nodes. After satisfying all the needs, they go back to the starting node. In order to apply the real world problem, this problem had been developed with additional constraints and pick up & delivery model is one of them. To enhance the effectiveness of pick up & delivery, hub became a popular concept, which often helps reducing the overall cost and improving the quality of service. Lots of studies have suggested heuristic methods to realize this problem because it often becomes a NP-hard problem. However, because of this characteristic, there are not many studies solving this problem optimally. If the problem can be solved in polynomial time, optimal solution is the best option. Therefore, this study proposes a new mathematical model to solve this problem optimally, verified by a real world problem. The main improvements of this study compared to real world case are firstly, make drivers visit every nodes once except hub, secondly, make drivers visit every nodes at the right time, and thirdly, make drivers start and end their journey at their own homes.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.12
• /
• pp.1150-1159
• /
• 2011

Reliability is defined as a probability that a system will operate properly for a specified period of time under the design operating conditions without failure. Reliability-Redundancy Optimization Problem(RROP) involves selection of components with multiple choices, redundancy levels and redundancy strategy(Active or Standby) for maximizing system reliability with constraints such as cost, weight, etc. Based on the design configuration of Multi-Spectral Camera(MSC) system of KOMPSAT-2, the mathematical programming model for RROP is suggested in this study. Due to the nature of RROP, i.e. NP-hard problem, Parallel Particle Swarm Optimization(PPSO) algorithm is proposed to solve it. The result of the numerical experiment for RROP is presented as instance of recommended design configuration at some mission time.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.7-18
• /
• 1998

In this paper, we develop three context-dependent resource allocation models to maximize user satisfaction in terms of software quality. Those models are formulated on the grounds that human resources are dominant In a software development project while taking into account managerial quality constraints of the system. The satisfaction function on exerted resources plays a key linking pin between the two sides, and its functioning forms bring about different solution methods. In addition to a basic linear model, an extension model is formulated so that it may be applicable to the situation of multiple-goal settings. Finally, non-linear model is given the solving optimization algorithm developed and proved in this paper.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1025-1030
• /
• 2005

Cooperative communications among users in multiple access wireless environments is an efficient way to obtain the powerful benefits of multi-antenna systems without the demand for physical arrays. This paper proposes a solution to optimize the weights of partnering users' signals for the minimum error probability at the output of maximum likelihood (ML) detector under the transmit power constraints by taking advantage of channel state information (CSI) feedback from the receiver to the transmitter. Simulation programs are also established to evaluate the performance of the system under flat Rayleigh fading channel plus AWGN (Additive White Gaussian Noise).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.17-24
• /
• 2006

We consider the sensor location problem (SLP) on a given sensor field. We present the sensor field as grid of points. There are several types of sensors which have different detection ranges and costs. If a sensor is placed in some point, the points inside of its detection range can be covered. The coverage ratio decreases with distance. The problem we consider in this thesis is called multiple-type differential coverage sensor location problem (MDSLP). MDSLP is more realistic than SLP. The coverage quantities of points are different with their distance form sensor location in MDSLP. The objective of MDSLP is to minimize total sensor costs while covering every sensor field. This problem is known as NP-hard. We propose a new integer programming formulation of the problem. In comparison with the previous models, the new model has a smaller number of constraints and variables. This problem has symmetric structure in its solutions. This group is used for pruning in the branch-and-bound tree. We solved this problem by branch-and-cut(B&C) approach. We tested our algorithm on about 60 instances with varying sizes.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.249-254
• /
• 2001

Abstract In this paper, we propose a method of cooperative control based on artifical intelligent system in distributed autonomous robotic system. In general, multi-agent behavior algorithm is simple and effective for small number of robots. And multi-robot behavior control is a simple reactive navigation strategy by combining repulsion from obstacles with attraction to a goal. However when the number of robot goes on increasing, this becomes difficult to be realized because multi-robot behavior algorithm provide on multiple constraints and goals in mobile robot navigation problems. As the solution of above problem, we propose an architecture of fuzzy system for each multi-robot speed control and fuzzy-neural network for obstacle avoidance. Here, we propose an architecture of fuzzy system for each multi-robot speed control and fuzzy-neural network for their direction to avoid obstacle. Our focus is on system of cooperative autonomous robots in environment with obstacle. For simulation, we divide experiment into two method. One method is motor schema-based formation control in previous and the other method is proposed by this paper. Simulation results are given in an obstacle environment and in an dynamic environment.