An LP-rounding heuristic to solve a multi-period facility relocation problem

  • A general multi-period network redesign problem arising in the context of strategic supply chain planning (SCP) is studied. Several aspects of practical relevance in SCP are captured namely, multiple facility layers with different types of facilities, flows between facilities in the same layer, direct shipments to customers, and facility relocation. An efficient two-phase heuristic approach is proposed for obtaining feasible solutions to the problem, which is initially modeled as a large-scale mixed-integer linear program. In the first stage of the heuristic, a linear programming rounding strategy is applied to second initial values for the binary location variables in the model. The second phase of the heuristic uses local search to correct the initial solution when feasibility is not reached or to improve the solution when its quality does not meet given criteria. The results of an extensive computational study performed on randomly generated instances are reported.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:T. Melo, S. Nickel, F. Saldanha-da-Gama
URN (permanent link):urn:nbn:de:hbz:386-kluedo-16211
Serie (Series number):Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (168)
Document Type:Report
Language of publication:English
Year of Completion:2009
Year of Publication:2009
Publishing Institute:Fraunhofer-Institut für Techno- und Wirtschaftsmathematik
GND-Keyword:Heuristic ; Linear Programming ; Rounding; Supply Chain Design
Faculties / Organisational entities:Fraunhofer (ITWM)
DDC-Cassification:510 Mathematik

$Rev: 12793 $