IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v44y1996i2p347-359.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Jacques A. Ferland & Alain Hertz & Alain Lavoie, 1996. "An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques," Operations Research, INFORMS, vol. 44(2), pages 347-359, April.
    • Handle: RePEc:inm:oropre:v:44:y:1996:i:2:p:347-359
    DOI: 10.1287/opre.44.2.347
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.44.2.347
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.44.2.347?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Richard Freling & H. Edwin Romeijn & Dolores Romero Morales & Albert P.M. Wagelmans, 1999. "A Branch and Price Algorithm for the Multi-Period Single-Sourcing Problem," Tinbergen Institute Discussion Papers 99-092/4, Tinbergen Institute.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:44:y:1996:i:2:p:347-359. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.