• Management Science and Financial Engineering
• /
• v.15 no.1
• /
• pp.51-69
• /
• 2009

A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

• Journal of Korean Society for Geospatial Information Science
• /
• v.8 no.1 s.15
• /
• pp.65-72
• /
• 2000

Travel demand forecasting is the important process of transportation policy and planning, especially trip assignment is also important because it finds deficiency of network GIS can be applied to transportation due to its various merits. Recently Program development environment is changed to component-based and transportation-component is necessary. This study evolves in implementing trip assignment model with GIS and tries to apply the system to the Cheongju City.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.599-617
• /
• 2006

A network model and a Genetic Algorithm(GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing the non-linear objective functions with the linear constraints. In the model, the flow-conservation constraints of the network are utilized to restrict the solution space and to force the link flows meet the traffic counts. The objective of the model is to minimize the discrepancies between the link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links and the link flows estimated through the traffic assignment using the path flow estimator in the legit-based SUE. In the proposed GA, a chromosome is defined as a vector representing a set of Origin-Destination Matrix (ODM), link flows and travel-cost coefficient. Each chromosome is evaluated from the corresponding discrepancy, and the population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment is applied during the crossover and mutation.

• IE interfaces
• /
• v.15 no.4
• /
• pp.474-482
• /
• 2002

In this paper, we propose a parametric optimization approach to simultaneously determining trip distribution, mode choice, and user-equilibrium assignment. In our model, mode choice decisions are based on a binomial logit model and passenger and cargo demands are divided into appropriate mode according to the user equilibrium minimum travel time. Underlying network consists of road and rail networks combined and mode choice available is auto, bus, truck, passenger rail, and cargo rail. We provide an equivalent convex optimization problem formulation and efficient algorithm for solving this problem. The proposed algorithm was applied to a large scale network examples derived from the National Intermodal Transportation Plan (2000-2019).

• Journal of Korean Society of Transportation
• /
• v.7 no.2
• /
• pp.45-52
• /
• 1989

The network equilibrium theory is to estimate the travel choices on a transportation network when the resulting travel times and costs are one basis for the choices. Increasing use of this principle on travel assignment problem lead to develop the combined choice models including not only travel options such as mode and route, but location options like trip distribution problems. This paper, first, reviews earlier developments of variable demand network equilibrium models, combined modeles of trip distribution and assignment, and entropy constrained combined models. Then various model structures of combining travel choice models based on network equilibrium theory and entropy constraints are discussed.

• Journal of Korean Society of Transportation
• /
• v.34 no.6
• /
• pp.570-579
• /
• 2016

This study proposes a concept of Stepwise Transfer Coefficient(STC) which implies greater transfer cost with increasing the number of transfers. Thus, the public transport information system provides the choice sets of travel routes by the consideration of not only transportation time but also the optimum number of transfers. However, path choice problems that involve STC are found to include non additive cost, which requires additional route enumeration works. Discussions on route enumeration in actual transportation networks is very complicated, thereby warranting a theoretical examination of route search considering STC. From these points of view, this study results in a probability based transit trip assignment model including STC. This research also uses incoming link based entire route deletion method. The entire route deletion method proposed herein simplifies construction of an aggregation of possible routes by theoretically supporting the process of enumeration of the different routes from origin to destination. Conclusively, the STC reflected route based logit model is proposed as a public transportation transit trip assignment model.

• Journal of Korean Society of Transportation
• /
• v.24 no.4 s.90
• /
• pp.149-159
• /
• 2006

Traditional trip tables are estimated through large-scale surveys such as household survey, roadside interviews, and license Plate matching. These methods are, however, expensive and time consuming. This paper presents two origin-destination (OD) trip matrix estimation methods from link traffic counts in stochastic assignment, which contains perceived errors of drivers for alternatives. The methods are formulated based on the relation between link flows and OD demands in logit formula. The first method can be expressed to minimize the difference between observed link flows and estimated flows, derived from traffic assignment and be solved by gradient method. The second method can be formulated based on dynamic process, which nay describe the daily movement patterns of drivers and be solved by a recursive equation. A numerical example is used for assessing the methods, and shows the performances and properties of the models.

• Proceedings of the KOR-KST Conference
• /
• 2007.05a
• /
• pp.527-535
• /
• 2007

• Journal of Korean Society of Transportation
• /
• v.23 no.3 s.81
• /
• pp.35-47
• /
• 2005

This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

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