• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.1
• /
• pp.17-25
• /
• 1990

Most of the least cost transportation network design problems are frequently formulated as the minimum spanning arborescence problems in directed networks with bitype are costs. These costs are classified whether the arc is included in the path from the root to a specified node over a given spanning arborescence. We prove that this problem is NP-hard, and develop a polynomial time algorithm for acyclic networks. The probelm in acyclic networks is initially formulated as 0-1 integer programming. Next, we prove that the 0-1 relaxed linear programming has an integral optimum solution by complementary slackness conditions. In this paper, we present an $O(n^2)$ algorithm based on a shortest path algorithm.

• Journal of Korean Society of Transportation
• /
• v.1 no.1
• /
• pp.28-42
• /
• 1983

In recent years, significant advances have been made enabling travel demand analysis and network design methods to be used as increasingly realistic evaluation tools. What has been lacking is the integration of travel demand analysis with network design models. This paper reviews some of advanced (integrated) modeling approaches and presents future research directions of integrated modeling system. To design urban transportation networks, it is argued that the travelers' free choice of mode, destination and route should be introduced into transportation network design procedure instead of assuming that trips from a zone to a workplace are fixed or deriving them in a normative procedure to achieve hypothetical system optima.

• Journal of Korean Society of Transportation
• /
• v.28 no.4
• /
• pp.129-139
• /
• 2010

This study proposes a model for measuring the connectivity of nodes in road networks. The connectivity index between two nodes is characterized by the number of routes, degree of circuitousness, design speed, and route capacity between the nodes. The connectivity index of a node is then defined as the weighted average of the connectivity indexes between the node and other nodes under consideration. The weighting factor between two nodes is determined by the travel demand and distance between them. The application of the model to a toy network shows that it reasonably well quantifies the level of connectivity of nodes in the network. If flow of rail networks can be measured in the same scale as that of road networks and the capacity of rail links can be estimated, the model proposed in this paper could be applied to intermodal transportation networks as well.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.9
• /
• pp.559-569
• /
• 2016

This study examined flow between regions based on the spatial structure of the territory and characterized the flow patterns by analyzing regional networks via transportation connectivity. To accomplish this, transportation connectivity of the entire nation was examined using 2010 national express bus OD data from the Korea Transport Database. After the initial analysis, 2010 car OD data describing networks in seven regions (125 cities and districts), Gangwon-do, Gyeongsangnam-do, Gyeongsangbuk-do, Jeollanam-do, Jeollabuk-do, Chungcheong-do and Seoul, were analyzed to identify transportation connectivity. The results revealed that Korea has strong triangular-belt-shaped transportation connectivity that connects among metropolitan areas in the Jeolla and Gyeongsang areas. Particular zones are set by regional characteristics and functional connectivity for each zone. The results of this study will be useful as a basic material to establish development strategies and customized regional policy development, as well as balanced development.

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

A network design model has been proposed. which represents a transportation facility investment decision problem. The model takes the discrete hi-level programming form in which two types of decision makers, government and travelers, are involved. The model is characterized by its ability to address the total social costs occurring in transportation networks and to estimate the equilibrium link volumes in multi-modal networks. Travel time and volume for each link in the multi-modal network are predicted by a joint modal split/traffic assignment model. An efficient solution algorithm has been developed and an illustrative example has been presented.

• Journal of Korean Society of Transportation
• /
• v.20 no.7
• /
• pp.69-76
• /
• 2002

In conducting studies related to the national base networks, it is very important to construct a simulation network. This research provides an algorithm to construct the simulation network from the digital transportation map which is constructed based on the National Geographic Information System(NGIS). The algorithm consists of three functions(extraction of networks from transportation digital map, transform of the derived network into one suitable to transportation simulation model, and inspection of errors in the network). The direct derivation of a simulation network from GIS enables to enhance the reliability of an analysis related to a transportation facility investment as well as to reduce cost and time. In this research, Emme/2 which is generally accepted transportation planning fields is adapted for the target system. However, this algorithm will be extended to other simulation models such as Satong-Paldal which is the only transportation simulation model developed in Korea, and Tranplan in the near future.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.86-102
• /
• 1991

The purpose of this paper is to present a branch and bound algorithm for the hierarchical transportation network design problem in 2-level directed networks. This problem is to find the least cost of hierarchical transportation networks which consist of a primary path and a secondary path. The primary path is a simple path from a prespecified orgin node to a prespecified terminal node. All nodes must be either a transsipment node on the primary path or connected to that path via secondary arcs. This problem is formulated to a 0-1 inter programming problem with assignment and illegal subtour elimination equations as constaints. We show that the subproblem relaxing subtour elimination constraints is transformed to a linear programming problem by means of the totally unimodularity. Optimal solutions of this subproblem are polynoially obtained by the assignment algorithm and complementary slackness conditions. Therefore, the optimal value of this subproblme is used as a lower bound. When an optimal solution of the subproblem has an illegal subtour, a better disjoint rule is adopted as the branching strategy for reducing the number of branched problems. The computational comparison between the least bound rule and the depth first rule for the search strategy is given.

• Structural Engineering and Mechanics
• /
• v.13 no.2
• /
• pp.187-209
• /
• 2002

The infrastructure system in the United States has been aging faster than the resource available to restore them. Therefore decision for allocating the resources is based in part on the condition of the structural system. This paper proposes to use neural network to predict the overall rating of the structural system because of the successful applications of neural network to other fields which require a "symptom-diagnostic" type relationship. The goal of this paper is to illustrate the potential of using neural network in civil engineering applications and, particularly, in bridge evaluations. Data collected by the Tennessee Department of Transportation were used as "test bed" for the study. Multi-layer feed forward networks were developed using the Levenberg-Marquardt training algorithm. All the neural networks consisted of at least one hidden layer of neurons. Hyperbolic tangent transfer functions were used in the first hidden layer and log-sigmoid transfer functions were used in the subsequent hidden and output layers. The best performing neural network consisted of three hidden layers. This network contained three neurons in the first hidden layer, two neurons in the second hidden layer and one neuron in the third hidden layer. The neural network performed well based on a target error of 10%. The results of this study indicate that the potential for using neural networks for the evaluation of infrastructure systems is very good.

• Journal of Navigation and Port Research
• /
• v.42 no.2
• /
• pp.117-126
• /
• 2018

Container port is one of the most vital link of the transportation chain that plays an important role in trading with other countries. Having a proper understanding of port operations could change the role of the port from a transportation node to an efficient point in a transportation chain. Development of transportation chains, logistics and progress of these networks have enhanced the sustainable condition and level of transportation. Therefore, evaluating the competitiveness of ports is obligatory for port users to make a decision in investment or exploitation. This paper introduces the use of Fuzzy C-means and TOPSIS for competitiveness comparison among a sample of container terminals in Korea and China and determine how to improve Korean port competitiveness and particularly in Busan port.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.901-908
• /
• 2010

There are many kinds of networks in vehicle for their purposes. In-vehicle networks, however, are not unified to single network. The networks are composed of several local networks because of communication speed, cost and efficiency. Because the complexity of network design for communication increases, local networks need a framework for interworking between heterogeneous networks. In this paper, a framework interworking between in-vehicle networks for ITS(Intelligent Transportation System) is proposed and implemented. The proposed framework consists of a compatible protocol, message conversion module, message transceiver module and message analysis module. The results obtained by implementation show that the framework efficiently supports the communication of information between heterogeneous in-vehicle networks.