An exact and a heuristic approach for the transportation-p-facility location problem


Das S. K. , Roy S. K. , Weber G. W.

COMPUTATIONAL MANAGEMENT SCIENCE, cilt.17, ss.389-407, 2020 (ESCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 17 Konu: 3
  • Basım Tarihi: 2020
  • Doi Numarası: 10.1007/s10287-020-00363-8
  • Dergi Adı: COMPUTATIONAL MANAGEMENT SCIENCE
  • Sayfa Sayıları: ss.389-407

Özet

The delineation of the transportation network is a strategic issue for all over the place. The problem of locating new facilities among several existing facilities and minimizing the total transportation cost are the main topics of the location network system. This paper addresses the transportation-p-facility location problem (T-p-FLP) which makes a connection between the facility location problem and the transportation problem, where p corresponds to the number of facilities. The T-p-FLP is a generalization of the classical transportation problem in which we have to seek where and how we impose the p-number of facilities such that the total transportation cost from existing facility sites to the potential facility sites will be minimized. The exact approach, based on the iterative procedure, and a heuristic approach as applied to the T-p-FLP are discussed and corresponding results are compared. An experimental example is incorporated to explore the efficiency and effectiveness of our proposed study in reality. Finally, a summary is given together with suggestions for future studies.