Transportation-location problem with unknown number of facilities. (October 2017)

• Record Type: Journal Article
• Authors: Carlo, Héctor J.; David, Víctor; Salvat-Dávila, Gabriela S.
• Is Part Of: Computers & industrial engineering. Volume 112(2017)
• Page Start: 212
• Page End: 220
• Publication Date: 2017-10
• Subjects: Transportation-location -- Capacitated location-allocation -- Capacitated multi-facility Weber Problem -- Continuous space -- Distribution network design -- Facility location problem; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2017.08.003
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: Presents a non-linear MIP formulation and a linear decomposition for the problem. Proposes a decomposition heuristic and a simulated annealing-based heuristic. Proposed heuristics are not dependent on the distance metric used. Introduces and provides an upper bound for three new benchmark problems. Abstract: The traditional transportation-location problem seeks to determine the location of m new capacitated facilities in continuous space and the level of interaction between these new facilities and existing facilities to minimize the total fixed and variable costs. This paper studies a variant of the transportation-location problem where the number of new facilities is also a decision variable. The problem has practical applications for designing large distribution networks. Several non-linear mixed integer formulations are presented in order to understand the intrinsic complexity of the problem. Given that the problem is NP-hard, a decomposition heuristic (DH) and a simulated annealing-based heuristic (SA) are developed based on the mathematical structure of the problem and compared via experimentation. It is found that both heuristics find the same solution for 40 internally generated problems. Three new benchmark problems are presented and an upper bound is provided.