姚新,唐珂,梅一,刘佳琳,黄长武,童浩

• 1:南方科技大学斯发基斯可信自主系统研究院
• 2:南方科技大学广东省类脑智能计算重点实验室和计算机科学与工程系
• 3:新西兰惠灵顿维多利亚大学工程与计算机科学学院
• 4:伯明翰大学计算机科学学院

摘要(Abstract)：

交通是一个城市的血管。一个有生命力的城市,尤其是智慧城市,离不开智慧交通。智慧交通也是支撑智慧物流的一大支柱。在一个城市中收货送货是随时随地都在发生的活动。如何使这种活动变得更人性化、更智能化、更高效,这对我们而言是一个重要的挑战。本文着重介绍智慧物流和智慧交通中一个广泛存在的难题——限量弧优化问题,及其解决方法。我们对限量弧优化问题及其主要变种进行描述并指出它们之间的异同点,之后针对不同的限量弧优化问题介绍当前有效的解决方法和待解决的挑战。

关键词(KeyWords)： 智慧城市;限量弧优化问题;大规模限量弧优化问题;动态限量弧优化问题;智能优化

Abstract:

Keywords:

基金项目(Foundation): 广东省广创团队项目（2017ZT07X386）;; 广东省类脑智能计算重点实验室（2020B121201001）;; 深圳市孔雀团队项目（KQTD2016112514355531）;; 国家自然科学基金资助项目（61906083）;; 深圳市基础研究资助项目（JCYJ20190809121403553）;; 新西兰皇家学会

作者(Author): 姚新,唐珂,梅一,刘佳琳,黄长武,童浩

DOI: 10.16453/j.cnki.ISSN2096-5036.2021.05.011

参考文献(References)：

