路用矿质混合料的级配设计及其优化

对于路用矿质混合料级配设计及其优化,可针对设计及其优化的不同要求创建相应的数学模型,处理办法是将设计与优化有机的结合在一起,以设计要求作为约束条件,以优化为目标,设计与优化一并完成.该法可用于各类矿质混合料的级配设计,且其中相关模型的求解亦分别有成熟的计算手段或程序可资利用,非常方便和适用.     

约束可松弛的网络绿波模型

为解决区域交通信号协调控制领域中常规网络绿波模型可行域窄或无解的问题,提出了约束可松弛的网络绿波模型。应用混合整数线性规划方法构建模型,以所有路段双向绿波带宽加权和最大为优化目标,利用约束松弛方法,将干线约束和网络外圈闭环约束转变为可松弛的不等式约束。模型针对每条路段引入了0~1二元变量,表示路段的绿波是否被打断。通过模型求解,获得网络中必要的松弛路段,并打断相应的路段绿波,去除外圈闭环约束,以扩大可行域并找到最优解。算例对不同控制方案下提出的模型和其他绿波模型的绿波优化结果进行比较分析。算例显示,当网络各个交叉口采用同一化控制方案时,易于在不打断任何路段绿波的条件下找到最优解。此时,所提出的模型的解和常规网络绿波模型的解等价。当网络各交叉口采取差异化控制方案时,常规网络绿波模型无可行解,Gartner网络绿波模型仅获得非最优的可行解,而所提出的模型能够获得全局最优解。算例中只有1条路段的绿波被打断,而网络的其他路段均获得有效绿波带,且任意相交的干线绿波能够合理协调。算例优化结果表明：所提出的模型优于常规网络绿波模型和Gartner网络绿波模型,更适合复杂的城市交通网络信号优化设计。     

利用可编程控制器对立式车床的改造

用可编程控制器对立式车床(C5116A)进行改造,在机床原有的操作方式和机床的主电路不变的情况下,使机床的控制线路大为简化,从而使机床故障率降低.文中提出了总体构思,设计出了PLC的梯形图及接线图,列出了改造后各电器元件的代号与老图纸的代号的对照表.并介绍了部分电路的调试过程.     

平行流交叉口行人过街控制策略研究

为解决平行流交叉口行人与机动车冲突问题,考虑行人与机动车在冲突点为寻找间隙穿越的交替穿插的抢行博弈过程,重新设计行人过街信号相位方案,提出人车搭接相位行人过街模式;考虑行人专用相位过街模式,给出两种行人过街模式的信号控制策略;构建优化模型,并对模型等价变换,降低计算复杂度.结果显示：常规交叉口处于高饱和状态时,两种行人过街模式下平行流交叉口分别降低了73.8%、50.3%的车均延误,故人车搭接相位过街模式效益更优;人车搭接相位过街模式与不考虑行人过街模式相比,交叉口车均延误仅增加 0.6~3.8 s⋅ pcu-1 .研究成果可为平行流交叉口行人信号配时提供理论依据.     

横向型企业集团利润最大化的订单分配模型

当由集团公司统一承接市场订单时，订单在各成员企业问的分配是关键问题．以集团利润最大化为目标，运用优化理论建立了单目标0-1规划的订单分配模型．模型中考虑了股权、资金成本、固定运营成本等因素．对模型求解可以确定集团对市场订单的分配，并由此编制集团各成员企业的生产及运输计划．用算例说明了模型的求解方法．     

船体分段制造最低成本的二次规划模型及其求解

以分段建造费用与工时成线性关系为前提建立的船体分段制造最低成本数学模型其约束条件呈线性关系,目标函数边际收益递减,将最低成本模型改进为二次规划,利用EXCEL工具进行求解,实例计算逼近全局最优,方法简单实用.     

浙江省公路网车辆OD数据库管理系统开发研究

