Advanced Search
MyIDEAS: Login to save this paper or follow this series

Heuristic Concentration and Tabu Search: A Nose to Nose Comparison

Contents:

Author Info

  • K.E. Rosing

    (Erasmus University Rotterdam)

  • C.S. ReVelle

    (John Hopkins University)

Registered author(s):

    Abstract

    In 1997 two papers_new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p-median problem were published in consecutive volumes of the European Journal of OperationalResearch. Here we apply the method of HC some of the data sets which were used for computationalexperience in the paper on TS and briefly set out the results.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://papers.tinbergen.nl/97058.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 97-058/3.

    as in new window
    Length:
    Date of creation: 06 Jun 1997
    Date of revision:
    Handle: RePEc:dgr:uvatin:19970058

    Contact details of provider:
    Web page: http://www.tinbergen.nl

    Related research

    Keywords: combinatorial optimization; heuristics; integer programming; location; heuristic concentration; tabu search;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, Elsevier, vol. 92(3), pages 493-511, August.
    2. ReVelle, Charles, 1993. "Facility siting and integer-friendly programming," European Journal of Operational Research, Elsevier, Elsevier, vol. 65(2), pages 147-158, March.
    3. P J Densham & G Rushton, 1992. "Strategies for solving large location-allocation problems by heuristic methods," Environment and Planning A, Pion Ltd, London, vol. 24(2), pages 289-304, February.
    4. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, Elsevier, vol. 96(2), pages 329-342, January.
    5. Rosing, K. E. & ReVelle, C. S., 1997. "Heuristic concentration: Two stage solution construction," European Journal of Operational Research, Elsevier, Elsevier, vol. 97(1), pages 75-86, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:dgr:uvatin:19970058. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antoine Maartens (+31 626 - 160 892)).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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