Variable neighbourhood search

Variable neighbourhood search

0.00 Avg rating0 Votes
Article ID: iaor19981828
Country: United Kingdom
Volume: 24
Issue: 11
Start Page Number: 1097
End Page Number: 1100
Publication Date: Nov 1997
Journal: Computers and Operations Research
Authors: ,
Keywords: programming: travelling salesman
Abstract:

Systematic change of neighbourhood within a local search algorithm yields a simple and effective metaheuristic for combinatorial optimization. We present a basic scheme for this purpose which can be implemented easily using any local search algorithm as a subroutine. Its effectiveness is illustrated by improvements in the GENIUS algorithm for the traveling salesman problem, without and with backhauls.

Reviews

Required fields are marked *. Your email address will not be published.