滚装甩挂运输牵引车调度优化及作业模式类比分析

针对滚装甩挂运输新船型可“直进直出”条件下的“边装边卸”作业模式，与传统船型“船艉 进出”条件下的“先卸后装”作业模式对比，建立滚装甩挂码头牵引车调度的混合整数规划模型， 并设计遗传算法求解模型。通过对比不同规模算例下CPLEX与所设计遗传算法的实验结果，验证模型的正确性和算法的有效性。结果表明：相较于传统船型“先卸后装”作业模式，新船型“边装边卸”作业模式在运营成本方面可降低约15%；当装卸任务分布密集时，卸船任务靠近船艏运营成本越高，装卸任务分布稀疏时，卸船任务远离船艏运营成本越高；总体而言，“边装边卸”作业模式的运营成本低于“先卸后装”作业模式。研究结论可为“边装边卸”作业模式下的港口滚装甩 挂作业调度提供决策支持。     

Prioritizing road extension projects with interdependent benefits under time constraint

Since transportation projects are costly and resources are limited, prioritizing or sequencing the projects is imperative. This study was inspired by a client who asked: “I have tens of approved road extension projects, but my financial resources are limited. I cannot construct all the projects simultaneously, so can you help me prioritize my projects?” To address this question, the benefits and costs of all the possible scenarios must be known. However, the impacts (or benefit) of road extension projects are highly interdependent, and in sizable cases cannot be specified thoroughly. We demonstrate that the problem is analogous to the Traveling Salesman Problem (TSP). Dynamic change in travel demand during construction is another aspect of the complexity of the problem. The literature is yet to provide efficient methods for large cases. To this end, we developed a heuristic methodology in which the variation of travel demand during the construction period is considered. We introduce a geometrical objective function for which a solution-finding policy based on “gradient maximization” is developed. To address the projects’ interdependency, a special neural network (NN) model was devised. We developed a search engine hybridized of Ant Colony and Genetic Algorithm to seek a solution to the TSP-like problem on the NN based on gradient maximization. The algorithm was calibrated and applied to real data from the city of Winnipeg, Canada, as well as two cases based on Sioux-Falls. The results were reliable and identification of the optimum solution was achievable within acceptable computational time.     

A multiobjective land development optimization model: the case of New Castle County,Delaware

This paper develops a multiobjective optimization model to consider transportation impacts of the future development of land. The output of the model is the best location and type of land use that has minimal negative transportation effects and uses the maximum available public transportation infrastructure. It provides tools for both planners and transportation engineers and enables them to consider different scenarios of possible policies and land development. Since multiple objectives and their nonlinear structures are considered, the model is solved using mixed integer nonlinear programming. The final results are shown in both tabular and graphical format. The effectiveness of the model is applied to the northern part of New Castle County, Delaware. The results show that the model successfully finds the best locations for both residential and commercial land uses in order to meet several criteria discussed in the paper.     

需求响应的集装箱班列时刻表优化及 Benders分解算法

充分考虑集装箱货物与集装箱班列在时间和数量方面的匹配关系，以集装箱货物送达目的站的总延误最小为目标，构建集装箱班列时刻表优化的线性混合整数规划模型.采 用Benders分解算法将原问题分解为确定集装箱货物与班列匹配方案的主问题，以及优化班列时刻表的子问题，通过求解子问题的对偶模型不断产生主问题的割平面.为克服割平面有效性较低的缺点，设计改进策略，使每次迭代产生多个割平面同时添加至主问题中.最后，通过算例验证模型和算法的有效性.结果表明：改进策略的运用有效提高了算法的计算效率，利用模型及算法得到的班列时刻表与集装箱货物的数量、时间分布之间具有较好的匹配性，制定的班列时刻表很好地响应了用户需求.     

Compromising system and user interests in shelter location and evacuation planning

Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority’s point of view, the desirable goal is to minimize the total evacuation time by computing a system optimum (SO). However, evacuees may not be willing to take long routes enforced on them by a SO solution; but they may consent to taking routes with lengths not longer than the shortest path to the nearest shelter site by more than a tolerable factor. We develop a model that optimally locates shelters and assigns evacuees to the nearest shelter sites by assigning them to shortest paths, shortest and nearest with a given degree of tolerance, so that the total evacuation time is minimized. As the travel time on a road segment is often modeled as a nonlinear function of the flow on the segment, the resulting model is a nonlinear mixed integer programming model. We develop a solution method that can handle practical size problems using second order cone programming techniques. Using our model, we investigate the importance of the number and locations of shelter sites and the trade-off between efficiency and fairness.     

一类大规模运输网络多阶段随机规划配流模型

利用随机规划理论，分析大规模运输网络的基本特性及优化，是近几年交通运输领域发展起来的一种新的研究方向，已广泛地应用于交通运输管理的各个部门。本文在分析了一类大规模运输网络在市场经济模式下的基本特性的基础上，提出了一类适用范围更广、更复杂的多阶段和广义多阶段随机规划配流模型。     

A Novel Evolutionary Feedforward Neural Network with Artificial Immunology

A hybrid algorithm to design the multi-layer feedforward neural network was proposed. Evolutionary programming is used to design the network that makes the training process tending to global optima. Artificial im-munology combined with simulated annealing algorithm is used to specify the initial weight vectors, therefore im-proves the probabiligy of training algorithm to converge to global optima. The applications of the neural network in the modulation-style recognition of analog modulated rader signals demonstrate the good performance of the network.     

面向对象有限元程序的数据设计

面向对象语言丰富的数据类型及类的继承性为有限元方法提供了更高的数据安全性和设计灵活性，同时也带来了一些传统的面向过程程序设计方法所没有的问题。本文用封装在类里的数据代替Ｆｏｒｔｒａｎ有限元程序中的公用区变量以降低耦合性；用静态变量定义类对象的共同属性以减少冗余性；用单元对象的链表结构取代单元文件以提高单元管理的效率和灵活性。对面向对象有限元程序设计所涉及的数据设计和维护的其它方面也进行了讨论。     

基于可持续发展的城市交通网络定量设计研究

基于可持续发展思想，提出可持续发展的城市交通网络宏观优化模型，对网络设计中的路段变量进行宏观控制具有一定的指导意义。     

考虑通道分工和竞争的客运专线定价方法

分析了中长途旅客运输市场竞争环境以及运输通道内既有线和客运专线合理分工．提出了客运专线多产品票价制定的多层规划模型．模型中不仅考虑了基于广义费用最小的旅客出行选择要求和运输企业效益最大化，并且兼顾了与客运通道内既有线的分工，其优化目标是得到最优或接近最优的票价制定方案．探讨了求解该模型的遗传算法．