• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2006.05a
• /
• pp.95-108
• /
• 2006

Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. Cargoes and stopovers can be changed numerously according to the change of transportation modes, thus being a NP-hard problem. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range and effective cost range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

• 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 Korean Society of Industrial and Systems Engineering
• /
• v.32 no.4
• /
• pp.192-202
• /
• 2009

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2342-2344
• /
• 1998

In this paper, the path planner is presented for a robot to achieve an efficient path forward the given goal position in two dimensional environment which is involved with partially unknown obstacles. The path planner consists of three major components: off-line path planning, on-line path planning, and modification of planned path. Off-line path planning is based on known environment and creates the shortest path. On-line path planning is for finding unknown obstacles. The modification can be accomplished, by genetic algorithm, to be smooth path for preventing slippage and excessive centrifugal force.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.943-946
• /
• 1999

In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm onstructs a bounded-skew tree(BST) in two steps:(ⅰ) a bottom-up phase to construct a binary tree of shortest-distance feasible regions which represent the loci of possible placements of clock entry points, and (ⅱ) a top-down phase to determine the exact locations of clock entry points. Experimental results show that our clock routing algorithm, named BST/DME, can produce a set of solutions with skew and wirelength trade-off.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.33-39
• /
• 2000

In this paper, we present an algorithm for the multicast routing problem when there exit the cell replication limits of ATM switching nodes. This problem can be formulated as a Degree Constrained Minimum Steiner Tree Problem(DCSP). The proposed algorithm is a modification of the shortest path heuristic originally devised for minimum Steiner tree problem. From the experimental results, it can be seen that our algorithm is efficient to obtain a near optimal solution with comparatively low computational time.

• Smart Media Journal
• /
• v.11 no.9
• /
• pp.39-46
• /
• 2022

The WK-recursive network proposed by Vecchia and Sanges[1] is widely used in the design and implementation of local area networks and parallel processing architectures. It provides a high degree of regularity and scalability, which conform well to a design and realization of distributed systems involving a large number of computing elements. In this paper, the routing of a message is investigated on the WK-recursive network, which is key to the performance of this network. We present an efficient shortest path algorithm on the WK-recursive network, which is simpler than Chen and Duh[2] in terms of design complexity.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.49-54
• /
• 2017

Pathfinding for pedestrians provided by various navigation programs is based on a shortest path search algorithm. There is no big difference in their guide results, which makes the path quality more important. Multiple criteria should be included in the search cost to calculate the path quality, which is called a multi-criteria pathfinding. In this paper we propose a user adaptive pathfinding algorithm in which the cost function for a multi-criteria pathfinding is defined as a weighted sum of multiple criteria and the weights are learned automatically by Perceptron learning. Weight learning is implemented in two ways: short-term weight learning that reflects weight changes in real time as the user moves and long-term weight learning that updates the weights by the average value of the entire path after completing the movement. We use the weight update method with momentum for long-term weight learning, so that learning speed is improved and the learned weight can be stabilized. The proposed method is implemented as an app and is applied to various movement situations. The results show that customized pathfinding based on user preference can be obtained.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1312-1318
• /
• 2006

One of the common services of telematics is the car navigation that finds the shortest path from source to target. Until now, some routing algorithms of the car navigation do not consider the real-time traffic information and use the static shortest path algorithm. In this paper, we prosed the method to predict the traffic flow in the future. This prediction combines two methods. The former is an accumulated speed pattern, which means the analysis results for all past speeds of each road by classfying the same day and the same time inteval. The latter is the Kalman filter. We predicted the traffic flows of each segment by combining the two methods. By experiment, we showed our algorithm gave better precise predicition than only using accumulated speed pattern that is used commonly. The result can be applied to the car navigation to support a dynamic shortest path. In addition, it can give users the travel information to avoid the traffic congestion areas.

• Journal of Korean Society for Geospatial Information Science
• /
• v.10 no.1 s.19
• /
• pp.59-66
• /
• 2002

The rapid change of industrial structure causes to increase distribution cost and requires necessity of physical distribution system urgently. Traffic situation is getting extremely worse and traffic jam has led to increasing expense of physical distribution delivery which dominates 20% of distribution cost. In this situation, the shortest and most suitable path search system is required by modern people who must waste a lot of time for moving with a car or on the street as well as many companies. for these reasons, we developed the shortest-path-searching system applying the dijkstra algorithm which is one of the effective shortest path algorithm to GIS, and it was constructed by considering realistic urban traffic and the pattern of street in a physical situation. Also, this system was developed to be updated weight data automatically, considering the dynamic change of traffic situation such as a traffic information service which will be served in real time. Finally, we designed this system to serve on web by using MapObjects IMS.