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

A hybrid algorithm for identifying global and local minima when optimizing functions with many minima

Author

Listed:
  • Salhi, S.
  • Queen, N. M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Salhi, S. & Queen, N. M., 2004. "A hybrid algorithm for identifying global and local minima when optimizing functions with many minima," European Journal of Operational Research, Elsevier, vol. 155(1), pages 51-67, May.
    • Handle: RePEc:eee:ejores:v:155:y:2004:i:1:p:51-67
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00871-8
    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. Al-Sultan, K. S. & Al-Fawzan, M. A., 1997. "A tabu search Hooke and Jeeves algorithm for unconstrained optimization," European Journal of Operational Research, Elsevier, vol. 103(1), pages 198-208, November.
    2. Chelouah, Rachid & Siarry, Patrick, 2000. "Tabu Search applied to global optimization," European Journal of Operational Research, Elsevier, vol. 123(2), pages 256-270, June.
    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. P. S. Dhabe & P. S. V. Nataraj, 2017. "A parallel Bernstein algorithm for global optimization based on the implicit Bernstein form," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 1654-1671, November.
    2. P. S. Dhabe & P. S. V. Nataraj, 2017. "The Bernstein algorithm using the modified implicit Bernstein form and its GPU parallelization using CUDA," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(4), pages 826-841, December.
    3. Priyadarshan Dhabe & P. S. V. Nataraj, 2020. "A GPU parallel Bernstein algorithm for polynomial global optimization," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 21-44, February.

    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. Bartholomew-Biggs, M. C. & Parkhurst, S. C. & Wilson, S. P., 2003. "Global optimization approaches to an aircraft routing problem," European Journal of Operational Research, Elsevier, vol. 146(2), pages 417-431, April.
    2. Hedar, Abdel-Rahman & Fukushima, Masao, 2006. "Tabu Search directed by direct search methods for nonlinear global optimization," European Journal of Operational Research, Elsevier, vol. 170(2), pages 329-349, April.
    3. 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.
    4. Rosanna Grassi & Paolo Bartesaghi & Stefano Benati & Gian Paolo Clemente, 2021. "Multi-Attribute Community Detection in International Trade Network," Networks and Spatial Economics, Springer, vol. 21(3), pages 707-733, September.
    5. Hariga, Moncer A., 2010. "A single-item continuous review inventory problem with space restriction," International Journal of Production Economics, Elsevier, vol. 128(1), pages 153-158, November.
    6. Congbo Li & Lingling Li & Ying Tang & Yantao Zhu & Li Li, 2019. "A comprehensive approach to parameters optimization of energy-aware CNC milling," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 123-138, January.
    7. Zheng Peng & Donghua Wu & Quan Zheng, 2013. "A Level-Value Estimation Method and Stochastic Implementation for Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 156(2), pages 493-523, February.
    8. Hahn, Kyu Hun & Hwang, Hark & Shinn, Seong Whan, 2004. "A returns policy for distribution channel coordination of perishable items," European Journal of Operational Research, Elsevier, vol. 152(3), pages 770-780, February.
    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. Chelouah, Rachid & Siarry, Patrick, 2003. "Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions," European Journal of Operational Research, Elsevier, vol. 148(2), pages 335-348, July.
    11. Fei Wei & Yuping Wang & Hongwei Lin, 2014. "A New Filled Function Method with Two Parameters for Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 163(2), pages 510-527, November.
    12. Wang, Huaiqing & Huang, Wenqi & Zhang, Quan & Xu, Dongming, 2002. "An improved algorithm for the packing of unequal circles within a larger containing circle," European Journal of Operational Research, Elsevier, vol. 141(2), pages 440-453, September.
    13. Herrera, F. & Lozano, M. & Molina, D., 2006. "Continuous scatter search: An analysis of the integration of some combination methods and improvement strategies," European Journal of Operational Research, Elsevier, vol. 169(2), pages 450-476, March.
    14. Khalid Abdulaziz Alnowibet & Salem Mahdi & Ahmad M. Alshamrani & Karam M. Sallam & Ali Wagdy Mohamed, 2022. "A Family of Hybrid Stochastic Conjugate Gradient Algorithms for Local and Global Minimization Problems," Mathematics, MDPI, vol. 10(19), pages 1-37, October.
    15. M Hariga & N Azaiez, 2006. "Heuristic procedures for the single facility inspection problem with minimal repair and increasing failure rate," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1081-1088, September.
    16. Li, Miao & Davari, Morteza & Goossens, Dries, 2023. "Multi-league sports scheduling with different leagues sizes," European Journal of Operational Research, Elsevier, vol. 307(1), pages 313-327.

    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:155:y:2004:i:1:p:51-67. 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.