This is the authors' abstract. We don't add key points for this paper.
The main concern of this paper is to decide the locations and allocations of facilities that impact not only the profitability of an organization but the fast ability to serve customers. Generally the location-routing problem is to minimize the overall cost by simultaneously selecting a subset of candidate facilities and constructing a set of delivery routes that satisfy some restrictions. In this paper we consider the periodic routing of vehicle to be used to distribute goods. Integer programming model is built to solve the problem. A feasible neighbourhood search is developed to solve the result model.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Panjaitan et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: