• Journal of information and communication convergence engineering
• /
• 제9권2호
• /
• pp.141-149
• /
• 2011

We consider the problem of assigning tasks to homogeneous nodes in the distributed system, so as to minimize the amount of communication, while balancing the processors' loads. This issue can be posed as the graph partitioning problem. Given an undirected graph G=(nodes, edges), where nodes represent task modules and edges represent communication, the goal is to divide n, the number of processors, as to balance the processors' loads, while minimizing the capacity of edges cut. Since these two optimization criteria conflict each other, one has to make a compromise between them according to the given task type. We propose a new cost function to evaluate static task assignments and a heuristic algorithm to solve the transformed problem, explicitly describing the tradeoff between the two goals. Simulation results show that our approach outperforms an existing representative approach for a variety of task and processing systems.

• 한국경영과학회지
• /
• 제15권1호
• /
• pp.37-46
• /
• 1990

Biomass to methane production is a good supply of substitutable energy resources. The economic viability of these systems depends a great deal on cost effective production methods and facilities. The operational problem is to determine the time eto allocate to each batch of several feedstocks for each digester and to determine the number of batches for each digester so as to maximize biogas production for two identical digesters over a fixed planning horizon. This paper provides an efficient approximation procedure which is based on decomposition of the problem and the analysis of incremental gas production function for each feedstock. The computational experience for the heuristic procedure was also reported.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1237-1240
• /
• 1996

This paper proposes a heuristic algorithm for performing the line balancing of PCB assembly fine including multiple surface mounters efficiently. We consider a PCB assembly line including the multiple surface mounters arranged serially as a target system. We assume that the number of heads of surface mounters can be changed. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. Also we propose an head-changing algorithm. The algorithms are validated through the computer simulation.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권6호
• /
• pp.800-806
• /
• 1999

This paper proposes IIKBAG(Intelligent Interlocking Knowledge Base Generator) which can build automatically the interlocking knowledge base utilized as the real-time interlocking strategy of the electronic interlocking system in order to enhance it's reliability and expansion. The IIKBAG consists of the inference engine and the knowledge base. The former has an auto-learning function which searches all the train routes for the given station model based on heuristic search technique while dynamically searching the model, and then generates automatically the interlocking patterns obtained from the interlocking relations of signal facilities on the routes. The latter is designed as the structure which the real-time expert system embedded on IS(Interlocking System) can use directly in order to enhances the reliability and accuracy. The IIKBAG is implemented in C computer language for the purpose of the build and interface of the station structure database. And, a typical station model is simulated to prove the validity of the proposed IIKBAG.

• ETRI Journal
• /
• 제42권3호
• /
• pp.388-398
• /
• 2020

We herein propose a heuristic redundancy selection algorithm that combines resubmission, replication, and checkpointing redundancies to reduce the resiliency overhead in fault-tolerant workflow scheduling. The appropriate combination of these redundancies for workflow tasks is obtained in two consecutive phases. First, to compute the replication vector (number of task replicas), we apportion the set of provisioned resources among concurrently executing tasks according to their needs. Subsequently, we obtain the optimal checkpointing interval for each task as a function of the number of replicas and characteristics of tasks and computational environment. We formulate the problem of obtaining the optimal checkpointing interval for replicated tasks in situations where checkpoint files can be exchanged among computational resources. The results of our simulation experiments, on both randomly generated workflow graphs and real-world applications, demonstrated that both the proposed replication vector computation algorithm and the proposed checkpointing scheme reduced the resiliency overhead.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.410-420
• /
• 1994

In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.

• 한국정밀공학회지
• /
• 제12권8호
• /
• pp.92-98
• /
• 1995

The position control of flexible joint manipulator is investigated by applying the self-organizing fuzzy logic controller (SOC) proposed by Procyk and Mamdani. The SOC is a heuristic rule-based controller and a further extension of an ordinary fuzzy controller, which has a hierachy structrue which consists of an algorithm being identical to a fuzzy controller at the lower ollp and a learning algorithm accomodating the performance evalution and rule modification function at the upper ollp. This form of control can be used in those complex systems which have been too difficult to control or which in the past have had to rely on the experience of a human operator. Even though the significant dynamic coupling of the motors and links on the flexible joint manipulator, the performance of command-following is good by applying the proposed SOC.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2003년도 춘계학술대회 논문집
• /
• pp.9-14
• /
• 2003

SGA (Single Genetic Algorithm) is a heuristic global optimization method based on the natural characteristics and uses many populations and stochastic rules. Therefore SGA needs many function evaluations and takes much time for convergence. In order to solve the demerits of SGA, $\mu$GA(Micro-Genetic Algorithm) has recently been developed. In this study, $\mu$GA which have small populations and fast convergence rate, was applied to structural optimization with discrete or integer variables such as 3, 10 and 25 bar trusses. The optimized results of $\mu$GA were compared with those of SGA. Solutions of $\mu$GA for structural optimization were very similar or superior to those of SGA, and faster convergence rate was obtained. From the results of examples, it is found that $\mu$GA is a suitable and very efficient optimization algorithm for structural design.

• International Journal of CAD/CAM
• /
• 제12권1호
• /
• pp.9-19
• /
• 2012

Generation of optimum planar B-spline curve in terms of minimum deviation and required fairness to approximate a target shape defined by a strip-shaped unorganized 2D point cloud is studied. It is proposed to use the location of control points as variables within the geometric optimization framework of point distance minimization. An adaptive simulated annealing heuristic optimization algorithm is developed to iteratively update an initial approximate curve towards the target shape. The new implementation comprises an adaptive cooling procedure in which the temperature change is adaptively dependent on the objective function evolution. It is shown that the proposed method results in an improved convergence speed when compared to the standard simulated annealing method. A couple of examples are included to show the applicability of the proposed method in the surface model reconstruction directly from point cloud data.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.119-122
• /
• 1995

Neural network has found wide applications in the system identification, modeling, and realization based on its function approximation capability. THe system governe dby nonlinear dynamics is hard to be identified by the neural network because there exist following difficulties. FIrst, the training samples obtained by the stae trajectory are apt to be nonuniform over the region of interest. Second, the system may becomje unstable while attempting to obtain the samples. This paper deals with these problems in discrete-time system and suggest effective solutions which provide stability and uniform sampliing by the virtue of robust control theory and heuristic algorithms.