3.1. Problem Description
This paper considers an auto parts supply network, as shown in
Figure 1. The strategical decisions in this paper are to determine the location and inventory capacity of DCs. Let
} represent the alternative points set of DCs, which is indexed by
. Denote
as a binary variable to describe if the alternative point
is selected as DCs. That is, if
, the DC is opened. In addition, it is essential to determine a reasonable inventory level for the opened DCs. Let
} represent the inventory levels set. Denote
to describe the opened DC, where
is equipped with the inventory level
. In addition, we have to decide the assignment between DCs and APSs, and we assume each APS has to be assigned with one DC. Suppose the set for APSs is
}, which is indexed by
. If the APS
is assigned to DC
,we define
= 1, otherwise
= 0. To investigate the multi-periods production demand of the APL, the time is discretized into several equal periods
, which is indexed by
. Once the APS
is assigned to DC
initially, the assignment will not change. As a side note, the auto parts demand in the APL is satisfied by DCs and APSs. We assume the auto parts demand of APS
is
. One part of the demand of the APS
is accommodated by the responding DC
, and another part of the demand is provided by APS
directly. Afterward, there is a need to pick-up auto parts centrally to the DCs so that the demand in the last period can be satisfied. Namely, the DCs will dispatch vehicles to the corresponding assigned APS
to pick-up auto parts according to the order quantity.
This will involve a vehicle routing problem to seek the shortest path. Three kinds of routes are included in
Figure 2. The red lines are the direct delivery routing from APSs to the APL, and the black lines are the unified delivery routing from APSs to the APL. In addition, the blue lines are the centralized pickup routing from DCs to APSs and end at the same DCs. Specifically, in order to reduce the system operating cost and carbon emissions, this paper solves a joint decision-making LIRP in auto parts supply logistics.
3.3. Deterministic Model
Here, we first formulate a deterministic model to describe the LIRP integrating with the prior known multi-period demand of the APL. Our objective is to find the most efficient , , and and other routing decision variables under proper constraints. As a result, the proposed sustainable LIRP in auto parts supply logistics is formulated as follows:
Objective function (1) minimizes the total system cost, where the first term is the construction cost for DCs, the second term is the inventory holding cost, the third term is the total transport cost from APSs to the APL, the fourth term is the total transport cost from DCs to the APL, and the last term is the total transport cost for centralized pickup from DCs to APSs.
In additn, objective function (2) is the definition of carbon emissions released by transport vehicles, including the carbon emission released by transport vehicles that route from APSs to the APL, from DCs to the APL, and from DCs to APSs.
Constraint (3) limits that each APS can only be assigned to one DC.
Constraint (4) ensures that the APSs can only be assigned to the opened DC.
Constraint (5) determines the capacity level of the opened DC.
Constraint (6) represents that all the demands of the APL are satisfied by APS and corresponding DC. We denote
to indicate the number of auto parts of APS
delivered from DC
to the APL during period
, and
is the quantity of auto parts delivered from APS
to the APL during period
when APS
is assigned to DC
.
Constraints (7) and (8) ensure that auto parts supplies from DCs and APSs need to satisfy the assignment relationship between DCs and APSs.
Constraint (9) indicates the inventory quantity conservation of auto parts from APS
stored in the corresponding assigned DC
. That is, the inventory quantity of auto parts from APS
during period
at DC
equals the inventory quantity during period
− 1, plus the order quantity from APS
to DC
, minus the quantity delivered to the APL from DC
.
Constraint (10) ensures that the quantity of auto parts of APS
delivered from DC
to the APL during period t does not exceed the inventory quantity at DC
during period
.
Constraint (11) guarantees that the total inventory quantity of all auto parts in the DC
at each period is less than the inventory capacity of DC
.
Constraint (12) indicates that only if the APS
is assigned to the DC
, the DC
will store the auto parts of the APS
.
Constraint (13) points out that only if the APS
is assigned to the DC
, the DC
will order auto parts from the APS
.
Constraints (14) and (15) ensure that when the DC
has a clear ordering demand for the auto parts of APS
, the DC
will dispatch vehicles to APS
to pick-up the auto parts.
Constraint (16) indicates that the vehicles dispatched by DC
will depart from DC j and finally arrive at DC
. Constraints (17) and (18) ensure that the first and final APSs picked up by the vehicles have a clear order need.
Constraints (19) and (20) describe the path planning for the vehicles to pick-up auto parts.
is the set for APSs that are assigned to the same DC
and has order needs during period
.
Constraints (21) and (22) ensure that the auto parts of APS
loaded in the vehicles only occur at the APS, which has a clear order need.
Constraints (23) and (24) calculate the number of auto parts loaded in the vehicle after it finishes loading at APS
during the period
.
Constraints (25) and (26) require that the quantity of auto parts loaded in the vehicle is no more than the vehicle capacity.
Constraint (27) requires that the quantity loaded in the vehicle after it finishes loading at APS
is greater than the order quantity needed.
Constraints (28) and (29) are the definitional domain of the decision variables.
Based on the above analysis, the comprehensive LIRP is formulated as the following MIP model.
3.4. Robust Model
In daily production activities, automobile production depends on the market demand, which is easily influenced by the preference of consumers and unexpected events. Various uncertain factors may lead to a sharp increase in auto parts demand. To avoid facing a shortage of auto parts, we try to develop a robust model to formulate the uncertain demand. To address the uncertain issue, this paper adopts the robust optimization method of [
40] and proposes a robust LIRP optimization model that is able to describe the degree of conservation and uncertainty level.
We assume that the production demand for the APL during each period is unknown and belongs to the symmetric range , where is the nominal values and is the maximum deviation value. For the sake of clarifying the uncertain , we introduce the concept of uncertainty level to represent the proportion of deviation. Therefore, the automobile production demand for the APL falls in the range of . Subsequently, we let describe the number of periods at which the production demand is uncertain, and the value of falls in the range of , in which is the total number of planning periods. Specifically, if , there is no uncertainty protection, and the model is deterministic. On the other hand, if , there exists uncertain demand during each period, indicating that the production scheme of the APL is fairly conservative. Then, we employ a set to describe the period set at which the production demand is uncertain. Based on the above analysis, a robust model is developed. Compared to the deterministic model, the difference is that constraint (6) is substituted by robustness constraints, which are formulated in (30) and (31).
Subject to: (3)–(5), (7)–(29)
In constraint (30), a compensation coefficient is introduced and represented as , which describes the protection function against the worst case. Equation (31) describes the demand satisfaction constraints under uncertain scenarios.