公开(公告)号：US10387823B2

公开(公告)日：2019-08-20

申请号：US13709517

申请日：2012-12-10

申请人： International Business Machines Corporation

发明人： Amelie Hocquette ,  Viu-Long Kong ,  Stephane Michel

IPC分类号： G06Q10/08

摘要： Method and system are provided for automated partitioning of transportation routing problems. The method includes: determining a threshold number of shipments per partition; selecting a geographic center; mapping delivery and/or pickup sites at geographic locations; scanning radially around the geographic center to determine the sparsest or densest region of sites and selecting a starting point in this region; and progressing from the starting point radially around the geographic center aggregating sites into partitions with a maximum of the threshold number of shipments in a partition. The method may include: solving each partitioned instance of a problem to generate one or more optimized routes; and creating a union of all the instances solutions.

公开(公告)号：US20130151435A1

公开(公告)日：2013-06-13

申请号：US13709517

申请日：2012-12-10

申请人： International Business Machines Corporation

发明人： Amelie Hocquette ,  Viu-Long Kong ,  Stephane Michel

IPC分类号： G06Q10/08

CPC分类号： G06Q10/08355 ,  G06Q10/083

摘要： Method and system are provided for automated partitioning of transportation routing problems. The method includes: determining a threshold number of shipments per partition; selecting a geographic centre; mapping delivery and/or pickup sites at geographic locations;scanning radially around the geographic centre to determine the sparsest or densest region of sites and selecting a starting point in this region; and progressing from the starting point radially around the geographic centre aggregating sites into partitions with a maximum of the threshold number of shipments in a partition. The method may include: solving each partitioned instance of a problem to generate one or more optimized routes; and creating a union of all the instances solutions.

摘要翻译： 提供方法和系统用于自动划分运输路线问题。 该方法包括：确定每个分区的出货阈值数量; 选择地理中心; 在地理位置映射传送和/或传送站点; 围绕地理中心径向扫描，以确定最稀疏或最密集的地点，并选择该地区的起点; 并且从地理中心聚集站点的径向起始点进入具有分区中最大出货量的最大值的分区。 该方法可以包括：解决问题的每个分割实例以生成一个或多个优化的路由; 并创建所有实例解决方案的联合。