• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2009

The Capacitated Vehicle Routing Problem (CVRP) is the problem that the vehicles stationed at central depot are to be optimally routed to supply customers with demands, satisfying vehicle capacity constraints. The CVRP is the NP-hard as it is a natural generalization of the Traveling Salesman Problem (TSP). In this article, we propose the heuristic algorithm, called the bisection seed detection method, to solve the CVRP. The algorithm is composed of 3-phases. In the first phase, we work out the initial cluster using the improved sweep algorithm. In the next phase, we choose a seed node in each initial cluster by using the bisection seed detection method, and we compose the rout with the nearest node from each seed. At this phase, we compute the regret value to decide the list of priorities for the node assignment. In the final phase, we improve the route result by using the tabu search and exchange algorithm. We compared our heuristic with different heuristics such as the Clark-Wright heuristic and the genetic algorithm. The result of proposed heuristic show that our algorithm can get the nearest optimal value within the shortest execution time comparatively.

• Journal of Korean Society of Water and Wastewater
• /
• v.27 no.4
• /
• pp.413-428
• /
• 2013

In this study, Ant Colony Algorithm(ACO) was used for optimal model. ACO which are metaheuristic algorithm for combinatorial optimization problem are inspired by the fact that ants are able to find the shortest route between their nest and food source. For applying the model to water distribution systems, pipes, tanks(reservoirs), pump construction and pump operation cost were considered as object function and pressure at each node and reservoir level were considered as constraints. Modified model from Ostfeld and Tubaltzev(2008) was verified by applying 2-Looped, Hanoi and Ostfeld's networks. And sensitivity analysis about ant number, number of ants in a best group and pheromone decrease rate was accomplished. After the verification, it was applied to real water network from S water treatment plant. As a result of the analysis, in the Two-looped network, the best design cost was found to $419,000 and in the Hanoi network, the best design cost was calculated to $6,164,384, and in the Ostfeld's network, the best design cost was found to $3,525,096. These are almost equal or better result compared with previous researches. Last, the cost of optimal design for real network, was found for 66 billion dollar that is 8.8 % lower than before. In addition, optimal diameter for aged pipes was found in this study and the 5 of 8 aged pipes were changed the diameter. Through this result, pipe construction cost reduction was found to 11 percent lower than before. And to conclusion, The least cost design model on water distribution system was developed and verified successfully in this study and it will be very useful not only optimal pipe change plan but optimization plan for whole water distribution system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.565-569
• /
• 2007

To find optimal path is killer application in the telematics system. The shortest path of conventional system, however, isn't always optimal path. That is, the path with minimum travelling time could be defined as optimal path in the road networks. There are techniques and algorithms for finding optimal path. Hierarchical path algorithm categorizes road networks into major layer and minor layer so that the performance of operational time increases. The path searched is accurate as much as optimal path. At above 2 system, a method to allocate minor roads to major road region influences the performance extremely. This paper proposes methods to determine search space for selecting major roads in the hierarchical path algorithm. In addition, methods which apply the proposed methods to hierarchical route algorithm is presented.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.103-110
• /
• 2009

We propose a novel routing protocol selection scheme based on the application feature in wireless mesh network. Each application has its own feature such as its packet size. For example, text messenger generates short size packets and file transfer application generates long size packets. Routing protocols in wireless mesh network discover the route with different features. Some find shortest hop routes; others find the routes consisting of high bandwidth though they have more hops. The proposed scheme selects the routing protocol by matching the feature of routing protocol and that of application. This paper shows the system that we have developed for supporting mesh routing as well as the proposed scheme and experimental results.

• Journal of Intelligence and Information Systems
• /
• v.29 no.2
• /
• pp.101-114
• /
• 2023

In the wartime, aircraft carrying out a mission to strike the enemy deep in the depth are exposed to the risk of being shoot down. As a key combat force in mordern warfare, it takes a lot of time, effot and national budget to train military flight personnel who operate high-tech weapon systems. Therefore, this study studied the path problem of predicting the route of emergency escape from enemy territory to the target point to avoid obstacles, and through this, the possibility of safe recovery of emergency escape military flight personnel was increased. based problem, transforming the problem into a TSP, VRP, and Dijkstra algorithm, and approaching it with an optimization technique. However, if this problem is approached in a network problem, it is difficult to reflect the dynamic factors and uncertainties of the battlefield environment that military flight personnel in distress will face. So, MDP suitable for modeling dynamic environments was applied and studied. In addition, GIS was used to obtain topographic information data, and in the process of designing the reward structure of MDP, topographic information was reflected in more detail so that the model could be more realistic than previous studies. In this study, value iteration algorithms and deterministic methods were used to derive a path that allows the military flight personnel in distress to move to the shortest distance while making the most of the topographical advantages. In addition, it was intended to add the reality of the model by adding actual topographic information and obstacles that the military flight personnel in distress can meet in the process of escape and escape. Through this, it was possible to predict through which route the military flight personnel would escape and escape in the actual situation. The model presented in this study can be applied to various operational situations through redesign of the reward structure. In actual situations, decision support based on scientific techniques that reflect various factors in predicting the escape route of the military flight personnel in distress and conducting combat search and rescue operations will be possible.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.521-528
• /
• 2008

Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.17 no.3
• /
• pp.215-226
• /
• 2015

