Year: 2025
Type: conference-paper
Abstract: Bilinear programming problems (BLPPs), central to supply chain decisions like integrated production-distribution, are challenging due to non-convexity. We propose BPSO-SA, a hybrid metaheuristic combining dual-swarm PSO (dedicated to coupled variables *x* and *y*) with Simulated Annealing (SA) to escape local optima. SA probabilistically accepts suboptimal solutions during search. Experiments on synthetic problems show BPSO-SA significantly outperforms standard PSO in solution quality, especially for larger scales, proving effective for complex BLPPs.
Authors: Yufei Han, Jiayi Ma, Zhidong Huang, Xuhan Zhang, Xiaodan Li
Institution: China University of Mining and Technology - Beijing
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
OpenAlex ID: W7084031129