一种解决集装箱港口拖车调度的混合策略

集装箱码头作为集装箱船舶与其它运输节点之间的枢纽,在不断增长的全球贸易中起着极其重要的作用.由于多种因素影响着集装箱码头的服务效率,从而使其成为了商界和学术界研究的热点.本文针对集装箱码头中的拖车调度问题,对于当某辆拖车完成一项作业任务后,如何去寻找下一个装卸任务的问题,提出了一个多因素的在线调度策略,该策略在针对我国大多数港口的现有布局和信息现状的基础上,综合考虑了拖车空驶和距离平衡多种因素,建立了综合评价函数,并应用评价搜索和离散事件仿真方法对评价函数进行了优化计算.在相关理论分析基础上,通过比较本文的调度策略和港口传统调度策略,我们认为本文的调度策略在缩短船舶停留时间和减少拖车空驶上具有十分明显的效果.     

考虑路径冲突的AGV配置与调度优化

合理调度有限的码头资源以满足船舶的装卸时间要求是自动化集装箱码头的重要目标之一。针对自动化集装箱码头自动导引车(automated guided vehicle,AGV)配置与调度问题,考虑船舶装卸时间要求和AGV运输过程中的路径冲突,提出分阶段调度策略。将船舶装卸作业分为卸船阶段、装卸同步阶段、装船阶段三个阶段,在每个阶段中,建立以最小化最大完工时间和最小化AGV空载和等待时间为双目标的调度优化模型,并设计基于NSGA-Ⅱ的启发式算法求解。根据本阶段的实际完工时间,从最优解集中选择下一阶段AGV的配置与调度方案。最后对比其他调度方案表明本文调度方案能够满足集装箱船的装卸时间要求,且提高了AGV的利用率,更符合码头实际作业要求。     

基于两阶段混合动态规划算法的龙门吊路径优化

产业界已出现利用多台轨道式龙门吊同时作业以提升集装箱码头装船效率的情况,由于需要确定每台龙门吊的取箱作业集合以及增加了“避免碰撞”、“顺次移动”等现实约束,故其移动路径规划问题在模型建立与求解上比单台轨道式龙门吊更为复杂。本文针对两台轨道式龙门吊同时作业的情形,建立了龙门吊移动路径网络模型,并开发了基于贪婪算法与动态规划的两阶段混合算法,并通过仿真算例,借助与基于实际调度规则所得到的调度方案的对比,验证了模型及优化算法的有效性与实用性。     

基于人机交互—蚁群算法的港口疏船调度优化

为解决因港口无法正常作业导致大量船舶压港后的疏船调度问题,从同时兼顾船公司和港口方利益出发,建立了船舶平均在港时间最短、额外作业成本最低、生产秩序恢复最快的调度生产多目标优化模型。利用多属性效用理论将多目标转换为单目标,并构建了相应的评价函数,采用改进的蚁群算法并结合人机交互以及邻域搜索方法求解,最后以大连港集装箱码头实际案例进行验证。结果表明,与通常调度方法相比,文中建立的优化模型能够更好地解决疏船问题;对比常规的蚁群算法,改进后的算法搜索效率更高。上述模型和算法为集装箱码头的生产组织调度提供了新的优化思路和方法。     

预知信息下集装箱码头资源联合调度在线策略研究

探讨了有限预知信息下的集装箱码头泊位与岸桥联合调度over-list在线模型,当分配每个船舶服务请求时预知后续k≥2个请求,要求完成所有请求的最大完工时间最小。着重考虑了由3个离散泊位组成的混合型泊位、6个岸桥以及只有两种请求的联合调度模型,证明了任意k≥2个请求预知能力下确定性在线策略的竞争比下界为9/7;同时,设计了k=2时的在线联合调度策略并证明其具有最优竞争比9/7,表明有限的预知能力即可实现在线策略最优调度效果,这也为集装箱码头资源调度实践中的策略设计提供理论依据。     

基于仿真优化的自动化集装箱码头出口箱箱位分配

