检索结果-南通市图书馆

A topology-based bounded rationality day-to-day traffic assignment model

在线全文

学校读者我要写书评

暂无评论

Communications in Transportation Research 2022年第1期2卷 298-313页

作者： Enrico Siri Silvia Siri Simona Sacone Department of Informatics BioengineeringRobotics and Systems EngineeringUniversity of GenovaGenova16145Italy

This paper analyzes the day-to-day adjustment process of users’behaviors in a transport network which is affected by relevant alterations such as disruptions due to critical events which cause the impossibility to use one or more *** representing the progressive adjustment of the flows on the network to reach a new equilibrium,a dayto-day discrete-time model is proposed,based on the idea that people are bounded rational in their choices,*** often do not behave according to the optimal solution but they accept solutions they consider ***,in their choice process,are influenced by the topological similarity between the route they are currently using and *** means that they tend to prefer the solutions that are more similar to the one they are already *** parallel,users exhibit a myopic behavior,i.e.,they tend to overestimate the goodness of a route if,when using it,they suddenly experience a significant reduction in travel time compared to what they are used *** the paper it is shown that such route choice behaviour implies that the steady state of the system corresponds to a Bounded Rational User Equilibrium,i.e.,a state that does not diverge from the user equilibrium more than a certain value which increases when the relative importance given to the topological similarity *** model also assumes that these biases vanish,at least with respect to those routes that are most frequently used by users,after a sufficient amount of *** certain conditions,it is then shown that the steady state can eventually collapse into a User *** effectiveness of the proposed model is assessed via simulation results in which two test networks are analyzed in detail to show the evolution of the users’behaviour in a transport network after a disruption.

关键词： traffic assignment Day-to-day traffic assignment Bounded rationality

Trasfugen:traffic assignment of urban network by an approximation fuzzy genetic algorithm

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

International Journal of Modeling, Simulation, and Scientific Computing 2018年第4期9卷 209-229页

作者： Mahdi Kherad Hamed Vahdat-Nejad Morteza Araghi Department of Computer Engineering University of Birjand Avini Blvd Birjand 97175Iran Department of Civil Engineering University of Birjand Birjand 97175Iran

This paper proposes the Trasfugen method for traffic assignment aimed at solving the user equilibrium *** this end,the method makes use of a genetic algorithm.A fuzzy system is proposed for controlling the mutation and crossover rates of the genetic algorithm,and the corrective strategy is exploited for handling the equilibrium problem *** the model,an approximation algorithm is proposed for obtaining the paths between the origin–destination pairs in the demand *** the traditional deterministic algorithm that has exponential time complexity,this approximation algorithm has polynomial time complexity and is executed much ***,the Trasfugen method is applied to the urban network of Tehran metropolitan and the efficiency is *** comparing the results obtained from the proposed model with those obtained from the conventional traffic assignment method,namely,the Frank–Wolfe method;it is shown that the proposed algorithm,while acting worse during the initial iterations,achieves better results in the subsequent ***,it prevents the occurrence of local optimal points as well as early/premature convergence,thus producing better results than the Frank–Wolfe algorithm.

关键词： traffic assignment equilibrium problem soft computing Tehran network.

traffic assignment Forecast Model Research in ITS

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Geo-Spatial Information Science 2007年第3期10卷 213-217页

作者： WANG Wei WANG Quan WANG Chao State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University 129 Luoyu Road Wuhan430079 China. 不详

As an important role in the development of ITS, traffic assignment forecast is always the research focus. Based on the analysis of classic traffic assignment forecast models, an improved traffic assignment forecast model, multi-ways probability and capacity constraint (MPCC) is presented. Using the new traffic as- signment forecast model to forecast the traffic volume will improve the rationality and veracity of traffic as- signment forecast.

关键词： intelligent transport system traffic forecast multi-ways probability assignment traffic assignment

Simulation model based on Monte Carlo method for traffic assignment in local area road network

在线全文

学校读者我要写书评

暂无评论

Frontiers of Structural and Civil Engineering 2009年第2期3卷 195-203页

作者： Yuchuan DU Yuanjing GENG Lijun SUN Key Lab.of Road and traffic Engineering of the Ministry of Education Tongji UniversityShanghai 201804China

For a local area road network,the available traffic data of traveling are the flow volumes in the key intersections,not the complete OD *** the circumstance characteristic and the data availability of a local area road network,a new model for traffic assignment based on Monte Carlo simulation of intersection turning movement is provided in this *** good stability in temporal sequence,turning ratio is adopted as the important parameter of this *** formulation for local area road network assignment problems is proposed on the assumption of random turning *** traffic assignment model based on the Monte Carlo method has been used in traffic analysis for an actual urban road *** results comparing surveying traffic flow data and determining flow data by the previous model verify the applicability and validity of the proposed methodology.

关键词： traffic assignment local area road network turning ratio Monte Carlo method

traffic assignment MODEL AND ALGORITHM BASED ON INTERVAL-VALUED IMPEDANCE

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

TRAFFIC ASSIGNMENT MODEL AND ALGORITHM BASED ON INTERVAL-VAL...

Air Route Network Generation Based on traffic assignment

