Heuristic Algorithm to Solve Vehicle Routing Problem with Split Pickups and DeliveriesYang Ya-zao, Jin Wen-zhou, Hao Xiao-ni, Tian Sheng 1. School of Business Administration, South China University of Technology, Guangzhou 510640, Guangdong, China; 2. School of Civil Engineering and Transportation, South China University of Technology, Guangzhou 510640, Guangdong, ChinaAbstract:In order to save the transportation cost and improve the efficiency of logistics services, the vehicle rou- ting problem with split pickups and deliveries is investigated. According to the characteristics of this problem, that is, multiple visits for a certain task point or for the same task point by a certain vehicle are allowed, a three-phase heuristic algorithm, which splits the demands of pickups and deliveries at some task points and minimizes the total driving distance of vehicles, is proposed. Numerical results show that the proposed algorithm helps to obtain reaso- nable vehicle routings, especially with the case of total delivery amount being greater than total pickup amount.