论文部分内容阅读
为提高集送货问题的求解效率,提出一种新的同步优化快速算法,即先以非精确的混合距离矩阵替代里程矩阵为输入进行求解,然后将结果反馈到输入端动态更新混合距离矩阵中对应的元素,以更新的混合距离矩阵为输入再次求解,以此反复迭代,直至满足优化目标。以40个遍布于北京的客户构成的集送货问题为例,用该算法进行了求解,并与传统异步优化算法的优化结果进行对比,结果表明同步优化快速算法能够在精度降低4.92%的情况下,比传统异步算法节省40%的计算时间,适用于实时性要求很高的动态调度。
In order to improve the efficiency of solving the problem of set delivery and delivery, a new fast algorithm of synchronization optimization is proposed. That is to say, an inaccurate hybrid distance matrix is used to solve the problem of solving the input matrix. Then the result is fed back to the input dynamic update mixture distance matrix The corresponding elements are solved again with the updated mixture distance matrix as an input to iteratively iterate until the optimization goal is met. Taking 40 customers in Beijing as an example, this algorithm is used to solve the problem, and compared with the traditional asynchronous optimization algorithm. The results show that the synchronous optimization algorithm can reduce the precision by 4.92% , Compared with the traditional asynchronous algorithm to save 40% of the calculation time, for real-time requirements of the dynamic scheduling.