• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.76-87
• /
• 2014

Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and is predicted to increase remarkably in the near future. For this reason, this paper studies energy saving strategies assuring the network-level QoS. In the strategies, the energy consumption of NIC(network interface card) on both endpoint of links decreases by selecting links and making them sleep when the total traffic volume of the IP network is lower than a threshold. In this paper, we propose a heuristic routing algorithm based on so-called delegating/delegated routers, and evaluate its characteristics using computer simulation considering network-level QoS. The selection of sleep links is determined in terms of the number of traffic paths (called min_used path) or the amount of traffics(called min_used traffic) through those kinks. To our experiment, the min_used traffic method shows a little better energy saving but the increased path length compared to the min_used path method. Those two methods have better energy saving characteristics than the random method. This paper confirms that the delegating/delegated router-based routing algorithm results in energy saving effects and sustains network-level QoS in IP networks.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.27-34
• /
• 2012

Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and will be remarkably increased in the near future. For that reason, the energy saving topics of ICT networks are actually studying in various research institutes. This paper studies the possible energy saving methods assuring the QoS of networks on network level. This paper assumed the energy consumption models according to energy profiles of node and link in IP networks. Especially it formulates the energy problem of a minimum energy consumption with various energy profile models and suggests the methods of energy-aware QoS routing under energy saving and network QoS sustaining condition. It shows the large difference of energy saving according to energy profiles and the possibility of energy saving by using the appropriate energy profile model in the simulation experiment. This paper shows that min_used_path(MP) heuristic of energy-aware QoS routing is the excellent method compared with other heuristic methods as view of reduction ratio of nodes and links and energy saving effect under network QoS sustaining condition. As a result, this paper confirms that the min_used_path(MP) heuristic of energy-aware QoS routing can get energy saving and sustaining of network QoS in IP networks.

• Journal of the military operations research society of Korea
• /
• v.26 no.1
• /
• pp.89-99
• /
• 2000

This paper deals with a heuristic algorithm for the vehicle routing-scheduling problem to minimize the total travel distance and the total cost. Because the aim of the Clarke-Wright method, one of famous heuristic methods, is to minimize the total travel distance of vehicles, it cannot consider the cost if the cost and the travel distance is not proportional. In the Clarke-Wright method, the route of each vehicle is found by using the saving matrix which is made by an assumption that the vehicle comes back to the starting point. The problem dealt with in the paper, however, does not need the vehicle to come back because each vehicle has its hoping-start-points and hoping-destination-points. Therefore we need a different saving matrix appropriate to this occasion. We propose a method to find an initial solution by applying network simplex method after transforming the vehicle routing-scheduling problem into the minimum cost problem. Moreover, we propose a method to minimize the total travel distance by using the modified saving matrix which is appropriate to no-return occasion and the method for the case of plural types of vehicles and freights.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.9 no.13
• /
• pp.79-86
• /
• 1986

This paper presents a heuristic algorithm for a crew scheduling problem with dead head flights. This paper modifies and improves saving method for finding the Multiple Salesman tours in the graph. The results show that the computing time from this algorithm is implemented very much than those from general crew scheduling algorithms by set covering models.

• Asia pacific journal of information systems
• /
• v.29 no.3
• /
• pp.468-488
• /
• 2019

As the growth of online travel agencies (hereafter OTAs) accelerates, competition among hotels to gain exposure on the first page of OTA websites, and the financial burden, such as commissions hotels have to pay in return, are increasing. Therefore, to facilitate successful management in the tourism industry, it is important to establish what makes people continue the practice of using OTAs to book rooms in hotels and other accommodation outlets. By adopting the heuristic-systematic model (HSM), this study explores the factors that drive consumers' continued use of OTA and classifies them into heuristic cues (brand awareness, cost saving, and scarcity message) and systematic cues (recommendation quality and the ability to provide reputation). Furthermore, we divided the sample based on the location of hotels within and outside Korea, and investigated the different roles of the cues between two models. The results are expected to provide theoretical and practical implications for both OTAs and hotels.

• Journal of the military operations research society of Korea
• /
• v.26 no.1
• /
• pp.47-55
• /
• 2000

The purpose of this paper is to develop a new heuristic algorithm for vehicle routing problem. The algorithm is composed of two steps. First step is to make a initial solution using sweeping algorithm. Second step is to improve initial solution for optimal solution using node exchange algorithm and tabu search algorithm. We have proven that our algorithm has produced better results than solutions obtained by saving algorithm and genetic in ten example problems with different unit size.

• Journal of the military operations research society of Korea
• /
• v.33 no.2
• /
• pp.31-47
• /
• 2007

The main purpose of this study is to find out the best solution of the vehicle routing problem with hard time window by using both genetic algorithm and heuristic. A mathematical programming model was also suggested in the study. The suggested mathematical programming model gives an optimal solution by using ILOG-CPLEX. This study also suggests a hybrid genetic algorithm which considers the improvement of generation for an initial solution by savings heuristic and two heuristic processes. Two heuristic processes consists of 2-opt and Or-opt. Hybrid genetic algorithm is also compared with existing problems suggested by Solomon. We found better solutions rather than the existing genetic algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.569-576
• /
• 2007

This paper is on the enhancement of our heuristics for GOSST problem that could apply to the design of communication networks offering graduated services. This problem hewn as one of NP-Hard problems finds a network topology meeting the G-Condition with minimum construction cost. In our prior research, we proposed two heuristics. We suggest methods of selecting G-Node and disconnections for Global or Local locating heuristic in this research. The ameliorated Local locating heuristic retrenches 17% more network construction cost saving ratio and the reformed Global locating heuristic does 14% more than our primitives.

• IE interfaces
• /
• v.13 no.3
• /
• pp.424-430
• /
• 2000

Supply chain management (SCM) is an area that has recently received a great deal of attention in the business community. While SCM is relatively new, the idea of coordinated planning is not. During the last decades, many researchers have investigated multi-stage inventory problems. However, only a few papers address the problem of cost-optimal coordination of multi-stage inventory control with respect to service measures. Even published approaches have a shortcoming in dealing with a delivery lead time consisted of a shipping time and a waiting time. Assumed that there is no waiting time, or that the delivery lead time is implicitly compounded of a shipping time and a waiting time, the problem is often simplified into a multi-stage buffer allocation and a single-stage stochastic buffer sizing problem at all installations. This paper presents a simulation-based heuristic algorithm and a comparison with others for the problem that cannot be decomposed into a multi-stage buffer allocation and a single-stage stochastic buffer sizing problem because the waiting time ties together all stages. The comparison shows that the simulation-based heuristic algorithm performs better than other approaches in saving average inventory cost for both Poisson and Normal demands.