Journal
KNOWLEDGE-BASED SYSTEMS
Volume 163, Issue -, Pages 186-203Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2018.08.025
Keywords
Multi-objective optimization; Evolutionary algorithms; Risk measures; Optimal allocation; Computational time
Categories
Ask authors/readers for more resources
The existing evolutionary algorithm techniques have limited capabilities in solving large-scale combinatorial problems due to their large search space, making impractical the examination of big real- world instances. In this paper, we address this issue by introducing a new algorithm that incorporates a coding structure specially designed to keep the processing time invariant to the size of the examined test instance, allowing the consideration of large-scale problems for a fraction of time required by other techniques. We test the performance of the proposed algorithm to the optimal allocation of limited resources to a number of competing investment opportunities for optimizing the objectives. We believe that the proposed algorithm can be particularly useful in other contexts too, subject to adaptations relevant to specific problem requirements. (C) 2018 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available