Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Korean Institute of Industrial Engineers
Journal Basic Information
Journal DOI :
Korean Institute of Industrial Engineers
Editor in Chief :
Volume & Issues
Volume 37, Issue 4 - Dec 2011
Volume 37, Issue 3 - Sep 2011
Volume 37, Issue 2 - Jun 2011
Volume 37, Issue 1 - Mar 2011
Selecting the target year
A Modified Particle Swarm Optimization Algorithm : Information Diffusion PSO
Park, Jun-Hyuk ; Kim, Byung-In ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 163~170
DOI : 10.7232/JKIIE.2011.37.3.163
This paper proposes a modified version of Particle Swarm Optimization (PSO) called Information Diffusion PSO (ID-PSO). In PSO algorithms, premature convergence of particles could be prevented by defining proper population topology. In this paper, we propose a variant of PSO algorithm using a new population topology. We draw inspiration from the theory of information diffusion which models the transmission of information or a rumor as one-to-one interactions between people. In ID-PSO, a particle interacts with only one particle at each iteration and they share their personal best solutions and recognized best solutions. Each particle recognizes the best solution that it has experienced or has learned from another particle as the recognized best. Computational experiments on the benchmark functions show the effectiveness of the proposed algorithm compared with the existing methods which use different population topologies.
Study on Vehicle Routing Problem of Artillery Position Construction for Survivability Support
Moon, Jung-Hyun ; Lee, Sang-Heon ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 171~179
DOI : 10.7232/JKIIE.2011.37.3.171
In this paper, we deal with the vehicle routing problem that could establish operational plan of military engineer for survivability support of artillery position construction. We propose VRPTW(vehicle routing problem with time-window) model of special form that considered service level to reflect the characteristics of military operations rather than the logic of economic efficiencies in the objective function. Furthermore we suggest modified particle swarm optimization algorithm for service based vehicle routing problem solution that can be possible to search in complicated and uncertain area and control relation softly between global and local search.
A Study on Energy Efficient Self-Organized Clustering for Wireless Sensor Networks
Lee, Kyu-Hong ; Lee, Hee-Sang ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 180~190
DOI : 10.7232/JKIIE.2011.37.3.180
Efficient energy consumption is a critical factor for deployment and operation of wireless sensor networks (WSNs). To achieve energy efficiency there have been several hierarchical routing protocols that organize sensors into clusters where one sensor is a cluster-head to forward messages received from its cluster-member sensors to the base station of the WSN. In this paper, we propose a self-organized clustering method for cluster-head selection and cluster based routing for a WSN. To select cluster-heads and organize clustermembers for each cluster, every sensor uses only local information and simple decision mechanisms which are aimed at configuring a self-organized system. By these self-organized interactions among sensors and selforganized selection of cluster-heads, the suggested method can form clusters for a WSN and decide routing paths energy efficiently. We compare our clustering method with a clustering method that is a well known routing protocol for the WSNs. In our computational experiments, we show that the energy consumptions and the lifetimes of our method are better than those of the compared method. The experiments also shows that the suggested method demonstrate properly some self-organized properties such as robustness and adaptability against uncertainty for WSN's.
A Comparison of Group Steiner Tree Formulations
Myung, Young-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 191~197
DOI : 10.7232/JKIIE.2011.37.3.191
The group Steiner tree problem is a generalization of the Steiner tree problem that is defined as follows. Given a weighted graph with a family of subsets of nodes, called groups, the problem is to find a minimum weighted tree that contains at least one node in each group. We present some existing and some new formulations for the problem and compare the relaxations of such formulations.
Deployment Planning of Blocks from Storage Yards Using a Tabu Search Algorithm
Lee, Sang-Hyup ; Kim, Ji-On ; Moon, Il-Kyeong ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 198~208
DOI : 10.7232/JKIIE.2011.37.3.198
At a shipyard, the efficient handling of blocks is one of the most important factors in the shipbuilding process. We consider the problem of deployment planning of blocks from storage yards. As some information of block arrangement should be considered to handle the problem, we adopt the block arrangement based on the coordinates and sizes of each block at a storage yard. Deployment planning for a block involves deciding upon its transportation route from the storage yard and searching for blocks that would obstruct its transportation along this route. A tabu search algorithm for deploying several blocks is developed to minimize the number of obstructive blocks deployed together from the storage yards at a shipyard. The results of computational experiments show that the developed algorithm is very useful in the deployment planning of multiple blocks from the storage yards.
Assessment of the Upper Limb Work Load according to the Mouse Size in VDT Tasks
Song, Young-Woong ; Kim, Kyoung-Ah ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 209~215
DOI : 10.7232/JKIIE.2011.37.3.209
The objective of this study was to determine whether there are differences in hand muscle activities (APB : abductor pollicis brevis, ED : extensor digitorum, ECU : extensor carpi ulnaris, and EI : extensor indicis) and subjective discomfort according to the three mouse sizes (small, medium, large) and two task types (pointing and scrolling). The mouse size and task type showed significant interaction effects on the total NEMG (p = 0.004) and on the NEMG of the abductor pollicis brevis muscle (p = 0.001). The total NEMG and the NEMG of APB showed the highest value in the 'scrolling' task using the 'small' mouse. However, the NEMG of the EI was different according to the mouse size, and the 'small' mouse showed the lowest value. The subjective discomfort was the lowest in the 'medium' mouse, and all nine subjects preferred the 'medium' size. The hand-size related anthropometric variables showed different correlations according to the task type and mouse size with the NEMGs and subjective discomfort. The results of this study could be used as a basic information for the determination of the proper mouse size according to the hand size.
A Forecast-based Inventory Control Policy for an Item with Non-stationary Demand
Park, Sung-Il ; Kim, Jong-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 216~228
DOI : 10.7232/JKIIE.2011.37.3.216
A logistics system involving a supplier who produces and delivers a single product and a buyer who receives and sells the product to the final customers is analyzed. In this system, the supplier and the buyer establish a contract which specifies that the supplier will deliver necessary amount of the product to raise inventory up to a specified position at the beginning of each period. A new periodic order-up-to-level inventory control policy specifically designed for nonstationary end customer's demand is proposed for the system. Simulations are used to test the efficiency of the proposed policy. An analysis of the test results reveals that the proposed policy performs much better than does the existing order-up-to-level policy, especially when the demand is nonstationary.
Forward Link Data Service Capacity Considering Data Rate Adaptation in CDMA2000 1X-EVDO Systems
Choi, Woo-Yong ; Lim, Dong-Gu ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 229~233
DOI : 10.7232/JKIIE.2011.37.3.229
The existing approaches for analyzing the data service capacity of CDMA2000 1X EV-DO (Evolution-Data Only) systems have focused on deriving the maximum number of active customers assuming that the data rates provided to the customers can be determined beforehand. However, we have seen that through real experiment, the data rates actually provided to the customers adaptively change according to the number of active customers. In this paper, we propose new capacity analysis model considering the data rate adaptation. Numerical examples are also presented to obtain the maximum input traffic rates for various values of the length of data burst and the required mean delay bound.
Product-Service System : Current Status and Research Issues
Kim, Kwang-Jae ; Hong, Yoo-Suk ; Park, Kwang-Tae ; Lim, Chie-Hyeon ; Heo, Jun-Yeon ; Kang, Chang-Muk ; Baek, Min-Jeong ; Park, Geun-Wan ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 234~247
DOI : 10.7232/JKIIE.2011.37.3.234
Product-service system (PSS) is a novel type of business model integrating products and services in a single system. It provides a strategic alternative to product-oriented economic growth and price-based competition in the global market. This paper first reviews the current status of PSS, including its concept, characteristics, benefits, and cases. This paper then reviews the existing literature and identifies major research issues for three main phases of a PSS development lifecycle, namely, PSS design, PSS evaluation, and PSS operation. This research is expected to contribute to promoting awareness and improving understanding of PSS in our society and planning of future research in this field.
A Genetic Algorithm for Scheduling of Trucks with Inbound and Outbound Process in Multi-Door Cross Docking Terminals
Joo, Cheol-Min ; Kim, Byung-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 248~257
DOI : 10.7232/JKIIE.2011.37.3.248
Cross docking is a logistics management concept in which items delivered to a terminal by inbound trucks are immediately sorted out, routed and loaded into outbound trucks for delivery to customers. Two main advantages by introducing a cross docking terminal are to consolidate multiple smaller shipment into full truck load and remove storage and order picking processes to save up logistics costs related to warehousing and transportation costs. This research considers the scheduling problem of trucks in the cross docking terminals with multi-door in an inbound and outbound dock, respectively. The trucks sequentially deal with the storage process at the one of inbound doors and the shipping process at the one of the outbound doors. A mathematical model for an optimal solution is derived, and genetic algorithms with two different chromosome representations are proposed. To verify performance of the GA algorithms, we compare the solutions of GAs with the optimal solutions and the best solution using randomly generated several examples.
On a Two Dimensional Linear Programming Knapsack Problem with the Generalized GUB Constraint
Won, Joong-Yeon ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 258~263
DOI : 10.7232/JKIIE.2011.37.3.258
We study on a generalization of the two dimensional linear programming knapsack problem with the extended GUB constraint, which was presented in paper Won(2001). We identify some new parametric properties of the generalized problem and derive a solution algorithm based on the identified parametric properties. The solution algorithm has a worst case time complexity of order O(
), where n is the total number of variables. We illustrate a numerical example.
An Event-Driven Entity-Relationship Modeling Method for Creating a Normalized Logical Data Model
Yoo, Jae-Gun ;
Journal of Korean Institute of Industrial Engineers, volume 37, issue 3, 2011, Pages 264~270
DOI : 10.7232/JKIIE.2011.37.3.264
A new method for creating a logical data model is proposed. The logical data model developed by the method defines table, primary key, foreign key, and fields. The framework of the logical data model is constructed by modeling the relationships between events and their related entity types. The proposed method consists of a series of objective and quantitative decisions such as maximum cardinality of relationships and functional dependency between the primary key and attributes. Even beginners to database design can use the methology as long as they understand such basic concepts about relational databases as primary key, foreign key, relationship cardinality, parent-child relationship, and functional dependency. The simple and systematic approach minimizes decision errors made by a database designer. In practial database design the method creates a logical data model in Boyce-Codd normal form unless the user of the method makes a critical decision error, which is very unlikely.