A Remanufacturing Logistics Network Model Based on Improved Multi-objective Ant Colony Optimization

A Remanufacturing Logistics Network Model Based on Improved Multi-objective Ant Colony Optimization

Dan Li Chunhong Liu Kang Li*

School of Management, Donghua University, 1882 West Yan'an Road, Shanghai 200051, China

School of Business Administration, Shanghai Lixin University of Accounting and Finance, Shanghai 200051, China

Corresponding Author Email: 
20180122@lixin.edu.cn
Page: 
391-395
|
DOI: 
https://doi.org/10.18280/jesa.520409
Received: 
28 March 2019
|
Accepted: 
10 July 2019
|
Published: 
10 October 2019
| Citation

OPEN ACCESS

Abstract: 

This paper attempts to optimize the location selection of processing centers, vehicle routing and carbon emissions in the remanufacturing logistics network. For this purpose, the author developed a novel optimization model to minimize the total cost of remanufacturing logistics, and designed an improved multi-objective ant colony optimization (MACO) algorithm to solve the model. The simulation results show the effectiveness and efficiency of our algorithm in solving the optimization problem. The research findings provide a reference for reducing reverse logistics cost considering environmental factors.

Keywords: 

remanufacturing logistics network, carbon emissions, multi-objective ant colony optimization (MACO), genetic algorithm (GA)

1. Introduction

With the growing constraints of resources and the environment, remanufacturing logistics has become a major concern in logistics management, especially reverse logistics management. The remanufacturing logistics generally involves the collection, detection, classification, disposal, remanufacturing and redistribution of waste products. This concept covers both the reverse logistics of products from the consumer to the remanufacturer, and the forward logistics of products from the remanufacturer to the seller. The reverse and forward logistical processes constitute a closed-loop logistics system. Compared with the traditional forward logistics, the reverse logistics network faces an immense difficulty in location allocation.

The location allocation problem has been tackled in many studies on the optimization of remanufacturing logistics network. For example, Lee and Dong [1] proposed a two-stage stochastic location model, considering the uncertainties in multi-period reverse logistics network. Alumur et al. [2] explored the multi-cycle static location allocation problem of multi-product recycling network, and suggested to reduce the transport cost by setting up network facilities like recycling centers and remanufacturing factories in the same city. Alshamsi and Diabat [3] constructed a mixed-integer linear model to configure the complex network in the reverse logistics system, aiming to optimize the site selection, the remanufacturing facilities and the capacities of inspection centers. Diabat et al. [4] developed an exact two-phase Lagrangian relaxation algorithm to solve a mixed integer nonlinear location allocation model in reverse supply chain. Radhi and Zhang [5] formulated a mixed integer nonlinear programming model to configure the remanufacturing production network, which takes account of the quality uncertainty, quantity of returns, total spending and transport cost. To minimize the total cost and maximize consumer satisfaction, Afshari et al. [6] proposed a multi-objective model in integrated forward/reverse streams under uncertainty. To assist with decision-making by mangers, Sangwan [7] designed various activities, decision variables and performance indices based on the four activities in reverse logistics. Liao [8] created a hybrid genetic algorithm (GA) to solve a generic mixed integer nonlinear programming model in reverse logistics network. Targeting recycled wood materials, Trochu et al. [9] developed a reverse logistics network model under environmental policies. Zarbakhshnia et al. [10] prepared a mixed integer linear program for green forward and reverse logistics networks.

Recent years saw the rising importance of environmental factors in remanufacturing logistics. Considering carbon emissions in the supply chain network, Elhedhli and Merrick [11] developed a facility location allocation model based on the relationship between carbon emissions and vehicle loads. Focusing on the associated costs of environmental contributions in reverse logistics, Bazan et al. [12] constructed a reverse logistics model covering the energy consumption and greenhouse gas emissions of manufacturing and remanufacturing. Accorsi et al. [13] examined the relationship between carbon emissions and total cost (production cost and logistics cost) in grain supply chain, arising from product transport distance and the agro ecosystem, and developed a mixed linear programming model for facility location allocation based on the relationship between transport distance and carbon emissions. Tornese et al. [14] constructed a linear programming model in light of the relationship between carbon emissions and pallet remanufacturing. Talaei et al. [15] studied the uncertainty of cost and demand based on fuzzy programming, and put forward a double objective mixed integer linear programming model to reduce the total network cost and the CO2 emissions. John et al. [16] proposed network design model for reverse supply chain, which considers the emissions cost of transport.

