Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery

2014 ◽  
Vol 28 (1) ◽  
pp. 288-309 ◽  
Author(s):  
Tao Zhang ◽  
W. Art Chaovalitwongse ◽  
Yuejie Zhang
Author(s):  
Chen Baowen ◽  
Song Shen-min ◽  
Chen Xinglin ◽  
Shan Zhizhong

Author(s):  
Robin Scanlon ◽  
Qing Wang ◽  
Jie Wang

Reverse logistics is an area that has come under increased scrutiny in recent years as legislators and companies try to increase the amount of goods that businesses reuse and recycle. The vehicle routing problem with simultaneous pickup and delivery arises when firms want to reduce handling costs by dealing with deliveries and returns in one operation. This is a complex problem for planners who aim to minimise the vehicle route length as the vehicle load rises and falls during a tour of facilities. This paper investigates the use of Ant Colony Optimisation to find solutions to this problem. An algorithm combining elements of three different studies is proposed. The algorithm finds results within 0.2% of the best known results and performs well for half of the benchmark problems, but needs further work to reach the same level on the other half. It is found that the proposed changes can have up to a 3.1% improvement in results when compared to previous methods run on this algorithm.


Sign in / Sign up

Export Citation Format

Share Document