Improved ITO Algorithm for Multiobjective Real-time Vehicle Routing Problem with Customers' Satisfaction
YI Yun-fei1,2,3, CAI Yong-le1, DONG Wen-yong1, LIN Xiao-dong2
1. Computer School, Wuhan University.Wuhan, Hubei 430079, China;
2. College of Computer and Information Engineering, Hechi University.Yizhou, Guangxi 546300, China;
3. Guangxi Universities Key Laboratory Breeding Base of System Control and Information Processing.Yizhou, Guangxi 546300, China
Based on the analysis of the standard vehicle routing problem, we proposed a multiobjective real-time vehicle routing problem model, referred as MR-VRPCS.The MR-VRPCS considers the traffic factors, customer demand dynamic change and customers' satisfaction.As we know, the ITO algorithm has low efficiency and poor convergence performance on the discrete combinatorial optimization problems.Therefore, we apply the universal framework of ITO and introduce the Ant Colony Optimization algorithm, which has got depth studied in vehicle routing problem, to design the ITO-Ant Optimization algorithm.We analyze the IAO algorithm's parameter setting problem by the method of orthogonal experiment.Finally, we use the Solomon benchmark test data to prove the effectiveness of the IAO algorithm, and adjust the standard test data to the MR-VRPCS model's, and resolve it with IAO.The experimental results show the feasibility and effectiveness of the proposed model and algorithm.
易云飞, 蔡永乐, 董文永, 林晓东. 求解带用户满意度的多目标实时车辆路径问题的改进伊藤算法[J]. 电子学报, 2015, 43(10): 2053-2061.
YI Yun-fei, CAI Yong-le, DONG Wen-yong, LIN Xiao-dong. Improved ITO Algorithm for Multiobjective Real-time Vehicle Routing Problem with Customers' Satisfaction. Chinese Journal of Electronics, 2015, 43(10): 2053-2061.
[1] Dantzig G,Ramser J.The truck dispatching problem[J].Management Science,1959,6(1):80-91.
[2] Tang Guochun,Aibing Ning,et al.A practical split vehicle routing problem with simultaneous pickup and delivery[A].16th International Conference on Industrial Engineering and Engineering Management[C].Beijing:IEEE,2009.26-30.
[3] A LKok,E W Hans,J M J Schutten.Vehicle routing under time-dependent travel times:the impact of congestion avoidance[J].Computer & Operations Reasearch,2012,39(5):910-918.
[4] S Geetha,G Poonthalir,et al.A hybrid particle swarm optimization with genetic operators for vehicle routing problem[J].Journal of Advances in Information Technology,2010,1(4):181-188.
[5] Michalis Mavrovouniotis,Shengxiang Yang.Ant colony optimization with memory-based immigrants for the dynamic vehicle routing problem[A].2012 IEEE Congress on Evolutionary Computation[C].Brisbane:IEEE,2012.1-8.
[6] 易云飞,董文永,等.求解带软时间窗车辆路径问题的改进伊藤算法及其收敛性分析[J].电子学报,2015,43(4):658-664. Yi Yunfei,Dong Wenyong,et al.The improved ITO algorithm to solve the vehicle routing problem with soft time windows and its convergence analysis[J].Acta Electronica Sinica,2015,43(4):658-664.(in Chinese)
[7] 董文永,张文生,于瑞国.求解组合优化问题伊藤算法的收敛性和期望收敛速度分析[J].计算机学报,2011,34(4):636-646. Dong Wenyong,Zhang Wensheng,et al.Convergence and runtime analysis of ITO algorithm for one class of combinatorial optimization[J].Chinese Journal of Computers.2011,34 (4):636-646.(in Chinese)
[8] 喻飞,李元香,等.透镜成像反学习策略在粒子群算法中的应用[J].电子学报,2014,42(2):230-235. Yu fei,Li Yuanxiang,et al.The applica-tion of a novel OBL based on lens imaging principle in PSO[J].Acta Electronica Sinica,2014,42(2):230-235.(in Chinese)
[9] S FGhannadpour,S Noori,R Tavakkoli Moghaddam.Multiobjective dynamic vehicle routing problem with fuzzy travel times and customers' satisfaction in supply chain management[J].IEEE Trans Eng Manage,2013,60(4):777-790.
[10] Quan XiongWen,Xu Ya.Dynamic pick-up and delivery vehicle routing problem with ready-time and deadline[A].32nd Chinese Control Conference[C].Xi'an:IEEE,2013.2515-2520.
[11] Barry van Veen,Michael Emmerich,et al.Ant colony algorithms for the dynamic vehicle routing problem with time windows[A].5th International Work Conference on the Interplay Between Natural and Artificial Computation (IWINAC 2013)[C].Mallorca:Springer Berlin Heidelberg,2013.1-10.