Biswarm Particle Swarm Optimization with Simulated Annealing for Bilinear Supply Chain

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.