• [1]Handa H,Chapman L,Yao X.Robust route optimization for gritting/salting trucks:A CERCIA experience[J].IEEEComputational Intelligence Magazine,2006,1(1):6-9.
• [2]Liu J,Tang K,Yao X.Robust Optimization in Uncertain Capacitated Arc Routing Problems:Progresses and Perspectives[J].IEEE Computational Intelligence Magazine,2021,16(1):63-82.
• [3]Mei Y,Tang K,Yao X.Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem[J].IEEETransactions on Evolutionary Computation,2011,15(2):151-165.
• [4]Xing L N,Rohlfshagen P,Chen Y W,et al.A hybrid ant colony optimization algorithm for the extended capacitated arc routing problem[J].IEEE Transactions on Systems,Man,and Cybernetics,Part B (Cybernetics),2011,41(4):1110-1123.
• [5]Lacomme P,Prins C,Ramdane-Chérif W.Evolutionary algorithms for periodic arc routing problems[J].European Journal of Operational Research,2005,165(2):535-553.
• [6]Mei Y,Tang K,Yao X.A memetic algorithm for periodic capacitated arc routing problem[J].IEEE Transactions on Systems,Man,and Cybernetics,Part B (Cybernetics),2011,41(6):1654-1667.
• [7]Mei Y,Tang K,Yao X.A global repair operator for capacitated arc routing problem[J].IEEE Transactions on Systems,Man,and Cybernetics,Part B (Cybernetics),2009,39(3):723-734.
• [8]Lacomme P,Prins C,Ramdane-Chérif W.Evolutionary algorithms for multiperiod arc routing problems[C]//Proc.9th Int.Conf.Inf.Process.Manage.Uncertainty Knowl.-Based Syst.2002:845-852.
• [9]Lacomme P,Prins C,Ramdane-Cherif W.Competitive memetic algorithms for arc routing problems[J].Annals of Operations Research,2004,131(1):159-185.
• [10]Tang K,Mei Y,Yao X.Memetic algorithm with extended neighborhood search for capacitated arc routing problems[J].IEEETransactions on Evolutionary Computation,2009,13(5):1151-1166.
• [11]Deb K,Pratap A,Agarwal S,et al.A fast and elitist multiobjective genetic algorithm:NSGA-II[J].IEEE transactions on evolutionary computation,2002,6(2):182-197.
• [12]Zhang Q,Li H.MOEA/D:A multiobjective evolutionary algorithm based on decomposition[J].IEEE Transactions on evolutionary computation,2007,11(6):712-731.
• [13]Xing L,Rohlfshagen P,Chen Y,et al.An evolutionary approach to the multidepot capacitated arc routing problem[J].IEEETransactions on Evolutionary Computation,2009,14(3):356-374.
• [14]Stützle T,Hoos H H.MAX-MIN ant system[J].Future generation computer systems,2000,16(8):889-914.
• [15]Martinelli R,Aragao M,Subramanian A.Improved Bounds for Large Scale Capacitated Arc Routing Problem[J].Computers and Operations Research,2013,40(8):2145-2160.
• [16]Mei Y,Li X,Yao X.Cooperative coevolution with route distance grouping for large-scale capacitated arc routing problems[J].IEEE Transactions on Evolutionary Computation,2014,18(3):435-449.
• [17]Yang Z,Tang K,Yao X.Large scale evolutionary optimization using cooperative coevolution[J].Information Sciences,2008,178(15):2985-2999.
• [18]Tang K,Mei Y,Yao X.Memetic algorithm with extended neighborhood search for capacitated arc routing problems[J].IEEETransactions on Evolutionary Computation,2009,13(5):1151-1166.
• [19]Tang K,Wang J,Li X,et al.A scalable approach to capacitated arc routing problems based on hierarchical decomposition[J].IEEE transactions on cybernetics,2016,47(11):3928-3940.
• [20]Huang C,Li Y,Yao X.Adaptive-SAHi D algorithm for capacitated arc routing problems[C]//2019 IEEE Symposium Series on Computational Intelligence (SSCI).IEEE,2019:1668-1675.
• [21]Huang C,Li Y,Yao X.Online Parameter Tuned SAHi D Algorithm for Capacitated Arc Routing Problems[C]//2020 IEEECongress on Evolutionary Computation (CEC).IEEE,2020:1-8.
• [22]Liu J,Yao X.Self-adaptive decomposition and incremental hyperparameter tuning across multiple problems[C]//2019 IEEESymposium Series on Computational Intelligence (SSCI).IEEE,2019:1590-1597.
• [23]Consoli P A,Mei Y,Minku L L,et al.Dynamic selection of evolutionary operators based on online learning and fitness landscape analysis[J].Soft Computing,2016,20(10):3889-3914.
• [24]Consoli P,Yao X.Diversity-driven selection of multiple crossover operators for the capacitated arc routing problem[C]//European Conference on Evolutionary Computation in Combinatorial Optimization.Springer,Berlin,Heidelberg,2014:97-108.
• [25]Wang J,Tang K,Lozano J A,et al.Estimation of the distribution algorithm with a stochastic local search for uncertain capacitated arc routing problems[J].IEEE Transactions on Evolutionary Computation,2015,20(1):96-109.
• [26]Wang S,Mei Y,Zhang M,et al.Genetic Programming with Niching for Uncertain Capacitated Arc Routing Problem[J].IEEETransactions on Evolutionary Computation,2021.
• [27]Tong H,Minku L L,Menzel S,et al.Towards Novel Meta-heuristic Algorithms for Dynamic Capacitated Arc Routing Problems[C]//International Conference on Parallel Problem Solving from Nature.Springer,Cham,2020:428-440.
• [28]Tong H,Minku L L,Menzel S,et al.A hybrid local search framework for the dynamic capacitated arc routing problem[C]//Proceedings of the Genetic and Evolutionary Computation Conference Companion.2021:139-140.
• [29]Mei Y,Tang K,Yao X.Capacitated arc routing problem in uncertain environments[C]//IEEE Congress on Evolutionary Computation.IEEE,2010:1-8.
• [30]Liu Y,Mei Y,Zhang M,et al.Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem[C]//Proceedings of the Genetic and Evolutionary Computation Conference.2017:290-297.
• [31]Golden B L,De Armon J S,Baker E K.Computational experiments with algorithms for a class of routing problems[J].Computers&Operations Research,1983,10(1):47-59.
• [32]Liu M,Singh H K,Ray T.A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems[C]//2014 IEEE Congress on Evolutionary Computation (CEC).IEEE,2014:595-602.
• [33]Stolfi D H,Alba E,Yao X.Can I Park in the City Center?Predicting Car Park Occupancy Rates in Smart Cities[J].Journal of Urban Technology,2020,27(4):27-41.
• [34]Zhang H,Liu J,Yao X.A Hybrid Evolutionary Algorithm for Reliable Facility Location Problem[C]//International Conference on Parallel Problem Solving from Nature.Springer,Cham,2020:454-467.