Crane scheduling with spatial constraints

In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Determining crane areas for balancing workload among interfering and noninterfering cranes

This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un‐)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross‐over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

使用三个数域的数域筛算法

大整数分解难题是RSA密码的数学安全基础.目前数域筛算法是分解365比特以上大整数的最有效方法,然而它的时间复杂度仍然是亚指数的.对于目前普遍使用的1024比特以上大整数,数域筛算法还不能分解,所以研究数域筛算法具有重要的意义.现有的一般数域筛算法普遍使用两个数域,对多个数域的研究极少.一般数域筛算法经过修改可以使用三个数域,即两个代数数域和一个有理数域.分析表明:修改后的数域筛算法与原来的一般数域筛算法在时间复杂度上处于同一量级.但修改后的数域筛算法有更多地方可以合并计算,所以计算速度更快了.通过两个实验也验证了这一结论.     

幂函数型完全非线性函数原像分布的特征

完全非线性函数是特征为奇数的有限域上抗差分密码攻击最优的函数,目前已有的六类完全非线性函数都是2-1的。当Π(x)为Fqm上的Dembowski-Ostrom函数或者Coulter-Matthews函数时,从Fqm到Fq的完全非线性函数tr(aΠ(x))的原像分布恰有两种取值,其中一种取值对应Fqm所有平方剩余元,另一种取值对应Fqm所有非平方剩余元。该结论在文中得到了证明。     

基于动态规划的猎雷具识别路径优化算法

路径长度、海流方向给猎雷具航渡、操控带来的时间消耗,是影响目标识别效率的主要因素。单纯运用动态规划算法只能解决猎雷具最短识别路径的问题,而无法顾全猎雷具在操控方面的时间损耗,从而在提升作战效率上得不偿失。本文基于动态规划算法,优化了识别路径的解算模型,并在模型解算前,提出了目标位置的预处理条件,简化了模型的解算步骤;在模型解算后,提出了识别路径的修正方法,完善了模型的解算结果。     

加权采样的序列蒙特卡罗滤波技术

在处理非线性滤波问题时,常用的几种通过模型近似或计算近似的滤波方法均在某种特定的情况下具有适用性.近年来随着计算机处理能力的快速发展,提出了序列蒙特卡罗滤波方法,因其在处理复杂的非线性和非高斯问题时表现出强大的潜力而引起广泛关注.详述了序列蒙特卡罗滤波算法的基本思想和原理,对其关键技术进行了归纳分析,并指出了该方法亟待解决的一些难点问题.     

CDF9／7小波在JPEG2000中的整数变化

通过添加系数缩放值叮,使目前在JPEG2000中广泛采用的CDF9／7小波提升算法完全整数化,不仅保持了现有算法的还原度,而且简化了算法的复杂度,在图像压缩上取得了比较满意的效果。     

提高消防经费使用效益之管见

当前,我国消防经费的规模随着消防事业的迅速发展正日益扩大。如何加强消防经费的管理,实现有限的经费效益最大化,确保消防部队的发展和建设显得尤为重要。通过分析现阶段消防经费管理和使用中存在的一些普遍问题,就提高消防部队经费使用效益问题,谈了几点意见。     

一种新的装备配置优化模型

传统的装备配置优化问题一般采用确定性的数学规划方法解决,难以满足高技术条件下现代战争中需要对大量随机现象和模糊现象进行精确定量分析的实际要求。在分析了高技术条件下装备配置问题一般特性的基础上,根据机会约束规划和模糊机会约束规划的思想,提出了一种新的建立装备配置优化模型的思路和方法,并给出了基于随机模拟的遗传算法的实值算例,算例结果与实际情况基本相符,反映了模型的科学性与实用性。     

A misclassification cost‐minimizing evolutionary–neural classification approach

Machine learning algorithms that incorporate misclassification costs have recently received considerable attention. In this paper, we use the principles of evolution to develop and test an evolutionary/genetic algorithm (GA)‐based neural approach that incorporates asymmetric Type I and Type II error costs. Using simulated, real‐world medical and financial data sets, we compare the results of the proposed approach with other statistical, mathematical, and machine learning approaches, which include statistical linear discriminant analysis, back‐propagation artificial neural network, integrated cost preference‐based linear mathematical programming‐based minimize squared deviations, linear integrated cost preference‐based GA, decision trees (C 5.0, and CART), and inexpensive classification with expensive tests algorithm. Our results indicate that the proposed approach incorporating asymmetric error costs results in equal or lower holdout sample misclassification cost when compared with the other statistical, mathematical, and machine learning misclassification cost‐minimizing approaches. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.