• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2010

It is recently issued scalability, mobility and external internet connection on Wire-less sensor network. The low power wireless sensor networks based on IPv6 technology 6LoWPAN technology is being standardized in the IETF. This paper for the 6LoWPAN environment based on the routing protocol LOAD, route cost applied the packet re-transmission rate which follows in Link Qualities price which uses at course expense and packet transmission Minimum route Cost routing protocol where does on the course wherethe smallest packet re-transmission becomes accomplished proposed. The technique which proposes compared and LOAD and AODV that about 13%, about 16% energy consumption is few respectively averagely, Energy of the entire network equally, used and energy effectiveness and improvement of network life time experiment led and confirmed.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.9-22
• /
• 2005

Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.6
• /
• pp.1845-1850
• /
• 2014

Railway operators have given a lot of efforts to determine the railway route of the minimum cost. In order to determine the optimal alignment, the alignment should be allocated satisfying the design criteria on various geographical condition with the minimum earth works. The determination of the optimal railway alignment is a kind of combination optimization because that must consider various design elements. This study developed a numerical model to determine the optimal railway alignment with the minimum construction cost. The problem was analyzed by the genetic algorithm, and the concept of the optimal alignment was established with the results from the analyses. The methodology was applied to a fictitious rail construction section and the result was evaluated. This methodology is meaningful considering the fact that the cost for energy is greater than that of the construction.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2018.05a
• /
• pp.318-320
• /
• 2018

When a ship sails on sea, it may be influenced by the environmental disturbance such as wind, wave, sea surface temperature, etc. These affect on the ship's speed, fuel consumption, safety and operating performance. It is necessary to find the optimal weather route of a ship to avoid adverse weather conditions which can put the crews in serious danger or cause structural damage to the vessel, machinery, and equipment. This study introduced how to apply A* algorithm based on sea trial test data for determining the optimal ship routes. The path cost function was modelled as a function of minimum arrival time or minimum energy depending on the time of various environment conditions. The specially modelled path-cost function and the safety constraints were applied to the A* algorithm in order to find the optimal path of the ship. The comparison of ship performances estimated by real sea trial's path and estimated optimal route during the voyage of the ship was investigated. The result of this study can be used to create a schedule to ensure safe operation of the ship with short passage time or minimum energy. In addition, the result of this study can be integrated into an on-board decision supporting expert system and displayed in Electronic Chart Display and Information System (ECDIS) to provide all the useful information to ship master.

• Journal of Korean Society of Transportation
• /
• v.24 no.3 s.89
• /
• pp.143-153
• /
• 2006

This paper annually estimates the economies of density, scale and scope with the data of cost and output of 27 leading air carriers to suggest the political findings and strategies of raising the cost efficiency of our air transport industry. The estimation results and their implications are as follows. First, KAL and Aha would reduce their cost if they could increase international route density. Second, KAL and AAR would reduce their cost if they could expand the network but save their cost more effectively if they could increase international route density rather than expand the network. Third, the minimum efficient scale that minimize average cost of two national flag carriers which operate by the present output ratio among domestic passenger, international passenger and freight appears to be larger than each present output level of KAL and AAR. Meanwhile, it appears that minimum efficient scale of small size low cost carriers which operate domestic-oriented route is much smaller than minimum efficient scale of national flag carriers. Finally, it appears that there exists the diseconomies of scope between domestic passenger and the other outputs, that is, international passenger and freight and therefore save their cost if freight output ratio is higher and domestic passenger output ratio is lower than the Present level.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.36-40
• /
• 2002

Routing algorithm uses metric to choose the route of Least cost to destination network, the best suited routing investigates all routes to the shortest destination among networks and is decided on the route given the minimum metric. This paper analyzed packet flow for setting up the best fitted path on the same network using RIP and EIGRP as the distance vector algorithm and measured the Link-efficiency.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.11
• /
• pp.5885-5889
• /
• 2013

In general, the network survivability means that The user do not know the network faults and the recovery of those. For this, we use the dual(multi) routes between each two nodes. It is important that the each dual routes have efficient costs(or minimum). Even if one route is the minimum cost in case of no fault, another route of dual may be very large cost in case of fault case. Therefore we need the dual routes of each two nodes having the efficient(or minimum) costs. In this paper we find the network design method for the dual routes of each two node having the efficient costs. Although the design method is very simple and heuristic and it may be not useful for some networks, we will use it in various network environment.. Because this design method can be used very easy. A sample design will proof this usefulness.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.3
• /
• pp.289-295
• /
• 2008

The shared-route decision algorithms in multicasting communications networks to provide the internet-based services such as IPTV, remote education/health, and internet broadcasting are presented. The three main measures of maximum delay, average delay and estimated delay between each node and member are adopted. Under the Mesh network with the uniform random cost between each node, the algorithm's performance is compared to the optimal solution with the minimum cost by all enumeration. The simulation results show that the algorithm using the estimated delay outperforms the other two methods.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.2
• /
• pp.65-71
• /
• 2018

In order to make the underwater vehicle carry out the mission in a submarine environment, it is needed to plan a safe and efficient route to a given destination and prevent the autonomous submersible from colliding with obstacles while moving along the planned route. The function of collision avoidance makes the travel distance of the autonomous submersible longer. Moreover, it should move slowly near to obstacles against their moving disturbance. As a result, this invokes the degradation of the navigation efficiency in the process of collision avoidance. The side effect of the collision avoidance is not ignorable in the case of high congested environments such as the coast with many obstacles. In this paper, we suggest a path planning method which provides the route with minimum travel time considering collision avoidance in congested environment. For the purpose, we define environmental congestion map related to geometric information and obstacles. And we propose a method to consider the moving cost in the RRT scheme that provides the existing minimum distance path. We verified that the efficiency of our algorithm with simulation experiments.