Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
复制标题
DOI：
10.1007/s10878-014-9741-1
复制
发表时间：
2014-07
影响因子：
1
通讯作者：
T. Zhang;W Art Chaovalitwongse;Yuejie Zhang;T. Zhang;W. Chaovalitwongse;Y. Zhang
中科院分区：
文献类型：
--
作者：
T. Zhang;W Art Chaovalitwongse;Yuejie Zhang;T. Zhang;W. Chaovalitwongse;Y. Zhang
今天，制造商已经变得更加关注制造（新产品）和回收（可重复使用资源）操作的协调。这就需要在供应链网络上同时调度货物的正向和反向流动。本文研究了时间相关的同时取货和送货的车辆路径问题。我们制定这个问题作为一个混合整数规划模型，其中的时间步长函数被用来计算旅行时间。为了有效地解决这个复杂的问题，我们开发了一种混合算法，集成了蚁群系统（ACS）和禁忌搜索（TS）算法。该算法根据TD-VRPSPD的特点，将信息素、行程时间和车辆剩余承载能力作为因子结构。在我们的计算实验中，56组基准实例被用来评估我们的混合算法的性能。此外，我们比较我们的混合算法的性能与个人ACS和TS算法。计算结果表明，我们的混合算法优于独立的ACS和TS算法。
Today manufacturers have become much more concerned with the coordination of both manufacturing (of new products) and recycling (of reusable resources) operations. This requires simultaneous scheduling of both forward and reverse flows of goods over a supply chain network. This paper studies time dependent vehicle routing problems with simultaneous pickup and delivery (TD-VRPSPD). We formulate this problem as a mixed integer programming model, where the time step function is used to calculate the travel time. To efficiently solve this complex problem, we develop a hybrid algorithm that integrates both Ant Colony System (ACS) and Tabu Search (TS) algorithms. Our algorithm uses the pheromones, travel time and vehicle residual loading capacity as a factor structure according to the characteristics of TD-VRPSPD. In our computational experiments, 56 groups of benchmark instances are used to evaluate the performance of our hybrid algorithm. In addition, we compare the performance of our hybrid algorithm with those of individual ACS and TS algorithms. The computational results suggest that our hybrid algorithm outperform stand-alone ACS and the TS algorithms.