Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Koster, R., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: A literature review. European Journal of Operational Research 182(2), 481–501 (2007)
Toth, P., Vigo, D.: The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications, vol. 9. SIAM, Philadelphia (2002)
Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with split deliveries. Discrete Applied Mathematics 50(3), 239–254 (1994)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254–265 (1987)
Ralphs, T.K., Kopman, L., Pulleyblank, W.R., Trotter, L.E.: On the capacitated vehicle routing problem. Mathematical Programming 94(2–3), 343–359 (2003)
Feremans, C., Labbe, M., Laporte, G.: Generalized network design problems. European Journal of Operational Research 148(1), 1–13 (2003)
Hansen, P., Mladenović, N.: Variable neighborhood search. In: Glover, Kochenberger (eds.) Handbook of Metaheuristics, pp. 145–184. Kluwer Academic Publisher, Dordrecht (2003)
Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research (2007) (in press), doi:10.1016/j.ejor.2007.08.048
Ostertag, A., Dörner, K.F., Hartl, R.F.: A variable neighborhood search integrated in the POPMUSIC framework for solving large scale vehicle routing problems. In: Blesa, M.J., Blum, C., Cotta, C., Fernández, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol. 5296, pp. 29–42. Springer, Heidelberg (2008)
Bellman, R.E.: Dynamic Programming. Dover Publications Inc., Mineola (2003)
Hu, B., Raidl, G.R.: Variable neighborhood descent with self-adaptive neighborhood-ordering. In: Cotta, C., Fernandez, A.J., Gallardo, J.E. (eds.) Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics (2006)
Puchinger, J., Raidl, G.R.: Relaxation guided variable neighborhood search. In: Proceedings of the XVIII Mini EURO Conference on VNS (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prandtstetter, M., Raidl, G.R., Misar, T. (2009). A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse. In: Cotta, C., Cowling, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2009. Lecture Notes in Computer Science, vol 5482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01009-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-01009-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01008-8
Online ISBN: 978-3-642-01009-5
eBook Packages: Computer ScienceComputer Science (R0)