Scaling Up Dynamic Optimization Problems: A Divide-and-Conquer Approach

Yazdani, D, Omidvar, MN orcid.org/0000-0003-1944-4624, Branke, J et al. (2 more authors) (2020) Scaling Up Dynamic Optimization Problems: A Divide-and-Conquer Approach. IEEE Transactions on Evolutionary Computation, 24 (1). ISSN 1089-778X

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Keywords: Computational resource allocation, cooperative coevolutionary (CC), decomposition, dynamic optimization problems, large-scale optimization problems, multipopulation.
Dates:
  • Published: February 2020
  • Accepted: 13 February 2019
  • Published (online): 4 March 2019
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Business (Leeds) > Accounting & Finance Division (LUBS) (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 31 Jan 2020 11:28
Last Modified: 31 Jan 2020 11:28
Status: Published
Publisher: IEEE
Identification Number: https://doi.org/10.1109/TEVC.2019.2902626

Share / Export

Statistics