Variable neighborhood search

被引：2721

作者：

Mladenovic, N

Hansen, P

机构：

[1] GERAD, MONTREAL, PQ H3T 2A7, CANADA

[2] ECOLE HAUTES ETUD COMMERCIALES, MONTREAL, PQ H3T 2A7, CANADA

来源：

COMPUTERS & OPERATIONS RESEARCH | 1997年 / 24卷 / 11期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1016/S0305-0548(97)00031-2

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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]. (C) 1997 Elsevier Science Ltd.

引用

页码：1097 / 1100

页数：4

共 9 条

[1] Bentley J. L., 1992, ORSA Journal on Computing, V4, P387, DOI 10.1287/ijoc.4.4.387
[2] DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION
ERLENKOTTER, D
[J]. OPERATIONS RESEARCH, 1978, 26 (06) : 992 - 1009
[3] NEW INSERTION AND POSTOPTIMIZATION PROCEDURES FOR THE TRAVELING SALESMAN PROBLEM
GENDREAU, M
HERTZ, A
LAPORTE, G
[J]. OPERATIONS RESEARCH, 1992, 40 (06) : 1086 - 1094
[4] The traveling salesman problem with backhauls
Gendreau, M
Hertz, A
Laporte, G
[J]. COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (05) : 501 - 508
[5] Glover F., 1990, ORSA Journal on Computing, V2, P4, DOI [10.1287/ijoc.1.3.190, 10.1287/ijoc.2.1.4]
[6] ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM
HANSEN, P
JAUMARD, B
[J]. COMPUTING, 1990, 44 (04) : 279 - 303
[7] JOHNSON DL, 1997, IN PRESS LOCAL SEARC
[8] Osman IH, 1996, ANN OPER RES, V63, P513
[9] Reeves CR., 1993, Modern Heuristic Techniques for Combinatorial Problems

← 1 →