Advertisement
Published in:
2010 | OriginalPaper | Chapter
Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem
Authors : Sandro Pirkwieser, Günther R. Raidl
Published in: Hybrid Metaheuristics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.