• Journal of the Korea Safety Management & Science
• /
• v.13 no.1
• /
• pp.127-131
• /
• 2011

Even if there are no causing factors such as car crash and road works, traffic congestion come from traffic growth on the road. In this case, estimation of traffic flow helps find the solution of traffic congestion problem. In this paper, we present a optimization model which used on traffic equilibrium problem and studied the problem of inverting shortest path sets for complex traffic system. And we also develop pivotal decomposition algorithm for reliability function of complex traffic system. Several examples are illustrated.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.254-266
• /
• 2010

This study dealt with Traffic Problem to Cheonan city. This study ran parallel literature investigation and actual proof investigation. Questionnaires 394 enforce frequency analysis in SPSS 15.0 versions. Traffic Problem to Cheonan city include the discomfort of public transportation, parking problem, pollution of automobile, traffic accident. By improvement of traffic problem, first, improvement plan of transportation system by administration of logical traffic demand should be readied. Second, because Cheonan city is many an university student who is use target of public transportation, public transportation utilization ratio must raise through discount application. Third, solution of traffic jam need to the improvement and strengthening of system of public transit. Fourth, Cheonan city must push ahead with supplies of traffic facility, modify of transportation network, and improvement of operating system. In particular, Cheonan city need to modify old road and improvement of accessibility though road network briefly. Fifth, Cheonan city need fixing of van traffic culture such as solution of parking problem and traffic order consciousness fostering of users.

• ETRI Journal
• /
• v.5 no.2
• /
• pp.17-28
• /
• 1983

This paper deals with the problem of optimally controlling traffic flows in urban transportation traffic networks. For this, a nonlinear discrete-time model of urban traffic network is first suggested in order to handle the phenomenon of traffic flows such as oversaturatedness and/or undersaturatedness. Then an optimal control problem is formulated and a hierarchical optimization technique is applied, which is based upon a prediction-type two-level method of Hirvonen and Hakkala.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.1
• /
• pp.33-44
• /
• 2001

In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.33-40
• /
• 2015

The time slot assignment problem (TSAP) or Satellite Communications scheduling problem (SCSP) for a satellite performs $n{\times}n$ ground station data traffic switching has been known NP-hard problem. This paper suggests $O(n^2)$ time complexity algorithm for TSAP of a satellite that performs $n^2{\times}n^2$ ground station data traffic switching. This problem is more difficult than $n{\times}n$ TSAP as NP-hard problem. Firstly, we compute the average traffic for n-transponder's basic coverage zone and applies ground station exchange method that swap the ground stations until all of the transponders have a average value as possible. Nextly, we transform the D matrix to $D_{LB}$ traffic matrix that sum of rows and columns all of transponders have LB. Finally, we select the maximum traffic of row and column in $D_{LB}$, then decide the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for experimental data.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.15-25
• /
• 2000

In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

• 한국방재학회:학술대회논문집
• /
• 2007.02a
• /
• pp.468-474
• /
• 2007

Korea's road traffic has been the important role of social and economic development, and it'll be a much more important in the future. But we require a far more efficient road traffic system to solve the problem of vehicle increases. So this paper is analyzed and researched both road traffic systems and road traffic safety, and hypothesized a solution to the problem by using small town's road traffic system demands as a good example. The road traffic system should harmonize around the structure of the town, and be related to the safety, By analyzing road traffic system, we can understand how importantly the traffic system is related with safety, efficiency and overall benefits for our community.

• Journal of information and communication convergence engineering
• /
• v.11 no.1
• /
• pp.30-44
• /
• 2013

Traffic congestion has become a serious problem with the recent exponential increase in the number of vehicles. In urban areas, almost all traffic congestion occurs at intersections. One of the ways to solve this problem is road expansion, but it is difficult to realize in urban areas because of the high cost and long construction period. In such cases, traffic signal control is a reasonable method for reducing traffic jams. In an actual situation, the traffic flow changes randomly and its randomness makes the control of traffic signals difficult. A prediction of traffic jams is, therefore, necessary and effective for reducing traffic jams. In addition, an autonomous distributed (stand-alone) point control of each traffic light individually is better than the wide and/or line control of traffic lights from the perspective of real-time control. This paper describes a stochastic optimum control of crossroads and multi-way traffic signals. First, a stochastic model of traffic flows and traffic jams is constructed by using a Bayesian network. Secondly, the probabilistic distributions of the traffic flows are estimated by using a cellular automaton, and then the probabilistic distributions of traffic jams are predicted. Thirdly, optimum traffic signals of crossroads and multi-way intersection are searched by using a modified particle swarm optimization algorithm to realize real-time traffic control. Finally, simulations are carried out to confirm the effectiveness of the real-time stochastic optimum control of traffic signals.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.306-310
• /
• 2004

In this paper, we consider the Ring Loading Problem with integer demand splitting (RLP). The problem is given with a ring network, in which a required traffic requirement between each selected node pair must be routed on it. Each traffic requirement can be routed in both directions on the ring network while splitting each traffic requirement in two directions only by integer is allowed. The problem is to find an optimal routing of each traffic requirement which minimizes the capacity requirement. Here, the capacity requirement is defined as the maximum of traffic loads imposed on each link on the network. We formulate the problem as an integer program. By characterizing every extreme point solution to the LP relaxation of the formulation, we show that the optimal objective value of the LP relaxation is equal to p or p+0.5, where p is a nonnegative integer. We also show that the difference between the optimal objective value of RLP and that of the LP relaxation is at most 1. Therefore, we can verify that the optimal objective value of RLP is p+1 if that of the LP relaxation is p+0.5. On the other hand, we present a strengthened LP with size polynomially bounded by the input size, which provides enough information to determine if the optimal objective value of RLP is p or p+1.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.238-242
• /
• 2005

This paper considers a routing problem on a RPR(Resilient Packet Ring). The RPR is one of the ring-type data telecommunication network. Our major problem is to find an optimal routing algorithm for a given data traffic on the network under no splitting the traffic service, where the maximum load of a link is minimized. This paper characterizes the Minmax problem and develops two heuristic algorithms. By using the numerical comparison, we show that our heuristic algorithm is valuable for efficient routing the data traffic on a RPR.