Variable neighborhood search Export

@article{citeulike:4928850, 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].}, author = {Mladenovic, N. and Hansen, P.}, citeulike-article-id = {4928850}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/S0305-0548(97)00031-2}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305-0548(97)00031-2}, doi = {10.1016/S0305-0548(97)00031-2}, issn = {03050548}, journal = {Computers \& Operations Research}, keywords = {1997, metaheuristics, optimization, vns}, month = {November}, number = {11}, pages = {1097--1100}, posted-at = {2009-09-29 18:42:57}, priority = {2}, title = {Variable neighborhood search}, url = {http://dx.doi.org/10.1016/S0305-0548(97)00031-2}, volume = {24}, year = {1997} }

TY - JOUR ID - citeulike:4928850 L3 - citeulike-article-id:4928850 N2 - 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]. IS - 11 JF - Computers & Operations Research SN - 03050548 EP - 1100 TI - Variable neighborhood search VL - 24 SP - 1097 KW - 1997 KW - metaheuristics KW - optimization KW - vns AU - Mladenovic, N AU - Hansen, P PY - 1997/11// UR - http://dx.doi.org/10.1016/S0305-0548(97)00031-2 ER -