Authors: Mladenović, Nenad 
Hansen, Pierre
Title: Variable neighborhood search
Journal: Computers and Operations Research
Volume: 24
Issue: 11
First page: 1097
Last page: 1100
Issue Date: 1-Jan-1997
Rank: M22
ISSN: 0305-0548
DOI: 10.1016/S0305-0548(97)00031-2
Abstract: 
Systematic change of neighborhood 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 [1], without and with backhauls [2].
Publisher: Elsevier
Project: ONR, Grant N00014-95-1-0917
NSERC, Grant GPO105574
FCAR, Grant 95ER1048

Show full item record

SCOPUSTM   
Citations

2,342
checked on Feb 28, 2021

Page view(s)

175
checked on Mar 1, 2021

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.