Journal of Northeastern University(Natural Science)

Journal of Northeastern University ›› 2011, Vol. 32 ›› Issue (12): 1688-1691.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Model and solution based on greedy ant colony algorithm for capacitated facility location problem

Yu, Hong-Tao (1); Gao, Li-Qun (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Yu, H.-T.
  • About author:-
  • Supported by:
    -

RichHTML

1

PDF (PC)

2220

Abstract: Capacitated facility location problem is investigated. A new mathematical model is put forward to improve the existing models that do not well address the economic benefit problem and development problem. Since capacitated facility location is a complicated decision process and thus it is often difficult to get an optimal and satisfactory solution, the model is solved by using a new improved ant colony algorithm, which combines conventional ant colony algorithm and greedy idea. Simulation results not only validate the new model, but also show that the improved ant colony algorithm can enhance the ability of escaping from local optimal solution.

CLC Number: