IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v149y2007i1p89-9810.1007-s10479-006-0113-9.html
   My bibliography  Save this article

Tabu search—Uncharted domains

Author

Listed:
  • Fred Glover

Abstract

No abstract is available for this item.

Suggested Citation

  • Fred Glover, 2007. "Tabu search—Uncharted domains," Annals of Operations Research, Springer, vol. 149(1), pages 89-98, February.
  • Handle: RePEc:spr:annopr:v:149:y:2007:i:1:p:89-98:10.1007/s10479-006-0113-9
    DOI: 10.1007/s10479-006-0113-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0113-9
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-006-0113-9?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Glover, Fred, 1998. "Tabu search -- wellsprings and challenges," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 221-225, April.
    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. J Euchi & H Chabchoub, 2011. "Hybrid metaheuristics for the profitable arc tour problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 2013-2022, November.
    2. Manfred Gilli & Enrico Schumann, 2012. "Heuristic optimisation in financial modelling," Annals of Operations Research, Springer, vol. 193(1), pages 129-158, March.
    3. ARNOLD, Florian & SÖRENSEN, Kenneth, 2017. "A simple, deterministic, and efficient knowledge-driven heuristic for the vehicle routing problem," Working Papers 2017012, University of Antwerp, Faculty of Business and Economics.

    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. Jouglet, Antoine & Savourey, David & Carlier, Jacques & Baptiste, Philippe, 2008. "Dominance-based heuristics for one-machine total cost scheduling problems," European Journal of Operational Research, Elsevier, vol. 184(3), pages 879-899, February.
    2. Ali Kharrazi & Brian D. Fath & Harald Katzmair, 2016. "Advancing Empirical Approaches to the Concept of Resilience: A Critical Examination of Panarchy, Ecological Information, and Statistical Evidence," Sustainability, MDPI, vol. 8(9), pages 1-17, September.
    3. Lust, T. & Roux, O. & Riane, F., 2009. "Exact and heuristic methods for the selective maintenance problem," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1166-1177, September.
    4. Regina Berretta & Paulo M. França & Vinícius A. Armentano, 2005. "Metaheuristic Approaches For The Multilevel Resource-Constrained Lot-Sizing Problem With Setup And Lead Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 22(02), pages 261-286.
    5. Pichitlamken, Juta & Nelson, Barry L. & Hong, L. Jeff, 2006. "A sequential procedure for neighborhood selection-of-the-best in optimization via simulation," European Journal of Operational Research, Elsevier, vol. 173(1), pages 283-298, August.
    6. Marie-Sklaerder Vié & Nicolas Zufferey & Roel Leus, 2022. "Aircraft landing planning under uncertain conditions," Journal of Scheduling, Springer, vol. 25(2), pages 203-228, April.
    7. B Karimi & S M T Fatemi Ghomi & J M Wilson, 2006. "A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 140-147, February.
    8. Vié, Marie-Sklaerder & Zufferey, Nicolas & Cordeau, Jean-François, 2019. "Solving the Wire-Harness Design Problem at a European car manufacturer," European Journal of Operational Research, Elsevier, vol. 272(2), pages 712-724.
    9. Shelokar, P.S. & Jayaraman, V.K. & Kulkarni, B.D., 2008. "Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1213-1229, March.
    10. Jens Poppenborg & Sigrid Knust, 2016. "A flow-based tabu search algorithm for the RCPSP with transfer times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 305-334, March.

    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:spr:annopr:v:149:y:2007:i:1:p:89-98:10.1007/s10479-006-0113-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.