• Journal of Korean Society for Quality Management
• /
• v.46 no.3
• /
• pp.717-738
• /
• 2018

Purpose: This study aims to analyze why surveys of a single set of customer requirement result in different Kano analyses depending on the survey questionnaire designs. Methods: This study singled out 14 common features from four different questionnaires of two studies of Smart Car features and analyzed them using the Kano model. Several methods and devices were used: Group Comparison and Timko Index were applied; Kano Distribution Index, Timko Dispersion and Kano Conformity were newly introduced for the quantitative analysis; Correlations between Timko indices from different Kano questionnaires were conducted; Heuristic Splitting technic for reinforcing attribute categorization is introduced. Results: Correlation Coefficient proved strong positive relations among the three questionnaires, whose agreement degree of the resulting Kano attributes showed less than 10% when Indifferent was ignored. Heuristic Splitting on Timko charts enhanced the degree of the resulting Kano attributes up to 80%. Conclusion: Among the questionnaires the representation of customer requirements tends to move by parallel shifts on the Timko chart maintaining their relative locations. Heuristic Splitting suggests a rational solution to the interpretation of those inexplicable attribute categories resulting from traditional Kano methods.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.238-242
• /
• 2005

This paper considers a routing problem on a RPR(Resilient Packet Ring). The RPR is one of the ring-type data telecommunication network. Our major problem is to find an optimal routing algorithm for a given data traffic on the network under no splitting the traffic service, where the maximum load of a link is minimized. This paper characterizes the Minmax problem and develops two heuristic algorithms. By using the numerical comparison, we show that our heuristic algorithm is valuable for efficient routing the data traffic on a RPR.

• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.74-83
• /
• 2011

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over, setup overlapping, state dependent setup time as well as demand splitting are considered. For this LSSP, we develop a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we develop an efficient heuristic algorithm by combining a decomposition scheme with a local search procedure. Test results show that the developed heuristic algorithm finds a good quality (in practice, even better) feasible solution using far less computation time compared with the CPLEX, a competitive MIP solver.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.373-380
• /
• 2007

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.159-167
• /
• 2009

In this paper, we consider a single-vendor single-buyer supply chain problem where a single vendor orders raw materials from its supplier, then using its manufacturing processes converts the raw materials to finished goods in order to deliver finished goods to a single buyer for effective implementation of Just-In-Time Purchasing. An integrated lot-splitting model of facilitating multiple shipments in small lots between buyer and supplier is developed in a JIT Purchasing environment. Also, an iterative heuristic solution procedure is developed to find the order quantity for finished goods and raw materials, and number of shipments between buyer and supplier. We show by numerical example that when the integrated policy is adopted by both vendor and buyer in a cooperative manner, both parties can benefit.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.1
• /
• pp.133-140
• /
• 2014

An efficient heuristic for two-vehicle-one-depot problems is developed in this research. Vehicle moving speeds are various along hour based time intervals due to traffic jams of rush hours. Two different heuristics are examined. One is that the delivery area assignment is made using Sweep algorithm for two vehicles by splitting the whole area in half to equally divide all delivery points. The other is using common area by leaving unassigned area between the assigned for two vehicles. The common area is reassigned by two stages to balance the completion time of two vehicle's delivery. The heuristic with common area performed better than the other due to various vehicle moving speeds and traffic jams.

• Journal of Korea Game Society
• /
• v.13 no.4
• /
• pp.25-34
• /
• 2013

Spatial partitioning trees are needed for processing collision detections efficiently. In order to select split planes for spatial partitioning trees, the tree balance and the number of polygons overlapped with the split plane should be considered. In this paper, the heuristic algorithm controlling weight values of tree build criteria is proposed for spatial partitioning trees of 3D games. As the weight values are changed, tree build time, T-junction elimination time which can cause visual artifacts in splitting polygons overlapped with the split plane, rendering speed (frame per second: FPS) according to tree balance are analysed under 3D game simulations.

• Nuclear Engineering and Technology
• /
• v.53 no.6
• /
• pp.2066-2073
• /
• 2021

The use of nuclear reactors is a large studied possible solution for thermochemical water splitting cycles. Nevertheless, there are several problems that have to be solved. One of them is to increase the efficiency of the cycles. Hence, in this paper, a thermal energy optimization of a Sulfur-Iodine nuclear hydrogen production cycle was performed by means a heuristic method with the aim of minimizing the energy targets of the heat exchanger network at different minimum temperature differences. With this method, four different heat exchanger networks are proposed. A reduction of the energy requirements for cooling ranges between 58.9-59.8% and 52.6-53.3% heating, compared to the reference design with no heat exchanger network. With this reduction, the thermal efficiency of the cycle increased in about 10% in average compared to the reference efficiency. This improves the use of thermal energy of the cycle.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.1
• /
• pp.319-333
• /
• 2022

In order to enhance system energy efficiency, bidirectional link resource allocation strategy in GFDM-based multiuser SWIPT systems is proposed. In the downlink channel, each SWIPT user applies power splitting (PS) receiver structure in information decoding (ID) and non-linear energy harvesting (EH). In the uplink channel, information transmission power is originated from the harvested energy. An optimization problem is constructed to maximize weighted sum ID achievable rates in the downlink and uplink channels via bidirectional link power allocation as well as subcarriers and subsymbols scheduling. To solve this non-convex optimization problem, Lagrange duality method, sub-gradient-based method and greedy algorithm are adopted respectively. Simulation results show that the proposed strategy is superior to the fixed subcarrier scheme regardless of the weighting coefficients. It is superior to the heuristic algorithm in larger weighting coefficients scenario.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.559-566
• /
• 2016

Software defined network (SDN) can effectively improve the performance of traffic engineering and will be widely used in backbone networks. Therefore, new energy-saving schemes must take SDN into consideration; this action is extremely important owing to the rapidly increasing energy consumption in telecom and Internet service provider (ISP) networks. Meanwhile, the introduction of SDN in current networks must be incremental in most cases, for technical and economic reasons. During this period, operators must manage hybrid networks in which SDN and traditional protocols coexist. In this study, we investigate the energy-efficient traffic engineering problem in hybrid SDN/Internet protocol (IP) networks. First, we formulate the mathematical optimization model considering the SDN/IP hybrid routing mode. The problem is NP-hard; therefore, we propose a fast heuristic algorithm named hybrid energy-aware traffic engineering (HEATE) as a solution. In our proposed HEATE algorithm, the IP routers perform shortest-path routing by using distributed open shortest path first (OSPF) link weight optimization. The SDNs perform multipath routing with traffic-flow splitting managed by the global SDN controller. The HEATE algorithm determines the optimal setting for the OSPF link weight and the splitting ratio of SDNs. Thus, the traffic flow is aggregated onto partial links, and the underutilized links can be turned off to save energy. Based on computer simulation results, we demonstrate that our algorithm achieves a significant improvement in energy efficiency in hybrid SDN/IP networks.