• 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.

• IE interfaces
• /
• v.22 no.4
• /
• pp.359-367
• /
• 2009

The vehicle travel time between the demand points in downtown area is greatly influenced by complex road condition and traffic situation that change real time to various external environments. Most of research in the vehicle routing problems compose vehicle routes only considering travel distance and average vehicle speed between the demand points, however did not consider dynamic external environments such as traffic situation by service time zones. A realistic vehicle routing problem which considers traffic situation of smooth, delaying, and stagnating by three service time zones such as going to work, afternoon, and going home was suggested in this study. A mathematical programming model was suggested and it gives an optimal solution when using ILOG CPLEX. A hybrid genetic algorithm was also suggested to chooses a vehicle route considering traffic situation to minimize the total travel time. By comparing the result considering the traffic situation, the suggested algorithm gives better solution than existing algorithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.1
• /
• pp.61-83
• /
• 2009

This study developed a variable demand traffic assignment model by stable dynamics. Stable dynamics, suggested by Nesterov and do Palma[19], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with the user equilibrium model, which is based on the arc travel time function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on congestion. It is therefore expected to be a useful analysis tool for transportation planners. In this study, we generalize the stable dynamics into the model with variable demands. We suggest a three stage optimization model. In the first stage, we introduce critical travel times and dummy links and determine variable demands and link flows by applying an optimization problem to an extended network with the dummy links. Then we determine link travel times and path flows in the following stages. We present a numerical example of the application of the model to a given network.

• International Journal of Highway Engineering
• /
• v.17 no.3
• /
• pp.97-105
• /
• 2015

PURPOSES : The Toll Collection System (TCS) operated by the Korea Expressway Corporation provides accurate traffic counts between tollgates within the expressway network under the closed-type toll collection system. However, although origin-destination (OD) matrices for a travel demand model can be constructed using these traffic counts, these matrices cannot be directly applied because it is technically difficult to determine appropriate passenger car equivalent (PCE) values for the vehicle types used in TCS. Therefore, this study was initiated to systematically determine the appropriate PCE values of TCS vehicle types for the travel demand model. METHODS : To search for the appropriate PCE values of TCS vehicle types, a traffic demand model based on TCS-based OD matrices and the expressway network was developed. Using the traffic demand model and a genetic algorithm, the appropriate PCE values were optimized through an approach that minimizes errors between actual link counts and estimated link volumes. RESULTS : As a result of the optimization, the optimal PCE values of TCS vehicle types 1 and 5 were determined to be 1 and 3.7, respectively. Those of TCS vehicle types 2 through 4 are found in the manual for the preliminary feasibility study. CONCLUSIONS : Based on the given vehicle delay functions and network properties (i.e., speeds and capacities), the travel demand model with the optimized PCE values produced a MAPE value of 37.7%, RMSE value of 17124.14, and correlation coefficient of 0.9506. Conclusively, the optimized PCE values were revealed to produce estimates of expressway link volumes sufficiently close to actual link counts.

• International Journal of Highway Engineering
• /
• v.15 no.3
• /
• pp.177-189
• /
• 2013

PURPOSES: This study aims to suggest a proper left-turn treatment method for the bicycle traffic flow at four-legged intersections. METHODS: Four types of crossing methods are proposed and analyzed : (1) indirect left turn, (2) direct left turn, (3) direct left turn on a Bike Box, and (4) direct left turn on bike left turn lane. The VISSIM simulation tests were conducted based on forty-eight operation scenarios prepared by varying vehicle and bicycle traffic volumes. RESULTS : The results from the four-legged signalized intersections suggest that (1) the indirect left turn is appropriate when vehicle demand is high, (2) the direct left turn is efficient on most traffic situation but the safety is a concern, (3) the direct left turn on a Bike Box is appropriate when bicycle demand is high while vehicle demand is not, and (4) the direct left turn on a bike left turn lane is appropriate when both vehicle and bicycle demand are low. CONCLUSIONS : The direct left turn of bicycle provides more efficiency than the indirect left turn at the four-legged intersections but to apply the methods and to study more, advanced evaluation methods, related law, and insurance programs are needed.

• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.117-134
• /
• 2004

Truck traffic accounts for a substantial fraction of the traffic stream in many regions and is often the source of localized traffic congestion, potential parking and safety problems. Truck trips tend to be ignored or treated superficially in travel demand models. It reduces the effectiveness and accuracy of travel demand forecasting and may result in misguided transportation policy and project decisions. This paper presents the development of speed-flow relationships with truck impacts based on CORSIM simulation results in order to enhance travel demand model by incorporating truck trips. The traditional BPR(Bureau of Public Road) function representing the speed-flow relationships for roadway facilities is modified to specifically include the impacts of truck traffics. A number of new speed-flow functions have been developed based on CORSIM simulation results for freeways and urban arterials.

• International Journal of High-Rise Buildings
• /
• v.3 no.2
• /
• pp.155-165
• /
• 2014

This study measured and compared the variation of ventilation rate and fan energy consumption according to various control strategies after installing wireless sensor-based pilot ventilation system in order to verify the applicability of demand-controlled ventilation (DCV) strategy that was efficient ventilation control strategy for underground parking lot. The underground parking lot pilot ventilation system controlled the ventilation rate by directly or indirectly tracking the traffic load in real-time after sensing data, using vehicle detection sensors and carbon monoxide (CO) and carbon dioxide ($CO_2$) sensor. The ventilation system has operated for 9 hours per a day. It responded real-time data every 10 minutes, providing ventilation rate in conformance with the input traffic load or contaminant level at that time. A ventilation rate of pilot ventilation system can be controlled at 8 levels. The reason is that a ventilation unit consists of 8 high-speed nozzle jet fans. This study proposed vehicle detection sensor based demand-controlled ventilation (VDS-DCV) strategy that would accurately trace direct traffic load and CO sensor based demand-controlled ventilation (CO-DCV) strategy that would indirectly estimate traffic load through the concentration of contaminants. In order to apply DCV strategy based on real-time traffic load, the minimum required ventilation rate per a single vehicle was applied. It was derived through the design ventilation rate and total parking capacity in the underground parking lot. This is because current ventilation standard established per unit floor area or unit volume of the space made it difficult to apply DCV strategy according to the real-time variation of traffic load. According to the results in this study, two DCV strategies in the underground parking lot are considered to be a good alternative approach that satisfies both energy saving and healthy indoor environment in comparison with the conventional control strategies.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.99-108
• /
• 2007

This paper presents an elastic demand stochastic user equilibrium traffic assignment that could not be easily tackled. The elastic demand coupled with a travel performance function is known to converge to a supply-demand equilibrium, where a stochastic user equilibrium (SUE) is obtained. SUE is the state in which all equivalent path costs are equal, and thus no user can reduce his perceived travel cost. The elastic demand SUE traffic assignment can be formulated based on a dynamic system, which is a means of describing how one state develops into another state over the course of time. Traditionally it has been used for control engineering, but it is also useful for transportation problems in that it can describe time-variant traffic movements. Through the Lyapunov Function Theorem, the author proves that the model has a stable solution and confirms it with a numerical example.

• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.89-92
• /
• 1996

It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in B-ISDN. We consider a hierarchical two level network architecture for VOD service. The first level consists of connected Local Video Servers(LVSs) in which a limited number of high vision programs are stored. The second level has one Central Video Server(CVS) containing all the programs served in the network. The purpose of this paper is to analyze the network traffic and to propose the storage policy for LVSs. For this purpose, we present an analysis of program storage amount in each LVS, transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.