Printer Friendly

A flexible integrated forward/reverse logistics model with random path-based memetic algorithm.

Abstract

Due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. The significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. This paper proposes a flexible mixed-integer programming model to deal with such issues. The model integrates the network design decisions in both forward and backward logistics networks, and also applies three kinds of delivering modes (normal delivery, direct shipment, and direct delivery) which enrich the model to be able to deliver the products to customers by distribution-skipping the mid-process strategy in order to deliver products in more flexible paths to customer zones. To tackle with such an NP-hard problem, a memetic algorithm (MA) with random path-based direct representation and combinatorial local search methods is developed. Numerical experiments are conducted to demonstrate the significance and applicability of the model as well as the efficiency and accuracy of the proposed solution approach.

Keywords

Integrated supply chain, Logistics network design, Random path-based direct encoding, Memetic algorithm.

Introduction

Extended producer responsibility is becoming more common across the world. Implementation of legislation, social responsibility, corporate imaging, environmental concern, economic benefits and customer awareness are forcing original equipment manufacturers (OEMs) to manufacture products that are environmentally friendly in order to contribute to the global large-scale effort towards environmental protection. One way of doing so is through the utilization of returned products, which extends their useful life cycle.

Products can be returned for reasons such as customer dissatisfaction and warranty. Such products can be sorted for reuse, remanufacture, recycle and disposal. In addition, industries are using remanufacturing for expensive products such as turbines used in airplane and electricity generation systems. In these cases, the recovery of used products is economically more attractive than disposal (Koh, Hwang, Sohn, & Ko, 2002).

One of the most important and strategic issues in supply chain management is the configuration of the logistics network having a significant effect on the total performance of the supply chain. The configuration of the reverse logistics network, however, has a strong influence on the performance of the forward logistics network, and vice versa, as they share a number of resources. Due to the fact that designing the forward and reverse logistics separately leads to suboptimal designs with respect to strategic and tactical costs, the design of the forward and reverse logistics networks should be integrated (Fleischmann, Beullens, Bloemhof, Ruwaard, & Wassenhove, 2001; Lee & Dong, 2008; Verstrepen, Cruijssen, de Brito, & Dullaert, 2007).

Previous research in the area of forward, reverse and integrated logistics network design was often limited to the consideration of the flow to be transported between two consecutive stages. In other words, there is no flow between facilities that are not consecutive. Nevertheless, considering flows between facilities that are not consecutive will enhance logistics network efficiency and flexibility.

Based on the aforementioned considerations, this paper addresses the issue of flexible, integrated, multi-stage forward/reverse logistics network design including suppliers, production, distribution, collection/ inspection, recovery and disposal facilities with limited capacity. The rest of this paper is structured as follows:

Section 2 offers a literature review to assess the state-of-the-art in forward/reverse logistics network design. To design flexible integrated forward/reverse logistics networks, a generalized mixed integer linear programming (MILP) formulation is developed in sections 3 and 4. Section 5 presents an efficient MA using a dynamic search strategy to find solutions for large-scale problems. The computational performance of the metaheuristic algorithm is analyzed in Section 6. Section 7 concludes this paper and offers guidelines for further research.

Literature review

This section presents a brief review of the most relevant and recent literature in closed-loop supply chain network design problems followed by two tables in order to categorize this area based on network types and demonstrate some gaps in this research field.

Integrated forward and reverse logistics refers to all those activities associated with the transformation and flows of goods and services with their information from the sources of the materials to the end users. Dullaert et al. (2007) gave a general review of the supply chain design models to support the development of richer supply chain models. These models range from simple uncapacitated facility location models to complex capacitated multi-objective models aimed at determining the cost minimizing or profit maximizing system design.

In the context of reverse logistics, various models have been developed in the last decade. Krikke et al. (1999) designed a MILP model for a two-stage reverse supply chain network for a copier manufacturer. In this model, processing costs of returned products and inventory costs are noticed in the objective function for minimizing the total cost. Fleischmann et al. (2001) designed a reverse logistics network by considering the forward flow together with the reverse flow, which has no capacity limitation. Extending Fleischmann et al.'s model, Salema et al. (2007) proposed a general model that has been applied to an Iberian company. However, when suspending the logistics between dismantlers and plants, both Fleischmann et al. and Salema et al.'s models did not consider the supplier side, and lacked the relations between forward and reverse flows. Jayaraman et al. (1999) developed a MILP model for reverse logistics network design under a pull system based on customers' demand for recovered products. The objective of the proposed model was to minimize total cost. Aras et al. (2008) developed a non-linear model and Tabu search solution approach for determining the locations of collection centers and the optimal purchase price of used products in a simple profit maximizing reverse logistics network. Biehl et al. (2007) simulated a carpet reverse logistics network, in which a specified experiment was used to analyze the effect of the system design and environmental factors influencing on the operational performance of the reverse logistics system. Kannan et al. (2010) developed a closed loop MILP model to determine raw materials, production, distribution and inventory, disposal, and recycling at different facilities. They presented a heuristic based on the genetic algorithm for their model minimizing the total supply chain costs. El-Sayed et al. (2010) presented a multi-period multi-echelon forward-reverse logistics network design model while the objective of their model was to maximize the profit of a supply chain. A bi-objective integrated forward/reverse supply chain design model was suggested by Pishvaee et al. (2010), in which the costs and the responsiveness of a logistics network were considered to be objectives of the model. They developed an efficient multi-objective priority-based MA by applying three different local searches in order to find the set of non-dominated solutions.

In addition, some researchers have presented studies on the optimization of stochastic supply chain network design in reverse logistics. Listes & Dekker (2005) proposed a stochastic approach to the case study of recycling and demolition waste, while uncertainty was associated with demand source and quality. Pouralikhani et al. (2013) proposed an uncertain multi-period multi-stage closed-loop logistics network design model incorporating strategic network design decisions along with tactical material flow to avoid sub-optimality from separated design in both parts. The demands of first market customer zones are assumed to be stochastic. The problem is formulated in a mixed integer non-linear programming (MINLP) decision making form as a multi-stage stochastic program with objective function maximizing the total expected profit.

