基于邮政网络的社区物流多中心m-TSP问题

从社区物流的配送问题着手,在总结社区物流配送特点和要求的基础上,提出了基于邮政网络对社区物流进行分区规划的问题.基于假设邮政网点足够密集的研究思想,即配送中心随地可取的情况下,对有社区物流需求的某个地区做分区规划.利用Weight-K-means算法,对划分好的每个区域做一次TSP计算,从而满足在每一个聚类中,不仅车载量均衡,而且车辆所走里程也大致相同.算例分析表明该算法能够得到满意的解.

Multicenter and m-TSP Study of Community Logistics Based on Postal Network

The distribution of community logistics is discussed with the distribution features of community logistics and requirements.The partitions of community logistics is based on post network for partition planning of concern district where community logistics demand exists under a presumption that postal outlets are consisted of multi-distribution centers.The K-means algorithm is cited,and a TSP calculation is given for every partitioned sector to meet the requirements of car load and mileage equilibriums.A simple example is given to illustrate the feasibility of this research.