⚙️
🌟 Najlepsze dopasowanie
Wpisz szukaną frazę, aby zobaczyć propozycje AI.

Determining the optimal location-distribution layout for multiple participants

Optimization of location and zoning in distribution networks – part 2.

Determining the optimal location-distribution layout for multiple participants

The reasons for solving the problem of multiple warehouse locations are the following determinants:

  • shortening delivery distances,
  • shortening delivery times,
  • increasing the level of customer service by enabling mutual replenishment of stocks from the resources of nearby warehouses.

Spatial planning of warehouse locations concerns in particular companies oriented towards increasing product availability both in terms of distance (delivery time) and maintaining the assumed level of customer service.

Among the methods supporting decisions regarding the location of multiple warehouses, we can find more or less complex and thus more or less precise ones. One of them is a method whose goal is cost minimization, consisting of determining, through an appropriate mathematical model, the number of products to be delivered from the considered warehouse locations to individual recipients. Based on fundamental analysis, a group of warehouses with specific (known) spatial-geographical parameters was selected.

The input data for the mathematical model considered in the example below are:
– capacity Vi and fixed cost Ks of maintaining warehouses,
– matrix of unit costs kj from the i-th warehouse to the j-th recipient,
– the demand Zj of individual recipients is also known.

The minimization of the total cost is calculated using the following formula:

1   [1]where:
kj – unit cost of transporting goods from the i-th warehouse to the j-th recipient,
Mt – mass of transported goods in tons,
Ks – fixed cost of maintaining the warehouse,
bi – binary variable (takes values 0 or 1).

Example

Problem
A group of seven potential warehouse locations (from M1 to M7) and a group of eight recipients served by the above warehouses are given. The volumetric potential of the hypothetical warehouses (Vi) is 11,300 m3 of product x with a total demand of 8 recipients (from O1 to O8) at the level of 4,700 m3. According to the input data table (1) for the example, the following information is known:

  • warehouse capacity (Vi),
  • fixed costs of maintaining warehouses (Ks),
  • unit delivery costs (kj) of the product from the i-th warehouse to the j-th recipient,
  • demand of the j-th recipients.

Table 1. Input data for the example
2

From the warehouses M1 to M7, it is necessary to select warehouses with optimally utilized volume and the lowest total costs.

Problem analysis
To solve the task, we will use the Microsoft Solver tool. To do this, you must enter table (1) with input data into an Excel spreadsheet and additionally create a working table presented below, containing fields for quantities.

Table 2. Decision variables table
3

P10-02.pdf