In a practical case study of remanufacturing, Kerr et al. (2001) attempted to quantify the life cycle environmental benefits achieved by incorporating remanufacturing into a product system, based on a study of Xerox photocopiers in Australia. They found that remanufacturing could reduce resource consumption and wastes generation if a product is designed for disassembly and remanufacturing.

Most of previous researches have utilized mixed integer programming (MIP) to model the problem. These models range from simple single objective forward facility location models (Jayaraman & Pirkul, 2001) to complex multi-objective closed-loop models (Chaabane, Ramudhin, & Paquet, 2012).

Moreover, since the majority of logistics network design problems can be categorized as NP-hard, many powerful heuristics, metaheuristics and Lagrangian relaxation (LR)-based methods have been developed for solving these models. Dengiz et al., (1997) offered many examples of GA, demonstrating that it can be applied to a wide variety of applicative areas. In the reverse logistics, Min et al. (2006) also successfully used GA to develop a multi-echelon reverse logistics network for product returns.

Elhedhli & Merrick (2012) have considered emission costs alongside fixed and variable location and production costs in a forward SCND problem. They used a concave function to model the relationship between CO2 emissions and vehicle weight. As the direct solution of their proposed model is not possible, Lagrangian relaxation is used to solve it. Wang et al. (2011) have considered the environmental concerns of forward SCND by proposing a multi-objective optimization model that captures the trade-off between the total costs and the environmental impacts. M. Pishvaee, Torabi, & Razmi (2012) proposed a credibility-based fuzzy mathematical model for a forward supply chain network with three stages. Their model aims to minimize both the environmental impacts and total costs. They showed the applicability of the model as well as the usefulness of the solution method in an industrial case study.

Jandagh et al. (2011) discussed the applications of qualitative research methods in management sciences. The differences between quantitative and qualitative research were clarified, and the statistical methods suitable for such research were explored.

Safari et al. (2012) aimed at offering such a mathematical model where the coefficients and constants used have all been extracted based on the analysis of research and educational aspects of Shahed University. The proposed model was a lexicographic model with 36 decision variables that were broken down into two classes of university source variables (15) and university product variables. The model also included 49 goals, seven structural constraints and 20 integer variables.

Mansourfar (2013) attempted to evaluate the potential advantages of international portfolio diversification for East Asian international investors when investing in the Middle Eastern emerging markets. Overall, the results of both econometric and the metaheuristic optimization methods supported each other. The findings of that study highlight the potential role of the Middle Eastern equity markets in providing international portfolio diversification benefits for East Asian investors. It was also found that the long and the short-term efficient frontiers in any of the intra- or inter-regionally diversified portfolios did not provide similar benefits.

Hamid (2014) investigated whether there was any relationship between consumer attitude, perceived value, and green products. To establish such an assumption, a sample of 300 educated respondents was selected to participate in the survey. The study concluded that within the given context of a developing country, consumers had a negligible attitude to and low perceived value of green products. Hence, no significant relationship was found between attitude, perceived value, and green products.

Recently, the importance of collecting and treating end-of-life (EOL) products has increased substantially (Sasikumar et al., 2008a; Sasikumar et al., 2008b;, Sasikumar et al., 2009; Pokharel et al., 2009) overviewed various aspects of reverse logistics (RL). Accordingly, the design of RL networks has interested researchers considerably (Kannan et al., 2012;Srivastava, 2008). Pishvaee, Kianfar, and Karimi (2010) developed a mixed integer linear programming model for a multistage RL network in which both opening and transportation costs were taken into account. Since the model is NP-hard, they have proposed a simulated annealing algorithm with special neighbourhood search mechanisms. Kannan et al. (2012) considered the environmental impacts of the RL network model proposed by Pishvaee et al. (2010) by appending a carbon footprint term to the objective function. They tested their model with a case study in the plastic industry. Fonseca et al. (2010) developed a bi-objective model in which total costs and environmental impacts of an RL network are taken into account. By using two-stage stochastic programming, the uncertainty of both shipping costs and waste generation amount is captured in their model. They applied the model for a case in the province of Cordoba.

To avoid the sub-optimality that arises from the separate modelling of forward and reverse networks, many researchers have integrated forward and reverse network design, known as closed-loop SCND (CLSC) (Soleimani, Seyyed-Esfahani, & Kannan, 2014). Fleischmann et al. (2001) suggested a mixed integer linear programming (MILP) model for designing a CLSC. They showed that RL operations could often be efficiently integrated into existing forward logistics. Schultmann, Zumkeller, & Rentz (2006) considered EOL vehicle treatment in Germany. They concentrated on the flow of used products and reintegrated reverse flow of used products into their genuine supply chains. They have modelled RL with vehicle routing planning and finally have used Tabu search (TS) to solve the model.

Wang and Hsu (2010) have integrated environmental issues into an integer CLSC model, and have also developed a genetic algorithm (GA) based on a spanning tree structure to solve the propounded NP-hard model. Pishvaee and Razmi (2012) proposed a multi-objective fuzzy mathematical programming model for designing an environmental supply chain under inherent uncertainty of input data in such problem. They applied the life cycle assessment (LCA) method to quantify the environmental influence of the network.

Devika et al. (2014) simultaneously considered the three pillars of sustainability in the network design problem. A mixed integer programming model was developed for this multi-objective closed-loop supply chain network problem. In order to solve this NP-hard problem, three novel hybrid metaheuristic methods were developed. Moreover, they have classified the published literature according to some main features. A more detailed classification of the literature is illustrated in Table 2 by considering three characteristics: modelling type, outputs of the models and solution approaches. To summarize Table 2, a coding system is presented in Table 1 by which the literature is reviewed in Table 2.

