A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse

Authors:
Matthias Prandtstetter;Günther R. Raidl;Thomas Misar
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Venue:
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Year:
2009

Citing 5
Cited 1

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Vehicle routing with split deliveries

Discrete Applied Mathematics
The vehicle routing problem

The vehicle routing problem
Dynamic Programming

Dynamic Programming
A Variable Neighborhood Search Integrated in the POPMUSIC Framework for Solving Large Scale Vehicle Routing Problems

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics

Hybrid heuristics for multimodal homecare scheduling

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

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.