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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.