A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem

Akpunar O. S., AKPINAR Ş.

EXPERT SYSTEMS WITH APPLICATIONS, cilt.168, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 168
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1016/j.eswa.2020.114304
  • Dergi Adı: EXPERT SYSTEMS WITH APPLICATIONS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Computer & Applied Sciences, INSPEC, Metadex, Public Affairs Index, Civil Engineering Abstracts
  • Anahtar Kelimeler: Location routing problem, Hybrid metaheuristic, Adaptive large neighbourhood search, Variable neighbourhood search
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

This paper proposes a new hybrid metaheuristic algorithm that is composed of the adaptive large neighbourhood search (ALNS) and the variable neighbourhood search (VNS) algorithms to tackle the location routing problem (LRP) with capacity constraints. The rationale of the proposed hybrid metaheuristic algorithm is to enhance the performance of the ALNS algorithm by incorporating the VNS algorithm as an elitist local search. Therefore, the diversification and intensification strategies of the proposed hybrid metaheuristic algorithm are realized via the ALNS and VNS algorithms, respectively. The performance evaluation tests of the proposed hybrid metaheuristic algorithm are performed on the three classical LRP benchmark sets taken from the related literature, and the obtained results are compared against some of the formerly proposed and published methods in terms of solution quality. Computational results indicate that the proposed hybrid metaheuristic algorithm has a satisfactory performance in solving the LRP instances and is a competitive algorithm.