An object-oriented methodology for solving assignment-type problems with neighborhood search techniques
成果类型：
Article
署名作者：
Ferland, JA; Hertz, A; Lavoie, A
署名单位：
Swiss Federal Institutes of Technology Domain; Ecole Polytechnique Federale de Lausanne
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.44.2.347
发表日期：
1996
页码：
347-359
关键词：
摘要：
Because of its specificity, it is usually difficult to reuse computer code developed for a given combinatorial problem to deal with another one. We use the Object Oriented Programming methodology to derive general purpose software including four different neighborhood search techniques (descent method, tabu search, exchange procedure, simulated annealing) to deal with any assignment-type problem with a bare minimum of coding effort. The structure of the software even allows a more advanced user to play around with several parameters of these techniques and to modify the techniques to create specific variants.