第一届交通运输工程国际学术会议

作者： XIE Binglei1, AN Shi2 , and ZHAO Zebin3 1Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen, China, 518055 2School of Science and Engineering on Communication, Harbin Institute of Technology, Harbin, China, 150001 3School of Management, Harbin Institute of Technology, Harbin, China, 150001

In the process of commute decision-making, owing to uncertainty, imprecision and subjectivity of human recognition, road impedances are often described as interval values. On the supposition of interval-valued road impedances, traffic assignment problem is analyzed. First, possibility theory was introduced to construct a new user equilibrium condition. In view of uncertainty of information, complexity of human recognition and preference of travelers, the new user equilibrium is the development and generalization of the classified Wardrop’s first principle. Subsequently, an index to reflect travelers’ attitude is introduced, and variable inequality model is provided. A modified diagonalized algorithm is applied to obtain equilibrium traffic flow.

关键词： traffic assignment user equilibrium interval value variable inequality

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Transactions of Nanjing University of Aeronautics and Astronautics 2020年第2期37卷 223-231页

作者： WANG Shijin LIN Jingjing HAN Yunxuan College of Civil Aviation Nanjing University of Aeronautics and AstronauticsNanjing 211106P.R.China

Air route network is the carrier of air traffic flow,and traffic assignment is a method to verify the rationality of air route network ***,air route network generation based on traffic assignment has been becoming the research focus of airspace programming *** on link prediction technology and optimization theory,a bi-level programming model is established in the *** model includes an upper level of air route network generation model and a lower level of traffic assignment *** air route network structure generation incorporates network topology generation algorithm based on link prediction technology and optimal path search algorithm based on preference,and the traffic assignment adopts NSGA-Ⅲ*** on the Python platform NetworkX complex network analysis library,a network of 57 airports,383 nodes,and 635 segments within China Airspace Beijing and Shanghai Flight Information Regions and 187975 sorties of traffic are used to simulate the bilevel *** with the existing air route network,the proposed air route network can decrease the cost by 50.624%,lower the flight conflict coefficient by 33.564%,and reduce dynamic non-linear coefficient by 7.830%.

关键词： air route network link prediction traffic assignment bi-level programming NSGA-Ⅲ algorithm

Direct computing methods for turn flows in traffic assignment

在线全文

学校读者我要写书评

暂无评论

Journal of Southeast University(English Edition) 2005年第2期21卷 225-228页

作者：任刚王炜东南大学交通学院南京210096

Two methods based on a slight modification of the regular traffic assignmentalgorithms are proposed to directly compute turn flows instead of estimating them from link flows orobtaining them by expanding the networks. The first one is designed on the path-turn incidencerelationship, and it is similar to the computational procedure of link flows. It applies to thetraffic assignment algorithms that can provide detailed path structures. The second utilizes thelink-turn incidence relationship and the conservation of flow on links, a law deriving from thisrelationship. It is actually an improved version of Dial's logit assignment algorithm. The proposedapproaches can avoid the shortcomings both of the estimation methods, e. g. Furness's model andFrator's model, and of the network-expanding method in precision, stability and computation ***, they are validated by numerical examples.

关键词： turn flow traffic assignment Dial's algorithm directly computing method

Lazy loading algorithm for traffic assignment of road networks under fixed charge condition

在线全文

学校读者我要写书评

暂无评论

Journal of Southeast University(English Edition) 2011年第2期27卷 185-187页

作者：赵金宝邓卫东南大学交通学院南京210096

The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users＇ choices of trip paths, are analyzed. Travelers usually decide their trip paths based on their personal habits, preferences and the information at hand. By considering both deterministic and stochastic factors which affect the value of time （VOT） during the process of path choosing, a variational inequality model is proposed to describe the problem of traffic assignment. A lazy loading algorithm for traffic assignment is designed to solve the proposed model, and the calculation steps are given. Numerical experiment results show that compared with the all-or-nothing assignment, the proposed model and the algorithm can provide more optimal traffic assignments for road networks. The results of this study can be used to optimize traffic planning and management.

关键词： traffic assignment road networks fixed charge lazy loading algorithm

A Trip-Chain Based User Equilibrium traffic assignment Model with Flexible Activities Scheduling Order

在线全文

学校读者我要写书评

暂无评论

Journal of traffic and Transportation Engineering 2016年第1期4卷 1-10页

作者： Chung-Yung Wang Hsiang-Wu Chen Department of Logistics Management Management College of National Defense University Taipei 11258 Taiwan R.O.C. Department of Transportation and Logistics Management National Chiao Tung University Hsinchu 30010 Taiwan R.O.C.

This study developed a user equilibrium traffic assignment model based on trip-chains with flexible activity scheduling order and derived the corresponding optimality conditions. We based on the gradient projection method to develop a solution algorithm, the accuracy of which was verified using the test network of UTown. This model could be used to estimate the transportation demands with and without activities scheduling restriction between OD （origin-destination） pairs based on trip-chains, as well as based on trips. Thus, the proposed model is more generalization than conventional trip based or trip-chain based traffic assignment models.

关键词： traffic assignment trip-chain flexible activity scheduling order gradient projection method.