Autonomous distributed approaches for pickup and delivery problems with time windows
Autonomous distributed approaches for pickup and delivery problems with time windows
复制标题
针对时间窗口取货和送货问题的自主分布式方法
DOI：
10.1109/sice.2007.4421437
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
I. Nishikawa
中科院分区：
文献类型：
--
作者：
K. Sakakibara;H. Tamaki;I. Nishikawa
本文将带时间窗的装卸问题视为一类实际运输问题。该问题要求任何配对的拾取和递送位置必须由一辆车辆服务，并且拾取位置必须在路线中的对应递送位置之前被调度。在本文中，搜索一组接近最优的路线，我们提出了自主分布式方法的基础上的搜索空间分解的问题。在这种方法中，首先，搜索空间被划分为子空间的基础上装载在每个车辆上的客户的数量。然后，遗传算法被应用到这些子空间。计算实验验证了该方法的有效性。
We consider the pickup and delivery problem with time windows as one of the practical transportation problems. The problem requires that any paired pickup and delivery locations have to be served by one vehicle and the pickup location has to be scheduled before the corresponding delivery location in the route. In this paper, to search a set of routes close to the optimal one, we propose autonomous distributed approaches based on the search space decomposition for the problem. In this approach, first, the search space is divided into sub-spaces based on the number of customers loaded on each vehicle. Then, the genetic algorithm is applied to these sub-spaces. The effectiveness of the proposed approach is evaluated by computational experiments.