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

A dynamic clustering based differential evolution algorithm for global optimization

Author

Listed:
  • Wang, Yong-Jun
  • Zhang, Jiang-She
  • Zhang, Gai-Ying

Abstract

No abstract is available for this item.

Suggested Citation

  • Wang, Yong-Jun & Zhang, Jiang-She & Zhang, Gai-Ying, 2007. "A dynamic clustering based differential evolution algorithm for global optimization," European Journal of Operational Research, Elsevier, vol. 183(1), pages 56-73, November.
    • Handle: RePEc:eee:ejores:v:183:y:2007:i:1:p:56-73
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)01106-4
    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. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    2. Liu, Bo & Wang, Ling & Jin, Yi-Hui & Tang, Fang & Huang, De-Xian, 2005. "Improved particle swarm optimization combined with chaos," Chaos, Solitons & Fractals, Elsevier, vol. 25(5), pages 1261-1271.
    3. Chelouah, Rachid & Siarry, Patrick, 2005. "A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions," European Journal of Operational Research, Elsevier, vol. 161(3), pages 636-654, March.
    4. 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.
    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. Mena, Rodrigo & Hennebel, Martin & Li, Yan-Fu & Zio, Enrico, 2014. "Self-adaptable hierarchical clustering analysis and differential evolution for optimal integration of renewable distributed generation," Applied Energy, Elsevier, vol. 133(C), pages 388-402.
    2. Duc-Hoc Tran & Jui-Sheng Chou & Duc-Long Luong, 2022. "Optimizing non-unit repetitive project resource and scheduling by evolutionary algorithms," Operational Research, Springer, vol. 22(1), pages 77-103, March.

    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. Hvattum, Lars Magnus & Glover, Fred, 2009. "Finding local optima of high-dimensional functions using direct search methods," European Journal of Operational Research, Elsevier, vol. 195(1), pages 31-45, May.
    2. Kaelo, P. & Ali, M.M., 2007. "Integrated crossover rules in real coded genetic algorithms," European Journal of Operational Research, Elsevier, vol. 176(1), pages 60-76, January.
    3. Morteza Ahandani & Mohammad-Taghi Vakil-Baghmisheh & Mohammad Talebi, 2014. "Hybridizing local search algorithms for global optimization," Computational Optimization and Applications, Springer, vol. 59(3), pages 725-748, December.
    4. Chelouah, Rachid & Siarry, Patrick, 2005. "A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions," European Journal of Operational Research, Elsevier, vol. 161(3), pages 636-654, March.
    5. 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.
    6. 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.
    7. Tammy Drezner & Zvi Drezner, 2019. "Cooperative Cover of Uniform Demand," Networks and Spatial Economics, Springer, vol. 19(3), pages 819-831, September.
    8. Chou, Jui-Sheng & Truong, Dinh-Nhat, 2021. "A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean," Applied Mathematics and Computation, Elsevier, vol. 389(C).
    9. Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
    10. 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.
    11. Marti, Rafael, 1998. "A tabu search algorithm for the bipartite drawing problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 558-569, April.
    12. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    13. 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.
    14. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    15. 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.
    16. 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.
    17. repec:dar:wpaper:62383 is not listed on IDEAS
    18. 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.
    19. 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.
    20. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    21. Deng, Ye & Wu, Jun & Tan, Yue-jin, 2016. "Optimal attack strategy of complex networks based on tabu search," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 442(C), pages 74-81.

    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:183:y:2007:i:1:p:56-73. 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.