An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic

Onne Beek, Birger Raa, Wout Dullaert

Abstract

The Vehicle Routing Problem is a well-studied problem. Since its formulation in 1959, a great number of powerful solution methods have been designed. However, for large scale problems, few techniques are able to consistently find good solutions within an acceptable time limit. In this paper, the concept of Static Move Descriptors, a recently published technique for speeding up Local Search algorithms, is analyzed and an efficient implementation is suggested. We describe several changes that significantly improve the performance of an SMD-based Local Search algorithm. The result is an efficient and flexible technique that can easily be adapted to different metaheuristics and can be combined with other complexity reduction strategies.

References

  1. Bentley, J. L. (1990). Experiments on traveling salesman heuristics. In Proceedings of the first annual ACMSIAM symposium on Discrete algorithms, SODA 7890, pages 91-99. Society for Industrial and Applied Mathematics.
  2. Clarke, G. and Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations research, 12(4):568-581.
  3. Cordeau, J. and Maischberger, M. (2011). A parallel iterated tabu search heuristic for vehicle routing problems. Computers & Operations Research.
  4. Croes, G. (1958). A method for solving traveling-salesman problems. Operations Research, 6(6):791-812.
  5. Fredman, M. and Tarjan, R. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM), 34(3):596-615.
  6. Gendreau, M., Hertz, A., and Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management science, 40(10):1276-1290.
  7. Glover, F. (1990). Tabu search-part II. ORSA Journal on computing, 2(I):4-32.
  8. Johnson, D. (1975). Priority queues with update and finding minimum spanning trees. Information Processing Letters, 4(3).
  9. Kilby, P., Prosser, P., and Shaw, P. (1997). Guided local search for the vehicle routing problem. Proceedings of the 2nd International Conference on Meta-heuristics.
  10. Kytö joki, J., Nuortio, T., Bräysy, O., and Gendreau, M. (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research, 34(9):2743-2757.
  11. Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4):408-416.
  12. Lee, C., Lee, Z., Lin, S., and Ying, K. (2010). An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Applied Intelligence, 32(1):88-95.
  13. Lenstra, J. and Kan, A. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2):221- 227.
  14. Lin, S. (1965). Computer solutions of the traveling salesman problem. Bell System Technical Journal.
  15. Mladenovic, N. and Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11):1097 - 1100.
  16. Nguyen, H. and Yoshihara, I. (2007). Implementation of an effective hybrid GA for large-scale traveling salesman problems. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, 37(1):92-9.
  17. Rego, C. (2001). Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Parallel Computing, 27(3):201-222.
  18. Thompson, P. M. and Psaraftis, H. N. (1993). Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems. Operations Research, 41(5):935-946.
  19. Voudouris, C., Tsang, E., and Alsheddy, A. (2010). Guided local search. Handbook of metaheuristics, pages 185- 218.
  20. Xu, J. and Kelly, J. (1996). A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science, 30(4):379-393.
  21. Zachariadis, E. and Kiranoudis, C. (2010). A strategy for reducing the computational complexity of local searchbased methods for the vehicle routing problem. Computers & Operations Research, 37(12):2089-2105.
Download


Paper Citation


in Harvard Style

Beek O., Raa B. and Dullaert W. (2013). An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic . In Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-8565-40-2, pages 277-282. DOI: 10.5220/0004284102770282


in Bibtex Style

@conference{icores13,
author={Onne Beek and Birger Raa and Wout Dullaert},
title={An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic},
booktitle={Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2013},
pages={277-282},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004284102770282},
isbn={978-989-8565-40-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic
SN - 978-989-8565-40-2
AU - Beek O.
AU - Raa B.
AU - Dullaert W.
PY - 2013
SP - 277
EP - 282
DO - 10.5220/0004284102770282