Portfolio Optimization with Translation of Representation for Transport Problems
Authors:
- Malgorzata ZajeckaMZMalgorzata Zajecka
- Mateusz MastalerczykMMMateusz Mastalerczyk
- Siang Yew ChongSCSiang Yew Chong
- Xin YaoXYXin Yao
- Joanna KwiecienJKJoanna Kwiecien
- Wojciech ChmielWCWojciech Chmiel
- Jacek DajdaJDJacek Dajda
- Marek Kisiel-DorohinickiMKMarek Kisiel-Dorohinicki
- Aleksander ByrskiABAleksander Byrski
Open Access
- 8 December 2024
- journal article
- research article
- Published by Walter de Gruyter GmbH in Journal of Artificial Intelligence and Soft Computing Research
- Vol. 15 (1) , 57-75
Abstract
The paper presents a hybridization of two ideas closely related to metaheuristic computing, namely Portfolio Optimization (researched by Xin Yao et al.) and Translation of Representation for different metaheuristics (researched by Byrski et al.). Thus, difficult problems (discrete optimization) are approached by a sequential run through a number of steps of different metaheuristics, providing the translation of representation (since the algorithms are completely different). Therefore, close cooperation of e.g. ACO, PSO, and GA is possible. The results refer to unaltered algorithms and show the superiority of the constructed hybrid.Keywords
This publication has 27 references indexed in Scilit:
- Design of Heuristic Algorithms for Hard Optimization2023
- Swarm intelligence: past, present and futureSoft Computing, 2017
- Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms2014
- Automated Algorithm Configuration and Parameter Tuning2011
- Metaheuristics2009
- A survey on metaheuristics for stochastic combinatorial optimizationNatural Computing, 2008
- Metaheuristics2008
- A Particle Swarm Approach to Quadratic Assignment Problems2007
- Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem2004
- Particle Swarm Optimization for the Assignment of Facilities to Locations2004