IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v95y1996i1p237-239.html
   My bibliography  Save this article

A note on hashing functions and tabu search algorithms

Author

Listed:
  • Carlton, William B.
  • Barnes, J. Wesley

Abstract

No abstract is available for this item.

Suggested Citation

  • Carlton, William B. & Barnes, J. Wesley, 1996. "A note on hashing functions and tabu search algorithms," European Journal of Operational Research, Elsevier, vol. 95(1), pages 237-239, November.
    • Handle: RePEc:eee:ejores:v:95:y:1996:i:1:p:237-239
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00249-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Roberto Battiti & Giampietro Tecchiolli, 1994. "The Reactive Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 126-140, May.
    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. R. Christopher L. Riley & Cesar Rego, 2019. "Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling," Journal of Heuristics, Springer, vol. 25(4), pages 793-807, October.
    2. Minghe Sun & Zhen-Yu Chen & Zhi-Ping Fan, 2014. "A Multi-task Multi-kernel Transfer Learning Method for Customer Response Modeling in Social Media," Working Papers 0161mss, College of Business, University of Texas at San Antonio.
    3. Fathali Firoozi, 2008. "Boundary Distributions in Testing Inequality Hypotheses," Working Papers 0046, College of Business, University of Texas at San Antonio.
    4. Minghe Sun, 2007. "A Primogenitary Linked Quad Tree Approach for Solution Storage and Retrieval in Heuristic Binary Optimization," Working Papers 0009, College of Business, University of Texas at San Antonio.
    5. Qinghua Wu & Yang Wang & Fred Glover, 2020. "Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 74-89, January.
    6. Wang, Yang & Wu, Qinghua & Glover, Fred, 2017. "Effective metaheuristic algorithms for the minimum differential dispersion problem," European Journal of Operational Research, Elsevier, vol. 258(3), pages 829-843.
    7. Lai, Xiangjing & Hao, Jin-Kao & Yue, Dong, 2019. "Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(1), pages 35-48.
    8. Minghe Sun, 2007. "A Primogenitary Linked Quad Tree Approach for Solution Storage and Retrieval in Heuristic Binary Optimization," Working Papers 0009, College of Business, University of Texas at San Antonio.
    9. Sun, Minghe, 2011. "A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization," European Journal of Operational Research, Elsevier, vol. 209(3), pages 228-240, March.
    10. Minghe Sun, 2008. "A Tabu Search Heuristic Procedure for the Capacitated Facility Location Problem," Working Papers 0050, College of Business, University of Texas at San Antonio.

    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. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    2. 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.
    3. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    4. Nha Vo‐Thanh & Hans‐Peter Piepho, 2023. "Generating designs for comparative experiments with two blocking factors," Biometrics, The International Biometric Society, vol. 79(4), pages 3574-3585, December.
    5. 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.
    6. Grolimund, Stephan & Ganascia, Jean-Gabriel, 1997. "Driving Tabu Search with case-based reasoning," European Journal of Operational Research, Elsevier, vol. 103(2), pages 326-338, December.
    7. Buscher, Udo & Shen, Liji, 2009. "An integrated tabu search algorithm for the lot streaming problem in job shops," European Journal of Operational Research, Elsevier, vol. 199(2), pages 385-399, December.
    8. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    9. Mohammad Hassan Salmani & Kourosh Eshghi, 2017. "A Metaheuristic Algorithm Based on Chemotherapy Science: CSA," Journal of Optimization, Hindawi, vol. 2017, pages 1-13, February.
    10. Anken, F. & Beasley, J.E., 2012. "Corporate structure optimisation for multinational companies," Omega, Elsevier, vol. 40(2), pages 230-243, April.
    11. Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
    12. Rajagopalan, Hari K. & Saydam, Cem, 2009. "A minimum expected response model: Formulation, heuristic solution, and application," Socio-Economic Planning Sciences, Elsevier, vol. 43(4), pages 253-262, December.
    13. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    14. Shiri, Samaneh & Huynh, Nathan, 2016. "Optimization of drayage operations with time-window constraints," International Journal of Production Economics, Elsevier, vol. 176(C), pages 7-20.
    15. Kulturel-Konak, Sadan, 2012. "A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays," European Journal of Operational Research, Elsevier, vol. 223(3), pages 614-625.
    16. Li, Mingjie & Hao, Jin-Kao & Wu, Qinghua, 2024. "A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment," European Journal of Operational Research, Elsevier, vol. 312(2), pages 473-492.
    17. Rex K. Kincaid & Keith E. Laba & Sharon L. Padula, 1997. "Quelling Cabin Noise in Turboprop Aircraft via Active Control," Journal of Combinatorial Optimization, Springer, vol. 1(3), pages 229-250, October.
    18. Tiago Maritan Ugulino Araújo & Lisieux Marie M. S. Andrade & Carlos Magno & Lucídio Anjos Formiga Cabral & Roberto Quirino Nascimento & Cláudio N. Meneses, 2016. "DC-GRASP: directing the search on continuous-GRASP," Journal of Heuristics, Springer, vol. 22(4), pages 365-382, August.
    19. C Alabas-Uslu, 2008. "A self-tuning heuristic for a multi-objective vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 988-996, July.
    20. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.

    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:eee:ejores:v:95:y:1996:i:1:p:237-239. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.