Many research directions still require intensive research in the area of closed-loop logistics network design problems. Moreover, since network design problems belong to the class of NP-hard problems, developing efficient solution methods is still a critical need in this area.

Problem description

As illustrated in Figure 1, in this paper an MILP model with seven echelons for a closed-loop supply chain network problem is proposed. The illustrated model emphasizes different delivery methods by considering three types of paths: i) normal delivery, in which products are delivered from one echelon to another adjoining one, ii) direct shipment delivery, in which products are delivered from plants to customers directly, and iii) direct delivery, in which products transport from DCs to customers or via plants to retailers directly.

The proposed model is based on the following common assumptions in the literature (Syarif, Yun, & Gen, 2002; H.-F. Wang & Hsu, 2010; Yao & Hsu, 2009):

* The demand of customers must be satisfied.

* The number of facilities in each echelon as well as their potential sites is restrained by pre-defined values.

* There is no flow between the facilities of the same echelon.

* The recovery and disposal rates are known in advance.

* In this supply chain network, there are a maximum of seven echelons: suppliers, plants, DCs, retailers, customers, collection/inspection centers, and disposal centers.

* Customers have no special preferences; that is, the price of products is the same wherever a customer buys them.

As a special characteristic of closed-loop logistics, suggested Van Der Laan et al. (1999), we assume that the number of the end-of-life products returned to the collection/inspection centers is a fraction of customers' demands. In addition, they are allocated to the treatment facilities based on their qualities.

The problem in this study can be stated as follows:

Given:

* The set of potential sites for locating facilities;

* The set of available paths to deliver products to customers;

* The demand of customers;

* The cost of opening facilities and shipping materials;

* The fraction of end-of-life products in each customer zone that is returned to the respective collection/inspection center;

* The fraction of end-of-life products classified in the collection/ inspection centers for each treatment center;

* The fraction of end-of-life products transported from each collection/inspection center to the plants;

* The capacity of each facility.

Determine:

* The configuration of supply chain network;

* The best route to deliver products to customer zones;

* The number of products that have to be manufactured at each plant;

* The assignment of customers to distribution centers and collection/ inspection centers;

* The assignment of suppliers to plants.

The major contributions and features that distinguish this study from those previous are as follows:

- The forward and reverse logistics are integrated, while many previous supply chain networks are just forward-extended logistics networks (see Gen, Cheng, & Lin 2008);

- Different methods of delivering products to customers are considered in forward networks, while to the best of our knowledge there is no application of these methods in the closed-loop logistics network design (see Wang & Hsu, 2010; Devika et al. 2014);

- Applying the random path-based solution representation in the metaheuristic approach to tackle the NP-hard nature of the problem in closed-loop networks is the last contribution of this paper. It should be noted that previous works in this area have applied other solution representations such as priority-based encoding method (M.S. Pishvaee, Farahani, et al., 2010), spanning tree-based (H.F. Wang & Hsu, 2010) or other approaches (see Govindan, Soleimani, & Kannan, 2014).

Model formulation

The notations of the proposed model are presented as below:

Indices

I     The Number of Suppliers with i = 1, 2,..., I
J     The Number of Plants with j = 1, 2,..., J
K     The Number of Distribution Centers (DCs) with k = 1, 2,..., K
L     The Number of Retailers with l= 1, 2,..., L
M     The Number of Customers with m = 1, 2,..., M
N     The Number of Collection/ Inspection Centers with n = 1, 2,..., N
O     The Number of Disposal Centers with o = 1, 2,..., O

Parameters

[cai.sub.i]     The Capacity of Supplier i
[caj.sub.j]     The Capacity of Plant j
[cak.sub.k]     The Capacity of Distribution Center k
[cal.sub.l]     The Capacity of Retailer l
[cam.sub.m]     The Demand of Customer m
[can.sub.n]     The Capacity of Collection/Inspection Center n
[Cao.sub.o]     The Capacity of Disposal Center o
[pr.sub.m]      The Recovery Percentage of Customer m
[pd.sub.n]      The Disposal Percentage of Collection/ Inspection
                Center n
[a.sub.ij]      The Unit Cost of Transportation from Supplier i to
                Plant j
[b.sub.jk]      The Unit Cost of Transportation from Plant j to DC k
[c.sub.jl]      The Unit Cost of Transportation from Plant j to
                Retailer l
[d.sub.jm]      The Unit Cost of Transportation from Plant j to
                Customer m
[e.sub.kl]      The Unit Cost of Transportation from DC k to Retailer l
[f.sub.km]      The Unit Cost of Transportation from DC k to Customer m
[g.sub.lm]      The Unit Cost of Transportation from Retailer l to
                Customer m
[h.sub.mn]      The Unit Cost of Tran sportation from Customer m to
                Collectio n/Ins pec tion Center n
[i.sub.nj]      The Unit Cost of Transportation from
                Collection/Inspection Center
                n to Plant j
[j.sub.no]      The Unit Cost of Transportation from
                Collection/Inspection Center
                n to Disposal Center o
[FCJ.sub.j]     Fixed Cost of Operating Plant j
[FCK.sub.k]     Fixed Cost of Operating DC k
[FCL.sub.l]     Fixed Cost of Operating Retailer l
[FCN.sub.n]     Fixed Cost of Operating Collection/Inspection Center n
[FCO.sub.o]     Fixed Cost of Operating Disposal Center o

Variables Continuous Variables

[XIJ.sub.ij]  Quantity of Products Shipped from Supplier i to Plant j
[XJK.sub.jk]  Quantity of Products Shipped from Plant i to DC k
[XJL.sub.jl]  Quantity of Products Shipped from Plant j to Retailer l
[XJM.sub.jm]  Quantity of Products Shipped from Plant j to Customer m
[XKL.sub.kl]  Quantity of Products Shipped from DC k to Retailer l
[XKM.sub.km]  Quantity of Products Shipped from DC k to Customer m
[XLM.sub.lm]  Quantity of Products Shipped from Retailer l to
              Customer m
