Vehicle routing problems with regular objective functions on a path

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014     

IDRP：行星际DTN路由协议

为解决星际网络场景下的数据传输问题,提出了一种星际容延迟网络路由协议:利用节点的历史连接信息来预测该节点与其各个邻居节点的连接恢复时间;当两个位于同一个域的节点互相连接时,交换彼此的连接时间预测表,并据此决定是否需要使用对方作为中继节点;深空节点的存储资源常常受限,在进行路由选择时将节点的存储区消耗情况也纳入决策。使用NS2进行地-火通信场景仿真,使用一种改进的泛洪路由和一种仅选择网关节点作为下一跳选择的路由策略作对比。仿真结果表明相比其他两种协议,提高了14%的投递成功率并减少了50%的平均传输延迟,并更有效的利用了节点存储资源。     

提供有界延迟服务的网络结构

将来的计算机网络必须支持具有不同通信量和不同服务质量（ＱｏＳ）要求的应用，有界延迟服务保证所有应用包的延迟都不超过给定延迟上界。本文首先提出有界延迟实时服务网络的框架，详细说明了其关键部件的功能和工作原理，并阐述了分析它们性能的技术，最后讨论了设计有界延迟服务网络在性能与实现复杂性之间的折衷。     

基于动态流能量高效的无线传感网路由算法

针对无线传感网中结点能量受限,提出了一种基于动态流能量高效的路由算法DFEERA(Dynamic Flow-based Energy-Efficient Routing Algorithm)。该算法通过在无线传感网内设置多个基站收集区域内传感器结点的数据流拓扑结构建立数据传输能量消耗模型,将该模型转换为最大流问题求解最优传输路径,作为某时期内结点数据传输路径。随着结点能量的消耗,动态调整该能量消耗模型重新规划路径,作为新的传输路径,从而平衡结点间的能量消耗,提高网络结点的存活率。仿真结果表明,与其他典型的路由算法相比,DFEERA能够更好地平衡结点的能耗,获得更高的能量消耗率和更长的网络生存期。     

基于启发式算法的复杂军事网络路径优化

使用一种启发式算法,使得复杂网络中最大介数最小化,可以达到接近最优化的路径,以改善复杂网络的信息容量。针对海上编队作战系统复杂网络的平均介数、最大介数与网络大小、迭代次数、介数分布情况的仿真发现,复杂网络容量超出比对文献中理论预测的最大值,这对于解决复杂军事网络的拥塞,提高复杂军事网络容量和作战效能重大意义。     

On the effectiveness of returns policies in the price‐dependent newsvendor model

We study in this paper the price‐dependent (PD) newsvendor model in which a manufacturer sells a product to an independent retailer facing uncertain demand and the retail price is endogenously determined by the retailer. We prove that for a zero salvage value and some expected demand functions, in equilibrium, the manufacturer may elect not to introduce buybacks. On the other hand, if buybacks are introduced in equilibrium, their introduction has an insignificant effect on channel efficiency improvement, but, by contrast, may significantly shift profits from the retailer to the manufacturer. We further demonstrate that the introduction of buybacks increases the wholesale price, retail price, and inventory level, as compared to the wholesale price‐only contract, and that the corresponding vertically integrated firm offers the lowest retail price and highest inventory level. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Adaptive random search for continuous simulation optimization

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

卫星中断容忍网络路由算法研究

针对卫星网络易中断、长时延等问题,提出一种适合卫星DTN网络的路由算法——SDTNR算法。该算法在节点缓存中设置了3个存放不同服务等级报文的队列,队列根据报文响应比排序,响应比小的报文优先发送。SDTNR算法根据卫星运行规律,建立节点选择表并实时更新该表,根据表中信息选择满足条件的节点作为下一跳节点,以此保证通信的可靠性。仿真结果表明,SDTNR与EPR、PR、FC 3种算法相比,SDTNR更好地提高了报文的投递率、降低了网络开销和平均时延。     

高精度轴类零件的砂带确定性修形方法

为提高金属轴类零件的加工精度,基于光学确定性加工原理将振动砂带研抛方法用于轴类零件的高精度修形中。在这种方法中,弹性接触轮在一定压力下与轴类工件接触形成一个矩形研抛区域,砂带覆盖在接触轮上,通过接触轮的轴向振动可以实现材料可控去除。利用圆柱度仪测量得到轴零件外圆表面的轮廓形貌,得到被加工零件表面轮廓的误差分布。使用脉冲迭代法计算接触轮在圆柱表面不同位置的驻留时间,通过机床主轴的伺服控制实现工件不同位置材料去除量的大小,从而实现被加工零件圆柱度误差的确定性修整。在经过仿真加工后,在一根45#钢轴的一段柱面上进行了确定性修形实验。结果表明,工件平均圆度误差从0.42 μm收敛至0.11 μm,圆柱度误差从0.76 μm收敛至0.35 μm,加工后的形状精度优于超精密外圆磨床的加工精度,验证了高精度轴类零件柱面上确定性修形的可行性。     

SpaceWire总线的双路由单元性能评价方法

基于双路由单元研究了Space Wire总线的性能评价体系。研究中给出双路由单元的定义,推导基于双路由单元的路由系统的数据传输时间和资源耗费的计算方法;推导基于双路由单元的多路由拓扑系统的性能评价体系;采用蒙特卡洛模拟的方法建立双路由单元系统的模拟平台,仿真计算路由单元在不同接口配置情况下的性能。研究结果表明:基于双路由单元的传输时间和资源耗费指标能够评价Space Wire总线的性能;在不同接口配置时,存在一种最佳的配置方式使系统的性能达到最优。