突发事件下应急物资配送问题的改进算法研究

应急物资配送主要是应急车辆在最短的时间内把应急物资从各地应急储备仓运送到救灾点集散中心,其研究的核心是最短路径选择问题。将最邻近算法应用于应急物资的配送路径选择,提出一种多对多的改进最邻近优化算法。在该算法中,克服以往只能解决一对多问题的局限性,引用全新的编码方法,以时间作为衡量标准,同时对组合参数进行选择进化,以实现组网路径的有效选择。通过仿真实验证明该算法具有很好的适应性。

Research of improved algorithm for Emergency supplies distribution under emergency

The main target of emergent material distribute is to transport the emergent vehicles from the warehouse distribution center to the relief point.The core of this research is the problem of shortest route selection.The nearest neighbor algorithm is applied to the distribution of emergency supplies routing,that presents a many-to-many and improved nearest neighbor algorithm.This algorithm overcomes the limitations of one-to-many in the past,quotes a brand new encoding method.Time as the measure,at the same ti...