基于公路网OD调查数据现状管理与深度利用的需要,结合浙江省公路网车辆OD数据库管理系统的开发．对系统设计原则与开发平台、功能与框架、技术流程以及关键技术进行详细阐述,可为今后建立更科学和完善的数据库系统提供参考。     

An adaptive information fusion model to predict the short-term link travel time distribution in dynamic traffic networks

As intelligent transportation systems (ITS) approach the realm of widespread deployment, there is an increasing need to robustly capture the variability of link travel time in real-time to generate reliable predictions of real-time traffic conditions. This study proposes an adaptive information fusion model to predict the short-term link travel time distribution by iteratively combining past information on link travel time on the current day with the real-time link travel time information available at discrete time points. The past link travel time information is represented as a discrete distribution. The real-time link travel time is represented as a range, and is characterized using information quality in terms of information accuracy and time delay. A nonlinear programming formulation is used to specify the adaptive information fusion model to update the short-term link travel time distribution by focusing on information quality. The model adapts good information by weighing it higher while shielding the effects of bad information by reducing its weight. Numerical experiments suggest that the proposed model adequately represents the short-term link travel time distribution in terms of accuracy and robustness, while ensuring consistency with ambient traffic flow conditions. Further, they illustrate that the mean of a representative short-term travel time distribution is not necessarily a good tracking indicator of the actual (ground truth) time-dependent travel time on that link. Parametric sensitivity analysis illustrates that information accuracy significantly influences the model, and dominates the effects of time delay and the consistency constraint parameter. The proposed information fusion model bridges key methodological gaps in the ITS deployment context related to information fusion and the need for short-term travel time distributions.     

Multiple criteria optimization method for the vehicle assignment problem in a bus transportation company

A vehicle assignment problem (VAP) in a road, long‐haul, passenger transportation company with heterogeneous fleet of buses is considered in the paper. The mathematical model of the VAP is formulated in terms of multiobjective, combinatorial optimization. It has a strategic, long‐term character and takes into account four criteria that represent interests of both passengers and the company's management. The decision consists in the definition of weekly operating frequency (number of rides per week) of buses on international routes between Polish and Western European cities. The VAP is solved in a step‐wise procedure. In the first step a sample of efficient (Pareto‐optimal) solutions is generated using an original metaheuristic method called Pareto Memetic Algorithm (PMA). In the second step this sample is reviewed and evaluated by the Decision Maker (DM). In this phase an interactive, multiple criteria analysis method with graphical facilities, called Light Beam Search (LBS), is applied. The method helps the DM to define his/her preferences, direct the search process and select the most satisfactory solution.     

考虑多目标的城市停车换乘选址优化模型及算法

停车换乘选址问题是城市交通网络设计研究的重点领域,已有研究的优化目标多集中在系统总费用方面,而对交通可持续发展方面考虑不足。为此,提出综合考虑多方面目标的停车换乘设施选址优化模型及其求解算法。首先,基于超网络理论,提出多方式城市交通系统的超网络模型并定义O-D (Origin-destination)间的超路径、有效超路径及子路径,结合出行者出行过程及交通网络拥挤特征,给出超路径费用的数学表达;其次,基于多方式交通网络随机均衡配流结果,构建交通总阻抗、污染物排放量以及交通系统公平性等系统优化指标的计算模型,并建立用以描述停车换乘设施选址问题的多目标优化模型;进而,以多目标系统优化模型为上层问题,以超网络下满足Logit分配的多方式交通网络配流模型为下层问题,构建描述城市多方式交通系统停车换乘设施选址问题的双层规划模型,并基于模型特征,结合“记录-搜索”思想设计非支配排序遗传算法进行求解;最后,基于Sioux Falls网络设计算例。研究结果表明：算法能够在有限的步骤内搜索到90%以上的Pareto最优解;平均而言,停车换乘措施使得交通总阻抗减小了0.31%,污染物排放量减少了7.32%...