排序方式： 共有97条查询结果，搜索用时 15 毫秒
81.
Gilbert Laporte 《海军后勤学研究》2007,54(8):811-819
In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations, so that each route starts and ends at a common location and some side constraints are satisfied. Common applications arise in newspaper and food delivery, and in milk collection. This article summarizes the main known results for the classical VRP in which only vehicle capacity constraints are present. The article is structured around three main headings: exact algorithms, classical heuristics, and metaheuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
82.
During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
83.
We consider design of control charts in the presence of machine stoppages that are exogenously imposed (as under jidoka practices). Each stoppage creates an opportunity for inspection/repair at reduced cost. We first model a single machine facing opportunities arriving according to a Poisson process, develop the expressions for its operating characteristics and construct the optimization problem for economic design of a control chart. We, then, consider the multiple machine setting where individual machine stoppages may create inspection/repair opportunities for other machines. We develop exact expressions for the cases when all machines are either opportunity‐takers or not. On the basis of an approximation for the all‐taker case, we then propose an approximate model for the mixed case. In a numerical study, we examine the opportunity taking behavior of machines in both single and multiple machine settings and the impact of such practices on the design of an X – Q C chart. Our findings indicate that incorporating inspection/repair opportunities into QC chart design may provide considerable cost savings. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
84.
移动自组织网络是一种无基础设施、由移动通信节点组成的无线网络,具有高动态特性。传统的路由协议并不能适应节点移动性带来的频繁拓扑变化,简单的洪泛路由也会因开销过大降低网络的性能。针对如何在移动自组织网络中自适应地进行路由选择,提出强化学习框架下的分步路由选择算法。该算法以最小链路总往返时延为目标,基于强化学习进行路由搜寻,在筛选出符合目标需求节点集合的基础上,结合置信度选择路由。在链路变得不可靠时,数据包被广播给筛选出的邻居节点集以提升路由可靠性并降低开销。对提出的算法在分组到达率和路由开销等主要性能指标进行数值仿真分析。仿真结果表明,提出的分步路由算法相比于基于强化学习的智能鲁棒路由,在降低开销的同时,保持着相当的吞吐率。 相似文献
85.
86.
战术MANET的QoS路由计算是一个NP完全问题,可以采用蚁群优化算法来求解.为了提高蚁群优化QoS路由算法的效率,降低时延和网络开销,提出了基于多态转移策略的蚁群优化QoS路由算法(MTS-AQRA).MTS-AQRA将链路稳定性和路由拥塞度与常规的QoS路由约束条件结合起来,利用多态转移策略产生的多样化路由搜索蚁群和并行路由搜索处理,能够在MANET网络中快速地建立满足业务QoS要求的稳定路由.仿真实验结果表明,MTS-AQRA在分组到达率、端到端时延、网络吞吐量等指标上综合性能优于AODV、AntHocNet、QoS-Aware ACO等路由算法. 相似文献
87.
航空集群机载网络作为集群成员间信息交互的纽带,其路由策略性能优劣直接影响信息传输实时性与可靠性,从而制约网络化集群作战效能发挥.考虑到航空集群机载网络具有诸多不确定性,为应对路由失效以及尽可能避免路由更新,从路由选择算法的角度,在软件定义网络架构下提出Failure-Oblivious路由策略.与传统路由策略不同的是,... 相似文献
88.
基于近极轨微纳卫星星座在高速数据传输模型下的网络特点,给出近极轨微纳卫星星座的高速数据传输的模型,分析适用于该模型的路由算法,推导该路由算法开销的计算方式,说明了算法在高速数传模型下的不足;给出算法的改进策略;利用NS3网络仿真平台建立微纳卫星星座高速数传网络场景,仿真了该场景下采用改进路由算法前后的关键性能指标。研究结果表明：在近极轨微纳卫星星座构建的高速数据传输网络中,改进算法在使得吞吐率和分组到达率有所提升的同时,显著降低了网络系统路由开销,微纳卫星高速数据传输网络的性能得到优化。 相似文献
89.
针对现有的软件定义卫星网络中流表占用的三态内容寻址存储器空间不断增加,复杂的流表项查找、匹配过程导致路由转发效率降低,无法满足多样化应用需求的问题,提出基于神经网络的软件定义卫星网络智能路由架构。控制器通过训练神经网络获取数据流的传输模式,并用训练后的神经网络代替流表,在此基础上提出基于Chebyshev神经网络的智能路由策略,交换机根据数据流的业务类型预测其转发路径,以满足卫星网络应用的服务质量要求。仿真结果表明:所提路由策略显著减少了占用的三态内容寻址存储器存储空间,提高了路由效率。 相似文献
90.
本文研究了节点负载处理能力异质条件下的无标度网络交通动力学过程,提出了一种基于节点资源利用率的全局动态路由策略。该策略利用网络中节点资源利用率构建了一种全局代价函数,选择使该代价函数最小的路径来传输负载。实验结果表明该路由策略在略微增加平均路径长度的情况下成倍地提高了网络负载传输能力,与有效路由策略的比较进一步验证了该策略的有效性。 相似文献