Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    An exact penalty function-based differential search algorithm for constrained global optimization

    Access Status
    Fulltext not available
    Authors
    Liu, J.
    Teo, Kok Lay
    Wang, Xiangyu
    Wu, Changzhi
    Date
    2015
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Liu, J. and Teo, K.L. and Wang, X. and Wu, C. 2015. An exact penalty function-based differential search algorithm for constrained global optimization. Soft Computing. 20 (4): pp. 1305-1313.
    Source Title
    Soft Computing
    DOI
    10.1007/s00500-015-1588-6
    ISSN
    1432-7643
    School
    Department of Mathematics and Statistics
    URI
    http://hdl.handle.net/20.500.11937/41557
    Collection
    • Curtin Research Publications
    Abstract

    Differential search (DS) is a recently developed derivative-free global heuristic optimization algorithm for solving unconstrained optimization problems. In this paper, by applying the idea of exact penalty function approach, a DS algorithm, where an S-type dynamical penalty factor is introduced so as to achieve a better balance between exploration and exploitation, is developed for constrained global optimization problems. To illustrate the applicability and effectiveness of the proposed approach, a comparison study is carried out by applying the proposed algorithm and other widely used evolutionary methods on 24 benchmark problems. The results obtained clearly indicate that the proposed method is more effective and efficient over the other widely used evolutionary methods for most these benchmark problems.

    Related items

    Showing items related by title, author, creator and subject.

    • Heuristic algorithms for routing problems.
      Chong, Yen N. (2001)
      General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world such problems arise in several contexts such as distribution ...
    • Optimal control problems with constraints on the state and control and their applications
      Li, Bin (2011)
      In this thesis, we consider several types of optimal control problems with constraints on the state and control variables. These problems have many engineering applications. Our aim is to develop efficient numerical methods ...
    • Optimal control problems involving constrained, switched, and delay systems
      Loxton, Ryan Christopher (2010)
      In this thesis, we develop numerical methods for solving five nonstandard optimal control problems. The main idea of each method is to reformulate the optimal control problem as, or approximate it by, a nonlinear programming ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.