In this study, with variables the cross section area ($97m^2$, $58m^2$, $38m^2$) and the wind velocity(0.5, 1.0, 1.5, 2.0, 2.5, 3.0, 3.5 m/s), the time of getting off train dependent on the way of itself and the width of the evacuation route was analyzed, and also fire and evacuation characteristics is reviewed by cross section area of each wind velocity. As the result, if cross section become smaller, the density of harmful gases in the tunnel increased more than the ratio of decreasing cross section area. In the case of small cross sectional area, the surrounding environment from initial fire is indicated to exceed the limit criteria suggested in performance based design. In the analysis of effective evacuation time for evacuation characteristics, the effective evacuation time was the shortest in the case of evaluating effective evacuation time by the visibility. Also, there was significant difference between the effective evacuation time on the basis of performance based evaluation and the effective evacuation time obtained by analyzing FED (Fractional effective dose), one of the analysis method obtaining the point that deaths occur, against harmful gases.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.71-81
• /
• 2010

In grid system, Task scheduling based on list scheduling models has showed low complexity and high efficiency in fully connected processor set environment. However, earlier schemes did not consider sufficiently the communication cost among tasks and the composition process of lightpath for communication in optical gird environment. In this thesis, we propose LSOG (Leveling Selection in Optical Grid) which sets task priority after forming a hierarchical directed acyclic graph (DAG) that is optimized in optical grid environment. To determine priorities of task assignment in the same level, proposed algorithm executes the task with biggest communication cost between itself and its predecessor. Then, it considers the shortest route for communication between tasks. This process improves communication cost in scheduling process through optimizing link resource usage in optical grid environment. We compared LSOG algorithm with conventional ELSA (Extended List Scheduling Algorithm) and SCP (Scheduled Critical Path) algorithm. We could see the enhancement in overall scheduling performance through increment in CCR value and smoothing network environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2293-2300
• /
• 2008

In ad-hoc sensor network, AODV routing information is disclosed to other nodes because AODV protocol doesn't have any security mechanisms. The problem of AODV is that an attacker can falsify the routing information in RREQ packet. If an attacker broadcasts the falsified packet, other nodes will update routing table based on the falsified one so that the path passing through the attacker itself can be considered as a shortest path. In this paper, we design the routing-information-spoofing attack such as falsifying source sequence number and hop count fields in RREQ packet. And we suggest an efficient scheme for detecting the attackers and isolating those nodes from the network without extra security modules. The proposed scheme doesn't employ cryptographic algorithm and authentication to reduce network overhead. We used NS-2 simulation to evaluate the network performance. And we analyzed the simulation results on three cases such as an existing normal AODV, AODV under the attack and proposed AODV. Simulation results using NS2 show that the AODV using proposed scheme can protect the routing-information-spoofing attack and the total n umber of received packets for destination node is almost same as the existing norm at AODV.

• Journal of Korean Historical Folklife
• /
• no.26
• /
• pp.71-106
• /
• 2008

The objective of this research is to reconstruct an aristocratic officer's travels by analysing Yu, hee-chun's diary, Miamilgi. Yu had kept his diary for eighty three months, from October 1567 to May 1577, and there were twenty six times of travel logs which are analysed in this research. As a result of the analysis, his travels can be divided into official travels and private travels. Sixteen times of official travels were comprised of inspection tours for parishes as a superintendent of Jeonra province, trips to supervise maintenance works of royal tombs and to worship the tombs, to carry out the sanjae (rituals in the mountains) as a second minister of the ministry of rites. It was difficult for him to have private travels as he continually served as a royal officer. He had got only 10 times of private travels during the eighty three months for maintaining the ancestor's tomb and worshiping the ancestors, for recuperating himself and his wife, and for constructing his new house. All of these travels were long-distance ones. In terms of his travel routes, he frequently used royal main trunks, e.g. 'Haenamro' (from Seoul to Damyang), which were maintained by the royal government. The main reason of his frequent using of trunk lines was that convenience facilities such as the royal post stations (Yeok) and royal inns (Won) were equipped well in these roads so it was easy to get horse change services and lodging and boarding. The fact that main trunks were chiefly straight lines and the shortest way was rather secondary reason. On the other hand, when he was a superintendent of Junra province, he had four times of round inspection on all parishes of Junra province, following the tour routs covering all over the province. As he was incumbent royal officer, he started his travel by getting a permission from the king. Simultaneously, he made ready some travel items. Among the items, horse was most important one for the journey. After finishing all the preparing processes before the departure, he had special farewell ceremony for the King, Sookbae, and had a small party with his friends called Jeonbeul. Main transportation means for his travel was horse, and many kinds of horses such as royal government's horse, Yeokma, local government's horse, Swema, as well as his private one were used. Additionally, he used a palanquin while he was doing inspection trip as a superintendent of Junra province. Yu was incumbent officer so he mostly lodged in local government guest houses. If he could not find out any local guest house, he was lodged in royal inn, and in his relatives houses or irregularly in buddhist temples. Most meals were supplied by local royal governments. The activities in his journeys were varied on his travel objectives. In his private journey, it was the main activities that maintaining ancestor's tombs and having a memorial service. During the trip, he visited his relatives. His official trips, on the other hand, had a regularity. Main activities were dealing with public works, and visiting Hyanggyo (country public school). However in the midway, he visited his relatives and had a journey to scenic places.