An efficient implementation of a static move descriptor-based local search heuristic

Onne Beek, Birger Raa, Wout Dullaert

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

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.

Original languageEnglish
Title of host publicationICORES 2013 - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems
Pages277-282
Number of pages6
Publication statusPublished - 2013
Event2nd International Conference on Operations Research and Enterprise Systems, ICORES 2013 - Barcelona, Spain
Duration: 16 Feb 201318 Feb 2013

Conference

Conference2nd International Conference on Operations Research and Enterprise Systems, ICORES 2013
CountrySpain
CityBarcelona
Period16/02/1318/02/13

Keywords

  • Efficient local search
  • Heuristic priority queue
  • Static move descriptors
  • Vehicle routing

Fingerprint Dive into the research topics of 'An efficient implementation of a static move descriptor-based local search heuristic'. Together they form a unique fingerprint.

Cite this