满足时间约束的物流配送网络设计

提出了对物流配送网络在时间上的需求，将问题抽象为能够描述具体情景的加权网络，结合图论中最短路算怯和问题中结点数目不变的约束条件设计了遗传算法，对问题作出了解答。在此基础上，对一个具体场景进行了算法仿真，得到了配送中心数目与服务质量关系的一般性结论，并且通过对收敛特性进行定性和定量的分析，验证了算法的有效性。

Design of Logistics and Distribution Network Satisfying Time Constraint

Time requirement of the logistics and distribution network is raised and analyzed. Having abstracted the problem into a weighting network, which can describe special cases, this paper establishes a genetic algorithm according to shortest path algorithm in topology model and special constraint of constant node count. Moreover, an emulation experiment is designed to which the algorithm is applied. The experimental data illustrate relationship between number of distribution center and quality of service, and the convergent property of genetic algorithm is analyzed both qualitatively and quantitatively, which proves that the algorithm is valid and efficient.