An ADD/DROP procedure for the capacitated plant location problem

Pesquisa Operacional

Claudio Thomas Bornstein²  Manoel Campêlo¹ 

[1] ,Universidade Federal do Rio de Janeiro Coordenação dos Programas de Pós-graduação de Engenharia Engenharia de Sistemas e ComputaçãoRio de Janeiro RJ

关键词: capacitated plant location problem;    ADD/DROP procedures;    heuristic methods;    Lagrangean relaxation;    problema de localização capacitado;    procedimentos ADD/DROP;    heurísticas;    relaxação lagrangeana;   

DOI  :  10.1590/S0101-74382004000100008

来源: SciELO

【 摘 要 】

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.

【 授权许可】

CC BY   
 All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License