Automatic Parameter Tuning using Bayesian Optimization Method

The Capacitated Arc Routing Problem (CARP) is an essential and challenging problem in smart logistics. Parameter tuning is commonly encountered in designing and applying heuristic or meta-heuristic algorithms for CARP. Recently, automatic parameter tuning or hyper-parameter optimization, which focuses on automatically finding an optimal parameter setting of an algorithm for problems at hand, has attracted considerable attention and become popular for addressing parameter tuning problems. This paper studies automatic parameter tuning for advanced algorithms in solving CARP. When designing algorithms for CARP, parameters are usually determined through empirical analysis or following some rules of thumb. This paper uses an automatic parameter tuning approach, that is, Bayesian optimization method, to tune an algorithm called SAHiD, which is a scalable approach based on hierarchical decomposition for large-scale CARP. The experimental results show that the algorithm’s performance can be significantly improved with automatic parameter tuning. The tuned SAHiD algorithm obtains better solutions and faster convergence speed than original SAHiD on test CARP instances.

[1]  Leslie Pérez Cáceres,et al.  The irace package: Iterated racing for automatic algorithm configuration , 2016 .

[2]  Xin Yao,et al.  Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems , 2009, IEEE Transactions on Evolutionary Computation.

[3]  Holger H. Hoos,et al.  Automated Algorithm Configuration and Parameter Tuning , 2012, Autonomous Search.

[4]  Mauro Birattari,et al.  Tuning Metaheuristics - A Machine Learning Perspective , 2009, Studies in Computational Intelligence.

[5]  A. E. Eiben,et al.  Evolutionary Algorithm Parameters and Methods to Tune Them , 2012, Autonomous Search.

[6]  Rolf Niedermeier,et al.  Chapter 2: The Complexity of Arc Routing Problems , 2013 .

[7]  Bertrand Neveu,et al.  A beginner's guide to tuning methods , 2014, Appl. Soft Comput..

[8]  Jasper Snoek,et al.  Practical Bayesian Optimization of Machine Learning Algorithms , 2012, NIPS.

[9]  Luc Muyldermans,et al.  A guided local search heuristic for the capacitated arc routing problem , 2003, Eur. J. Oper. Res..

[10]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[11]  Donald R. Jones,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..

[12]  Luc Muyldermans,et al.  Districting for salt spreading operations , 2002, Eur. J. Oper. Res..

[13]  Paulo Morelato França,et al.  GRASP with evolutionary path-relinking for the capacitated arc routing problem , 2013, Comput. Oper. Res..

[14]  Nando de Freitas,et al.  Taking the Human Out of the Loop: A Review of Bayesian Optimization , 2016, Proceedings of the IEEE.

[15]  Philippe Lacomme,et al.  Evolutionary algorithms for periodic arc routing problems , 2005, Eur. J. Oper. Res..

[16]  Andrew W. Moore,et al.  Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation , 1993, NIPS.

[17]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[18]  Chris Eliasmith,et al.  Hyperopt-Sklearn: Automatic Hyperparameter Configuration for Scikit-Learn , 2014, SciPy.

[19]  Xin Yao,et al.  Dynamic selection of evolutionary operators based on online learning and fitness landscape analysis , 2016, Soft Comput..

[20]  Carl E. Rasmussen,et al.  Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.

[21]  Philippe Lacomme,et al.  Competitive Memetic Algorithms for Arc Routing Problems , 2004, Ann. Oper. Res..

[22]  Moshe Dror,et al.  Routing electric meter readers , 1979, Comput. Oper. Res..

[23]  Thomas Stützle,et al.  A Racing Algorithm for Configuring Metaheuristics , 2002, GECCO.

[24]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[25]  Xin Yao,et al.  Population-based Algorithm Portfolios with automated constituent algorithms selection , 2014, Inf. Sci..

[26]  Wen Lea Pearn,et al.  Approximate solutions for the capacitated arc routing problem , 1989, Comput. Oper. Res..

[27]  Thomas Stützle,et al.  Continuous optimization algorithms for tuning real and integer parameters of swarm intelligence algorithms , 2011, Swarm Intelligence.

[28]  Richard W. Eglese,et al.  A deterministic tabu search algorithm for the capacitated arc routing problem , 2008, Comput. Oper. Res..

[29]  Thomas Stützle,et al.  An analysis of post-selection in automatic configuration , 2013, GECCO '13.

[30]  Kevin Leyton-Brown,et al.  Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.

[31]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[32]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[33]  G. Ulusoy.  The fleet size and mix problem for capacitated arc routing , 1985 .

[34]  Kevin P. Murphy,et al.  Time-Bounded Sequential Parameter Optimization , 2010, LION.

[35]  Thomas Bartz-Beielstein,et al.  Sequential parameter optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[36]  A. E. Eiben,et al.  Parameter Tuning of Evolutionary Algorithms: Generalist vs. Specialist , 2010, EvoApplications.

[37]  Andy J. Keane,et al.  Recent advances in surrogate-based optimization , 2009 .

[38]  Meng Zhao,et al.  Tuning the hyper-parameters of CMA-ES with tree-structured Parzen estimators , 2018, 2018 Tenth International Conference on Advanced Computational Intelligence (ICACI).

[39]  Yoshua Bengio,et al.  Algorithms for Hyper-Parameter Optimization , 2011, NIPS.

[40]  Gilbert Laporte,et al.  A fast heuristic for large-scale capacitated arc routing problems , 2018, J. Oper. Res. Soc..

[41]  Sanne Wøhlk.  A Decade of Capacitated Arc Routing , 2008 .

[42]  H. Handa,et al.  Robust route optimization for gritting/salting trucks: a CERCIA experience , 2006, IEEE Computational Intelligence Magazine.

[43]  James F. Campbell,et al.  Roadway Snow and Ice Control , 2000 .

[44]  Thomas J. Santner,et al.  Space-Filling Designs for Computer Experiments , 2003 .

[45]  Xiaodong Li,et al.  A Scalable Approach to Capacitated Arc Routing Problems Based on Hierarchical Decomposition , 2017, IEEE Transactions on Cybernetics.

[46]  Thomas Stützle,et al.  Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement , 2007, Hybrid Metaheuristics.

[47]  Kevin Leyton-Brown,et al.  Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms , 2012, KDD.