• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.27-28
• /
• 2010

Finding shortest path technique running time differs depending on applying of the algorithm and data, and also used a lot of difference in effectiveness depending on the environment occurs. Therefore, the algorithm and environment based on this study, the relationship between optimal solutions and compare running time.

• IE interfaces
• /
• v.21 no.1
• /
• pp.1-7
• /
• 2008

In this paper we study the Minimum Edge Addition Problem(MEAP) to decrease the diameter of a graph. MEAP can be used for improving the serviceability of telecommunication networks with a minimum investment. MEAP is an NP-hard optimization problem. We present two mathematical programming models : One is a multi-commodity flow formulation and the other is a path partition formulation. We propose a branch-and-price algorithm to solve the path partition formulation to the optimality. We develop a polynomial time column generation sub-routine conserving the mathematical structure of a sub problem for the path partition formulation. Computational experiments show that the path partition formulation is better than the multi-commodity flow formulation. The branch-and-price algorithm can find the optimal solutions for the immediate size graphs within reasonable time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.939-955
• /
• 2010

With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.2
• /
• pp.91-98
• /
• 1990

This paper studies a heuristic method for the Maximum Origin-Destination Flow Path (MODFP) in an acyclic transportation network. We construct a mathematical formulation for finding the MODFP. Then by applying Benders' partitioning method, we generate two subproblems which should be solved in turn so that they may give an optimal solution. We solve one subproblem by an optimal seeking algorithm and the other by a hueristic method. so that, we finally obtain a good solution. The computational complexity of calculating the optimal solution of the first subproblem is 0(mn) and that of calculating the heuristic solution of the other subproblem is $0(n^2).$ From the computational experiments, we estimated the performance of the heuristic method as being 99.3% and the computing time relative to optimal algorithm as being 28.76%.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.534-544
• /
• 2009

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.

• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.3
• /
• pp.27-32
• /
• 2007

3D based information is demanded increasingly as cities grow three dimensionally and buildings become large and complex. The use of 3D GIS is also getting attention as fundamental data for ubiquitous computing applications such as location-based guidance, path finding and emergency escaping. However, most 3D modeling techniques are focused on the visualization of buildings or terrains and do not have topological structures required in spatial analyses. In this paper, we introduce a method to incorporate topological relationship into 3D models by combining 2D GIS layers and 3D model. We divide indoor spaces of a 3D model into discrete objects and then define the relationship with corresponding features in 2D GIS layers through database records. We also show how to construct hallways network in the 2D-3D integrated building model. Finally, we test different cases of route finding situations inside a building such as normal origin-destination path finding and emergency evacuation.

• Journal of the Korean Society for Railway
• /
• v.18 no.2
• /
• pp.149-156
• /
• 2015

It is necessary to determine real path for urban railway users in order to allocate revenues between urban railway organizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label has been utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on the travel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics of users, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimal route based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.12
• /
• pp.1232-1239
• /
• 2009

This paper proposes an exploration strategy to efficiently find a specific place in large unknown environments with wall-following based path planning. Many exploration methods proposed so far showed good performance but they focused only on efficient planning for modeling unknown environments. Therefore, to successfully accomplish the room finding task, two additional requirements should be considered. First, suitable path-planning is needed to recognize the room number. Most conventional exploration schemes used the gradient method to extract the optimal path. In these schemes, the paths are extracted in the middle of the free space which is usually far from the wall. If the robot follows such a path, it is not likely to recognize the room number written on the wall because room numbers are usually too small to be recognized by camera image from a distance. Second, the behavior which re-explores the explored area is needed. Even though the robot completes exploration, it is possible that some rooms are not registered in the constructed map for some reasons such as poor recognition performance, occlusion by a human and so on. With this scheme, the robot does not have to visit and model the whole environment. This proposed method is very simple but it guarantees that the robot can find a specific room in most cases. The proposed exploration strategy was verified by various experiments.

• Journal of Ocean Engineering and Technology
• /
• v.28 no.6
• /
• pp.560-565
• /
• 2014

In this study, the problem of trajectory optimization for underwater gliders considering depth constraints is discussed. Typically, underwater gliders are controlled to dive and climb in a saw-tooth pattern at constant gliding angles. This approach is effective and close to optimal for deep water applications. However, the optimal path deviates from the saw-tooth path in shallow water conditions. This study focuses on finding more efficient gliding paths that can minimize the traverse time in the horizontal plane when the water depth is limited. The trajectory optimization problem is formulated into a minimum time control problem with inequality path constraints and hydrodynamic drag effects. A numerical approach based on the pseudo-spectral method is adopted as a solution approach, and the simulation results are presented.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.10
• /
• pp.2606-2615
• /
• 1994

Sorting time is one of the most important issues for auto IC test handling systems. In actual system, because of too much path, reducing the computing time for finding a sorting path is the key way to enhancing the system performance. The exhaustive path search technique can not be used for real systems. This paper proposes heuristic sorting algorithm to find the minimal sorting time. The suggested algorithm is basically based on the best-first search technique and multi-level search technique. The results are close to the optimal solutions and computing time is greately reduced also. Therefore the proposed algorthm can be effectively used for real-time sorting process in auto IC test handling systems.