[XMN.sub.mn]  Quantity of Products Shipped from Customer m to
              Collection/Inspection Center n
[XNJ.sub.nj]  Quantity of Products Shipped from Collection/Inspection
              Cente n to Plant j
[XNO.sub.no]  Quantity of Products Shipped from Collection/Inspection
              Center n to Disposal Center o

Binary Variables

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]  If production takes
                                                     place at Plant j
                                                     Otherwise
[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]  If a distribution
                                                     center is opened at
                                                     location k
                                                     Otherwise
[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]  If a distribution
                                                     center is opened
                                                     at location l
                                                     Otherwise
[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]  If a Collection/
                                                     Inspection center
                                                     is opened at
                                                     location n
                                                     Otherwise
[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]  If a disposal
                                                     center is opened
                                                     at location o
                                                     Otherwise


[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

The model seeks to minimize the total investment and operation costs of the flexible closed-loop logistics network design problem with products being simultaneously shipped and collected (1). These costs are depicted as i) transportation costs between facilities and depots as well as between depots and customers for each forwarded or collected product, and ii) investments required to open a facility.

The following constraints ensure that the flow of products is maintained and the demands are satisfied.

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (2)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (3)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (4)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (5)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (6)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (7)

The amount of products transmitted from each facility is restricted by its capacity in constraints 8 to 13:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (8)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (9)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (10)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (11)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (12)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (13)

Constraint (14) ensures that the customer demand is satisfied:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (14)

Finally, integrality and non-negativity of variables are guaranteed:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (15)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (16)

Solution approach

The inherent characteristics of the Genetic Algorithm (GA) indicate why this algorithm may be a suitable method for flexible logistics network design problems. Applying a population of answers in many generations causes GA to search in multiple directions. On the other hand, lack of capacity of enough search intensification is often a disadvantage to a pure GA. To improve the intensification of the search in GA, Moscato & Norman (1992) first introduced Memetic Algorithm (MA). MA is a population-based metaheuristic algorithm that is similar to GA and has an additional local search to improve the intensification of GA toward global optimum answers. It has been proved that MA has practical success in a variety of problem domains such as NP-hard optimization models (Moscato & Cotta, 2003).

Applying domain knowledge and population-based search methods such as GA, as well as local search ones such as Simulated Annealing (SA), MA combine the advantages of both intensification and diversification of heuristic algorithms. Recently, MA has been applied in a variety of NP-hard problems such as production-distribution problems (Boudia & Prins, 2009), scheduling models (Tavakkoli-Moghaddam, Safaei, & Sassani, 2009), minimum span frequency assignment problems (Kim, Smith, & Lee, 2007), and partitioning problems (ElMekkawy & Liu, 2009). This paper applies an MA to the flexible closed-loop logistics model described as follows.

Chromosome representation

Although applying a flexible logistics model improves the flexibility and efficiency of the supply chain network, using the new delivery routes makes the problem much more complex. To tackle such an NP-hard problem, the random path-based direct encoding method is adopted; the ability of this approach to manage candidate solutions has been described by Gen & Cheng (1999). As shown in Figure 2, the chromosome's length is 7xN (N is the number of customers), and every seven genes produces one unit, each of which denotes the delivery route to a customer as well as the recovery route from that customer.

The first three alleles of a unit represent the backward flow of the network, which shows the flow to collection/inspection rcenters, disposal centers, and plants, respectively. The four remaining alleles of that unit show the forward flow from suppliers to customers, where each of alleles represents the ID of retailers, DCs, plants, and suppliers, respectively. As an illustration, an ID randomly assigned to these facilities in the reverse and forward flow is shown in Figure 4. It should be noted that applying this encoding approach might generate an unfeasible solution, which violates the facility capacity constraint. A repairing method is therefore imperative. As discussed earlier, in the delivery route to a customer at least one plant must be assigned. If the total demand of a customer from a plant exceeds its capacity, that customer will be assigned to another plant with sufficient product supply so that the transportation costs between that assigned plant and the customer is the lowest.

Inputs:
   M: The number of customers
   N: The number of collection/ inspection centers
   O: The number of disposal centers
   L: The number of retailers
   K: The number of DCs
   J: The number of plants
   I: The number of suppliers
     Begin
For i = 0 to N-1
   [C.sub.k] [7xi + 1] [left arrow] random (1,N)
   [C.sub.k] [7xi + 2] [left arrow] random (1,0)
   [C.sub.k] [7xi + 3] [left arrow] random (1,J)
   [C.sub.k] [7xi + 4] [left arrow] random (1,L)
   [C.sub.k] [7xi + 5] [left arrow] random (1,K)
   [C.sub.k] [7xi + 6] [left arrow] random (1,J)
   [C.sub.k] [7xi + 7] [left arrow] random (1,I)
End
 End
Output: The chromosome [C.sub.K] []

Fig. 3. Random path-based direct encoding procedure


Random path-based direct decoding

The delivery and recovery paths can be conventionally determined by applying the random path-based direct decoding procedure. Using this method speeds up the algorithm. Table 3 and Figure 4 represent an instance of the delivery and recovery route in our model, which helps to understand better the decoding procedure for our approach.

Memetic operators

The role of operators in the quality of answers is unavoidable in MAs, and this paper has focused on the crossover and local search methods, population size, fitness function or selection approach and termination conditions. Inspired by the research conducted on these issues in the literature of metaheuristics algorithms in other fields of operations research, we applied the mostly compatible approaches to the closed-loop logistics network design problem with different delivery paths, as below:

Cross over

We applied the most common method for GAs and MAs: the two-point crossover. In this method we first generate two random positions: head and tail. Then, the substring between these positions is exchanged with the second chromosome in the same range.

Local search