在集装箱码头堆场中，出口集装箱的箱位分配直接影响集装箱的装船效率以及船舶的在港停留时间。研究主要探讨自动化集装箱码头出口集装箱的箱位分配问题，并将船舶靠泊随机性和出口集装箱集港顺序综合考虑到整数规划模型中。针对模型的特点，设计了基于仿真优化思想的启发式算法求得集装箱贝位分配量，并提出“长途箱压短途箱”的贝内具体落位策略。多组实验结果表明，提出的基于仿真的遗传算法能够有效解决自动化集装箱码头出口箱的箱位分配问题。通过多组算例对比实验发现贝位平均翻箱次数和箱区间作业不平衡度随集装箱数量增加而增加，且“长途箱压短途箱”堆存策略能有效减少未来取箱的翻箱次数。研究结果为智能港口、全自动化集装箱码头的运营提供了思路和方向，有助于实现集装箱码头各子系统一体化效率的提升。     

基于关键资源优先的三级装卸搬运分区协调策略

研究基于关键资源优先的单元化“装卸、搬运、装卸”三级作业链调度问题。已知关键资源调度方案,将两非关键作业级的调度问题分别转化为最小单位流问题求解。在数学模型基础之上提出三级装卸搬运的分区协调策略。对关键装卸级作业区进行合理分区和设备分配,从而合理设置已知参数;提出非关键级装卸作业区的分区协调策略,以扩大计算规模。以码头三级装卸搬运作业链为例,参照宁波港码头数据,设计面向集装箱码头的仿真算例,通过较大规模算例验证分区策略对于计算大规模非关键装卸级调度问题的可行性和快捷性。     

兼顾成本与时间保证率的泊位及岸桥协同调度优化

针对集装箱班轮根据船期表按计划到离港的运行规律以及港口企业追求低运营成本的需求,本文以集装箱班轮按计划离港保证率最大和码头作业成本最低为目标,构建了泊位及岸桥协同调度多目标优化模型;设计了叠加式局部搜索算法,将其嵌入到带精英策略的非支配排序遗传算法中,经过相互交叉反馈运算,得到Pareto非劣解;采用“性价比”的概念和量化方法,选择出对港口和船公司的利益偏向最小的实施方案,解决了在Pareto解集中寻优的问题。最后,以大连港集装箱码头的生产实际为例,验证了上述优化模型及算法的合理性和有效性。     

考虑泊位疏浚的连续型泊位和动态岸桥联合调度

针对集装箱码头泊位需要定期维护的实际特征,研究了泊位疏浚情况下连续型泊位和动态岸桥联合调度问题。首先,建立了一个以船舶周转时间最小为目标的整数线性规划模型;其次,针对问题特性设计了三种启发式算法。为了分析泊位疏浚对码头工作的影响并验证模型正确性和算法有效性,分别对未考虑泊位疏浚和考虑泊位疏浚两种调度情形,进行了小规模与大规模问题输入的多组测试。三种算法在小规模输入上均取得了相同于CPLEX的精确解,从而验证了算法的有效性;进一步通过对比分析这些算法在大规模输入中的运行结果,验证其有效性能。     

基于知识图谱的运筹学发展现状及趋势研究

借助于Citespace软件对web of science上2006年到2015年之间以运筹学为主题的3166篇学术论文进行分析,梳理了运筹学这十年间的发展脉络、重要文献、研究热点和前沿等。研究发现,目前美国在运筹学研究领域依然遥遥领先,英国、中国等也取得了较为丰硕的成果。近十年对运筹学发展有较大影响的成果主要有Stahlbock R在2008对运筹学在港口的作业组织和控制,码头运作计划和调度应用的总结;19世纪70年代和80年代由Charnes A和Cooper W W以及 Rhodes E开创的CCR和BCC模型;1979年由Garey M R总结的具有三百个具有NP完全性的问题;由Goldberg D E在1989年对于遗传算法的论著等。研究热点领域主要集中在集装箱码头调度运输方面的研究。研究前沿主要集中在管理科学、战略制定、遗传算法、人员排班、数据包络分析等问题。     

A REPRESENTATION FORMULA RELATED TO SCHR(O)DINGER OPERATORS

