%0 Journal Article %A HUANG Wulan1 %A 2 %A ZHANG Tao1 %A 3 %T Vehicle routing problem with simultaneous pick-up and delivery and time-windows based on improved global artificial fish swarm algorithm %D 2016 %R %J Computer Engineering and Applications %P 21-29 %V 52 %N 21 %X This paper concerns a Vehicle Routing Problem with Simultaneous Pick-up and Delivery and Time-Windows(VRPSPDTW). A binary mixed binary integer programming model is developed for the problem. To further improve the convergence speed and optimization capability of the artificial fish swarm algorithm, an Improved Global Artificial Fish Swarm Algorithm(IGAFSA) is proposed, and the parameters of the algorithm are also determined by experiments. In order to reduce computational complexity, during the course of the algorithm, the time windows constraint and the vehicle capacity constraint are allowed to violate. Computational results are reported from Wang and Chen’s benchmark and compared with the results from Artificial Fish Swarm Algorithm(AFSA) and Parallel Simulated Annealing(P-SA) that minimizes the Number of Vehicles(NV) and the total Travel Distance(TD), which demonstrate the effectiveness of the IGAFSA algorithm. The results show that the IGAFSA which obtains the NV and TD solutions is better than AFSA, and its TD solutions are better than P-SA too. %U http://cea.ceaj.org/EN/abstract/article_35006.shtml