• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.139-149
• /
• 2004

As the expansion of road capacity has become impractical in many urban areas, congestion pricing has been widely considered as an effective method to reduce urban traffic congestion in recent years. The principal reason is that the congestion pricing may lead the user equilibrium (UE) flow pattern to system optimum (SO) pattern in road network. In the context of network equilibrium, the link tolls according to the marginal cost pricing principle can user an UE flow to a SO pattern. Thus, the pricing method offers an efficient tool for moving toward system optimal traffic conditions on the network. This paper proposes a continuous network design program (CNDP) in network equilibrium condition, in order to find optimal congestion toll for maximizing net economic benefit (NEB). The model could be formulated as a bi-level program with continuous variable(congestion toll) such that the upper level problem is for maximizing the NEB in elastic demand, while the lower level is for describing route choice of road users. The bi-level CNDP is intrinsically nonlinear, non-convex, and hence it might be difficult to solve. So, we suggest a heuristic solution algorithm, which adopt derivative information of link flow with respect to design parameter, or congestion toll. Two example networks are used for test of the model proposed in the paper.

• Journal of Korean Society of Transportation
• /
• v.15 no.2
• /
• pp.51-66
• /
• 1997

실시간 변화하는 교통상황을 파악하고 교통혼잡을 완화시키려는 각종 교통정책들을 개발하고 평가하기 위하여 동적 통행배정모형에 대한 연구가 지속되고 있으며 상당한 성과 를 이루고 있다. 그러나 이론적인 어려움과 계산량과 과다로 기존의 모형들은 대부분 단순 가로망을 대상으로 적용되어 왔으며 대규모 가로망에 적용하는 데는 상당한 어려움을 겪고 있다. 본 연구의 목적은 실제 가로망에 쉽게 적용할 수 있는 휴리스틱 동적 통행배정모형을 개발하고 이를 해석할 수 있는 알고리즘을 개발하는 데 있다. 개발되는 모형은 변동부등식 (variational inequality)으로 구축되며 알고리즘은 휴리스틱 알고리즘(heuristic disagonalized algorithm)을 개발한다. 예제 가로망을 대상으로 개발된 모형을 평가하며 도출된 해가 Wrdrop의 균형해(equilibrium)임을 보인다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.12 no.1
• /
• pp.10-18
• /
• 1987

This paper discusses algorithmic properties of a class of complementarity programs involving strictly diagonally isotone and off-diagonally isotone functions, i. e., functions whose Jacobian matrices have positive diagonal elements and nonnegative off-diagonal elements, A typical traffic equilibrium under elastic demands is cast into this class. Algorithmic properties of these complementarity problems, when a Jacobi-type iteration is applied, are investigated. It is shown that with a properly chosen starting point the generated sequence are decomposed into two converging monotonic subsequences. This and related will be useful in developing solution procedures for this class of complementarity problems.

• Journal of Information Technology Services
• /
• v.12 no.3
• /
• pp.111-126
• /
• 2013

As the gaps become narrower in interconnection fee and volume rate, the MNOs began to introduce flat pricing for unlimited voice traffic competitively in Korea wireless telecommunication market : 'unlimited talks within intra-network' by the 1st operator, followed by the 3rd operator's 'unlimited talks over all networks'. As a result, subscribers tip in toward the third ranked operator and could bring a substantial change to steadfast market structure over the last decade in Korea. This paper aims to develop a simple economic model to analyze competition with flat pricing for unlimited voice traffic, and to check whether the pricing can be appropriate for the MNOs. The results show that MNOs already step in the necessary conditions to launch flat pricing for voice traffic. It also predicts that the MNOs compete with unlimited talk over all networks and set a single fee in an equilibrium. At present, the MNOs run virtually identical pricing for unlimited talk over all networks, considering their differentiation with respect to service quality, coverage and brand preference.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.5
• /
• pp.2057-2067
• /
• 2013

