A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic
- 388 Downloads
Adaptive large neighborhood search (ALNS) is a useful framework for solving difficult combinatorial optimisation problems. As a metaheuristic, it consists of some components that must be tailored to the specific optimisation problem that is being solved, while other components are problem independent. The literature is sparse with respect to studies that aim to evaluate the relative merit of different alternatives for specific problem independent components. This paper investigates one such component, the move acceptance criterion in ALNS, and compares a range of alternatives. Through extensive computational testing, the alternative move acceptance criteria are ranked in three groups, depending on the performance of the resulting ALNS implementations. Among the best variants, we find versions of criteria based on simulated annealing, threshold acceptance, and record-to-record travel, with a version of the latter being consistently undominated by the others. Additional analyses focus on the search behavior, and multiple linear regression is used to identify characteristics of search behavior that are associated with good search performance.
KeywordsAdaptive large neighbourhood search Simulated annealing Threshold acceptance Record-to-record travel Vehicle routing problem Capacitated minimum spanning tree Quadratic assignment problem
The authors thank two anonymous referees for their helpful comments that led to several improvements of the original manuscript.
- Burak, B., Özcan, E., Korkmaz, E.E.: An experimental study on hyper-heuristics and exam timetabling. In: International Conference on the Practice and Theory of Automated Timetabling, pp 394–412. Springer, Berlin (2006)Google Scholar
- Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: PATAT 2008 Conference, Montreal, Canada (2008)Google Scholar
- Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Technical Report CSM-192, University of Stirling, Technical Report (2012)Google Scholar
- Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Mingozzi, A., Toth, P., Sandi, C., Christofides, N. (eds.) Combinatorial Optimization, pp. 315–338. Wiley, New York (1979)Google Scholar
- Furini, F., Malaguti, E., Santini, A.: An exact algorithm for the Partition Coloring Problem. Comput. Oper. Res. 1–17 (2017) (submitted)Google Scholar
- Glover, F.: Multi-start and strategic oscillation methods principles to exploit adaptive memory. In: Laguna, M., Velarde, J.L.G. (eds.) Computing Tools for Modeling, Optimization and Simulation, Operations Research/Computer Science Interfaces Series, vol. 12, pp. 1–24. Springer, Boston, MA (2000)CrossRefGoogle Scholar
- Irnich, S., Toth, P., Vigo, D.: The family of vehicle routing problems. In: Toth, P., Vigo, D. (eds.) Vehicle Routing: Problems, Methods, and Applications, Chap 1, 2nd edn, pp. 1–33. SIAM, Philadelphia (2014)Google Scholar
- Landa-Silva, D., Obit, J.: Great deluge with non-linear decay rate for solving course timetabling problems. In: 4th International IEEE Conference on Intelligent Systems, 2008. IS’08, vol. 1, pp. 8–11. IEEE (2008)Google Scholar
- Ropke, S., Santini, A.: Parallel adaptive large neighbourhood search. OR-16-11, DEI University of Bologna (2016)Google Scholar
- Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: CP-98 (Fourth International Conference on Principles and Practice of Constraint Programming), Lecture Notes in Computer Science, vol. 1520, pp. 417–431 (1998)Google Scholar
- Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Subramanian, A., Vidal, T.: New benchmark instances for the capacitated vehicle routing problem. Technical Report, UFF, Rio de Janeiro, Brazil. http://www.optimization-online.org/DB_HTML/2014/10/4597.html (2014)