Heuristic approaches for solid transportation-p-facility location problem

Abstract

Determining optimum places for the facilities and optimum transportation from existing sites to the facilities belongs to the main problems in supply chain management. The solid transportation-p-facility location problem (ST-p-FLP) is an integration between the facility location problem and the solid transportation problem (STP). This paper delineates the ST-p-FLP, a generalization of the classical STP in which location of p-potential facility sites are sought so that the total transportation cost by means of conveyances from existing facility sites to potential facility sites will be minimized. This is one of the most important problems in the transportation systems and the location research areas. Two heuristic approaches are developed to solve such type of problem: a locate-allocate heuristic and an approximate heuristic. Thereafter, the performance of the proposed model and the heuristics are evaluated by an application example, and the obtained results are compared. Moreover, a sensitivity analysis is introduced to investigate the resiliency of the proposed model. Finally, conclusions and an outlook to future research works are provided.