After crossing, two offspring are created. The child with a better fitness function is selected for further improvement during the subsequent local search method in which a combinatorial crossover method has been applied, as explained below.

Combinatorial local search

In this approach, the most economic path in the neighbourhood of a customer is calculated, and the path with the lowest cost is selected. As illustrated in Figure 5 in a relatively narrow area, the trade-off between quality of the answers and consumption of CPU time is satisfactorily managed.

Input: problem data and qualified offspring from crossing
For i = 1 : M
From all available routes from [c.sub.k] []
Calculate the total transportation cost through each path
Select the best path
Output: the best delivery path to a customer in the qualified offspring

Fig. 5. Pseudo code of combinatorial local search


Selection

In the proposed MA, the popular roulette wheel selection approach is applied to select the next generation from the old population, making the selection probability of a chromosome proportional to its fitness value.

Computational results

To test the accuracy and efficiency of the proposed MA, the following example is adopted as a base for comparison. To test the efficiency, different sizes of the test problems are produced through doubling the numbers of the nodes at each stage, as shown in Table 4, and running ten times for each problem. A total of 50 experiments were investigated by our algorithm. Other parameters are generated randomly using uniform distributions, as shown in Table 4. The results were compared withILOG -CPLEX. These experiments were all performed on a PC with an Intel[R] Core[TM] i5 2.53 GHZ computer with 4 GB. Test problem 1 is the illustrative example of which I = 1, J = 2, K = 5, L = 8, M = 20, N = 2, O = 1. In test problem 2, I = 2, J = 4, K = 10, L = 16, M = 40, N = 4 and O = 2, there are 142 constraints, and 516 variables (including 36 binary variables), and the optimal solution is 50742 by LINGO. In test problem 3, I = 4, J = 8, K = 20, L = 32, M = 80, N = 8, and O = 4, there are 284 constraints, and 2012 variables (including 72 binary variables). The problem size increases to 568 constraints and 7848 variables in problem 4, and problem 5 reaches 1136 constraints and 30608 variables. We can observe that the size of the problem increased immensely.

To evaluate the efficiency and accuracy of our MA, LINGO was first implemented as it is the most commonly applied software. The results are illustrated in Table 6. For test problem 3, after 10[conjunction]12 iterations and 20 min(s) of elapsed runtime LINGO failed to obtain the final solution, as with test problem 4. For problem 5, LINGO failed to find a feasible solution before 40 min. With our MA, two cases were considered: one was done with the same population size of 80 for five test problems regardless of the problem size, and the other was done by increasing the population size with the problem size in order to obtain more accurate results. Table 6 summarizes the test results.

From Table 6 it can be observed that LINGO fails to solve such kinds of large-scale models, whereas our algorithm is capable of doing so. Besides, with our MA, increasing the population size with problem size only slightly improved accuracy of the problem, yet requires a large computation time. Therefore, we do not have to use a large population size to implement our algorithm as the problem size increases.

As far as LINGO cannot solve large-scale problems with its branch-and-bound method; CPLEX is considered to be more efficient by its branch-and-cut method, and thus was developed for more experiments. The comparisons of our algorithm and CPLEX with different error rates are illustrated in Table 7, of which the costs in boldface are the optimum answers.

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (17)

Moreover, from Table 7, it can be illustrated that although a larger population size can improve the solution, it consumes huge computation time. The 'trade-off' between these is to find a suitable population size in the consideration of the error rate and CPU time. Therefore, if we set the acceptable error rate in advance, the respective population size can be determined. In our experiments, 7% of the acceptable error rate was assumed, and thus the population size of 80 was used. In reality, the control of error and making of effective decisions are the most important concerns of a company, which can then be achieved by setting a suitable population size under a required accuracy using our algorithm. In summary, the proposed random path-based memetic algorithm has demonstrated its performance in terms of both accuracy and efficiency.

Conclusion and future remarks

In this paper, an MILP for a multi-stage closed loop supply chain network design problem is developed that aims to minimize the total cost of opening facilities and transportation in the proposed network. Many research studies have been conducted on closed-loop logistics network design problems in which the network includes suppliers, plants, DCs, customer zones, collection/inspection and disposal centers with normal delivery paths from two consecutive echelons of the network. However, there still exists a gap in both quantitative modeling and the solution approach of flexible multi-stage closed-loop logistics problems. The proposed model considering retailer centers in the network is able to build up a logistics network more productively and flexibly with different delivery modes.

In more detail, the proposed network has considered three kinds of delivering paths in its model that were not used in closed-loop network problems previously. These are: normal delivery, to transport products from an echelon to another adjoining one; direct shipment, to deliver products from plants to customers directly rather than via DCs and retailers; direct delivery, to transport products from DCs to customers, or from plants to retailers to customers directly. Applying this strategy in distribution, skipping the mid-process, leads to closer routes to customers, reduced transportation costs and lead times and increased customer satisfaction.

To solve the problem on larger scales a memetic algorithm with a combinatorial local search method is applied to find near optimum solutions in large-scale problems. Some test problems from small to large sizes are also solved with LINGO and CPLEX optimization software. Comparing the results obtained by exact methods via those obtained by the memetic algorithm proved the algorithm's accuracy, capability, and efficiency.

The proposed future remarks are as below:

- Other objective functions, such as responsiveness, tardiness, and robustness can be considered as other goals in designing the flexible logistics network design problem.

- The uncertainty embedded in demand and recovery rates can be examined in a more analytical way to make the model closer to reality.

- The proposed random path-based direct encoding approach and combinatorial local search method for the flexible closed-loop logistics network design problem can be applied in other metaheuristic algorithms such as cloud theory-based simulated.

References

Aras, N.; Aksen, D. & Gonul Tanugur, A. (2008). "Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles". European Journal of Operational Research, 191(3), 1223-1240.

Biehl, M.; Prater, E. & Realff, M J. (2007). "Assessing performance and uncertainty in developing carpet reverse logistics systems". Computers & Operations Research, 34(2), 443-463.

