Solving the Two-Stage Capacitated Facility Location Problem by the Lagrangian Heuristic
In the two-stage capacitated facility location problem a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost associated with opening plants and depots, and variable cost associated with both transportation stages. In this work a Lagrangian relaxation is analyzed and a Lagrangian heuristic producing feasible solutions is presented. The results of a computational study are reported.
Igor Litvinchev Edith Lucero Ozuna Espinosa
Complex Systems Department Computing Centre of Russian Academy of Sciences Moscow, Russia Faculty of Mechanical and Electrical Engineering Nuevo Leon State University Monterrey, Mexico
国际会议
Third International Conference ,ICCL2012(第三届国际计算物流会议)
上海
英文
92-103
2012-09-24（万方平台首次上网日期，不代表论文的发表时间）