IDEAS home Printed from https://ideas.repec.org/a/sae/envirb/v27y2000i1p137-150.html
   My bibliography  Save this article

Heuristic Concentration: A Study of Stage One

Author

Listed:
  • Kenneth E Rosing

    (Economic Geography Institute, Tinbergen Institute, Erasmus University Rotterdam, PO Box 1738, NL-3000 DR Rotterdam, The Netherlands)

Abstract

Heuristic concentration (HC) is a metaheuristic for the solution of certain combinatorial problems. In stage one, a concentration set (CS), consisting of nodes likely to be in the optimal solution, is developed by multiple runs of an interchange heuristic. In stage two, a good, usually optimal, solution is constructed by selecting the best nodes from the CS. The CS is effective when it is small but comprehensive. Both of these characteristics depend upon: (1) the robustness of the heuristic; (2) the number of times it is run, q ; and (3) the number of “best†solutions used to create the CS, m. Stage two is thus totally dependent upon the efficiency of stage one for the improved, and at least potentially optimal, solution. Proper values for the parameters m and q increase the probability of selecting correct elements to construct the optimal solution in stage two and to decrease the work in its identification. After a consideration of the robustness of two alternative interchange heuristics I will concentrate on the appropriate values for the parameters m and q. This is an empirical examination and the p -median problem is used throughout.

Suggested Citation

  • Kenneth E Rosing, 2000. "Heuristic Concentration: A Study of Stage One," Environment and Planning B, , vol. 27(1), pages 137-150, February.
    • Handle: RePEc:sae:envirb:v:27:y:2000:i:1:p:137-150
    DOI: 10.1068/b2526
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/b2526
    Download Restriction: no
    File URL: https://libkey.io/10.1068/b2526?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
    ---><---

    References listed on IDEAS

    as
    1. Rosing, K. E. & ReVelle, C. S. & Rolland, E. & Schilling, D. A. & Current, J. R., 1998. "Heuristic concentration and Tabu search: A head to head comparison," European Journal of Operational Research, Elsevier, vol. 104(1), pages 93-99, January.
    2. Schilling, D. A. & Rosing, K. E. & ReVelle, C. S., 2000. "Network distance characteristics that affect computational effort in p-median location problems," European Journal of Operational Research, Elsevier, vol. 127(3), pages 525-536, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Sanci, Ece & Daskin, Mark S., 2019. "Integrating location and network restoration decisions in relief networks under uncertainty," European Journal of Operational Research, Elsevier, vol. 279(2), pages 335-350.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    2. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    3. Fleming, Christopher L. & Griffis, Stanley E. & Bell, John E., 2013. "The effects of triangle inequality on the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 1-7.
    4. Mariana de Oliveira Lage & Cláudia Aparecida Soares Machado & Cristiano Martins Monteiro & Clodoveu Augusto Davis & Charles Lincoln Kenji Yamamura & Fernando Tobal Berssaneti & José Alberto Quintanilh, 2021. "Using Hierarchical Facility Location, Single Facility Approach, and GIS in Carsharing Services," Sustainability, MDPI, vol. 13(22), pages 1-13, November.
    5. Pacheco, J.A. & Delgado Serna, C.R., 2000. "Diseño de Metaheurísticos para Problemas de Rutas con Flota Heterogénea: Concentración Heurística," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 14, pages 137-151, Abril.
    6. Jackson, Laura E. & Rouskas, George N. & Stallmann, Matthias F.M., 2007. "The directional p-median problem: Definition, complexity, and algorithms," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1097-1108, June.
    7. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
    8. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    9. Rosing, K. E. & ReVelle, C. S. & Schilling, D. A., 1999. "A gamma heuristic for the p-median problem," European Journal of Operational Research, Elsevier, vol. 117(3), pages 522-532, September.
    10. Sanci, Ece & Daskin, Mark S., 2019. "Integrating location and network restoration decisions in relief networks under uncertainty," European Journal of Operational Research, Elsevier, vol. 279(2), pages 335-350.
    11. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    12. Mohammad M. Fazel-Zarandi & J. Christopher Beck, 2012. "Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 387-398, August.
    13. Aras, Necati & Aksen, Deniz & Gönül Tanugur, Ayse, 2008. "Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1223-1240, December.
    14. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    15. Jayaraman, Vaidyanathan & Patterson, Raymond A. & Rolland, Erik, 2003. "The design of reverse distribution networks: Models and solution procedures," European Journal of Operational Research, Elsevier, vol. 150(1), pages 128-149, October.

    More about this item

    Statistics

    Access and download statistics

    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:sae:envirb:v:27:y:2000:i:1:p:137-150. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: SAGE Publications (email available below). General contact details of provider: .

    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.