Scheduling of airport runway operations using stochastic branch and bound methods

In this paper we present a solution methodology based on the stochastic branch and bound algorithm to find optimal, or close to optimal, solutions to the stochastic airport runway scheduling problem. The objective of the scheduling problem is to find a sequence of aircraft operations on one or several runways that minimizes the total makespan, given uncertain aircraft availability at the runway. Enhancements to the general stochastic branch and bound algorithm are proposed and we give the specific details pertaining to runway scheduling. We show how the algorithm can be terminated early with solutions that are close to optimal, and investigate the impact of the uncertainty level. The computational experiment indicates that the sequences obtained using the stochastic branch and bound algorithm have, on average, 5–7% shorter makespans than sequences obtained using deterministic sequencing models. In addition, the proposed algorithm is able to solve instances with 14 aircraft using less than 1 min of computation time.     

Adding a new station and a road link to a road–rail network in the presence of modal competition

In this paper we study the problem of locating a new station on an existing rail corridor and a new junction on an existing road network, and connecting them with a new road segment under a budget constraint. We consider three objective functions and the corresponding optimization problems, which are modeled by means of mixed integer non-linear programs. For small instances, the models can be solved directly by a standard solver. For large instances, an enumerative algorithm based on a discretization of the problem is proposed. Computational experiments show that the latter approach yields high quality solutions within short computing times.     

桥梁活载内力分析可视化研究初步

可视化方法可有效处理数值分析的结果。提出了两种利用可视化方法分析桥梁活载内力的可行方式，完成了其中一种的程序实现，并结合实例介绍了其工程应用。     

遗传算法与极大熵相结合解多目标规划问题

采用极大熵解法，将多目标规划转化为一般的可微规划，鉴于转化后的目标函数和约束条件都是高度非线性的，采用遗传算法求解多目标规划，取已有的典型算例运用文中提出的方法，则得到了较好的精度。     

城市群环路的双目标规划模型

为了确定城市群环路的合理半径及其环带服务宽度,提出了以走行距离和路径总阻抗为目标函数的双目标规划模型.其中,走行距离函数考虑OD点3种相对位置情况,利用d ijkstra算法求解;路径总阻抗函数采用预算约束的离散交通网络设计的双层规划数学模型,用分枝定界算法求解.研究表明,城市群环路所服务的对象,主要是夹角小于90°的OD对.以成都市都市圈路网为实例验证了模型的可行性.     

Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets

Introduction Vehicle routing problem (VRP) with differentfleets is an important investment decision in reality. Itconsists of two decision-making processes: selectingvehicles of available types and routing the selectedfleet. A desirable fleet has more than one type of ve-hicles. Typically, the fixed cost of vehicles accountsfor approximately 80% of the total cost associatedwith vehicles[1]. The fixed cost is a major factor todetermine vehicle combination in a fleet.A few models were develope…     

COLOR IMAGE QUANTIZATION WITH EVOLUTIONARY PROGRAMMING

Introduction　　 The need for quantization of color images isarised because of the limitations of image displayand hardcopy,data storage and data transmissiondevices.The color image quantization is a complexdata clustering problem due to the broad distribu-tion of local optima in the three- dimensional colorspace. Many of the present algorithms for colorquantization find non- optimal solutions,giving riseto visible shifts in color and false contours whenthe number of quantization colors is sma…     

多目标多重运输调度问题的混合算法

本文研究了多目标多重运输调度问题．建立了该问题的目标规划模型，提出了该问题基于分校定界和割平面技术的混合算法。     

综合交通运输的一种优化模型

随着社会经济发展和科技进步,人类交通运输业已经进入综合交通运输系统的新时代。将优化方法应用到交通运输问题中,通过系统、科学的研究,制定最优的交通运输方案,已经成为现在和将来交通运输研究的主题之一。通过对一种联合交通运输问题建立优化模型,并用实际的数值结果加以验证,以期能为企业的领导者合理、科学地决策最佳方案提供更加有力的依据。     

条码文法研究

以Ｃｈｏｍｓｋｙ关于形式语言的基本理论为工具研究了条码，得出了一组结论。这些结论对通用解码程序设计的研究，具有直接的指导作用。