Variable neighborhood search coupled with ILP-based very large neighborhood searches for the (periodic) location-routing problem

  • Authors:

  • Sandro Pirkwieser;Günther R. Raidl

  • Affiliations:

  • Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria

  • Venue:
  • HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work deals with the application of a variable neighborhood search (VNS) to the capacitated location-routing problem (LRP) as well as to the more general periodic LRP (PLRP). For this, previous successful VNS algorithms for related problems are considered and accordingly adapted as well as extended. The VNS is subsequently combined with three very large neighborhood searches (VLNS) based on integer linear programming: Two operate on whole routes and do a rather coarse, yet powerful optimization, with the more sophisticated one also taking the single customers into account, and the third operates on customer sequences to do a more fine-grained optimization. Several VNS plus VLNS combinations are presented and very encouraging experimental results are given. Our method clearly outperforms previous PLRP approaches and is at least competitive to leading approaches for the LRP.