会议专题

Solving Capacitated Facility Location Problem Using Tabu Search

This study proposes a tabu search heuristic procedure for the capacitated facility location problem. The heuristic procedure uses recency based short term memory and frequency based long term memories performing diversification and intensification functions. Its performance is tested through a computational experiment using test problems from the literature. It found optimal solutions for almost all test problems. As compared to a Lagrangian heuristic method, the tabu search heuristic procedure found much better solutions using much less CPU time.

Capacitated facility location Tabu search Metaheuristics

Minghe Sun Eliane Aparecida Ducati Vinícius Amaral Armentano

College of Business, The University of Texas at San Antonio, San Antonio, TX 78249-0634 Faculdade de Engenharia Elétrica e de Computa(c)(a)o, Universidade Estadual de Campinas Caixa Postal

国际会议

第六届管理学国际会议(Proceedings of ICM2007 the 6th International on Management)

武汉

英文

76-81

2007-08-03(万方平台首次上网日期,不代表论文的发表时间)