An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques

Jacques A. Ferland, Alain Hertz and Alain Lavoie
Additional contact information
Jacques A. Ferland: University of Montreal, Montreal, Quebec, Canada
Alain Hertz: Ecole Polytechniques Fédérale de Lausanne, Lausanne, Switzerland
Alain Lavoie: University of Montreal, Montreal, Quebec, Canada

Operations Research, 1996, vol. 44, issue 2, 347-359

Abstract: 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.

Keywords: computers/computer science; software: object-oriented methodology; programming; integer; heuristic: neighborhood search techniques; assignment-type problems (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.44.2.347 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:44:y:1996:i:2:p:347-359

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().