Optimization Model for a Location-Allocation-Routing in a Periodic Distribution Network

Abstract

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.