In today’s world, changes in the economic and industrial sectors are taking place more quickly than in the past. Based on today’s competitive market, considering the needs and desires of the customer is very important. Thus, designing the supply chain network to minimize the costs and improve the system efficiency, the service facility, and attention to the timely service delivery to the customer should be considered. Also, deployment costs to determine the number and position of facilities are regarded as another strategic issue. Therefore, to become closer to the real-world application, by considering the Jackson network model (queuing theory), the present study aims to design a closed-loop supply chain (CLSC) network to reduce the waiting time in the queue. Two objectives, namely minimizing the cost and waiting time incurred in queues formed in producers and distributors, are investigated. Queuing mathematical expressions are used both in dealing with objectives and constraints. To develop a model, which is close to real by considering uncertainty, the parameters, including demand rate and shipping cost of products, were considered as a trapezoidal fuzzy number. Also, we crisp this fuzzy uncertainty using both Jimenez and chance-constrained programming approaches. Due to the suggested model’s complexity and nonlinearity, we linearized the mathematical model as much as possible, then two meta-heuristic algorithms, namely multi-objective particle swarm optimization (MOPSO) and non-dominated sorted genetic algorithm (NSGA-II), are used to solve the model. First, the structural parameters of these algorithms are tuned by the Taguchi method. Then, numerous numerical test problems ranging from small to large scales are used to compare these algorithms considering Pareto front measuring indexes and various hypothesis tests.

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Figure 8

Figure 9

Figure 10

Figure 11

Figure 12

Figure 13

Figure 14

Figure 15

Figure 16

Figure 17

Figure 18

Figure 19

Figure 20

Figure 21

Figure 22

Figure 23

Figure 24

Figure 25

Figure 26

Figure 27

Figure 28

Figure 29

Figure 30

Figure 31

Figure 32

Figure 33

Figure 34

Figure 35

Figure 36

Figure 37

Figure 38

Figure 39

Figure 40

Figure 41

Figure 42

Figure 43

Figure 44

Figure 45

Figure 46

Figure 47

Figure 48

Figure 49

Figure 50

Figure 51

Figure 52

Figure 53

Figure 54

Figure 55

Figure 56

Figure 57

This preprint is available for download as a PDF.

Loading...

Posted 08 Jun, 2021

###### No community comments so far

###### Reviews received

Received 03 Jun, 2021

###### Reviewers invited

Invitations sent on 03 Jun, 2021

###### Editor assigned

On 18 May, 2021

###### First submitted

On 16 May, 2021

Posted 08 Jun, 2021

###### No community comments so far

###### Reviews received

Received 03 Jun, 2021

###### Reviewers invited

Invitations sent on 03 Jun, 2021

###### Editor assigned

On 18 May, 2021

###### First submitted

On 16 May, 2021

In today’s world, changes in the economic and industrial sectors are taking place more quickly than in the past. Based on today’s competitive market, considering the needs and desires of the customer is very important. Thus, designing the supply chain network to minimize the costs and improve the system efficiency, the service facility, and attention to the timely service delivery to the customer should be considered. Also, deployment costs to determine the number and position of facilities are regarded as another strategic issue. Therefore, to become closer to the real-world application, by considering the Jackson network model (queuing theory), the present study aims to design a closed-loop supply chain (CLSC) network to reduce the waiting time in the queue. Two objectives, namely minimizing the cost and waiting time incurred in queues formed in producers and distributors, are investigated. Queuing mathematical expressions are used both in dealing with objectives and constraints. To develop a model, which is close to real by considering uncertainty, the parameters, including demand rate and shipping cost of products, were considered as a trapezoidal fuzzy number. Also, we crisp this fuzzy uncertainty using both Jimenez and chance-constrained programming approaches. Due to the suggested model’s complexity and nonlinearity, we linearized the mathematical model as much as possible, then two meta-heuristic algorithms, namely multi-objective particle swarm optimization (MOPSO) and non-dominated sorted genetic algorithm (NSGA-II), are used to solve the model. First, the structural parameters of these algorithms are tuned by the Taguchi method. Then, numerous numerical test problems ranging from small to large scales are used to compare these algorithms considering Pareto front measuring indexes and various hypothesis tests.

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Figure 8

Figure 9

Figure 10

Figure 11

Figure 12

Figure 13

Figure 14

Figure 15

Figure 16

Figure 17

Figure 18

Figure 19

Figure 20

Figure 21

Figure 22

Figure 23

Figure 24

Figure 25

Figure 26

Figure 27

Figure 28

Figure 29

Figure 30

Figure 31

Figure 32

Figure 33

Figure 34

Figure 35

Figure 36

Figure 37

Figure 38

Figure 39

Figure 40

Figure 41

Figure 42

Figure 43

Figure 44

Figure 45

Figure 46

Figure 47

Figure 48

Figure 49

Figure 50

Figure 51

Figure 52

Figure 53

Figure 54

Figure 55

Figure 56

Figure 57

This preprint is available for download as a PDF.

Loading...