Boudia, M. & Prins, C. (2009). "A memetic algorithm with dynamic population management for an integrated production-distribution problem". European Journal of Operational Research, 195(3), 703-715.

Chaabane, A.; Ramudhin, A. & Paquet, M. (2012). "Design of sustainable supply chains under the emission trading scheme". International Journal of Production Economics, 135(1), 37-49.

Dengiz, B.; Altiparmak, F. & Smith, A. E. (1997). "Local search genetic algorithm for optimal design of reliable networks". Evolutionary Computation, IEEE Transactions on, 1(3), 179-188.

Devika, K.; Jafarian, A. & Nourbakhsh, V. (2014). "Designing a sustainable closed-loop supply chain network based on triple bottom line approach: A comparison of metaheuristics hybridization techniques". European Journal of Operational Research, 235(3), 594-615.

Dullaert, W.; Braysy, O.; Goetschalckx, M.; Raa, B. & Center, A. (2007). "Supply chain (re) design: Support for managerial and policy decisions". European Journal of Transport and Infrastructure Research, 7(2), 73-92.

El-Sayed, M.; Afia, N. & El-Kharbotly, A. (2010). "A stochastic model for forward-reverse logistics network design under risk". Computers & Industrial Engineering, 58(3), 423-431.

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.

ElMekkawy, T. & Liu, S. (2009). "A new memetic algorithm for optimizing the partitioning problem of tandem AGV systems". International Journal of Production Economics, 118(2), 508-520.

Fleischmann, M.; Beullens, P.; BLOEMHOF-RUWAARD, J. M. & WASSENHOVE, L. N. (2001). "The impact of product recovery on logistics network design". Production and operations management, 10(2), 156-173.

Fonseca, M. C.; Garcia-Sanchez, a.; Ortega-Mier, M.; & Saldanha-da-Gama, F. (2010). "A stochastic bi-objective location model for strategic reverse logistics". Top, 18(1), 158-184.

Gen, M. & Cheng, R. (1999). Genetic algorithms and engineering optimization (Vol. 7): Wiley-interscience.

Gen, M.; Cheng, R. & Lin, L. (2008). Network models and optimization: Multiobjective genetic algorithm approach: Springer.

Govindan, K.; Soleimani, H. & Kannan, D. (2014). "Reverse logistics and closed-loop supply chain: A comprehensive review to explore the future. European Journal of Operational Research, 240(3), 603-626.

Hamid, A. (2014). "A Study on the Relationship between Consumer Attitude, Perceived Value and Green Products". Iranian Journal of Management Studies, 7(2), 315-328.

Jayaraman, V.; Guide Jr, V. & Srivastava, R (1999). "A closed-loop logistics model for remanufacturing". Journal of the operational research society, 49, 507-508.

Jayaraman, V. & Pirkul, H. (2001). "Planning and coordination of production and distribution facilities for multiple commodities". European Journal of Operational Research, 133(2), 394-408.

Kannan, D.; Diabat, A.; Alrefaei, M.; Govindan, K. & Yong, G. (2012). "A carbon footprint based reverse logistics network design model". Resources, Conservation and Recycling, 67, 75-79.

Kannan, G.; Sasikumar, P. & Devika, K. (2010). "A genetic algorithm approach for solving a closed loop supply chain model: Acase of battery recycling". Applied Mathematical Modelling, 34(3), 655-670.

Kerr, W. & Ryan, C. (2001). "Eco-efficiency gains from remanufacturing: A case study of photocopier remanufacturing at Fuji Xerox Australia". Journal of cleaner production, 9(1), 7, 81-85.

Kim, S.-S.; Smith, A. E. & Lee, J.-H. (2007). "A memetic algorithm for channel assignment in wireless FDMA systems". Computers & operations research, 34(6), 1842-1856.

Koh, S.-G.; Hwang, H.; Sohn, K.-I. & Ko, C.-S. (2002). "An optimal ordering andrecovery policy for reusable items". Computers & Industrial Engineering, 43(1), 59-73.

Krikke, H.; van Harten, A. & Schuur, P. (1999). "Business case Oce: reverse logistic network re-design for copiers". OR-Spektrum, 21(3), 381-409.

Lee, D. -H. & Dong, M. (2008). "A heuristic approach to logistics network design for end-of-lease computer products recovery". Transportation Research Part E: Logistics and Transportation Review, 44(3), 455-474.

Listes, O. & Dekker, R. (2005). "A stochastic approach to a case study for product recovery network design". European Journal of Operational Research, 160(1), 268-287.

Mansourfar, G. (2013). "Econometrics and Metaheuristic Optimization Approaches to International Portfolio Diversification". Iranian Journal of Management Studies, 6(6), 45-75.

Min, H.; Jeung Ko. H. & Seong Ko. C. (2006). "A genetic algorithm approach to developing the multi-echelon reverse logistics network for product returns". Omega, 34(1), 56-69.

Moscato, P. & Cotta, C. (2003). "A gentle introduction tomemetic algorithms". Handbook of metaheuristics (pp. 105-144): Springer.

Moscato, P. & Norman, M. G. (1992). "A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passingsystems". Parallel Computing and Transputer Applications, 1, 177-186.

Pishvaee, M.; Torabi, S. & Razmi, J. (2012). "Credibility-based fuzzy mathematical programming model for green logistics design under uncertainty". Computers & Industrial Engineering, 62 (2), 624-632.

Pishvaee, M. S.; Farahani, R. Z. & Dullaert, W. (2010). "A memetic algorithm for bi-objective integrated forward/reverse logistics network design". Computers & operations research, 37(6), 1100-1112.

Pishvaee, M. S.; Kianfar, K. & Karimi, B. (2010). "Reverse logistics network design using simulated annealing". The International Journal of Advanced Manufacturing Technology, 47(1-4), 269-281.

