An ADD/DROP procedure for the capacitated plant location problem

An ADD/DROP procedure for the capacitated plant location problem

0.00 Avg rating0 Votes
Article ID: iaor20084299
Country: Brazil
Volume: 24
Issue: 1
Start Page Number: 151
End Page Number: 162
Publication Date: Jan 2004
Journal: Pesquisa Operacional
Authors: ,
Keywords: heuristics
Abstract:

The capacitated plant location problem with linear transportation costs is considered. Exact rules and heuristics are presented for opening or closing of facilities. A heuristic algorithm based on ADD/DROP strategies is proposed. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Computational results are presented and comparisons with other algorithms are made.

Reviews

Required fields are marked *. Your email address will not be published.