[Zurück]

S. Pirkwieser, G. Raidl:
"Multilevel variable neighborhood search for periodic routing problems";
Vortrag: EvoCOP 2010, Istanbul, Turkey; 07.04.2010 - 09.04.2010; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010", (2010), S. 226 - 238.

In this work we present the extension of a variable neighborhood
search (VNS) with the multilevel re nement strategy for periodic
routing problems. The underlying VNS was recently proposed and performs
already well on these problems. We apply a path based coarsening
scheme by building xed (route) segments of customers accounting for
the periodicity. Starting at the coarsest level the problem is iteratively
re ned until the original problem is reached again. This re nement is
smoothly integrated into the VNS. Further a suitable solution-based recoarsening
is proposed. Results on available benchmark test data as well
as on newly generated larger instances show the advantage of the multilevel
VNS compared to the standard VNS, yielding better results in
usually less CPU time. This new approach is especially appealing for
large instances.

http://publik.tuwien.ac.at/files/PubDat_189079.pdf