• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.19-35
• /
• 2007

This study is for detecting the Braess Paradox by stable dynamics in general transportation networks. Stable dynamics, suggested by Nesterov and de Palma[18], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model based on link latency function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. The phenomenon that increasing capacity of a network, for example creating new links, may decrease its performance is called Braess Paradox. It has been studied intensively under user equilibrium model with link latency function since Braess[5] demonstrated a paradoxical example. However it is an open problem to detect the Braess Paradox under stable dynamics. In this study, we suggest a method to detect the Paradox in general networks under stable dynamics. In our model, we decide whether Braess Paradox will occur in a given network. We also find Braess links or Braess crosses if a network permits the paradox. We also show an example how to apply it in a network.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.201-209
• /
• 2005

Empty moves are necessary when there are imbalances among transportation demands from source locations to destination locations and the transportation demands require empty equipment that must be supplied to source locations. When the amount of the inflow exceeds that of the outflow or the amount of the outflow exceeds that of the inflow, repositioning empty equipment is necessary. Examples of the empty equipment are containers, chassis, and pallets. This paper addresses how to estimate the empty moves on several typical transportation networks. Types of transportation networks considered are chain, tree, cycle, tree of cycles, and hybrid networks. Simple procedures are suggested for determining the optimal empty flows. Numerical examples are provided to illustrate procedures in this paper.

• Journal of Korean Society of Transportation
• /
• v.18 no.4
• /
• pp.95-105
• /
• 2000

