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. © 2019 IEEE.
|Title of host publication
|2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings
|Institute of Electrical and Electronics Engineers Inc.
|Number of pages
|Published - Jun 2019
Bibliographical noteThis work was supported by National Key R&D Program of China (Grant No. 2017YFC0804003), the Program for Guangdong Introducing Innovative and Enter-preneurial Teams (Grant No. 2017ZT07X386), Shenzhen Peacock Plan (Grant No. KQTD2016112514355531), the Program for University Key Laboratory of Guangdong Province (Grant No. 2017KSYS008), and the Science and Technology Innovation Committee Foundation of Shenzhen (Grant Nos. ZDSYS201703031748284, JCYJ20170307105521943, JCYJ20170817112421757).
- automatic parameter tuning
- Bayesian optimization
- Capacitated arc routing problem (CARP)