a revised ant algorithm for solving location–allocation problem with risky demand in a multi-echelon supply chain network：一种改进的蚁群算法求解位置-多阶供应链网络中的风险需求.pdfVIP

Applied Soft Computing 32 (2015) 311–321 Contents lists available at ScienceDirect Applied Soft Computing j o u r na l h o me p ag e: w w w. elsev /locate/aso c A revised ant algorithm for solving location–allocation problem with risky demand in a multi-echelon supply chain network Kung-Jeng Wang ∗ , C.-H. Lee Department of Industrial Management, National Taiwan University of Science and Technology (Taiwan Tech), #43, Sec. 4, Keelung Rd., Taipei 106, Taiwan, ROC a r t i c l e i n f o a b s t r a c t Article history: This study addresses a capacitated facility location and task allocation problem of a multi-echelon supply Received 29 January 2012 chain against risky demands. Two and three-echelon networks are considered to maximize profit. The Received in revised form 20 February 2015 study represents the problem by a bi-level stochastic programming model. The revised ant algorithm Accepted 24 March 2015 proposed in the study improves the existing ant algorithm by using new design of heuristic desirability Available online 2 April 2015 and efficient greedy heuristics to solve the problem. A set of computational experiments is reported to not only allow to fine-tune the parameters of the algorithm but also to evaluate its performance for solving Keywords: the problem proposed. Experiments reveal that the proposed solution algorithm can reach 95–99% of Ant algorithm Location–allocation problem