The Purpose of this study is to present a new Trip Generation Model using Backpropagation Neural Networks. For this purpose, it is compared the performance between existing linear/nonlinear Regression models and a new TriP Generation model using Neural Networks. The study was performed according to the below. First, it is analyzed the limits of conventional Regression models, next Proved the superiority of Neural Networks model in theoretical and empirical aspects, and lastly Presented a new approach of Trip Generation methodology. The results show that Backpropagation Neural Networks model is predominant in estimation and Prediction comparable to Regression analysis. Such results mean the possibility of Neural Networks\` application in Trip Generation modeling. Specially under the circumstances of the chancing transportation situations and unstable transportation on vironments, its application in transportation fields will be extended.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.3
• /
• pp.63-80
• /
• 2007

This study is a generalization of 'stable dynamics' recently suggested by Nesterov and de Palma[29]. Stable dynamics is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model that is common in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. An equilibrium in stable dynamics needs only maximum flow in each arc and Wardrop[33] Principle. In this study, we generalize the stable dynamics into the model with multiple traffic classes. We classify the traffic into the types of vehicle such as cars, buses and trucks. Driving behaviors classified by age, sex and income-level can also be classes. We develop an equilibrium with multiple traffic classes. We can find the equilibrium by solving the well-known network problem, multicommodity minimum cost network flow problem.

• Journal of Korean Society of Transportation
• /
• v.26 no.3
• /
• pp.233-243
• /
• 2008

Recognition for the importance and roles of public transportation is increasing because of traffic problems in many cities. In spite of this paradigm change, previous researches related with public transportation trip assignment have limits in some aspects. Especially, in case of multimodal public transportation networks, many characters should be considered such as transfers. operational time schedules, waiting time and travel cost. After metropolitan integrated transfer discount system was carried out, transfer trips are increasing among traffic modes and this takes the variation of users' route choices. Moreover, the advent of high-technology public transportation card called smart card, public transportation users' travel information can be recorded automatically and this gives many researchers new analytical methodology for multimodal public transportation networks. In this paper, it is suggested that the methodology for establishment of brand new multimodal public transportation networks based on computer programming methods using transportation card data. First, we propose the building method of integrated transportation networks based on bus and urban railroad stations in order to make full use of travel information from transportation card data. Second, it is offered how to connect the broken transfer links by computer-based programming techniques. This is very helpful to solve the transfer problems that existing transportation networks have. Lastly, we give the methodology for users' paths finding and network establishment among multi-modes in multimodal public transportation networks. By using proposed methodology in this research, it becomes easy to build multimodal public transportation networks with existing bus and urban railroad station coordinates. Also, without extra works including transfer links connection, it is possible to make large-scaled multimodal public transportation networks. In the end, this study can contribute to solve users' paths finding problem among multi-modes which is regarded as an unsolved issue in existing transportation networks.

• Journal of Korean Society of Transportation
• /
• v.5 no.1
• /
• pp.47-58
• /
• 1987

A commodity distribution problem with intertemporal storage facilities and dynamic transportation networks is proposed. mathematical integer programming methods and multiobjective programming techniques are used in the model formulation. Dynamic characteristics of commodity distribution problems are taken into account in the model formulation. storage facility location problems and transportation link addition problems are incorporated into the intertemporal multicommodity distribution problem. The model is capable of generating the most efficient and rational commodity distribution system. Therefore it can be utilized to provided the most effective investment plan for the transportation infrastructure development as well as to evaluate the existing commodity distribution system. The model determines simultaneously the most efficient locations, sizes, and activity levels of storage facilities as well as new highway links. It is extended to multiobjective planning situations for the purpose of generating alternative investment plans in accordance to planning situations. sine the investment in transportation network improvement yields w\several external benefits for a regional economy, the induced benefit maximization objective is incorporated into the cost minimization objective. The multiobjective model generates explicitly the trade-off between cost savings and induced benefits of the investment in transportation network improvement.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.2
• /
• pp.140-149
• /
• 2001

The paper discusses the problem of finding the Origin-Destination(O-D) shortest paths in internodal transportation networks with time-schedule constraints. The shortest path problem on the internodal transportation network is concerned with finding a path with minimum distance, time, or cost from an origin to a destination using all possible transportation modalities. The time-schedule constraint requires that the departure time to travel from a transfer station to another node takes place only at one of pre-specified departure times. The scheduled departure times at the transfer station are the times when the passengers are allowed to leave the station to another node using the relative transportation modality. Therefore, the total time of a path in an internodal transportation network subject to time-schedule constraints includes traveling time and transfer waiting time. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. The effectiveness of the GA approach is evaluated using several test problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.52
• /
• pp.117-139
• /
• 1999

This paper is concerned about the hybrid tandem configuration as the design of the automated guided vehicle system(AGVs). The hybrid tandem configuration is that the manufacturing system is divided into several non-overlapping zones, workstations of each zone are linked by network configuration including loop. That is, the manufacturing system is divided into several non-overlapping small size networks, and at most two automated guided vehicles can be available in each network. The transit point is located at proper point between adjacent networks. The parts are transported to workstations in other network through the transit points. One of the objective functions in dividing into the hybrid tandem configuration is to minimize the maximum travel time of the divided networks, and other is to minimize the total travel distance of parts moved to workstations in other networks for the next processing. The model formulation is presented, and a numerical example is shown. Also, the performances of system for the hybrid tandem, tandem and network configuration are compared through the simulation. The results of this research will contribute to the development of material handling systems in the manufacturing system. Also, it will be applied in determining the transportation area of transportation vehicles and the number and size of the transportation fleet in the transportation problem of logistics management.

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.129-141
• /
• 2009

Intermodal freight transportation is defined as the movement of freight from origins to destinations by two or more transportation modes. When implemented in hub networks, it could enhance the efficiency of the networks because consolidated flows are transported by more suitable modes and technologies. In spite of this advantage, the intermodal hub network design problem has received limited attention in the literature partly because of the complex nature of the problem. This paper aims to develop an optimization model for designing intermodal hub networks with sin91e allocation strategy. The model takes into account various cost components of intermodal hub networks including transportation, stationary inventory, and service delay costs. Moreover, using transport frequency variables, it is capable of endogenously determining the transportation economies of scale achieved by consolidation of flows. As such, the model is able to realistically represent the characteristics of intermodal hub networks in practice. Since the model Is a complicated nonlinear integer programming problem, we perform model simplification based on the analytical study of the model, which could facilitate the development of solution algorithms in the future. We expect that this study contributes to the design of intermodal hub networks as well as to the assessment of existing logistics systems.