首页> 外文期刊>Journal of ambient intelligence and humanized computing >The urban transport planning with uncertainty in demand and travel time: a comparison of two defuzzification methods
【24h】

The urban transport planning with uncertainty in demand and travel time: a comparison of two defuzzification methods

机译:需求和旅行时间不确定的城市交通规划:两种去模糊方法的比较

获取原文
获取原文并翻译 | 示例
           

摘要

Nowadays the traffic congestion is being a common problem in major cities, every time the travel time is increasing and also the number of private cars. It is urgent to take actions to solve this problem. The urban transport is becoming into the best way to fight against congestion; but to make it more attractive to users it has to be more efficient (less travel time, less waiting time, low fare). The urban transport process has four main activities: Network design, Timetabling, Vehicle scheduling and Crew scheduling. The problem presented here is about the integration of the frequency and departure time scheduled both are subactivities of the timetable construction, besides it includes multiple periods planning and multiperiod synchronization, also the authors consider uncertainty in demand and travel time using fuzzy numbers. The planners faced this problem everyday. The authors created a mathematical model including the characteristics previously mentioned, the objectives of this model are to minimize the total operation cost, to maximize the number of multiperiod synchronization between routes, and to minimize the total waiting time for passengers. The SAugmecon method is used to solve the problem, 32 instances were randomly generated based on real data, and the comparison of two defuzzification methods (k-preference and second index of Yager) is presented. Also, the comparison of the problem with uncertainty on demand and uncertainty on demand and travel time is presented.
机译:如今,交通拥堵已成为主要城市的普遍问题,每次出行时间增加,私家车数量也增加。迫切需要采取行动解决这个问题。城市交通正在成为对抗拥堵的最佳方式。但要使其对用户更具吸引力,就必须提高效率(减少旅行时间,减少等待时间,降低票价)。城市交通过程主要有四个活动:网络设计,时间表,车辆调度和机组调度。这里提出的问题是关于计划的发车频率和出发时间的整合,它们都是时间表构建的子活动,除了包括多时间段计划和多周期同步外,作者还考虑了需求和旅行时间的不确定性。规划者每天都面对这个问题。作者创建了一个包含前面提到的特征的数学模型,该模型的目标是最小化总运营成本,最大化路线之间的多周期同步数量以及最小化乘客的总等待时间。 SAugmecon方法用于解决该问题,根据实际数据随机生成了32个实例,并比较了两种解模糊方法(k-preference和Yager的第二个索引)。此外,还对需求不确定性与需求不确定性和旅行时间的问题进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号