An efficient heuristic approach for a multi-period logistics network redesign problem

• M.T. Melo ^[3] ; S. Nickel ^[1] ; F. Saldanha-da-Gama ^[2]
  1. [1] Karlsruhe Institute of Technology

     Karlsruhe Institute of Technology

     Stadtkreis Karlsruhe, Alemania

     
  2. [2] Universidade de Lisboa

     Universidade de Lisboa

     Socorro, Portugal

     
  3. [3] Saarland University of Applied Sciences, Alemania

  Mostrar afiliaciones +
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 22, Nº. 1, 2014, págs. 80-108
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • In this paper, a multi-period logistics network redesign problem arising in the context of strategic supply chain planning is studied. Several aspects of practical relevance are captured, namely, multiple echelons with different types of facilities, product flows between facilities in the same echelon, direct shipments to customers, and facility relocation. A two-phase heuristic approach is proposed to obtain high-quality feasible solutions to the problem, which is initially modeled as a large-scale mixed-integer linear program. In the first phase of the heuristic, a linear programming rounding strategy is applied to find initial values for the binary location variables. The second phase of the heuristic uses local search to correct the initial variable choices when a feasible solution is not identified, or to improve the initial feasible solution when its quality does not meet given criteria. The results of a computational study are reported for randomly generated instances comprising a variety of logistics networks.