• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation >An assignment model with modified Logit, which obviates enumeration and overlapping problems
【24h】

An assignment model with modified Logit, which obviates enumeration and overlapping problems

机译：修改Logit的分配模型，避免了枚举和重叠问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

One of the main components of stochastic assignment models is the route choice model solved with implicit or explicit path enumeration algorithms. Such models are used both for congested networks within equilibrium or dynamic models and for non-congested networks within static or pseudo-dynamic network loading models. This paper proposes a C-Logit model specification within a Dial algorithm structure for the implicit assignment of network flows. The model and its solution algorithm, called D-C-Logit, combine several positive features found in the literature for choice set generation and choices from a given choice set: 1. generation of a set of alternatives with a selective approach; 2. calculation of the path choice probability in a closed form; 3. simulation of the overlapping effect among alternative paths; 4. computation of just one tree for each origin avoiding explicit path enumeration. This paper has two main objectives: the proposition of a Dial-like algorithm to solve a C-Logit assignment model and application of the algorithm to different networks in order to demonstrate certain properties.
机译：随机分配模型的主要组成部分之一是使用隐式或显式路径枚举算法求解的路由选择模型。这样的模型既用于均衡或动态模型内的拥塞网络，又用于静态或伪动态网络负载模型内的非拥塞网络。本文在Dial算法结构内提出了一种C-Logit模型规范，用于网络流的隐式分配。该模型及其求解算法称为D-C-Logit，结合了文献中发现的一些积极特征，用于选择集的生成和给定选择集的选择：1.用选择性方法生成一组替代项； 2.以封闭形式计算路径选择概率； 3.模拟替代路径之间的重叠效应； 4.为每个原点只计算一棵树，避免显式的路径枚举。本文有两个主要目标：提出一种类似Dial的算法来解决C-Logit分配模型；以及将该算法应用于不同的网络以证明某些特性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号