【24h】

Design of Polish Logistics Network

机译:波兰物流网络设计

获取原文

摘要

On the basis of the assumptions it can be concluded that customers in the selected area procure the nearest center. Each client within the Voronoi diagram cell is closest to the designated center than the other one. Polygons created by dividing differ from Polish administrative division. The Regions resulting from the Voronoi cell division of polish are convex polygons. Application of Delaunay triangulation divides a network into triangles with as little corners. The result of this procedure is to obtain a minimum distance between centroids. This reduces the transport time and minimizes the costs of delivery. In the work the aspects of client subjective assessment in making decisions about the choice of the distribution center has been omitted i.e. the price of the product, the quality of the offer or the actual transport.
机译:在假设的基础上,可以得出结论,所选地区的客户可以获得最近的中心。 voronoi图表中的每个客户端都比另一个客户端最接近指定的中心。通过划分的多边形与波兰行政划分不同。由抛光的Voronoi细胞分裂产生的区域是凸多边形。 Delaunay三角测量的应用将网络划分为与少数角度的三角形。该方法的结果是获得质心之间的最小距离。这减少了运输时间并最大限度地减少了交货的成本。在工作中,在制定关于分销中心的选择决定的客户主观评估方面是省略的,即产品的价格,要约的质量或实际运输。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号