[Zurück]

M. Prandtstetter, G. Raidl, T. Misar:
"A hybrid algorithm for computing tours in a spare parts warehouse";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Tübingen, Deutschland; 15.04.2009 - 17.04.2009; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2009", Springer, (2009), S. 25 - 36.

We consider a real-world problem arising in a warehouse for
spare parts. Items ordered by customers shall be collected and for this
purpose our task is to determine efficient pickup tours within the warehouse.
The algorithm we propose embeds a dynamic programming algorithm
for computing individual optimal walks through the warehouse
in a general variable neighborhood search (VNS) scheme. To enhance
the performance of our approach we introduce a new self-adaptive variable
neighborhood descent used as local improvement procedure within
VNS. Experimental results indicate that our method provides valuable
pickup plans, whereas the computation times are kept low and several
constraints typically stated by spare parts suppliers are fulfilled.

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