Based on the reliability budget and percentile travel time(PTT) concept, a new travel time index named combined mean travel time(CMTT) under stochastic traffic network was proposed. CMTT here was defined as the convex...Based on the reliability budget and percentile travel time(PTT) concept, a new travel time index named combined mean travel time(CMTT) under stochastic traffic network was proposed. CMTT here was defined as the convex combination of the conditional expectations of PTT-below and PTT-excess travel times. The former was designed as a risk-optimistic travel time index, and the latter was a risk-pessimistic one. Hence, CMTT was able to describe various routing risk-attitudes. The central idea of CMTT was comprehensively illustrated and the difference among the existing travel time indices was analyzed. The Wardropian combined mean traffic equilibrium(CMTE) model was formulated as a variational inequality and solved via an alternating direction algorithm nesting extra-gradient projection process. Some mathematical properties of CMTT and CMTE model were rigorously proved. Finally, a numerical example was performed to characterize the CMTE network. It is founded that that risk-pessimism is of more benefit to a modest(or low) congestion and risk network, however, it changes to be risk-optimism for a high congestion and risk network.展开更多
The assumption widely used in the user equilibrium model for stochastic network was that the probability distributions of the travel time were known explicitly by travelers. However, this distribution may be unavailab...The assumption widely used in the user equilibrium model for stochastic network was that the probability distributions of the travel time were known explicitly by travelers. However, this distribution may be unavailable in reality. By relaxing the restrictive assumption, a robust user equilibrium model based on cumulative prospect theory under distribution-free travel time was presented. In the absence of the cumulative distribution function of the travel time, the exact cumulative prospect value(CPV) for each route cannot be obtained. However, the upper and lower bounds on the CPV can be calculated by probability inequalities.Travelers were assumed to choose the routes with the best worst-case CPVs. The proposed model was formulated as a variational inequality problem and solved via a heuristic solution algorithm. A numerical example was also provided to illustrate the application of the proposed model and the efficiency of the solution algorithm.展开更多
As a major mode choice of commuters for daily travel, bus transit plays an important role in many urban and metropolitan areas. This work proposes a mathematical model to optimize bus service by minimizing total cost ...As a major mode choice of commuters for daily travel, bus transit plays an important role in many urban and metropolitan areas. This work proposes a mathematical model to optimize bus service by minimizing total cost and considering a temporally and directionally variable demand. An integrated bus service, consisting of all-stop and stop-skipping services is proposed and optimized subject to directional frequency conservation, capacity and operable fleet size constraints. Since the research problem is a combinatorial optimization problem, a genetic algorithm is developed to search for the optimal result in a large solution space. The model was successfully implemented on a bus transit route in the City of Chengdu, China, and the optimal solution was proved to be better than the original operation in terms of total cost. The sensitivity of model parameters to some key attributes/variables is analyzed and discussed to explore further the potential of accruing additional benefits or avoiding some of the drawbacks of stop-skipping services.展开更多
In recent years,there have been important developments in the joint analysis of the travel behavior based on discrete choice models as well as in the formulation of increasingly flexible closed-form models belonging t...In recent years,there have been important developments in the joint analysis of the travel behavior based on discrete choice models as well as in the formulation of increasingly flexible closed-form models belonging to the generalized extreme value class.The objective of this work is to describe the simultaneous choice of shopping destination and travel-to-shop mode in downtown area by making use of the cross-nested logit(CNL) structure that allows for potential spatial correlation.The analysis uses data collected in the downtown areas of Maryland-Washington,D.C.region for shopping trips,considering household,individual,land use,and travel-related characteristics.The estimation results show that the dissimilarity parameter in the CNL model is 0.37 and significant at the 95% level,indicating that the alternatives have high spatial correlation for the short shopping distance.The results of analysis reveal detailed significant influences on travel behavior of joint choice shopping destination and travel mode.Moreover,a Monte Carlo simulation for a group of scenarios arising from transportation policies and parking fees in downtown area,was undertaken to examine the impact of a change in car travel cost on the shopping destination and travel mode switching.These findings have important implications for transportation demand management and urban planning.展开更多
Consideration of the travel time variation for rescue vehicles is significant in the field of emergency management research.Because of uncertain factors,such as the weather or OD(origin-destination)variations caused b...Consideration of the travel time variation for rescue vehicles is significant in the field of emergency management research.Because of uncertain factors,such as the weather or OD(origin-destination)variations caused by traffic accidents,travel time is a random variable.In emergency situations,it is particularly necessary to determine the optimal reliable route of rescue vehicles from the perspective of uncertainty.This paper first proposes an optimal reliable path finding(ORPF)model for rescue vehicles,which considers the uncertainties of travel time,and link correlations.On this basis,it investigates how to optimize rescue vehicle allocation to minimize rescue time,taking into account travel time reliability under uncertain conditions.Because of the non-additive property of the objective function,this paper adopts a heuristic algorithm based on the K-shortest path algorithm,and inequality techniques to tackle the proposed modified integer programming model.Finally,the numerical experiments are presented to verify the accuracy and effectiveness of the proposed model and algorithm.The results show that ignoring travel time reliability may lead to an over-or under-estimation of the effective travel time of rescue vehicles on a particular path,and thereby an incorrect allocation scheme.展开更多
A model is proposed to describe the passengers’route choice behaviors in urban railway traffic with stochastic link capacity degradation by considering two types of demand,sensitive and insensitive passenger.The inse...A model is proposed to describe the passengers’route choice behaviors in urban railway traffic with stochastic link capacity degradation by considering two types of demand,sensitive and insensitive passenger.The insensitive passengers choose their route without paying much attention to congestion.To the contrary,sensitive passengers who consider route congestion choose travel route based on generalized cost.An equilibrium state is given by variational inequalities in terms of travel generalized cost,which is represented by the combinations of mean and variance of total travel time.The diagonalization algorithm is given to solve this programming.Results show that insensitive passengers have large effects on the path choice than sensitive ones,especially for the larger demand.展开更多
A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a res...A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.展开更多
基金Project(2012CB725403-5)supported by National Basic Research Program of ChinaProject(71131001-2)supported by National Natural Science Foundation of China+1 种基金Projects(2012JBZ005)supported by Fundamental Research Funds for the Central Universities,ChinaProject(201170)supported by the Foundation for National Excellent Doctoral Dissertation of China
文摘Based on the reliability budget and percentile travel time(PTT) concept, a new travel time index named combined mean travel time(CMTT) under stochastic traffic network was proposed. CMTT here was defined as the convex combination of the conditional expectations of PTT-below and PTT-excess travel times. The former was designed as a risk-optimistic travel time index, and the latter was a risk-pessimistic one. Hence, CMTT was able to describe various routing risk-attitudes. The central idea of CMTT was comprehensively illustrated and the difference among the existing travel time indices was analyzed. The Wardropian combined mean traffic equilibrium(CMTE) model was formulated as a variational inequality and solved via an alternating direction algorithm nesting extra-gradient projection process. Some mathematical properties of CMTT and CMTE model were rigorously proved. Finally, a numerical example was performed to characterize the CMTE network. It is founded that that risk-pessimism is of more benefit to a modest(or low) congestion and risk network, however, it changes to be risk-optimism for a high congestion and risk network.
基金Project(2012CB725400)supported by the National Basic Research Program of ChinaProjects(71271023,71322102,7121001)supported by the National Natural Science Foundation of China
文摘The assumption widely used in the user equilibrium model for stochastic network was that the probability distributions of the travel time were known explicitly by travelers. However, this distribution may be unavailable in reality. By relaxing the restrictive assumption, a robust user equilibrium model based on cumulative prospect theory under distribution-free travel time was presented. In the absence of the cumulative distribution function of the travel time, the exact cumulative prospect value(CPV) for each route cannot be obtained. However, the upper and lower bounds on the CPV can be calculated by probability inequalities.Travelers were assumed to choose the routes with the best worst-case CPVs. The proposed model was formulated as a variational inequality problem and solved via a heuristic solution algorithm. A numerical example was also provided to illustrate the application of the proposed model and the efficiency of the solution algorithm.
基金Project(B01B1203)supported by Sichuan Province Key Laboratory of Comprehensive Transportation,ChinaProject(SWJTU09BR141)supported by the Southwest Jiaotong University,China
文摘As a major mode choice of commuters for daily travel, bus transit plays an important role in many urban and metropolitan areas. This work proposes a mathematical model to optimize bus service by minimizing total cost and considering a temporally and directionally variable demand. An integrated bus service, consisting of all-stop and stop-skipping services is proposed and optimized subject to directional frequency conservation, capacity and operable fleet size constraints. Since the research problem is a combinatorial optimization problem, a genetic algorithm is developed to search for the optimal result in a large solution space. The model was successfully implemented on a bus transit route in the City of Chengdu, China, and the optimal solution was proved to be better than the original operation in terms of total cost. The sensitivity of model parameters to some key attributes/variables is analyzed and discussed to explore further the potential of accruing additional benefits or avoiding some of the drawbacks of stop-skipping services.
基金Projects(JCYJ20120615145601342,JCYJ20130325151523015)supported by Shenzhen Science and Technology Development Funding-Fundamental Research Plan,ChinaProject(2013U-6)supported by Key Laboratory of Eco Planning & Green Building,Ministry of Education(Tsinghua University),China
文摘In recent years,there have been important developments in the joint analysis of the travel behavior based on discrete choice models as well as in the formulation of increasingly flexible closed-form models belonging to the generalized extreme value class.The objective of this work is to describe the simultaneous choice of shopping destination and travel-to-shop mode in downtown area by making use of the cross-nested logit(CNL) structure that allows for potential spatial correlation.The analysis uses data collected in the downtown areas of Maryland-Washington,D.C.region for shopping trips,considering household,individual,land use,and travel-related characteristics.The estimation results show that the dissimilarity parameter in the CNL model is 0.37 and significant at the 95% level,indicating that the alternatives have high spatial correlation for the short shopping distance.The results of analysis reveal detailed significant influences on travel behavior of joint choice shopping destination and travel mode.Moreover,a Monte Carlo simulation for a group of scenarios arising from transportation policies and parking fees in downtown area,was undertaken to examine the impact of a change in car travel cost on the shopping destination and travel mode switching.These findings have important implications for transportation demand management and urban planning.
基金Projects(72071202,71671184)supported by the National Natural Science Foundation of ChinaProject(22YJCZH144)supported by Humanities and Social Sciences Youth Foundation,Ministry of Education of China+3 种基金Project(2022M712680)supported by Postdoctoral Research Foundation of ChinaProject(22KJB110027)supported by Natural Science Foundation of Colleges and Universities in Jiangsu Province,ChinaProject(D2019046)supported by Initiation Foundation of Xuzhou Medical University,ChinaProject(2021SJA1079)supported by General Project of Philosophy and Social Science Research in Jiangsu Universities,China。
文摘Consideration of the travel time variation for rescue vehicles is significant in the field of emergency management research.Because of uncertain factors,such as the weather or OD(origin-destination)variations caused by traffic accidents,travel time is a random variable.In emergency situations,it is particularly necessary to determine the optimal reliable route of rescue vehicles from the perspective of uncertainty.This paper first proposes an optimal reliable path finding(ORPF)model for rescue vehicles,which considers the uncertainties of travel time,and link correlations.On this basis,it investigates how to optimize rescue vehicle allocation to minimize rescue time,taking into account travel time reliability under uncertain conditions.Because of the non-additive property of the objective function,this paper adopts a heuristic algorithm based on the K-shortest path algorithm,and inequality techniques to tackle the proposed modified integer programming model.Finally,the numerical experiments are presented to verify the accuracy and effectiveness of the proposed model and algorithm.The results show that ignoring travel time reliability may lead to an over-or under-estimation of the effective travel time of rescue vehicles on a particular path,and thereby an incorrect allocation scheme.
基金Project(71525002) supported by China National Funds for Distinguished Young ScientistsProjects(71271023,71210001) supported by the National Natural Science Foundation of ChinaProject(RCS2015ZZ003) supported by the Research Foundation of State Key Laboratory of Rail Traffic Control and Safety,Beijing Jiaotong University,China
文摘A model is proposed to describe the passengers’route choice behaviors in urban railway traffic with stochastic link capacity degradation by considering two types of demand,sensitive and insensitive passenger.The insensitive passengers choose their route without paying much attention to congestion.To the contrary,sensitive passengers who consider route congestion choose travel route based on generalized cost.An equilibrium state is given by variational inequalities in terms of travel generalized cost,which is represented by the combinations of mean and variance of total travel time.The diagonalization algorithm is given to solve this programming.Results show that insensitive passengers have large effects on the path choice than sensitive ones,especially for the larger demand.
基金supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2012R1A1A4A0105777)supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (NIPA-2013-H030113-4007) supervised by the NIPA (National IT Industry Promotion Agency)
文摘A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.
