The method of imbedded Lagrangian element to estimate wave power absorption by some submerged devices

A simple approach is described to estimate the wave power absorption potential of submerged devices known to cause wave focusing and flow enhancement. In particular, the presence of a flow-through power take-off （PTO） system, such as low-head turbines, can be accounted for. The wave radiation characteristics of an appropriately selected Lagrangian element （LE） in the fluid domain are first determined. In the limit of a vanishing mass, the LE reduces to a patch of distributed normal dipoles. The hydrodynamic coefficients of this virtual object are then input in a standard equation of motion where the effect of the PTO can be represented, for example, as a dashpot damping term. The process is illustrated for a class of devices recently proposed by Carter and Ertekin （2011）, although in a simplified form. Favorable wave power absorption is shown for large ratios of the LE wave radiation coefficient over the LE added mass coefficient. Under optimal conditions, the relative flow reduction from the PTO theoretically lies between 0.50 and 1 2 ≈ 0.71, with lower values corresponding to better configurations. Wave power capture widths, the sensitivity of results to PTO damping and sample spectral calculations at a typical site in Hawaiian waters are proposed to further illustrate the versatility of the method.     

面向鲁棒性的高速铁路网络列车运行调整计划优化模型

针对高速铁路路网中出现区间封锁事件,考虑事件持续时间的不确定性,以列车运行时间和安全间隔时间为约束条件,引入路径选择唯一性约束保证列车运行调整计划的鲁棒性,以所有列车晚点时间之和的期望值最小为目标函数,建立高速铁路列车运行调整计划优化整数规划模型.设计基于优先级规则的启发式算法,求解原模型的可行解.运用拉格朗日松弛算法和最短路径算法求解该模型的松弛模型,得到原模型最优解的下界.根据可行解与最优解下界之间的距离,可以定量地衡量可行解的质量.结果表明,相较于CPLEX数学求解软件,算法求解效率较高;模型与算法能够有效生成鲁棒的列车运行调整计划,为调度员提供必要辅助决策信息.     

A hybrid heuristic strategy for liquefied natural gas inventory routing

As liquefied natural gas (LNG) steadily grows to be a common mode for commercializing natural gas, LNG supply chain optimization is becoming a key technology for gas companies to maintain competitiveness. This paper develops methods for improving the solutions for a previously stated form of an LNG inventory routing problem (LNG-IRP). Motivated by the poor performance of a Dantzig-Wolfe-based decomposition approach for exact solutions, we develop a suite of advanced heuristic techniques and propose a hybrid heuristic strategy aiming to achieve improved solutions in shorter computational time. The heuristics include two phases: the advanced construction phase is based on a rolling time algorithm and a greedy randomized adaptive search procedure (GRASP); and the solution improvement phase is a series of novel MIP-based neighborhood search techniques. The proposed algorithms are evaluated based on a set of realistic large-scale instances seen in recent literature. Extensive computational results indicate that the hybrid heuristic strategy is able to obtain optimal or near optimal feasible solutions substantially faster than commercial optimization software and also the previously proposed heuristic methods.     

技术站配流与调机运用综合问题的拉格朗日松弛算法

技术站调度问题中配流与调机运用是关系密切的两个基础问题。基于单机器调度和资源分配理论,构建单解单编技术站配流与调机运用综合问题的混合整数线性规划模型,同时确定出发列车的编组内容和调机的解编任务,使得出发列车满足列车编组要求,且车辆在站加权总停留时间最小。设计拉格朗日松弛算法松弛掉连接约束,将原问题分解为解体子问题、配流子问题和编组子问题,对偶问题采用传统次梯度优化算法求解。最后,采用既有文献算例对该算法的有效性进行测试,结果表明:与分支定界算法相比,该算法能够实现计算质量和时间的较好折中。     

大规模货物列车运行图优化编制的一种拉格朗日松弛启发式算法

针对货物列车运行图优化编制规模庞大、精确求解困难的问题,构造时空网络将列车运行线铺画描述为路径求解问题,将各类约束转化为时空网络节点选择限制,建立整数规划模型。该问题本质在于疏解各列车运行线潜在冲突。对原模型进行拉格朗日松弛,将列车运行线潜在冲突表示为各节点罚数,设计启发式算法并通过拉格朗日乘子更新迭代求解。以京九线北京西至阜阳区段为例,对该区段711条运行线中的439条货物列车运行线进行了优化编制实验。结果表明,在满足运行线铺画条数的前提下,全图货物列车平均旅行速度由39.28 km/h提升至41.81~43.72 km/h,所提出的算法是解决大规模列车运行图编制的一种有效算法。     

配送网络流问题探讨

考虑物流配送中的网络流问题,即由某些供应点向各个需求点通过某种运输工具(货车、轮船等)供应货物的问题,目的是尽可能的降低配送成本.通过一个混和整数规划模型来描述该问题,利用网络单纯形法、拉格朗日松弛算法以及试探法为主要研究方法,有效地得到该问题一个近似程度较高的可行解.     

广义势及非惯性系中的Lagrange方程

本文从动能出发,定义一系列惯性力所对应的广义势,获得非惯性坐标系中的Lagrange函数,从而将Lagrange方程推广到非惯性系,为相对运动的研究提供直捷方便的方法。     

Model and algorithm for container ship stowage planning based on bin-packing problem

In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage planning problem increases due to its multi-ports nature. This problem is NP-hard problem. In order to reduce the computational complexity, the problem is decomposed into two sub-problems in this paper. First, container ship stowage problem （CSSP） is regarded as “packing problem”, ship-bays on the board of vessel are regarded as bins, the number of slots at each bay are taken as capacities of bins, and containers with different characteristics （homogeneous containers group） are treated as items packed. At this stage, there are two objective functions, one is to minimize the number of bays packed by containers and the other is to minimize the number of overstows. Secondly, containers assigned to each bays at first stage are allocate to special slot, the objective functions are to minimize the metacentric height, heel and overstows. The taboo search heuristics algorithm are used to solve the subproblem. The main focus of this paper is on the first subproblem. A case certifies the feasibility of the model and algorithm.     

Northern Adriatic Sea surface circulation and temperature/pigment fields in September and October 1997

Satellite images of surface chlorophyll-a concentration measured by the sea-viewing wide field-of-view sensor (SeaWiFS) and of sea surface temperature derived from advanced very high resolution radiometer (AVHRR) measurements, combined with in-situ drifter measurements of surface currents, and ancillary wind, Po River discharge and surface salinity data, are used to describe the surface dynamics in the northern Adriatic during the period September–October 1997.The satellite observations revealed very complex mesoscale dynamics, with time scales of a day or two and length scales of about 10 km, including the meandering and instability of basin-scale currents (e.g., the western coastal layer), jets/filaments and eddies. In addition, the two typical patterns of the Po River plume are observed and qualitatively explained in terms of wind forcing. A basin-wide double gyre pattern spreads the rich runoff water across most of the northern Adriatic from mid-September to early October, following Bora wind events and under stratified sea conditions. In contrast, in late October the Po plume is confined to the coast due to weaker winds and de-stratified conditions. This variability in the Po River plume extension is also confirmed by in-situ salinity measurements.     

几种启发式集装箱优化配装方法的比较

集装箱配装是个多约束的复杂组合优化问题 ,属于NP -Hard问题 ,其求解是很困难的 ,所以实际应用中一般多用启发式方法来解。分析和比较了几种启发式集装箱配装的特点 ,并对未来的研究发展趋势做出了预测。