TY - JOUR
T1 - An efficient swarm intelligence approach to the optimization on high-dimensional solutions with cross-dimensional constraints, with applications in supply chain management
AU - Liu, Hsin Ping
AU - Phoa, Frederick Kin Hing
AU - Chen-Burger, Yun-Heh
AU - Lin, Shau Ping
N1 - Funding Information:
The author(s) declare financial support was received for the research, authorship, and/or publication of this article. This work was partially supported by the Academia Sinica grant number AS-IA-112-M03 and the National Science and Technology Council (Taiwan) grant number 111-2118-M-001-007-MY2. H-PL was also partially supported by the doctoral student scholarship provided by the Institute of Statistical Science, Academia Sinica (Taiwan).
Publisher Copyright:
Copyright © 2024 Liu, Phoa, Chen-Burger and Lin.
PY - 2024/1/18
Y1 - 2024/1/18
N2 - Introduction: The Swarm Intelligence Based (SIB) method has widely been applied to efficient optimization in many fields with discrete solution domains. E-commerce raises the importance of designing suitable selling strategies, including channel- and direct sales, and the mix of them, but researchers in this field seldom employ advanced metaheuristic techniques in their optimization problem due to the complexities caused by the high-dimensional problems and cross-dimensional constraints. Method: In this work, we introduce an extension of the SIB method that can simultaneously tackle these two challenges. To pursue faster computing, CPU parallelization techniques are employed for algorithm acceleration. Results: The performance of the SIB method is examined on the problems of designing selling schemes in different scales. It outperforms the Genetic Algorithm (GA) in terms of both the speed of convergence and the optimized capacity as measured using improvement multipliers.
AB - Introduction: The Swarm Intelligence Based (SIB) method has widely been applied to efficient optimization in many fields with discrete solution domains. E-commerce raises the importance of designing suitable selling strategies, including channel- and direct sales, and the mix of them, but researchers in this field seldom employ advanced metaheuristic techniques in their optimization problem due to the complexities caused by the high-dimensional problems and cross-dimensional constraints. Method: In this work, we introduce an extension of the SIB method that can simultaneously tackle these two challenges. To pursue faster computing, CPU parallelization techniques are employed for algorithm acceleration. Results: The performance of the SIB method is examined on the problems of designing selling schemes in different scales. It outperforms the Genetic Algorithm (GA) in terms of both the speed of convergence and the optimized capacity as measured using improvement multipliers.
KW - CPU parallelization
KW - selling scheme
KW - supply chain management
KW - swarm intelligence
KW - tensor-type particle
UR - http://www.scopus.com/inward/record.url?scp=85183863598&partnerID=8YFLogxK
U2 - 10.3389/fncom.2024.1283974
DO - 10.3389/fncom.2024.1283974
M3 - Article
C2 - 38313866
AN - SCOPUS:85183863598
SN - 1662-5188
VL - 18
JO - Frontiers in Computational Neuroscience
JF - Frontiers in Computational Neuroscience
M1 - 1283974
ER -