Cost scaling based successive approximation algorithm for the traffic assignment problem

This paper presents a cost scaling based successive approximation algorithm, called ε-BA (ε-optimal bush algorithm), to solve the user equilibrium traffic assignment problem by successively refining ε-optimal flows. As ε reduces to zero, the user equilibrium solution is reached. The proposed method is a variant of bush-based algorithms, and also a variant of the min-mean cycle algorithm to solve the min-cost flow by successive approximation. In ε-BA, the restricted master problem, implying traffic equilibration restricted on a bush, is solved to ε-optimality by cost scaling before bush reconstruction. We show that ε-BA can reduce the number of flow operations substantially in contrast to Dial’s Algorithm B, as the former operates flows on a set of deliberately selected cycles whose mean values are sufficiently small. Further, the bushes can be constructed effectively even if the restricted master problem is not solved to a high level of convergence, by leveraging the ε-optimality condition. As a result, the algorithm can solve a highly precise solution with faster convergence on large-scale networks compared to our implementation of Dial’s Algorithm B.     

Robust traffic assignment model: Formulation,solution algorithms and empirical application

ABSTRACT

The deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes.

The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models.     

“船舶—堆场—列车”混堆堆场箱位分配模型

集装箱海铁联运港口堆场作业箱型复杂,为了提高港口作业能力和效率,基于进口、出口箱的混合堆存方式,对"船舶-堆场-列车"作业堆场箱位分配问题进行研究."船舶-堆场-列车"作业堆场负责堆存通过船舶、列车及外集卡进出港口的集装箱.本文在待分配箱的作业时间及箱区已知的前提下,以集装箱堆存产生的压箱数最小为目标,建立"船舶-堆场-列车"作业混堆堆场箱位分配模型,根据模型特点设计了启发式算法进行求解,并进行算例分析.结果表明,所建模型和求解算法能够有效减少堆场的压箱数,满足箱型堆存要求,提高港口作业效率.     

两种大型集装箱船绑扎桥结构强度的对比计算浅析

以大型集装箱船常见的剪力墙式绑扎桥和A型斜撑式绑扎桥为研究对象,基于通用大型有限元分析软件PATRAN/NASTRAN及CCS规范的相关要求,对两种绑扎桥的结构强度进行了对比计算分析。结果表明：两种型式的绑扎桥在结构强度方面相差不大,相比而言,剪力墙式绑扎桥略优于A型斜撑式。     

2500TEU内贸集装箱船船型开发设计

针对内贸箱船货运近海航行,重箱化及散货集装箱化的需求,对2500TEU级内贸箱船船型的开发思路与各方面的特点作了介绍。该船型具有低航速、大载重吨、高装箱率、快捷牢靠堆装系统的特点,目前已成功升级了第二代2500TEU船型。     

自动化集装箱码头总体布置

我国作为世界第一大集装箱生产、运输国,至今尚未有一座自动化集装箱码头投产运营,开展自动化码头总体布置研究是自动化集装箱码头建设的关键。结合国内外自动化集装箱码头应用发展状况,总结自动化集装箱码头几种常见的布置形式和特点,针对某工程建设设想,制定全自动化码头总体布置技术方案,提出相关意见和建议,可供类似工程参考。     

集装箱船装运危险货物的适用规则解读

分析了船上危险货物的种类及防爆要求。通过解读规范要求,整理出集装箱船可运输的危险品种类及特殊要求。根据运输危险货物的要求,归纳总结集装箱船设计中应该注意的供水、通风、人员保护和机器处所限界面隔热等问题,并提出设计运输危险货物的集装箱船时应遵循的主要原则。     

基于规则评价的武器目标分配方法

遗传算法、蚁群算法、粒子群优化算法等解决武器目标分配问题的典型方法尚不能满足工程应用的要求,为了提高舰艇对反舰导弹防御过程中的武器目标分配问题的工程化水平,采用系统分析的方法,提出一组适应舰艇火力通道组织的火力分配规则,设计了基于规则评价的武器目标分配方法,建立了评价函数及求解过程,并分析了算法的复杂度,该方法可以使目标分配结果与规则的符合度直观明确,更符合指挥员的自然决策思维过程,具有很好的工程实用价值。     

3600TEU集装箱船建造方案设计

集装箱船特点是线型变化大、精度要求高,相对于其他常规船型,建造难度较大.针对造船领域集装箱船建造方案策划所需考虑的多种因素,进行研究探讨,以3600 TEU集装箱船为例,介绍集装箱船建造方案策划的各项举措,保障项目成功实施.