Talks and Poster Presentations (with Proceedings-Entry):

S. Pirkwieser, G. Raidl:
"Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problem";
Talk: International Workshop on Hybrid Metaheuristics (HM), Wien; 2010-10-01 - 2010-10-02; in: "Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010", (2010), 174 - 189.

English 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 ne-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.

Electronic version of the publication:

Created from the Publication Database of the Vienna University of Technology.