期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Traffic assignment problem under tradable credit scheme in a bi-modal stochastic transportation network: A cumulative prospect theory approach 被引量:2
1
作者 HAN Fei ZHAO Xiang-mo CHENG Lin 《Journal of Central South University》 SCIE EI CAS CSCD 2020年第1期180-197,共18页
The traffic equilibrium assignment problem under tradable credit scheme(TCS) in a bi-modal stochastic transportation network is investigated in this paper. To describe traveler’s risk-taking behaviors under uncertain... The traffic equilibrium assignment problem under tradable credit scheme(TCS) in a bi-modal stochastic transportation network is investigated in this paper. To describe traveler’s risk-taking behaviors under uncertainty, the cumulative prospect theory(CPT) is adopted. Travelers are assumed to choose the paths with the minimum perceived generalized path costs, consisting of time prospect value(PV) and monetary cost. At equilibrium with a given TCS, the endogenous reference points and credit price remain constant, and are consistent with the equilibrium flow pattern and the corresponding travel time distributions of road sub-network. To describe such an equilibrium state, the CPT-based stochastic user equilibrium(SUE) conditions can be formulated under TCS. An equivalent variational inequality(VI) model embedding a parameterized fixed point(FP) model is then established, with its properties analyzed theoretically. A heuristic solution algorithm is developed to solve the model, which contains two-layer iterations. The outer iteration is a bisection-based contraction method to find the equilibrium credit price, and the inner iteration is essentially the method of successive averages(MSA) to determine the corresponding CPT-based SUE network flow pattern. Numerical experiments are provided to validate the model and algorithm. 展开更多
关键词 tradable credit scheme cumulative prospect theory endogenous reference points generalized path costs stochastic user equilibrium variational inequality model heuristic solution algorithm
下载PDF
Benefit analysis of curb parking and study on its optimization model
2
作者 裴玉龙 杨中良 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2003年第3期311-314,共4页
Curb parking lot is a major part of city parking facility with lots of problems, especially in CCA (citycenter area and it has a lot of advantages and has much effect on dynamic traffic as well. It is therefore necess... Curb parking lot is a major part of city parking facility with lots of problems, especially in CCA (citycenter area and it has a lot of advantages and has much effect on dynamic traffic as well. It is therefore necessaryto control the scale of curb parking. Basing the whole benefits of the traffic system and considering the minimumsynthetical cost on curb parking, a optimization model is brought forward of cur. b parking planning in CCAbased on minimum generalized cost. Based on this model, the scale of curb parking can be defined reasonablyto make the whole benefits of traffic system optimum in CCA. 展开更多
关键词 curb parking benefit analysis generalized cost scale of parking
下载PDF
Inverse Generalized Minimum Cost Flow Problem Under the Hamming Distances
3
作者 Mobarakeh Karimi Massoud Aman Ardeshir Dolati 《Journal of the Operations Research Society of China》 EI CSCD 2019年第2期355-364,共10页
Given a generalized minimum cost flow problem,the corresponding inverse problem is to find a minimal adjustment of the cost function so that the given generalized flow becomes optimal to the problem.In this paper,we c... Given a generalized minimum cost flow problem,the corresponding inverse problem is to find a minimal adjustment of the cost function so that the given generalized flow becomes optimal to the problem.In this paper,we consider both types of the weighted Hamming distances for measuring the adjustment.In the sum-type case,it is shown that the inverse problem is APX-hard.In the bottleneck-type case,we present a polynomial time algorithm. 展开更多
关键词 Generalized minimum cost flow Inverse problem Hamming distance Binary search
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部