IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v6y2004i3d10.1023_bmcap.0000026564.87435.66.html
   My bibliography  Save this article

Tabu Guided Generalized Hill Climbing Algorithms

Author

Listed:
  • Diane E. Vaughan

    (Los Alamos National Laboratory)

  • Sheldon H. Jacobson

    (University of Illinois)

Abstract

This paper formulates tabu search strategies that guide generalized hill climbing (GHC) algorithms for addressing NP-hard discrete optimization problems. The resulting framework, termed tabu guided generalized hill climbing (TG2HC) algorithms, uses a tabu release parameter that probabilistically accepts solutions currently on the tabu list. TG2HC algorithms are modeled as a set of stationary Markov chains, where the tabu list is fixed for each outer loop iteration. This framework provides practitioners with guidelines for developing tabu search strategies to use in conjunction with GHC algorithms that preserve some of the algorithms’ known performance properties. In particular, sufficient conditions are obtained that indicate how to design iterations of problem-specific tabu search strategies, where the stationary distributions associated with each of these iterations converge to the distribution with zero weight on all non-optimal solutions.

Suggested Citation

  • Diane E. Vaughan & Sheldon H. Jacobson, 2004. "Tabu Guided Generalized Hill Climbing Algorithms," Methodology and Computing in Applied Probability, Springer, vol. 6(3), pages 343-354, September.
    • Handle: RePEc:spr:metcap:v:6:y:2004:i:3:d:10.1023_b:mcap.0000026564.87435.66
    DOI: 10.1023/B:MCAP.0000026564.87435.66
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:MCAP.0000026564.87435.66
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/B:MCAP.0000026564.87435.66?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. Ulrich Faigle & Walter Kern, 1992. "Some Convergence Results for Probabilistic Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 4(1), pages 32-37, February.
    2. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    3. George L. Nemhauser, 1994. "The Age of Optimization: Solving Large-Scale Real-World Problems," Operations Research, INFORMS, vol. 42(1), pages 5-13, February.
    Full references (including those not matched with items on IDEAS)

    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. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    2. Hanafi, Saïd & Wang, Yang & Glover, Fred & Yang, Wei & Hennig, Rick, 2023. "Tabu search exploiting local optimality in binary optimization," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1037-1055.
    3. Drexl, Andreas & Haase, Knut, 1993. "Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 323, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Drexl, Andreas & Juretzka, Jan & Salewski, Frank, 1993. "Academic course scheduling under workload and changeover constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 337, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    6. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    7. A Lim & B Rodrigues & J Zhang, 2005. "Tabu search embedded simulated annealing for the shortest route cut and fill problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(7), pages 816-824, July.
    8. Berterottière, Lucas & Dauzère-Pérès, Stéphane & Yugma, Claude, 2024. "Flexible job-shop scheduling with transportation resources," European Journal of Operational Research, Elsevier, vol. 312(3), pages 890-909.
    9. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    10. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    11. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    12. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    13. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    14. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    15. Rego, Cesar & Roucairol, Catherine, 1995. "Using Tabu search for solving a dynamic multi-terminal truck dispatching problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 411-429, June.
    16. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    17. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    18. Dusan Ku & Tiru S. Arthanari, 2016. "On double cycling for container port productivity improvement," Annals of Operations Research, Springer, vol. 243(1), pages 55-70, August.
    19. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    20. Yazdani Sabouni, M.T. & Logendran, Rasaratnam, 2013. "Carryover sequence-dependent group scheduling with the integration of internal and external setup times," European Journal of Operational Research, Elsevier, vol. 224(1), pages 8-22.

    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:metcap:v:6:y:2004:i:3:d:10.1023_b:mcap.0000026564.87435.66. 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.