• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.1-15
• /
• 2005

In this paper, we deal with a mesh network design problem arising from the deployment of WDM for the optical internet. The mesh network consists of mesh topology for satisfying traffic demand while minimizing the cost of WDM, OXC, and fiber cables. The problem seeks to find an optimal routing of traffic demands in the network such that the total cost is minimized. We formulate the problem as a mixed-integer programming model and devise a tabu search heuristic procedure. Also we develop an optical internet design system that implements the proposed tabu search heuristic procedure. We demonstrate the computational efficacy of the proposed algorithm, compared with CPLEX 8.0.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.421-430
• /
• 2000

This paper presents a new approach which uses $A^*$ search and genetic algorithms for solving large scale multi-objective shortest path problem. The focus of this paper is motivated by the problem of finding Pareto optimal paths for an advanced traveler information system(ATIS) in the context of intelligent transportation system(ITS) application. The individual description, the decoding rule, the selection strategy and the operations of crossover and mutation are proposed for this problem. The keynote points of the algorithm are how to represent individuals and how to calculate the fitness of each individual. The high performance of the proposed algorithm is demonstrated by computer simulations.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.689-691
• /
• 2023

본 논문에서는 시작 노드와 목적지 노드 까지의 최단경로를 중점으로 가장 인접한 경유지를 선택하고 경유지가 다수일 경우 하모니서치 알고리즘을 통해 최적의 경로를 탐색하는 기법을 제안한다. 본 논문의 기법은 기존의 사용자의 현 위치에서 인접한 경유지를 추천해주는 시스템과 달리 목적지까지의 경로 전체에서 가장 인접한경유지를 선택해준다는 차별점이 있다. 그렇게 선택된 경유지들은 하모니서치 알고리즘을 사용하여 최적의 경로를 제안한다. 본 논문의 기법은 최단경로의 이탈을 최소화한 경유지 선택으로 거리, 시간, 비용적 측면에서 효율적이며 길을 헤매서 생기는 불필요한 지연을 최소화할 수 있다. 자율주행, 비행기, 선박, 드론 등 최적 경로 이탈시 큰 손실을 안기거나 위험한 시스템에 적용시 큰 효과를 거둘 수 있다.

• Journal of Korean Society of Transportation
• /
• v.23 no.8 s.86
• /
• pp.171-179
• /
• 2005

This paper presents the algorithm using fuzzy inference that preestimates each link speed changed by different kinds of road situations. The elements we are considered are time zone, rainfall probability information and lane control information. This paper is consists of three parts. First of all we set up the fuzzy variables, and preestimate link speed changed by various road situations. For this process, we build the membership functions for each fuzzy variable and establish the fuzzy inference relations to find how fuzzy variables influence on link speed. Second, using backtracking method, we search the shortest route influenced by link speed changed by fuzzy inference. Third, we apply this algorithm to hypothetical network and find the shortest path. As a result, it is shown that this algorithm choose appropriate roundabout path according to the changing road situations.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.155-165
• /
• 2012

This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.

• The Journal of Bigdata
• /
• v.7 no.2
• /
• pp.129-137
• /
• 2022

With the development of the 4th industry, the logistics industry is evolving into a smart logistics system. However, ship work that transports vehicles is progressing slowly due to various problems. In this paper, we propose an stowage automation algorithm that can be used for cargo loading of vehicle carriers that shortens loading and unloading work time. The stowage automation algorithm returns the shortest distance by searching for a loading space and a movable path in the ship in consideration of the structure of the ship. The algorithm identifies walls, ramps and vehicles that have already been shipped, and can work even with randomly placed. In particular, it is expected to contribute to developing a smart logistics system for vehicle carriers by referring to the ship's master plan to search for vehicle loading and unloading space in each port and predict the shortest movable path.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1535-1541
• /
• 2009

In this paper, we suggest an efficient path searching algorithm that reduces the hop count when each node sends a data in ZigBee networks. As the hop count reduces, the network traffic is also reduces and leads to less energy consumption. This enables the sensor network live longer with limited node power. The proposed path searching algorithm consists of two sub-algorithms. One for upstream process and the other for downstream process. When a node selects its proper routing path, the node not only uses the information of the parent and child node, but it also uses the neighbor nodes for each node. In the simulation, we changed various network environment factors such as network parameters, number of nodes, and number of neighbor nodes and observed their performances. We compare the performance to the previous ZigBee Tree routing algorithm with separate two algorithms, the upstream and the downstream, and then compare the performance when all two algorithms are applied.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1483-1492
• /
• 1996

In this paper, related on the postal business with the GIS(Geographics Information System), it discusses design and implementation of the PROS(Postal Route Optimization System) model and its main module, the shortest path generation algorithm, for supporting to postal route managements. It explains examples requirements of postal route system, and suggests the efficient PROS model using our developed shortest path generation algorithm. Because the shortest path algorithm adopts not only consider the Dijkstra algorithm of graph theory, but also the method with the direction property, PROS can be implemented with fast and efficient route search. PROS is mainly constituted of the Shortest Generator, the Isochronal Area Generator, and the Path Rearrangement Generator. It also exploits the GIS engine and the spatial DBMS (Data Base Management System) for processing coordinates in the map and geographical features. PROS can be used in the management of postal delivery business and delivery area and route, and in the rearrangement of route. In the near future, it can be also applied to commercial delivery businesses, guides of routs and traffic informations, and auto navigation system with GPS(Global Positioning System).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.735-748
• /
• 2014

The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1178-1191
• /
• 2014

The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.