Compared with general logistics optimization problems, the remanufacturing logistics optimization faces complicated environmental factors. However, most studies have neglected the cost of environmental factors resulting from the product fabrication and transport in remanufacturing logistics network. In view of the growing resource and environmental constraints, it is highly reasonable and practical to consider the cost of carbon emissions in the optimization of remanufacturing logistics network. In other words, the remanufacturing logistics network should be optimized from the aspects of both economic and environmental costs.

This paper proposes an optimization model for remanufacturing logistics network, which includes decisions on location allocation, vehicle routing and carbon emissions. The goal is to minimize the total cost in remanufacturing logistics network. Moreover, an improved multi-objective ant colony optimization (MACO) algorithm was developed to optimize the total cost in remanufacturing logistics network. The effectiveness of the MACO was verified through a simulation on waste textile product remanufacturing logistics.

2. Model Construction

2.1 Problem description

This paper attempts to develop a remanufacturing logistics network model that optimizes the costs of location allocation, transport and carbon emissions. As shown in Figure 1, the products are transported from recycling centers to processing centers and remanufacturing centers. The three types of centers are linked up by transport vehicles and collection vehicles. The transport vehicles travel between remanufacturing centers and processing centers, while the collection vehicles visit processing centers and recycling centers. The main purpose of the model is select the processing centers and optimize the delivery routes that can optimize the total cost in remanufacturing logistics network.

Figure 1. Remanufacturing logistics network

2.2 Assumptions

The following assumptions were put forward before model construction: 

(1) Each recycling center is served by only one collection vehicle.

(2) Each collection vehicle starts from a processing center, then visits the recycling centers and eventually returns to the starting processing center.

(3) All collection vehicles are of the same type with the same capacity.

(4) All transport vehicles are of the same type with the same capacity.

(5) The capacity of an alternative processing center is limited.

(6) Carbon emissions is taxed at P yuan/t by the government.

2.3 Notations

(1) Sets

R: the set of recycling centers

I: the set of potential processing centers

J: the set of remanufacturing centers

K: the set of collection vehicles

G: the set of transport vehicles

(2) Parameters

BCi: Construction cost of potential processing center i in a period

ACr: Unit variable cost of recycling center r

Qri: Transport quantity from recycling center r to processing center i

Cw: Transport cost of collection vehicle per unit distance

Cu: Transport cost of transport vehicle per unit distance

Dri: Transport distance from node r to node i

Dij: Transport distance from node i to node j

λi: Carbon emissions coefficient of processing center i

βi: Carbon emissions coefficient per unit distance from recycling centers to processing center i

Qij: Transport quantity from processing center i to remanufacturing center j

Qk: Maximum capacity of collection vehicle k

Qg: Maximum capacity of transport vehicle g

Qr: Quantity of recycled products by recycling center r in a period

Qi: Quantity of processed products by processing center i in a period

Mi: Maximum processing capacity of processing center i

p: Tax rate of carbon emissions

(3) Decision variables