Traffic demand forecasting for pavement management in the present can be estimated using the past trends or subjective judgement of experts instead of objective methods. Also future road plans and local development plans of a target region, for example new road constructions and detour plans cannot be considered for the estimate of future traffic demands. This study, which is the fundamental research for developing objective and accurate decision-making support system of maintenance management for the national highway, proposed the methodology to predict future traffic demands according to 4-step traffic forecasting method using EMME in order to examine significance of future traffic demands affecting pavement deterioration trends and compare existing traffic demand forecasting methods. For the case study, this study conducted the comparison of traffic demand forecasting methods targeting Daejeon Regional Construction and Management Administration. Therefore, this study figured out that the differences of traffic demands and the level of agent costs as well as user costs between existing traffic demand forecasting methods and proposed traffic demand forecasting method with considering future road plans and local development plan.

• Journal of Korean Society of Transportation
• /
• v.20 no.1
• /
• pp.77-90
• /
• 2002

Network expansion has been an inevitable method for most traffic equilibrium assignments to consider intersection movements such as intersection delays. The drawback of network expansion is that because it dramatically increases network sizes to emulate possible directional movements as corresponding links, not only is complexities for building network amplified, but computational performance is shrunk. This paper Proposes a new variational inequality formulation for a user-optimal traffic equilibrium assignment model to explicitly consider directional delays without building expanded network structures. In the formulation, directional delay functions are directly embedded into the objective function, thus any modification of networks is not required. By applying a vine-based shortest Path algorithm into the diagonalization algorithm to solve the problem, it is additionally demonstrated that various loop-related movements such as U-Turn, P-Turn, etc., which are frequently witnessed near urban intersections, can also be imitated by blocking some turning movements of intersections. The proposed formulation expects to augment computational performance through reduction of network-building complexities.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.3-8
• /
• 2013

In this paper, we present an energy-efficient base station operation with base station sharing in wireless cellular networks. Firstly, cost functions are modeled related with the amount of energy usage and traffic load. We use game theory and formulate an energy bill game, where the players are the service operators which are operating base stations and their strategies are the bill of their base station energy consumption and hand-over traffic load to the others service operators. We show that the global optimal performance in terms of minimizing the energy costs is achieved at the Nash equilibrium of the formulated energy bill game. Simulation results confirm that the proposed approach can reduce the energy bill of the service operator, and show the relationship between the energy cost saving and various parameters.

• Journal of Korean Society of Transportation
• /
• v.18 no.2
• /
• pp.91-101
• /
• 2000

The optimal congestion charge in transportation economics corresponds to the solution to the welfare maximization Problem for users of a certain road link where congestion takes Place. This congestion charge is in nature the optimal Price of the transportation facility, which is derived by the Partial equilibrium analysis on that facility. Therefore it is not certain that this congestion charge can maximize the well-being of all the users of the total transportation network, since the analysis does not count the impact of the congestion charge on traffic volumes of other links. This study suggests an alternative approach to estimate the optimal congestion charge. The key difference of this study from Previous ones is to derive the solution through the general equilibrium analysis on a market where several transportation facilities as well as Private goods are available to consumers. This approach shows a set of solutions a little different from the Previous one, which are explained below. The optimal congestion charge is derived for two different cases. One is the situation of which the congestion charge is levied on every transportation facility In this case, the optimal solution of each facility should equate the marginal utility of every user to the marginal cost of the corresponding facility. This analysis result in general equilibrium coincides with the Previous analysis result in partial equilibrium. However this result cannot apply to another case of which the charge is imposed only on a certain transportation facility. In this case, the optimal charge on a certain transportation facility should be less than the optimal congestion charge of partial equilibrium analysis.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.3
• /
• pp.162-169
• /
• 2018

Net neutrality, which has not been a problem, has recently become a problem for ISPs (Internet Service Providers), and their complaints have been paid by domestic platform companies, but overseas global IT companies such as Google and YouTube, generate huge revenues from domestic markets. In this situation, domestic IT companies claim that it is natural to impose more expensive charges or restrict speed on users who generate huge traffic. On the other side, however, the telecommunication network has become an essential public good that is essential to our everyday life, and because it has been given a monopoly position by a private company to efficiently respond to the explosive demand for telecommunication services, It is necessary to provide equal and universal service and fulfill public duty. In this paper, we deal with the network neutrality problem, focusing on the price elasticity between the CP (Contents Provider) and the ISP, rather than the user who is one side of the two-sided market for the already saturated satellites communication market. We present a game model that determines the optimal price for each platform by Nash equilibrium and analyze how the net neutrality affects CP according to the change of exogenous variables through the proposed game model.