Yuxin Liu
ABSTRACT
Uncertain Capacitated Arc Routing Problem (UCARP) is a variant of the well-known CARP. It considers a variety of stochastic factors to reflect the reality where the exact information such as the actual task demand and accessibilities of edges are unknown in advance. Existing works focus on obtaining a robust solution beforehand. However, it is also important to design effective heuristics to adjust the solution in real time. In this paper, we develop a new Genetic Programming-based Hyper-Heuristic (GPHH) for automated heuristic design for UCARP. A novel effective meta-algorithm is designed carefully to address the failures caused by the environment change. In addition, it employs domain knowledge to filter some infeasible candidate tasks for the heuristic function. The experimental results show that the proposed GPHH significantly outperforms the existing GPHH methods and manually designed heuristics. Moreover, we find that eliminating the infeasible and distant tasks in advance can reduce much noise and improve the efficacy of the evolved heuristics. In addition, it is found that simply adding a slack factor to the expected task demand may not improve the performance of the GPHH.
- S.K. Amponsah and S. Salhi. 2004. The Investigation of a Class of Capacitated Arc Routing Problems: The Collection of Garbage in Developing Countries. Waste Management 24, 7 (2004), 711--721.Google Scholar
Cross Ref
- R. Baldacci and V. Maniezzo. 2006. Exact Methods Based on Node-Routing Formulations for Undirected Arc-Routing Problems. Networks 47, 1 (2006), 52--60. Google ScholarDigital Library
- E. Bartolini, J.-F. Cordeau, and G. Laporte. 2013. An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand. Operations Research 61, 2 (2013), 315--327.Google ScholarCross Ref
- J.F. Campbell and A. Langevin. 2000. Roadway Snow and Ice Control. Springer US, Boston, MA, 389--418.Google Scholar
- Y. Chen, J.K. Hao, and F. Glover. 2016. A Hybrid Metaheuristic Approach for the Capacitated Arc Routing Problem. European Journal of Operational Research 253, 1 (2016), 25--39.Google ScholarCross Ref
- C.H. Christiansen, J. Lysgaard, and S. Wøhlk. 2009. A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands. Operations Research Letters 37, 6 (2009), 392--398. Google ScholarDigital Library
- G. Fleury, P. Lacomme, and C. Prins. 2004. Evolutionary Algorithms for Stochastic Arc Routing Problems. Springer Berlin Heidelberg, 501--512.Google Scholar
- G. Fleury, P. Lacomme, C. Prins, and W. Ramdane-Chérif. 2005. Improving Robustness of Solutions to Arc Routing Problems. Journal of the Operational Research Society 56, 5 (2005), 526--538.Google ScholarCross Ref
- B.L. Golden and R.T. Wong. 1981. Capacitated Arc Routing Problems. Networks 11, 3 (1981), 305--315.Google ScholarCross Ref
- H. Handa, D. Lin, L. Chapman, and X. Yao. 2006. Robust Solution of Salting Route Optimisation Using Evolutionary Algorithms. In 2006 IEEE International Conference on Evolutionary Computation. 3098--3105.Google Scholar
- P. Lacomme, C. Prins, and W. Ramdane-Cherif. 2004. Competitive Memetic Algorithms for Arc Routing Problems. Annals of Operations Research 131, 1 (2004), 159--185.Google ScholarCross Ref
- Y. Mei, X. Li, and X. Yao. 2014. Cooperative Coevolution With Route Distance Grouping for Large-Scale Capacitated Arc Routing Problems. IEEE Transactions on Evolutionary Computation 18, 3 (2014), 435--449.Google ScholarCross Ref
- Y. Mei, K. Tang, and X. Yao. 2009. A Global Repair Operator for Capacitated Arc Routing Problem. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 39, 3 (2009), 723--734. Google ScholarDigital Library
- Y. Mei, K. Tang, and X. Yao. 2010. Capacitated Arc Routing Problem in Uncertain Environments. In IEEE Congress on Evolutionary Computation. 1--8.Google Scholar
- V. Pillac, M. Gendreau, C. Guéret, and A.L. Medaglia. 2013. A Review of Dynamic Vehicle Routing Problems. European Journal of Operational Research 225, 1 (2013), 1--11.Google ScholarCross Ref
- U. Ritzinger, J. Puchinger, and R.F. Hartl. 2016. A Survey on Dynamic and Stochastic Vehicle Routing Problems. International Journal of Production Research 54, 1 (2016), 215--231.Google ScholarCross Ref
- L. Santos, J. Coutinho-Rodrigues, and J.R. Current. 2009. An Improved Heuristic for the Capacitated Arc Routing Problem. Computers & Operations Research 36, 9 (2009), 2632--2637. Google ScholarDigital Library
- L. Santos, J. Coutinho-Rodrigues, and J.R. Current. 2010. An Improved Ant Colony Optimization Based Algorithm for the Capacitated Arc Routing Problem. Transportation Research Part B: Methodological 44, 2 (2010), 246--266.Google ScholarCross Ref
- K. Tang, Y. Mei, and X. Yao. 2009. Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems. IEEE Transactions on Evolutionary Computation 13, 5 (2009), 1151--1166. Google ScholarDigital Library
- J. Wang, K. Tang, J. A. Lozano, and X. Yao. 2016. Estimation of the Distribution Algorithm With a Stochastic Local Search for Uncertain Capacitated Arc Routing Problems. IEEE Transactions on Evolutionary Computation 20, 1 (2016), 96--109.Google ScholarDigital Library
- J. Wang, K. Tang, and X. Yao. 2013. A Memetic Algorithm for Uncertain Capacitated Arc Routing Problems. In 2013 IEEE Workshop on Memetic Computing. 72--79.Google Scholar
- T. Weise, A. Devert, and K. Tang. 2012. A Developmental Solution to (Dynamic) Capacitated Arc Routing Problems Using Genetic Programming. In Proceedings of GECCO. ACM, 831--838. Google ScholarDigital Library
- E.J. Willemse and J.W. Joubert. 2016. Constructive Heuristics for the Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities. Computers & Operations Research 68 (2016), 30--62. Google ScholarDigital Library
Index Terms
- Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem
Recommendations
Genetic programming hyper-heuristic for multi-vehicle uncertain capacitated arc routing problem
GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference CompanionThis paper investigates evolving routing policy for general Uncertain Capacitated Arc Routing Problems (UCARP) with any number of vehicles, and for the first time, designs a novel model for online decision making (i.e. meta-algorithm) for multiple ...
A Combined Generative and Selective Hyper-heuristic for the Vehicle Routing Problem
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016Hyper-heuristic methods for solving vehicle routing problems (VRP) have proved promising on a range of data. The vast majority of approaches apply selective hyper-heuristic methods that iteratively choose appropriate heuristics from a fixed set of pre-...
Iterated local search using an add and delete hyper-heuristic for university course timetabling
Graphical abstractDisplay Omitted HighlightsAdd and delete operations are encoded as a list/string of integers (ADL).An effective hyper-heuristic approach operating with ADLs is proposed.Low level heuristics perform search over the space of feasible ...
Comments