$X_{i}=\left\{\begin{array}{cc}{1} & {\text { If i was chosen to be processing center }} \\ {0} & {\text { or else }}\end{array}\right. i \in B$

$Y_{\mathrm{ri}}^{k}=\left\{\begin{array}{cc}{1} & {\text { If collection vehicle } \mathrm{k} \text { travels from node } \mathrm{r} \text { to } \mathrm{i}} \\ {0} & {\text { or else }}\end{array}\right. r \in A, \mathrm{i} \in B, \mathrm{k} \in D$

$Y_{\mathrm{ij}}^{g}=\left\{\begin{array}{cc}{1} & {\text { If transport vehicle } \mathrm{g} \text { travels from node i to j }} \\ {0} & {\text { or else }}\end{array}\right. i \in B, \mathrm{j} \in C, \mathrm{g} \in E$

$X_{r i}=\left\{\begin{array}{ll}{1} & {\text { If products of recycling center } \mathrm{r} \text { are processed by processing center } \mathrm{i}} \\ {0} & {\text { or else }}\end{array}\right. r \in A, \mathrm{i} \in B$

2.4 Mathematical model

$\begin{align}  & \min {{Z}_{1}}=\sum\limits_{i\in I}^{{}}{{{X}_{i}}}B{{C}_{i}}+\sum\limits_{r\in R}{\sum\limits_{i\in I}^{{}}{A{{C}_{r}}}{{Q}_{ri}}}{{X}_{i}} \\ & +\sum\limits_{k\in K}{\sum\limits_{r\in \left( R\bigcup I \right)}{\sum\limits_{i\in \left( R\bigcup I \right)}^{{}}{{{C}_{W}}}{{D}_{ri}}{{Q}_{ri}}}Y_{ri}^{k}}+\sum\limits_{g\in G}{\sum\limits_{i\in \left( I\bigcup J \right)}{\sum\limits_{j\in \left( I\bigcup J \right)}^{{}}{{{C}_{u}}}{{D}_{ij}}{{Q}_{ij}}}Y_{ri}^{g}} \\\end{align}$    (1)

$\min {{Z}_{2}}=p\left( \begin{align}  & \sum\limits_{i\in I}{{{\lambda }_{i}}{{X}_{i}}}+\sum\limits_{k\in K}{\sum\limits_{i\in I}{\sum\limits_{r\in \left( R\bigcup I \right)}{{{\beta }_{i}}{{Q}_{ri}}{{D}_{ri}}Y_{ri}^{k}}}} \\ & +\sum\limits_{g\in G}{\sum\limits_{i\in \left( I\bigcup J \right)}{\sum\limits_{j\in J}{{{\beta }_{ij}}{{Q}_{ij}}{{D}_{ri}}jY_{ij}^{g}}}} \\\end{align} \right)$   (2)

Subject to:

$\sum_{r \in(R \cup I)} \sum_{i \in(R \cup I)} Q_{r} Y_{r i}^{k} \leq Q_{k}$   (3)

$\sum_{i \in(I \cup J)} \sum_{j \in(I \cup J)} Q_{i} Y_{i j}^{g} \leq Q_{g}$   (4)

$\sum\limits_{r\in R}^{{}}{\sum\limits_{k\in K}^{{}}{Y_{ri}^{k}}}{{Q}_{ri}}\le {{M}_{i}}$   (5)

$\sum\limits_{i\in I}{{{X}_{ri}}}=1,r\in R$   (6)

$\sum\limits_{r\in (R\bigcup I)}^{{}}{Y{}_{rm}^{k}}-\sum\limits_{i\in (R\bigcup I)}^{{}}{Y{}_{mi}^{k}}=0,k\in K,m\in \left( R\bigcup I \right)$   (7)

$\sum_{i \in I} \sum_{r \in R} Y_{i r}^{k} \leq 1, k \in K$   (8)

$\sum\limits_{k\in K}{\sum\limits_{r\in R}{Y_{ri}^{k}-{{X}_{i}}}}\le 0,i\in I$   (9)

$\sum\limits_{k\in K}{\sum\limits_{r\in \left( R\bigcup I \right)}{Y_{ri}^{k}}}=1,i\in \left( R\bigcup I \right)$   (10)

$X_{r i}=\{0,1\}, \forall i \in(R \cup I), r \in(R \cup I)$    (11)

$Y_{r i}^{k}=\{0,1\}, \forall i \in(R \cup I), i \in(R \cup I), k \in K$    (12)

$Y_{i j}^{g}=\{0,1\}, \forall i \in(I \cup J), j \in(I \cup J), g \in G$    (13)

${{X}_{i}}=\left\{ 0,1 \right\},\forall i\in I~$   (14)

Eq. (1) sets out the optimization objectives like the costs of location allocaiton, operation and transport. Eq. (2) defines the optimization objective of the carbon emissions cost in the remanufacturing logistics network. Constraints (3) and (4) specify the maximum capacities of collection vehicle and transport vehicle, respectively. Constraint (5) imposes the capacity limit on processing centers. Constraint (6) requires that each recycling center can only be served by one processing center. Constraint (7) assures that transport routes are continuous. Constraint (8) illustrates that each collection vehicle should only pass through one processing center. Constraint (9) stipulates that potential processing centers can be built when selected. Constraint (10) demands that each collection vehicle serves only one recycling center. Constraints (11)~(14) define the possible values.

3. An Improved MACO

The ant colony optimization (ACO) was improved to solve the discrete optimization problem of our remanufacturing logistics network. The ACO mimics the foraging behavior of ant colonies to find the optimal path based on shared special information. In the ACO, the ants in a colony can memorize the shared information on each path and provide feedbacks about the correctness of the path. The path which has been repeatedly proved correct will attract more ants. In this way, more and more ants will make the optimal decision on path selection. However, the path selection may not output the optimal result due to the lack of pheromone, which slows down the convergence and even enters the local optimum trap. In this paper, the MACO is developed by integrating the ACO and the GA, aiming to optimize the remanufacturing logistics network more effectively.

3.1 MACO encoding

In the MACO, individual chromosomes are generated randomly through real number encoding. The chromosomes can be expressed as a n-dimensional vector [m1, m2..., mn], mi$\in${1,2,...,n}. Each mi corresponds to a recycling center. Each collection vehicle starts from the alternative processing center 0. When the transport quantity exceeds its maximum capacity, the collection vehicle returns to the processing center 0, thus creating a path. Next, the collection vehicle leaves the alternative processing center 0 and arrives at the next recycling center. The above steps are repated until the vehicle has trasversed all recylcing centers in all n-dimensional vectors.

3.2 State transition rule

${{p}_{k}}(i,j)=\left\{ \begin{matrix}   \frac{{{[\sum\limits_{m=1}^{M}{{{w}_{m}}\tau _{k}^{m}(i,j)}]}^{\alpha }}\eta _{j}^{\beta }}{\sum\limits_{h\in {{L}_{k}}(i)}{({{[\sum\limits_{m=1}^{M}{{{w}_{m}}\tau _{k}^{m}(i,j)}]}^{\alpha }}\eta _{j}^{\beta })}},q>{{q}_{0}}  \\   \arg \underset{j\in {{L}_{k}}(i)}{\mathop{\max }}\,\{{{[\sum\limits_{m=1}^{M}{{{w}_{m}}\tau _{k}^{m}(i,j)}]}^{\alpha }}\eta _{j}^{\beta }\},q\le {{q}_{0}}  \\\end{matrix} \right.$   (15)

where, wm is the weight of M objectives in the initial phase; $\tau (i,j)=\sum\limits_{m=1}^{M}{{{w}_{m}}\tau _{i}^{m}(i,j)}$ is the pheromone vector; q0 is a random variable uniformly distributed in [0, 1]; ηj is the visibility factor; α is the cumulative pheromone released by individual ants in the colony; β represents relative importance of other shared information for path selection.

3.3 Pheromne update

If ant k decides to move to node j from node i, the pheromone of path (i, j) will be reduced to increase the probability for ants to choose other nodes.The pheromone intensity is updated by:

$\tau^{m}(i, j)=(1-\zeta) \tau^{m}(i, j)+\zeta \Delta \tau^{m}(i, j)$   (16)

where ζ is a constant (0<ζ<1); $(1-\zeta) \tau^{m}(i, j)$ is the volatilization of representative pheromones; Qm represents the size of the pheromone; Fm is the value of the m-th objective function.

3.4 Crossover operation

Based on the crossover rules in the ACO, the crossover operator A was selected to perform the crossover of chromosomes in our problem. Firstly, two parent chromosomes were randomly selected. Then, two points were identified randomly in each parent chromosome. After that, the two parent chromosome swapped the segment between the two points.

To sum up, the AMCO can be implemented in the following steps:

Step 1: Initialize the parameters and place m ants on n alternative processing centers.

Step 2: Each ant k (k=1, 2,... m) moves to the next point j according to Eq. (15). When the ant chooses all the nodes, an individual chromosome is generated. The chromosomes thus generated form the initial population.

Step 3: Calculate the m objective function values of each ant, and update the pareto frontier and Pareto optimal solution set.

Step 4: Perform crossover using the crossover operator A, and then conduct the mutation operation.

Step 5: Update the pheromone according to Equation (16).

Step 6: If the current number of iterations is smaller than the maximum number of iterations, return to Step 2.

Step 7: Terminate the algorithm.

4. Simulation Analysis

The MACO was verified through a simulation on textile product remanufacturing logistics. Specifically, 23 large cities were selected from Guangdong Province, China, and the distances between them were obtained from Google Maps. The cities as potential processing centers were numbered by 1 to 5, the cities as recycling centers are numbered by 6 to 20, and the cities as remanufacturing centers are numbered by 21 to 23. The parameters were set as: α=1, β=5, ρ=0.1, ζ=0.4, q0=0.7, the maximum number of iterations of 150, the crossover rate of 0.9 and the mutuation rate of 0.1. The other parameters are listed in Table 1 below. The simulation results are recorded in Table 2. Three processing centers were selected and five distribution routes were taken as the best routes to optimize the total cost.

Furthermore, the performance of the MACO was compared with that of the ACO and the GA. The ACO parameters were configured as α=1, β=5, ρ=0.2, ζ=0.3, q0=0.8, and the maximum number of iterations of 150. The GA parameters were configured as: the population size of 100, the crossover rate of 0.9, the mutation rate of 0.1 and the maximum number of iterations of 150. The convergence curves of the three algorithms are plotted as Figure 2. It can be seen that the optimal value of the MACO was smaller than that of the GA and that of the ACO. Moreover, the MACO only took 41 iterations to converge to the optimal value, while the GA and ACO respectively took 86 and 75 iterations. To sum up, the MACO outperformed the other two algorithms in finding the optimal solution to remanufacturing logisitics network.

Table 1. Parameter setting

Parameter

Value

Parameter

Value

ACr

350

βi

U (0.03,0.1)

Cw

0.3

Qk

2000

Cu

0.35

Qg

2300

λi

U(730,810)

p

0.02

Table 2. Simulation results

Selected processing center

Distribution route

Location cost

Operating costs

Transportation cost

carbon emissions (kg)

Total cost

1

1-11-17-20-16-1

1-14-15-1

17900

1032500

327400

41150

1378623

2

2-9-6-7-2

2-8-10-12-2

19500

1172500

368990

38110

1561752

4

4-19-13-18-4

23000

892500

177165

4554

1092756

Figure 2. Comparison of convergence curves

5. Conclutions

This paper proposes an improved MACO for remnufacturing logistics network. Through the integration between the ACO with the GA, the MACO enhances the uniformity of individual distribution and jumps out of the local optimum trap. The simulation results show that three processing centers were selected with five best distribution routes according to the MACO. The comparision with the ACO and the GA indicates that our alogrithm is an effective way to optimize the remanufacturing logisitics network.

Acknowledgment

This research was supported by the Fundamental Research Funds for Chinese Central Universities (Grant No.: CUSF -DH-D-2016064).

  References

[1] Lee, D.H., Dong, M. (2009). Dynamic network design for reverse logistics operations under uncertainty. Transportation Research Part E: Logistics and Transportation Review, 45(1): 61-71. https://doi.org/10.1016/j.tre.2008.08.002

[2] Alumur, S.A., Nickel, S., Saldanha-da-Gama, F., Verter, V. (2012). Multi-period reverse logistics network design. European Journal of Operational Research, 220(1): 67-78. https://doi.org/10.1016/j.ejor.2011.12.045

[3] Alshamsi, A., Diabat, A. (2015). A reverse logistics network design. Journal of Manufacturing Systems, 37: 589-598. https://doi.org/10.1016/j.jmsy.2015.02.006

[4] Diabat, A., Abdallah, T., Henschel, A. (2015). A closed-loop location-inventory problem with spare parts consideration. Computers & Operations Research, 54: 245-256. https://doi.org/10.1016/j.cor.2013.08.023

[5] Radhi, M., Zhang, G. (2015). Optimal configuration of remanufacturing supply network with return quality decision. International Journal of Production Research, 54(5): 1487-1502. https://doi.org/10.1080/00207543.2015.1086034

[6] Afshari, H., Sharafi, M., El Mekkawy, T.Y., Peng, Q.J. (2016). Multi-objective optimisation of facility location decisions within integrated forward/reverse logistics under uncertainty. International Journal of Business Performance and Supply Chain Modelling, 8(3):250-276. https://doi.org/10.1504/IJBPSCM.2016.078565

[7] Sangwan, K.S. (2017). Key activities, decision variables and performance indicators of reverse logistics. Procedia CIRP, 61: 257-262. https://doi.org/10.1016/j.procir.2016.11.185

[8] Liao, T.Y. (2018). Reverse logistics network design for product recovery and remanufacturing. Applied Mathematical Modelling, 60: 145-163. https://doi.org/10.1016/j.apm.2018.03.003

[9] Trochu, J., Chaabane, A., Ouhimmou, M. (2018). Reverse logistics network redesign under uncertainty for wood waste in the CRD industry. Resources, Conservation and Recycling, 128: 32-47. https://doi.org/10.1016/j.resconrec.2017.09.011

[10] Zarbakhshnia, N., Soleimani, H., Goh, M., Razavi, M., Sara, S. (2019). A novel multi-objective model for green forward and reverse logistics network design. Journal of Cleaner Production, 208: 1304-1316. https://doi.org/10.1016/j.jclepro.2018.10.138

[11] Elhedhli, S., Merrick, R. (2012). Green supply chain network design to reduce carbon emissions. Transportation Research Part D: Transport and Environment, 17(5): 370-379. https://doi.org/10.1016/j.trd.2012.02.002

[12] Bazan, E., Jaber, M.Y., El Saadany, A.M.A. (2015). Carbon emissions and energy effects on manufacturing–remanufacturing inventory models. Computers & Industrial Engineering, 88: 307-316. https://doi.org/10.1016/j.cie.2015.07.002

[13] Accorsi, R., Cholette, S., Manzini, R., Pini, C., Penazzi, S. (2016). The land-network problem:ecosystem carbon balance in planning sustainable agro-food supply chains. Journal of Cleaner Production, 112: 158-171. https://doi.org/10.1016/j.jclepro.2015.06.082

[14] Tornese, F., Carrano, A.L., Thorn, B.K., Pazour, J.A., Roy, D. (2016). Carbon footprint analysis of pallet remanufacturing. Journal of Cleaner Production, 126(10): 630-642. https://doi.org/10.1016/j.jclepro.2016.03.009

[15] Talaei, M., Moghaddam, B.F., Pishvaee, M.S., Bozorgi-Amiri, A., Gholamnejad, S. (2016). A robust fuzzy optimization model for carbon-efficient closed-loop supply chain network design problem: A numerical illustration in electronics industry. Journal of Cleaner Production, 113(1): 662-673. https://doi.org/10.1016/j.jclepro.2015.10.074

[16] John, S.T., Sridharan, R., Kumar, P.N.R. (2017). Multi-period reverse logistics network design with emission cost. The International Journal of Logistics Management, 28(1): 127-149. https://doi.org/10.1108/IJLM-08-2015-0143