Schr(o)dinger operator is a central subject in the mathematical study of quantum mechanics.Consider the Schrodinger operator H = -△ V on R, where △ = d2/dx2 and the potential function V is real valued. In Fourier analysis, it is well-known that a square integrable function admits an expansion with exponentials as eigenfunctions of -△. A natural conjecture is that an L2 function admits a similar expansion in terms of "eigenfunctions" of H, a perturbation of the Laplacian (see [7], Ch. Ⅺ and the notes), under certain condition on V.     

Qualitative Analysis of Bifurcating Solutions in the Lengyel-Epstein Model

One of the most fundamental problems in theoretical biology is to explain the mechanisms by which patterns and forms are created in the＇living world. In his seminal paper ＂The Chemical Basis of Morphogenesis＂, Turing showed that a system of coupled reaction-diffusion equations can be used to describe patterns and forms in biological systems. However, the first experimental evidence to the Turing patterns was observed by De Kepper and her associates（1990） on the CIMA reaction in an open unstirred reactor, almost 40 years after Turing＇s prediction. Lengyel and Epstein characterized this famous experiment using a system of reaction-diffusion equations. The Lengyel-Epstein model is in the form as follows     

On a class of self-similar processes with stationary increments in higher order Wiener chaoses

We study a class of self-similar processes with stationary increments belonging to higher order Wiener chaoses which are similar to Hermite processes. We obtain an almost sure wavelet-like expansion of these processes. This allows us to compute the pointwise and local Hölder regularity of sample paths and to analyse their behaviour at infinity. We also provide some results on the Hausdorff dimension of the range and graphs of multidimensional anisotropic self-similar processes with stationary increments defined by multiple Wiener–Itô integrals.     

(0,1 ;0)-INTERPOLATION ON INFINITE INTERVAL (-∞, +∞)

In this paper, we study the explicit representation and convergence of (0, 1; 0)-interpolation on infinite interval, which means to determine a polynomial of degree ≤ 3n - 2 when the function values are prescribed at two set of points namely the zeros of Hn(x) and H′n(x) and the first derivatives at the zeros of H′n(x).     

On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

CONTENTS OF VOLUME 30

正~~     

Instructions for contributions

正Applied Mathematics-A Journal of Chinese Universities,Series B(Appl.Math.J.Chinese Univ.,Ser.B)is a comprehensive applied mathematics journal jointly sponsored by Zhejiang University,China Society for Industrial and Applied Mathematics,and Springer-Verlag.It is a quarterly journal with     

Journal of Mathematical Research with Applications Guide for Authors

正Journal overview:Journal of Mathematical Research with Applications(JMRA),formerly Journal of Mathematical Research and Exposition(JMRE)created in 1981,one of the transactions of China Society for Industrial and Applied Mathematics,is a home for original research papers of the highest quality in all areas of mathematics with applications.The target audience comprises:pure and applied mathematicians,graduate students in broad fields of sciences and technology,scientists and engineers interested in mathematics.     

Staircase transportation problems with superadditive rewards and cumulative capacities

A cumulative-capacitated transportation problem is studied. The supply nodes and demand nodes are each chains. Shipments from a supply node to a demand node are possible only if the pair lies in a sublattice, or equivalently, in a staircase disjoint union of rectangles, of the product of the two chains. There are (lattice) superadditive upper bounds on the cumulative flows in all leading subrectangles of each rectangle. It is shown that there is a greatest cumulative flow formed by the natural generalization of the South-West Corner Rule that respects cumulative-flow capacities; it has maximum reward when the rewards are (lattice) superadditive; it is integer if the supplies, demands and capacities are integer; and it can be calculated myopically in linear time. The result is specialized to earlier work of Hoeffding (1940), Fréchet (1951), Lorentz (1953), Hoffman (1963) and Barnes and Hoffman (1985). Applications are given to extreme constrained bivariate distributions, optimal distribution with limited one-way product substitution and, generalizing results of Derman and Klein (1958), optimal sales with age-dependent rewards and capacities.To our friend, Philip Wolfe, with admiration and affection, on the occasion of his 65th birthday.Research was supported respectively by the IBM T.J. Watson and IBM Almaden Research Centers and is a minor revision of the IBM Research Report [6].