Each supply point will have a supply equal to its original supply, and each demand point will have a demand equal to its original demand.
The demand of each demand point can be satisfied by several vehicles and a single vehicle is allowed to serve multiple demand points.
The objective is to satisfy the demand of each demand point with the minimum total distribution cost.
Each demand point has a specified shipment quantity and a deadline for delivery.
The significance of each demand point was determined by the weight assigned to it.
The population of each demand point has been normalized in a range of 1 10.
Also, each supply point will have supply equal to original supply, T (for i = m + 1, m + 2,….., m + n) and each demand point will have its demand equal to original demand, T (for j = 1, 2,……, m).
Each demand point d i ϵ I was represented as a coordinate (d xi, d yi ) in the Cartesian plane.
The euclidean distance in kilometers between a demand point (i in I) and a facility location (j in M) is denoted by (d_{ij}).
Considering the wide range of cities involved and the incomplete information on pipeline networks, we calculated the shortest distance between the demand point and candidate site based on the shortest path theory of railway mileage.