Pishvaee, M. S. & Razmi, J. (2012). "Environmental supply chain network design using multi-objective fuzzy mathematical programming". Applied Mathematical Modelling, 36(8), 3433-3446.

Pokharel, S. & Mutha, A. (2009). "Perspectives in reverse logistics: a review". Resources, Conservation and Recycling, 53(4), 175-182.

Pouralikhani, Hamed; Najmi, Hesamaddin; Yadegari, Ehsan & Mohammadi, Emran (2013). "A Multi-Period Model for Managing Used Products in Green Supply Chain Management under Uncertainty". J. Basic Appl. Sci. Res., 3(2), 984-995.

Safari, S.; Sardari, A. & Sabzian, H. (2012). "Designing a Mathematical Model for Allocating Budget to University Research and Educational Goals: A Case Study in Shahed University". Iranian Journal of Management Studies, 5(5), 88-113.

Salema, M. I. G.; Barbosa-Povoa, A. P. & Novais, A. Q. (2007). "An optimization model for the design of a capacitated multi-product reverse logistics network with uncertainty". European Journal of Operational Research, 179(3), 1063-1077.

Sasikumar, P. & Kannan, G. (2008a). "Issues in reverse supply chains, partI: end-of-life product recovery and inventory management--an overview". International Journal of Sustainable Engineering, 1(3), 154-172. doi: 10.1080/19397030802433860.

Sasikumar, P. & Kannan, G. (2008b). "Issues in reverse supply chains, part II: reversedistribution issues--an overview". International Journal of Sustainable Engineering, 1(4), 234-249. doi: 10.1080/19397030802509974.

Sasikumar, P. & Kannan, G. (2009). "Issues in reverse supply chain, part III: classification and simple analysis". International Journal of Sustainable Engineering, 2(1), 2-27.

Schultmann, F.; Zumkeller, M. & Rentz, O. (2006). "Modeling reverse logistic tasks within closed-loop supply chains: An example from the automotive industry". European Journal of Operational Research, 17(3) 1033-1050.

Soleimani, H.; Seyyed-Esfahani, M. & Kannan, G. (2014). "Incorporating risk measures in closed-loop supply chain network design". International Journal of Production Research, 52(6), 1843-1867.

Srivastava, S. K. (2008). "Network design for reverse logistics". Omega, 36(4), 535-548. doi: http://dx.doi.org/10.1016/j.omega.2006.11.012.

Syarif, A.; Yun, Y., & Gen, M. (2002). "Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach". Computers & Industrial Engineering, 43(1), 299-314.

Tavakkoli-Moghaddam, R.; Safaei, N. & Sassani, F. (2009). "A memetic algorithm for the flexible flow line scheduling problem with processor blocking". Computers & Operations Research, 36(2), 402-414.

Van Der Laan, E.; Salomon, M.; Dekker, R. & Van Wassenhove, L. (1999). "Inventory control in hybrid systems with remanufacturing". Management science, 45(5), 733-747.

Verstrepen, S.; Cruijssen, F.; de Brito, M. P. & Dullaert, W. (2007). "An exploratory analysis of reverse logisticsin Flanders". European Journal of Transport and Infrastructure Research, 7(4), 301-316.

Wang, F.; Lai, X. & Shi, N. (2011). "A multi-objective optimization for green supply chain network design". Decision Support Systems, 51(2), 262-269.

Wang, H.-F. & Hsu, H.-W. (2010). "A closed-loop logistic model with a spanning-tree based genetic algorithm". Computers & operations research, 37(2), 376-389.

Yao, M.-J. & Hsu, H.-W. (2009). "A new spanning tree-based genetic algorithm for the design of multi-stage supplychain networks with nonlinear transportation costs". Optimization and Engineering, 10(2), 219-237.

Jandaghi. GH. (2011). "Application of qualitative research in management (why, when and how)". Iranian Journal of Management Studies, 3(3), 59-73.

Ehsan Yadegari (1*), Hesamaddin Najmi (2), Morteza Ghomi-Avili (3), Mostafa Zandieh (1)

(1.) Faculty of Management and Accounting, Shahid Beheshti University, Tehran, Iran

(2.) Department of Industrial Engineering, University of Tehran, Iran

(3.) Faculty of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran

(Received: 6 October, 2014; Revised: 10 January, 2015; Accepted: 15 January, 2015)

(*) Corresponding Author, Email: e.yadegari@mail.sbu.ac.ir

Table 1. Coding of logistics network design research

Field       Title                                         Symbol

Modeling
            Stochastic mixed integer programming          SMIP
            Fuzzy mixed integer programming               FMIP
            Mixed integer non-linear programming          MINLP
            Mixed integer linear programming              MILP
Solution
approach
            Exact
            Branch and bound                              B& B
            Lagrangian relaxation-based                   LR
            Genetic algorithm                             GA
            Simulated annealing                           SA
            Tabu search-based                             TS
            Interactive fuzzy solution approach           F
            Others heuristics                             H
Outputs
            Suppliers/orders                              S
            Facilities location                           L
            Facility capacity                             FC
            Allocation                                    Al
            Production amount                             PQ
            Production assignment to production centers   PA
            Utilization of production centers             UT
            Transportation amount                         TA
            Transportation mode                           TM
            Delivery mode                                 DM
            Inventory                                     I
            Price of products                             P

Table 2. Review of some existing models

                                  Modeling   Outputs

