基于剩余装载能力的蚁群算法求解同时送取货车辆路径问题.pdfVIP

26 5 Vol. 26 No. 5 2009 5 Control Theory Applications May. 2009 :2009 , , , (1. , 200433; 2. , 201209; 3. , , 200433; 4. , 110004) : ; ; , , ; , . . : ; ; ; : O223 : A A residual-loading-capacity-based ant colony system for the vehicle routing problem with simultaneous delivery and pickup ZHANG Tao , TIAN Wen-xin , ZHANG Yue-jie , LIU Shi-xin (1. School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai 200433, China; 2. Informatization Office in Center of Modern Education Technology, Shanghai Finance University, Shanghai 201209, China; 3. School of Computer Science, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, Shanghai 200433, China; 4. School of Information Science and Engineering, Northeastern University, Shenyang Liaoning 110004, China) Abstract: The vehicle routing problem with simultaneous delivery and pickup (VRPSDP) is studied under capacity constraint and maximum distance constraint; and the mixed integer programming model is built. To deal with the fluctuation in vehicle load, we propose an ant colony system (ACS) approach by combining the pheromone updating strategy of rank- based version of the ant system (ASRank) with the MAX-MIN ant system (MMAS). A heuristic factor based on the residual loading capacity is also designed to improve the vehicle loading rate. Additionally, a local search strategy of node-exchange is used in the process of tour improvement to accel