An exact and a heuristic approach for the transportation- p -facility location problem
- PDF / 573,661 Bytes
- 19 Pages / 439.37 x 666.142 pts Page_size
- 6 Downloads / 229 Views
An exact and a heuristic approach for the transportation-p-facility location problem Soumen Kumar Das1 · Sankar Kumar Roy1
· Gerhard Wilhelm Weber2,3
Received: 10 January 2018 / Accepted: 16 January 2020 © Springer-Verlag GmbH Germany, part of Springer Nature 2020
Abstract 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. Keywords Facility location problem · Transportation problem · Transportation- p-facility location problem · Optimization · Exact approach · Heuristic approach
B
Sankar Kumar Roy [email protected] Soumen Kumar Das [email protected] Gerhard Wilhelm Weber [email protected]
1
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721102, West Bengal, India
2
Faculty of Engineering Management, Chair of Marketing and Economic Engineering, Poznan University of Technology, ul. Strzelecka. 11, 60-965 Poznan, Poland
3
Institute of Applied Mathematics, Middle East Technical University, 06800 Ankara, Turkey
123
S. K. Das et al.
1 Introduction The facility location problem (FLP) is actually a strategy, where and how to locate the new facilities among several existing facilities in such a way that at least one of the objective functions will be optimized (like cost, profit, travel distance, service, waiting time and market shares). Mainly, the traditional FLP contains three given sets: a set of existing facility sites, a set of potential facility sites and a set of weights related to existing facility sites. In fact, it seeks the best locations for a set of facilities with respect to a set of all existing facility sites. Industries locate assembly plants and warehouses. Stores are located by retail outlets. The efficiency of manufacturing and marketing of products is dependent on the location of facilities. Similarly, the government also takes the decisions about the location of schools, fire stations, hospitals, etc. In any case, good services depend on the location of facilities. The FLP
Data Loading...