Forward networks
Jayaraman and Pirkul (2001)       MILP       L, AL, PQ, TA
Jayaraman and Ross (2003)         MILP       L, AL, TA
Wang et al. (2011)                MILP       TA
Tsiakis and Papageorgiou (2008)   MILP       L, Al, FC, TA, PA, UT
Pishvaee et al. (2012b)           FMIP       L, AL, TM, FC, PQ
Syarif et al. (2002)              MILP       L, TA, SS, PQ
Elhedhli and Merrick (2012)       MINLP      L, AL, TA
Reverse networks
Krikke et al. (1999)              MILP       AL, TA
Min and Ko (2008)                 MINLP      L, AL, I
Aras et al. (2008)                MINLP      L, AL, TA, NV
Fonseca et al. (2010)             SMIP       L, TA
Kannan et al. (2012)              MILP       L, TA
closed-loop networks
Fleischmann et al. (2001)         MILP       L, AL
Lu and Bostel (2007)              MILP       L, AL
Salema et al. (2009)              MILP       L, AL, PQ, I, TA,
Ko and Evans (2007)               MINLP      L, TA, FC
Pishvaee and Razmi (2012)         FMIP       L, TA, PQ
Wang and Hsu (2010)               MILP       L, PQ, TA
Devika et al. (2014)              MILP       S, L, AL, PQ, TA
This paper                        MILP       L, PQ, TA, DM

                                  Solution method

Forward networks
Jayaraman and Pirkul (2001)       LR
Jayaraman and Ross (2003)         SA
Wang et al. (2011)                E
Tsiakis and Papageorgiou (2008)   E
Pishvaee et al. (2012b)           F
Syarif et al. (2002)              GA
Elhedhli and Merrick (2012)       LR
Reverse networks
Krikke et al. (1999)              E
Min and Ko (2008)                 GA
Aras et al. (2008)                TS
Fonseca et al. (2010)             E
Kannan et al. (2012)              E
closed-loop networks
Fleischmann et al. (2001)         E
Lu and Bostel (2007)              LR
Salema et al. (2009)              B& B
Ko and Evans (2007)               GA
Pishvaee and Razmi (2012)         F
Wang and Hsu (2010)               GA
Devika et al. (2014)              H
This paper                        H

Table 3. The delivery and recovery path

   Delivery path

1  [S.sub.2]-[P.sub.4]-[DC.sub.3]-[R.sub.6]-[C.sub.1]-[CI.sub.3]-
   ([P.sub.4],[D.sub.2])
2  [S.sub.2]-[P.sub.4]-[R.sub.6]-[C.sub.1]-[CI.sub.3]-([P.sub.4],
   [D.sub.2])
3  [S.sub.2]-[P.sub.4]-[DC.sub.3]-[CI.sub.3]-([P.sub.4],[D.sub.2])
4  [S.sub.2]-[P.sub.4]-[CI.sub.3]-([P.sub.4],[D.sub.2])

Table 4. The size of test problems

Test     Sup.  Plant  DC  Retailer  Cu.   Co./  Disp.
problem                             zone  in.

1         1      2     5    8        20    2     1
2         2      4    10   16        40    4     2
3         4      8    20   32        80    8     4
4         8     16    40   64       160   16     8
5        16     32    40  128       320   32    16

Table 5. The values of the parameters used in the test problems

Parameter                            Range

[cai.sub.i]                          Uniform (2000, 7000)
[caj.sub.j]                          Uniform (1000, 3000)
[cak.sub.k]                          Uniform (500, 1500)
[cal.sub.l]                          Uniform (250, 900)
[cam.sub.m]                          Uniform (100, 300)
[can.sub.n]                          Uniform (200, 400)
[cao.sub.o]                          Uniform (200, 400)
[pr.sub.m]                           10%
[pd.sub.n]                           10%
[a.sub.ij], [b.sub.jk], [c.sub.jl],  Uniform (3, 12)
[d.sub.jm], [e.sub.kl], [f.sub.km],
[g.sub.lm], [h.sub.mn], [i.sub.nj]
[FCJ.sub.j]                          Uniform (2000, 4200)
[FCK.sub.k]                          Uniform (1800, 3200)
[FCL.sub.l]                          Uniform (1500, 2500)
[FCN.sub.n]                          Uniform (1600, 2000)
[FCO.sub.o]                          Uniform (2000, 3600)

Table 6. Problem size with the same and different population sizes

10 times                    Test problem
each
problems               1         2         3          4          5

                                         195168     392931     789434
LINGO      Optimal   50742     99120     (feasible  (feasible  (feasible
                                         solution)  solution)  solution)
           Time (s)      7        33      >1800      >1800      >2400
MA         Mn cost   50742     99220     196254     396258     798456
(pop-      Ave_cost  50802     99248     205482     425648     851379
size=80)
           Ave_time      2.91     15.24      38.01     331.29    1508.84
MA         Pop_size     50        80        200        300        400
(variable  Mn_cost   50742     99220     195456     394576     788945
pop-size)
           Ave_cost  51025     99248     204513     425111     819564
           Ave_time      2.34     15.24     106.91    2150.68   10352.11

Table 7. Comparisons of CPLEX via variable pop-size MA

             ILOG-CPLEX            MA(variable pop_size)  Error
                                                          rate
Problem  Mincost    Avetime(s)  Min_cost     Ave_time(s)   (%)

1         50742         0.07     50742           2.34      0.00
2         99120         1.14     99220          15.24      0.10
         195161      >491.22
3        (feasible  (Out of     195456         106.91      0.15
         solution)  memory)
         391909     >1165.34
4        (feasible  (Out of     394576        2150.68      0.68
         solution)  memory)
         789152     >1325.28
5        (feasible  (Out of     788945       10352.11     [----]
         solution)  memory)
COPYRIGHT 2015 University of Tehran, Farabi College
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2015 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Author:Yadegari, Ehsan; Najmi, Hesamaddin; Ghomi-Avili, Morteza; Zandieh, Mostafa
Publication:Iranian Journal of Management Studies
Article Type:Report
Geographic Code:7IRAN
Date:Apr 1, 2015
Words:7825
Previous Article:Designing export performance model based on organizational orientations.
Next Article:An analysis of the green response of consumers to the environmentally friendly behaviour of corporations.
Topics:

Terms of use | Privacy policy | Copyright © 2019 Farlex, Inc. | Feedback | For webmasters