柔性桩与土相互作用非线性分析的增量传递矩阵法

对桩侧土采用非线性荷载传递函数,对桩端土采用线性荷载传递函数,同时考虑桩周土所分担的荷载对单桩荷载传递规律的影响,利用增量荷载传递矩阵法及微分方程的近似解法--子域法,推出了刚性承台下柔性桩与地基非线性相互作用的近似解析算式。为了验证该方法的可行性,通过试验将试验结果与有限元结果及该方法所得结果进行了对比,对比表明:该理论解与现场实测值、有限元计算值都非常接近。     

Modeling duration choice in space–time multi-state supernetworks for individual activity-travel scheduling

Multi-state supernetworks have been advanced recently for modeling individual activity-travel scheduling decisions. The main advantage is that multi-dimensional choice facets are modeled simultaneously within an integral framework, supporting systematic assessments of a large spectrum of policies and emerging modalities. However, duration choice of activities and home-stay has not been incorporated in this formalism yet. This study models duration choice in the state-of-the-art multi-state supernetworks. An activity link with flexible duration is transformed into a time-expanded bipartite network; a home location is transformed into multiple time-expanded locations. Along with these extensions, multi-state supernetworks can also be coherently expanded in space–time. The derived properties are that any path through a space–time supernetwork still represents a consistent activity-travel pattern, duration choice are explicitly associated with activity timing, duration and chain, and home-based tours are generated endogenously. A forward recursive formulation is proposed to find the optimal patterns with the optimal worst-case run-time complexity. Consequently, the trade-off between travel and time allocation to activities and home-stay can be systematically captured.     

An optimization model for integrated planning of railway traffic and network maintenance

Railway transportation systems are important for society and have many challenging and important planning problems. Train services as well as maintenance of a railway network need to be scheduled efficiently, but have mostly been treated as two separate planning problems. Since these activities are mutually exclusive they must be coordinated and should ideally be planned together. In this paper we present a mixed integer programming model for solving an integrated railway traffic and network maintenance problem. The aim is to find a long term tactical plan that optimally schedules train free windows sufficient for a given volume of regular maintenance together with the wanted train traffic. A spatial and temporal aggregation is used for controlling the available network capacity. The properties of the proposed model are analyzed and computational experiments on various synthetic problem instances are reported. Model extensions and possible modifications are discussed as well as future research directions.     

基于多旅行商问题的应急设施服务区划分模型

基于多旅行商问题，增设集散中心需求及应急服务设施资源容量约束条件，以最小化遍历区域内全部集散中心的综合旅行时间成本为优化目标，构建一种应急设施服务区划分模型，确定各应急设施的服务区范围.设计一种复合算法求解模型，首先基于P-中值选址模型的优化理念，形成初始方案；继而加入禁忌搜索算法，结合LKH求解器对模型进行迭代优化求得最优解.基于宁波市北仑区实际拓扑网络进行案例分析，验证了模型和求解方法的有效性.     

变邻域搜索求解公共交通乘务调度问题

公共交通乘务调度问题是一个将车辆工作切分为一组合法班次的过程,它是NP难问题,许多求解方法的效率都与班次评价密不可分,本文通过裁剪TOPSIS方法(Technique for Order Preference by Similarity to an Ideal Solution)设计了TOPSIS班次评价方法.此外,通过裁剪变邻域搜索算法使之适合求解乘务调度问题,提出了基于变邻域搜索的乘务调度方法(Crew Scheduling Approach Based on Variable Neighbourhood Search,VNS),其中,并入了TOPSIS班次评价方法在调度过程中进行班次评价,设计了两种带概率的复合邻域结构以增加搜索的多样性,帮助跳出局部最优,在VNS中利用模拟退火算法进行局部搜索.利用中国公共交通中的11组实例进行了测试,测试结果表明,VNS优于两种新近提出的乘务调度方法,且其结果关于班次数接近于下界.     

缓波型非粘接柔性立管的干涉敏感性

针对非粘接柔性立管在波浪和海流作用下易发生立管干涉的问题,以我国南海某油田输油立管和相邻锚链为例,分别对拖曳力系数、管道单位长度质量、外径、内部介质密度、立管抗拉弯扭刚度和悬挂角度等参数进行敏感性分析,得出不同参数的敏感性情况,并在此基础上提出一些建议供实际工程设计参考.     

Capturing correlation with a mixed recursive logit model for activity-travel scheduling

Representing activity-travel scheduling decisions as path choices in a time–space network is an emerging approach in the literature. In this paper, we model choices of activity, location, timing and transport mode using such an approach and seek to estimate utility parameters of recursive logit models. Relaxing the independence from irrelevant alternatives (IIA) property of the logit model in this setting raises a number of challenges. First, overlap in the network may not fully characterize perceptual correlation between paths, due to their interpretation as activity schedules. Second, the large number of states that are needed to represent all possible locations, times and activity combinations imposes major computational challenges to estimate the model. We combine recent methodological developments to build on previous work by Blom Västberg et al. (2016) and allow to model complex and realistic correlation patterns in this type of network. We use sampled choices sets in order to estimate a mixed recursive logit model in reasonable time for large-scale, dense time-space networks. Importantly, the model retains the advantage of fast predictions without sampling choice sets. In addition to estimation results, we present an extensive empirical analysis which highlights the different substitution patterns when the IIA property is relaxed, and a cross-validation study which confirms improved out-of-sample fit.     

Integrating capacity analysis with high-speed railway timetabling: A minimum cycle time calculation model with flexible overtaking constraints and intelligent enumeration

Compared with most optimization methods for capacity evaluation, integrating capacity analysis with timetabling can reveal the types of train line plans and operating rules that have a positive influence on improving capacity utilization as well as yielding more accurate analyses. For most capacity analyses and cyclic timetabling methods, the cycle time is a constant (e.g., one or two hours). In this paper, we propose a minimum cycle time calculation (MCTC) model based on the periodic event scheduling problem (PESP) for a given train line plan, which is promising for macroscopic train timetabling and capacity analysis. In accordance with train operating rules, a non-collision constraint and a series of flexible overtaking constraints (FOCs) are constructed based on variations of the original binary variables in the PESP. Because of the complexity of the PESP, an iterative approximation (IA) method for integration with the CPLEX solver is proposed. Finally, two hypothetical cases are considered to analyze railway capacity, and several influencing factors are studied, including train regularity, train speed, line plan specifications (train stops), overtaking and train heterogeneity. The MCTC model and IA method are used to test a real-world case involving the timetable of the Beijing–Shanghai high-speed railway in China.     

改进的免疫模拟退火算法求解混合流水车间调度问题

针对混合流水车间调度问题的特点,设计了一种双层编码和解码的方法,在一定程度上扩大了可行解的搜索范围,为了克服传统免疫算法在初期收敛速度慢的问题,在算法的早期应用特定的变异算子,以期提高收敛速度,为避免算法陷入局部最优解,在算法后期,利用模拟退火算法的随机扰动性,引导算法跳出局部最优解,同时还引入了免疫记忆,运用精英保留策略预防最优解的丢失,最终提出了一种改进的混合免疫算法.通过仿真结果表明了该算法在解决混合流水车间问题上的可行性和有效性.     

基于集中质量法的软体排受力和构型分析

首次将一种基于集中质量法的力学模型用于分析计算软体排沉排受力和构型。该力学模型解决了不均匀质量、可拉伸软体排排体的构型和拉力分布的分析计算问题,并能考虑实际河流环境中水流的作用力。实例计算结果的讨论以及与悬链线理论解进行对比可知基于集中质量法的力学模型更适用于实际河流环境下的软体排排体的受力分析。