Next Article in Journal
On the Existence and Stability of Solutions for a Class of Fractional Riemann–Liouville Initial Value Problems
Next Article in Special Issue
A Multi-Objective Optimization Method for Flexible Job Shop Scheduling Considering Cutting-Tool Degradation with Energy-Saving Measures
Previous Article in Journal
Multi-Shell Models of Celestial Bodies with an Intermediate Layer of Fluid: Dynamics in the Case of the Large Values of the Ekman Number
Previous Article in Special Issue
Energy-Efficient Hybrid Flowshop Scheduling with Consistent Sublots Using an Improved Cooperative Coevolutionary Algorithm
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Mathematics
Volume 11
Issue 2
10.3390/math11020298
mathematics-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles thumb_up
...
Endorse textsms
...
Comment
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Review

A Review of Combinatorial Optimization Problems in Reverse Logistics and Remanufacturing for End-of-Life Products

by
Yaping Ren
1,2,3,
Xinyu Lu
4,
Hongfei Guo
1,2,3,*,
Zhaokang Xie
4,
Haoyang Zhang
4 and
Chaoyong Zhang
5
1
School of Intelligent Systems Science and Engineering, Jinan University, Zhuhai 519070, China
2
Institute of Physical Internet, Jinan University, Zhuhai 519070, China
3
GBA and B&R International Joint Research Center for Smart Logistics, Jinan University, Zhuhai 519070, China
4
School of Management, Jinan University, Guangzhou 510632, China
5
State Key Lab of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(2), 298; https://doi.org/10.3390/math11020298
Submission received: 25 November 2022 / Revised: 28 December 2022 / Accepted: 3 January 2023 / Published: 6 January 2023
(This article belongs to the Special Issue Mathematical Modeling and Intelligent Optimization in Green Manufacturing & Logistics)
Browse Figures
Versions Notes

Abstract

:
During the end-of-life (EOL) product recovery process, there are a series of combinatorial optimization problems (COPs) that should be efficiently solved. These COPs generally result from reverse logistics (RL) and remanufacturing, such as facility location and vehicle routing in RL, and scheduling, planning, and line balancing in remanufacturing. Each of the COPs in RL and remanufacturing has been reviewed; however, no review comprehensively discusses and summarizes the COPs in both. To fill the gap, a comprehensive review of the COPs in both RL and remanufacturing is given in this paper, in which typical COPs arising at the end of the product life cycle are discussed and analyzed for the first time. To better summarize these COPs, 160 papers published since 1992 are selected and categorized into three modules: facility location and vehicle routing in RL, scheduling in remanufacturing, and disassembly in remanufacturing. Finally, the existing research gaps are identified and some possible directions are described.

1. Introduction

Reverse logistics (RL) and remanufacturing are the two main processes for end-of-life (EOL) products’ recovery, aiming to maximize resource utilization by means of collecting, disassembling, refurbishing, and reassembling to grant the EOL products the same quality and functionality as new products. In order to improve the efficiency of product recovery, it is vital to solve the combinatorial optimization problems (COPs) involved effectively; therefore, scholars have conducted much research on them.
The concept of RL was put forward by Stock [1] in 1992, whose essence was to transfer EOL products from the consumer to the producer for processing. The COPs in RL include facility location and the vehicle-routing problem (VRP). The facility location is to build an appropriate network structure to determine the location of various facilities, such as collection centers, remanufacturing centers, distribution centers, etc. The VRP is to formulate a specific transportation plan to transport EOL products to the above facilities, including the driving path, number of vehicles, types of vehicles, etc. There are some reviews about the facility location and VRP in RL [2,3,4,5].
However, only the transportation process of RL cannot truly realize the reuse of resources; remanufacturing is the key to achieve sustainable development [6]. Remanufacturing is a process to recover EOL products to the same state as new products through inspection, disassembly, cleaning, maintenance, replacement, reassembly, etc. [7]. The COPs involved include disassembly sequence planning (DSP), disassembly-line-balancing problem (DLBP), disassembly scheduling, production scheduling, reassembly, etc. There are also some reviews about each of the COPs in remanufacturing [8,9,10,11].
Relevant reviews have been provided for each COP involved in RL and remanufacturing as shown in Table 1. However, it lacks a literature to review all COPs from the perspective of the recovery process for EOL products recovery, which is important to draw a framework of COPs for product recovery. In this paper, the COPs involved in RL and remanufacturing are divided into three categories, namely, facility location and VRP in RL, scheduling in remanufacturing, and disassembly in remanufacturing. These COPs are analyzed from two perspectives: a mathematical model and intelligent optimization methods, to fill the blanks of current research.
The rest of this article is organized as follows: Section 2, Section 3 and Section 4 summarize the mathematical model of facility location and VRP in RL, scheduling in remanufacturing, and disassembly in remanufacturing, respectively. Section 5 analyzes and discusses the literature from the perspective of optimization methodology and problem uncertainty. Section 6 summarizes the full text and proposes the future research directions.

2. Facility Location and VRP in RL

Before remanufacturing EOL products, collecting them from users is the first step, which is essentially a process of RL. To perform this efficiently, it is necessary to properly plan the location of various facilities and products’ flow routes. Specifically, companies need to choose how to collect EOL products from users and transport them to collection centers, where to inspect EOL products, where to remanufacture EOL products to make them available for resale, and how to sell remanufactured products to potential users [12]. That is to solve the problem of facility location and the VRP in RL.

2.1. Facility Location in RL

Generally, the facility location determines the location of the collection center, remanufacturing center, distributing center, and so on to minimize the logistics costs. Scholars have designed different network structures based on these facilities, which can be summarized as three types. This section will analyze the three kinds of network structures from the perspective of mathematical models, including: general network structure, closed-loop network structure, and hybrid network structure.

2.1.1. General Network Structure

The general network structure consists of four parts: consumers, collection centers, remanufacturing centers, and secondary markets, as shown in Figure 1. The collection center collects EOL products from consumers, inspects and disassembles the products, and then, according to the value of the components, chooses to discard or remanufacture; finally, the remanufactured finished products flow back to the market for sale. It is worth noting that in this network structure, remanufactured products are usually different from new products and mainly flow to the second-hand market.
It can be seen from Table 2 that most researchers choose the single-objective mixed-integer linear programming (MILP) model when establishing the mathematical model of the general network structure. Two papers established the mixed-integer nonlinear programming model (MILNP) [13,14], and they were single-objective optimization to maximize the total profit or minimize the total cost [14,15,16,17,18,19,20]. However, while minimizing the total cost, Roghanian and Pazhoheshfar [21] considered the uncertainty of capacity, demand, and product quantity in RL parameters, so they proposed a probabilistic mixed-integer linear programming model (P-MILP) and converted it into an equivalent deterministic model when solving. Tari and Alumur [22] considered the fairness between different companies and the problem of providing a stable product flow for each company while minimizing the total cost, thus establishing multi-objective mixed-integer linear programming (M-MILP).
In addition to minimizing the total cost and maximizing the total profit, the main purpose of establishing the mathematical model is to find out the location, capacity, and quantity of the core facilities, such as the collection center and the remanufacturing center that need to be opened in the RL network. Sasikumar et al. [13] provided decisions related to the number and location of facilities to be opened and the allocation of corresponding product flows through the establishment of MILP. Roghanian and Pazhoheshfar [21] proposed a multi-product, multi-stage RL network problem. It was not only necessary to determine the subset of disassembly centers and machining centers to be opened, but also necessary to determine the transportation strategy to meet the needs of manufacturing centers and recycling centers, with the minimum fixed opening cost and total transportation cost. Alshamsi and Diabat [16] also introduced important transportation considerations by providing options for using internal fleets and outsourcing options. Liao [14] introduced a modular remanufacturing process and emission reduction; two papers [14,16] also considered the carbon footprint while determining the location of factories (inspection/remanufacturing), the transportation of cores/remanufactured products between factories, and the route of vehicles between factories.

2.1.2. Closed-Loop Network Structure

To protect the environment, many countries expand producer responsibility through legislation. Driven by economic benefits, many manufacturers began to integrate RL [23], thus evolving a closed-loop network structure (CLNS), as shown in Figure 2. The CLNS integrates forward logistics and reverse logistics, producing huge economic and environmental benefits, and is the most widely studied network structure by scholars. In the CLNS, manufacturers obtain raw materials from suppliers, and the products manufactured are sold to customers through distributors. The products used by customers are collected by the collection center and selectively sent to the remanufacturing center. After remanufacturing, they return to forward logistics. In the CLNS, the terminals of forward logistics and reverse logistics are the same customer group.
Table 3 and Table 4 are, respectively, the previous mathematical model research on CLNS and the corresponding abbreviations of terms. In paper [24], the environmental problems are integrated into an integer CLNS model, and a genetic algorithm based on the spanning tree structure is proposed to solve the NP-hard problem. Pishvaee et al. [25] also established a multi-objective fuzzy mathematical model to design the environmental protection supply chain. They used life cycle assessment to quantify the environmental impact of the network. Zohal and Soleimani [26] also regard the model as a green CLNS according to the CO2 emissions of the gold industry. As shown in Table 3, most scholars are studying how to use metaheuristics and heuristic algorithms to solve the model. Devika et al. [27] proposed six different mixed metaheuristics to solve the sustainable CLNS problem they developed. In paper [28], a CLNS decision model under uncertainty was proposed, and the imperialist competitive algorithm, particle swarm optimization, and genetic algorithm were used to solve the large-scale NP-hard model developed by them. In another study, Fard et al. [29] considered the three-level decision model to express their forward/reverse supply chain network design problem, and adopted a variety of metaheuristic algorithms, including tabu search, variable neighborhood search, particle swarm optimization, water wave optimization, and Keshtel algorithm. The results show that the metaheuristic algorithm is an effective method to solve the model in practice.

2.1.3. Hybrid Network Structure

Some scholars have put forward the concept of hybrid facilities, that is, the merger of a manufacturing center and remanufacturing center, and the merger of a distribution center and collection center, as shown in Figure 3, thus representing integrated forward and reverse logistics [34]. Due to the existence of mixed facilities, RL can use the nodes of forward logistics to optimize its design, thereby effectively reducing or eliminating the cost of building new RL networks. Therefore, in recent years, it has also become a research hotspot of scholars.
In this growing research field, the number of literature sources is growing rapidly. Fleischmann et al.’s pioneering work in hybrid network structure modeling studied the impact of product recycling on the design of a logistics network [35]. The study argued that the impact of product recycling depended heavily on the environment. In some cases, it may be feasible to integrate this activity into the existing logistics structure, while in other cases, it may be necessary to redesign the logistics network in an overall manner. Since this study, Salma et al. [36] incorporated capacity constraints, demand uncertainty, and returns into the multi-product planning based on this model. Later, they integrated strategic and tactical decisions by considering two inter-related time scales: at the strategic level, they gave a discretization of the time range, which must meet the needs and reporting values; at the tactical level, more detailed planning was allowed to achieve this goal [37]. Cardoso et al. [38] analyzed the integration of RL activities under demand uncertainty, took the maximum expected net present value as the objective function, and made decision variables for facility size and location, process installation, forward and reverse logistics, and inventory level. Later, the author expanded this work to solve the uncertainty and characterize the elastic closed-loop network structure [39].
Subsequently, environmental and social sustainability issues began to be considered. Paksoy et al. [40] analyzed the supply plan and considered the emission cost (total cost minimization) and the profit maximization of the recycled products in the economic objective function. Mota et al. [41] considered the sustainability of the economy, environment, and society. They proposed a mathematical model with the minimization of the total cost of the network structure as the economic objective function; the minimization of the life cycle assessment index ReCipe as the environmental objective function; and the location of the network structure activities in underdeveloped areas as the social objective function. Gao et al. [42], based on the existing forward logistics network, proposed a double-objective stochastic integer programming model aiming at economic and environmental benefits, which aimed to support production, remanufacturing, and waste activities by addressing the uncertainty factors of new product demand and the return volume of old products in the customer area.

2.2. VRP in RL

After locating critical facilities, the next question is how to reversely transport EOL products, that is, the vehicle-routing problem in RL. The VRP in RL refers to how to arrange vehicle types, quantities, capacities, routes, etc., to collect waste products from customers, to achieve the goal of the minimum cost or the shortest route. Collection is the starting point of EOL product recovery, so scholars have carried out much research to improve the efficiency of this link.
The VRP in RL can be described as: a certain number of customers must use a certain number of fleets with limited capacity, which are usually assumed to be the same. The vehicles are stationed in a central parking lot and return after collecting waste products from customers according to the route requirements. Cao et al. [43] used RL to reuse the Internet of Things through identifying the resources required for road infrastructure, and modeled RL to transfer the Internet of Things from a tailings dam to a processing plant, and then to a road construction site. For minimizing the total cost, Richnák and Gubová [44] established a heterogeneous-fleet electric-vehicle path-recovery time window model considering vehicle load constraints. The type of vehicle limited the weight of recyclable waste and the time limit allowed by the customer. Chen et al. [45] proposed a nonlinear programming model including the number of second-hand products and reprocessed products. For both types of requirements, analysis and insight were provided in the form of a complete strategy consisting of different scenarios that allow optimal decisions to be made under a variety of conditions. Through sensitivity analysis, numerical examples supplemented the understanding of the model. Santana et al. [46] considered the risks in the e-waste recycling process and modeled the reverse logistics process of electrical and electronic equipment as a MILP with biological objectives under uncertainty. The cooperative alliance strategy was employed by Mishra et al. [47] to actualize the constrained capabilities of VRP in RL. The cooperative mechanism made it possible to prevent inefficient resource distribution, cut back on circular logistics, and minimize long-distance travel. In order to minimize recovery tasks, Chen et al. [48] used an improved ant colony algorithm to handle vehicle design and route optimization problems. Foroutan et al. [49] established a mixed-integer nonlinear programming model for multi-mode green vehicle routing and scheduling with the objective of minimizing operating costs and environmental costs and considering return, lead time, and delay costs. A mathematical model for the recovery of EOL cars was developed by Chaabane et al. [50] by combining the traditional VRP with the receiving and delivery problem as well as the restrictions of various vehicle kinds and time periods.
The multi-vehicle routing optimization problem with time limitations has also been the subject of interest for scholars’ in-depth research. In order to meet the needs of minimizing transportation and procurement costs, the research in the literature [51] included choosing suppliers and setting up homogeneous fleets to buy various products from chosen suppliers. It also defined new branching rules, introduced new inequality families, and established the competitiveness of the new branching price-reduction method. To optimize the multi-depot production material-allocation system and research the routing problem of delivery vehicles, Xu et al. [52] took into account a variety of factors, including multiple warehouses, multiple vehicle types, multiple commodities, mismatches between customer supply and demand, and arbitrary segmentation of delivery and delivery demands. Fan et al. [53] designed a genetic variable neighborhood algorithm for multi-vehicle routing optimization problem with fuzzy set requirements by improving the adaptive search strategy. A multi-mode electric vehicle routing optimization model was developed by Guo et al. [54] taking into account the differentiating service costs under the consideration of vehicle diversity, charging strategy, person vehicle matching, and service time difference.
With the improvement in logistics network and the development of e-commerce, in order to improve customer satisfaction, logistics service providers need to handle a large number of delivery orders and return orders at the same time. In this case, the joint optimization of simultaneous pickup and delivery VRP (VRPSPD) can significantly improve the utilization rate of vehicles [55].
Studies have shown that solving the problem of collecting refurbished goods in forward and reverse logistics can improve the utilization rate of refurbished products, shorten the return time, and improve customer satisfaction [55]. Dethloff [56] studied VRPSPD in order to avoid redundant handling work, considering that customers have both picking and delivery needs. They developed an insertion-based heuristics method, which can be used to construct initial feasible solutions, which can be improved by subsequent application of the local search process. A specific case of VRPSPD that allows for the decomposition of the picking and delivery needs was developed by Masson et al. [57]. This method can be used in real-world transportation systems with many of pickup trucks but few deliveries. Nagy et al. [58] proposed a VRP with separable delivery and picking, and studied the cost reduction caused by demand segmentation of simultaneous delivery and pickup. In order to optimize vehicle scheduling to satisfy freight requests, Ghilas et al. [59] created a VRPSPD with scheduling lines and took synchronization and time window limitations into account in the solution algorithm. Gschwind et al. [60] evaluated the performance of branch cut and price algorithms in VRPSPD to solve the shortest path issue under time windows and resource limitation. Goeke [61] investigated the VRPSPD of electric cars, in which the route design of electric vehicles attempted to optimize the pick-up and delivery services in metropolitan areas with a lower environmental impact. Wolfinger [62] proposed a mixed-integer programming model to develop a single warehouse VRPPD with split load, and tested the algorithm performance through extensive computing experiments through large-scale neighborhood search. Haddad et al. [63] developed a multi-warehouse VRPPD to design a sustainable picking and distribution route between multiple warehouses. The efficiency of transportation can be increased at the same time, within the limitations of vehicle capacity and time window.

3. Scheduling in Remanufacturing

The remanufacturing system is generally composed of three subsystems: disassembly, reprocessing and reassembly, as shown in Figure 4. Previous research usually took the scheduling of reprocessing and reassembly as the production scheduling in remanufacturing. Disassembly scheduling can be defined as the problem of determining which products or subassemblies, how many, and when to disassemble EOL products to satisfy the demand of their parts or components. This paper reviews scheduling in remanufacturing into disassembly scheduling, production scheduling, and integrated scheduling

3.1. Disassembly Scheduling in Remanufacturing

In the last few years, there has been a growing interest in the disassembly-scheduling problem. Since Gupta and Taleb [64] described the basic form of the disassembly-scheduling problem, a number of research articles have been released. We review literature sources on approaches employed to model capacitated or incapacitated problems.
The majority of the early research took into account the scheduling issue of incapable disassembly. Firstly, Gupta and Taleb [64] proposed a reverse material requirement planning algorithm (RMRP) without an explicit objective function. Later, Taleb et al. [65] proposed a different RMRP algorithm to reduce the number of products that needed to be disassembled by taking into account the commonality of parts in this fundamental instance. In order to reduce the total cost of setup, disassembly operations, and inventory holding, Kim et al. [66] applied a heuristics algorithm and a linear programming (LP) relaxation technique to the basic problem put forth by Taleb et al. [65]. In order to reduce the total cost of product purchase, installation, disassembly operation and inventory holding, Lee et al. [67] adopted a two-stage heuristic algorithm to solve the problem based on the research of Gupta and Taleb [64]. Lee and Xirouchakis [68] proposed and solved three integer programming models for three problem cases, i.e., a single product type without parts commonality and single and multiple product types with parts commonality, they used CPLEX to solve the problem. Inderfurth and Langella [69] adopted a heuristic algorithm to reduce the estimated cost of disassembly operation, purchase and disposal, taking into account such factors as multiple product types, commonality of components, two-stage structure and uncertainty of production rate. Later, Kongar and Gupta [70] further improved their earlier work by incorporating uncertainty into the consideration of the problem and expressing the uncertainty of the problem through fuzzy goal programming [71]. Barba-Gutierrez and Adenso-Diaz [72] extended their earlier work by integrating uncertainty requirements. Barba-Gutierrez, Adenso-Diaz et al. [73], proposed an algorithm: F-RMRP (RMRP based on fuzzy logic) to solve the problem. Kim and Lee [74] considered a multi-period version problem and proposed a heuristic algorithm using priority rules to solve it. Recently, Kim et al. [75] proposed a two-stage heuristic algorithm based on their earlier model of Kim and Lee [74]. Most recent studies considered the capability of the disassembly-scheduling problem. Lee et al. [76] proposed an integer programming model whose objective function was to minimize the sum of disassembly operation, product purchase, and inventory carrying costs. Later, Kim et al. [77] proposed an optimization algorithm with the minimum number of disassembled products as the objective function. Later, Kim et al. [78], based on the research of Kim et al. [77], considered the more complex actual situation, added the minimum installation, disassembly operation and inventory carrying cost into the objective function, and proposed a Lagrange heuristic algorithm to solve the problem. In addition, Prakash et al. [79] proposed a disassembly-scheduling problem model for parts commonality and proposed a constrained simulated annealing algorithm to solve it. Liu and Zhang [80] built a non-convex mixed-integer model based on the research of Prakash et al. [79]. Aiming at the optimal collection price, appropriate disassembly time and quantity of recycled products, Liu and Zhang proposed a particle swarm optimization algorithm based on dynamic programming to solve the problem. Ullerich and Buscher [81] established an integer linear programming model considering complete disassembly scheduling by considering the capacity constraints of each time period. Later, Ji et al. [82] added the consideration of start-up and setup costs on the basis of Ullerich and Buscher [81], and proposed a Lagrange relaxation heuristic algorithm to solve the problem. Godichaud et al. [83] built an MILP model considering the penalty cost of sales loss and disassembly capacity overload, and proposed a genetic algorithm to solve it. Hrouga et al. [84] adopted a hybrid genetic algorithm and fix-and-optimization heuristic algorithm to solve the disassembly batch scale problem of multi-type products with sales loss and capacity constraints. Based on the original study by Hrouga et al. [85], the problems of disassembly batch size under sales loss, multiple product types, and two-tier and capacity constraints were considered by Hrouga et al. [84], and the objective function was to minimize the sum of installation, inventory, sales losses and overload costs. An efficient optimization method based on a genetic algorithm and fix-and-optimization heuristic was proposed. Kim and Xirouchakis [86] considered the problem of multi-cycle, multi-product type, two-level product structure and random demand, aiming to minimize the sum of expectation setting, inventory holding and penalty costs of unmet requests, and proposed a Lagrange relaxation heuristic algorithm for solving the problem. Inderfurth and Langella [69] proposed a disassembly-scheduling problem of random output considering the impact of yield uncertainty on the stochastic scale model and binomial model, and proposed a two-root three-leaf mathematical model to describe the problem. Liu and Zhang [80] constructed a mixed-integer nonlinear programming considering the capable disassembly-scheduling problem of stochastic yield and demand, and proposed an algorithm based on external approximation to solve it. Tian and Zhang [87] considered the problems of capable disassembly scheduling and pricing, and established a non-convex mixed-integer model with the objective of determining the appropriate collection price of recycled products and the appropriate disassembly time and quantity, which was solved by the algorithm combining particle swarm optimization and dynamic programming. Zhou, He et al. [88] considered the capability disassembly-scheduling problem with the uncertainty of demand and disassembly operation time, constructed a new stochastic programming model, and proposed a hybrid genetic algorithm to solve it. Yuan, Yang et al. [89] proposed a capable fuzzy disassembly-scheduling model with cycle time and environmental cost as parameters, proposed a mixed-integer mathematical programming model with the goal of minimizing cycle time and environmental cost, and proposed a metaheuristic algorithm based on the fruit fly optimization algorithm to solve the problem. Slama, Ben-Ammar et al. [90] constructed a new mixed-integer programming model with the goal of maximizing disassembly process gain by considering external procurement, defects and late-order items, setup time, and capable dynamic batch problems. Slama et al. [91] considered the random multi-period disassembly batch problem and proposed a special optimization method according to specific different scenarios. (i) A two-stage mixed-integer linear programming model was proposed to solve all possible scenarios of small cases. (ii) The sample average approximation method based on Monte Carlo simulation was proposed for all possible scenarios of medium-scale examples. (iii) For all possible scenarios of large-scale instances, an optimization algorithm based on Monte Carlo simulation and genetic algorithm was proposed.

3.2. Production Scheduling in Remanufacturing

Process planning and production scheduling for remanufacturing are more challenging than traditional manufacturing because there are many uncertain factors in the remanufacturing system, for example, there are uncertainties in the processing route and time of processing different kinds of materials in the remanufacturing process. These uncertainties will lead to the failure of the usual process planning and scheduling methods. Therefore, many researchers have conducted a great amount of meaningful exploration on the uncertainty of remanufacturing production.
Wen H et al. [92] took the minimum remanufacturing time as the objective function, established a production-scheduling comprehensive optimization model with double random variable constraints, and proposed a hybrid algorithm of stochastic simulation technology, a neural network, and a genetic algorithm to solve the problem. He P [93] proposed a quality evaluation standard for the remanufacturing production-scheduling problem under the two uncertain conditions of randomness and fuzziness of job scheduling. Then, based on this, he built a remanufacturing production-scheduling model under uncertain conditions, and adopted the hybrid algorithm of the BP neural network and genetic algorithm to solve the problem. Peng S et al. [94] took the high value-added cylinder block of the engine as the research object, took the minimum manufacturing span as the objective function, considered the uncertainty of processing time and path, and proposed a new rule-based dynamic window algorithm to solve the problem. Zhang [95] considered the remanufacturing production scheduling problem under random and fuzzy conditions, built a quality evaluation method for remanufacturing recovered resources, and based on this, established a remanufacturing production scheduling model under uncertain conditions, and proposed a hybrid algorithm combining a double-fuzzy algorithm, BP neural network, and genetic algorithm to solve the problem. Shi J et al. [96] proposed a new double-fuzzy remanufacturing scheduling model, which considered many double uncertainties in remanufacturing and used double fuzzy variables to describe these uncertainties. Extended discrete particle swarm optimization algorithm was used to solve the problem.

3.3. Integrated Scheduling in Remanufacturing

Kim et al. [97] encouraged the integration of all remanufacturing operations (disassembly, remanufacturing/repair, and reassembly) into remanufacturing scheduling decisions. The past research on the scheduling problem of integrated remanufacturing system can be divided into flow shop type and job shop type. The flow-shop-type reprocessing shop is oriented to small-batch, multiple varieties of personalized remanufacturing products; the job-shop-type reprocessing shop is oriented to small-batch, multiple varieties of a single type of remanufacturing product type.
For the remanufacturing system with a flow-shop-type reprocessing shop, Stanfield, King et al. [98], aiming to minimize in-process operations and maximizing system utilization, proposed a stochastic scheduling heuristic algorithm to solve the problem. In addition, Kim et al. [99], aiming to minimize the total flow time of a remanufacturing system with parallel flow-shop reprocessing lines, proposed three heuristic algorithms for solving the problem, namely, the heuristic algorithm based on priority rules, the heuristic algorithm based on Nawaz–Enscore–Ham and the iterative greedy algorithm. Later, Kim et al. [75], based on the research by Kim et al. [99], proposed an algorithm based on priority rules to minimize the total delay. Qu et al. [100] proposed a new FPA algorithm based on the hormone regulation mechanism to solve the waiting-free flow-shop scheduling problem, and introduced hormone-regulatory factors to enhance the global search capability of the algorithm. Wang et al. [101] studied the scheduling problem of a remanufacturing system with a parallel disassembly workstation, parallel flow-shop-reprocessing line, and parallel reassembly workstation, and adopted the improved multi-objective invasive weed optimization algorithm to solve it. Wang, Tian et al. [102] considered the scheduling problem with parallel disassembly workstations, multiple parallel flow-shop-reprocessing lines, and parallel reassembly workstations. Aiming to minimize the total energy consumption, they proposed an improved genetic algorithm to solve the problem.
For the remanufacturing system with a shop–shop reprocessing shop, Guide Jr [103] proposed a drum-slow Okinawa scheduling method for a military warehouse. Subsequently, Daniel and Guide Jr [104] reported the performance of various scheduling rules and order release strategies based on the drum-cached Okinawa scheduling method. In addition, Souza et al. [105] proposed a two-stage solution, aiming to meet the profit maximization of customer service level, built a queuing network model, and solved using priority rules. See Guide Jr et al. [106] and Li et al. [107] for other models and solving algorithms. Kang and Hong [108] studied the disassembly and reassembly optimization problem; established an integer programming model; and solved the problem with the minimum disassembly cost, inventory cost, and manufacturing cost of new parts as targets. Lin D et al. [109] took the optimal factory selection and optimal remanufacturing job scheduling as objectives under resource constraints, and used linear physical programming and the multi-level-coded genetic algorithm to solve the problem. Giglio et al. [110] considered an integrated-batch-size and energy-saving job-shop scheduling problem, constructed a mixed-integer programming model, and proposed a relaxation-fixed heuristic algorithm to solve it. Yu and Lee [111] considered the scheduling problem of a remanufacturing system with parallel disassembly workstations, shop-like reprocessing workstations, and parallel reassembly workstations, constructed an integer programming model, and proposed two solving algorithms: a decomposition algorithm and integration algorithm. Li et al. [112] proposed a hybrid metaheuristic algorithm embedded with a colored, timed Petri net scheduling strategy to solve the problem of the optimal recovery route and recovery operation sequence for searching the worn core on the workstation, aiming to minimize the total production cost. Fu, Zhou et al. [113] adopted a multi-objective discrete Drosophila optimization algorithm to solve the stochastic multi-objective disassembly reprocessing–reassembly integrated scheduling problem in order to minimize the expected production cycle and total delay. Zhang, Zheng et al. [114] considered the integrated process planning and scheduling problem of a remanufacturing system containing a parallel disassembly workstation, a flexible job-shop-type reprocessing shop, and a parallel reassembly workstation, and proposed an improved artificial swarm algorithm to solve it.

4. Disassembly in Remanufacturing

Disassembly refers to obtaining valuable components from EOL products with various resource constraints. Disassembly in remanufacturing mainly includes two COPs: disassembly sequence planning (DSP) and disassembly line balancing problem(DLBP). DSP means obtaining the required components in an optimal sequence. DLBP means assigning disassembly operations to different workstations on a disassembly line to achieve one or multi-objectives.

4.1. Disassembly Sequence Planning

The most common objective of DSP is to improve the disassembly efficiency and reduce the cost. Disassembly sequence planning can be divided into three steps as shown in Figure 5: First, choosing a suitable disassembly mode which could be complete/partial disassembly or sequential/parallel disassembly. Second, building a model about the disassembly relationship of parts or components of EOL products. Third, choosing an optimization method to solve the DSP problem. There has been a great amount of research on DSP, and various methods have been developed. The most commonly used methods are heuristic algorithms. Additionally, the most prominent advantage of the heuristic algorithms is that they can obtain high-quality solutions in an acceptable time for large-scale problems [115]. For example, Tseng et al. [116] developed a new block-based genetic algorithm (GA) with the penalty function matrix in the crossover and mutation mechanism for disassembly sequence planning. Similarly, ElSayed et al. [117] and Li et al. [118] used a GA to address DSP on different occasions. It is obvious that a GA is easy to use and effective. However, more and more studies have investigated other heuristic algorithms. Zhong et al. [119] solve the DSP including fasteners using Dijkstra’s algorithm and particle swarm optimization (PSO), which is another metaheuristic algorithm. Guo et al. [120] proposed a lexicographic multi-objective scatter search method to overcome the complexity explosion caused by a large-scale DSP considering a multi-objective resource-constrained operation. Liu et al. [121] built the disassembly model by using the modified feasible-solution-generation method, and a robotic DSP was solved by using an enhanced discrete bee colony algorithm. Additionally, Tao et al. [122] proposed an improved Tabu search heuristic algorithm with an exponentially decreasing diversity management strategy; a partial and parallel DSP problem was solved to show the proposed algorithm was feasible and efficient. Guo et al. [123] and Ren et al. [124,125,126,127] investigated various types of DSP problems by using different heuristic algorithms. In summary, a heuristic algorithm is one of the most effective methods to solve DSP.
There are few studies which have investigated the exact mathematical methods. The exact mathematical methods can quickly obtain high-quality solutions for small-scale problems without traversing the entire solution space [115]. However, exact mathematical methods are more restrictive than other techniques. If the problem is large-scale, that is, with many variables and constraints, it is difficult to obtain a solution in an acceptable time. However, still some valuable papers are proposed because exact mathematical methods still have the advantage of quickly producing solutions when solving small-scale problems. For example, Zhu et al. [128] introduced a disassembly information model with dynamic capabilities to handle state-dependent information and presented a linear-programming-based optimization model to obtain the optimal disassembly sequence. Costa et al. [129] developed a recursive branch-and-bound algorithm to obtain the optimal disassembly sequence. They also proposed a best-first search algorithm to accelerate the optimization process. Some literature sources [130,131,132] also investigated the exact mathematical methods, but the solutions were not good enough when encountering large-scale DSP.

4.2. Disassembly-Line-Balancing Problem

The DLBP was first proposed by Güngör and Gupta [133] and more and more studies have investigated this problem. As Figure 6 shows, the main difference between DSP and the DLBP is the disassembly operation assigned to the workstation, which makes the DLBP more complex than DSP. Hence, there are some unique variables in the DLBP, such as objectives which could minimize the number of workstations or idle time [134].
Like DSP, many studies have also applied a metaheuristic algorithm to solve the DLBP. For example, Yin et al. [135] considered a partial DLBP with multi-robot workstations; they established an exact mixed-integer programming model and proposed a multi-objective hybrid driving algorithm to effectively address the above problem. Li et al. [136] introduced the profit-oriented U-shaped partial DLBP for the first time. They established an integer linear programming model for solving the small-scale problem. Additionally, a novel discrete cuckoo search algorithm was implemented and improved to solve the considered DLBP. Wang et al. [137] proposed a discrete multi-objective artificial bee colony algorithm to address the partial DLBP considering both economic benefits and environmental impacts. Ren et al. [138,139,140,141] also investigated the problem of disassembly line balancing and applied different heuristic methods to meet different objectives.
The exact mathematical methods can produce higher-quality solutions when solving the small-scale DLBP, so there are some papers which have investigated them. Yılmaz et al. [142] focused on a multi-objective DLBP considering the tactical-level strategies and operational-level scenarios. They also developed the improved augmented ϵ-constrained method to obtain the Pareto solutions for small-scale problems. Edis et al. [143] studied a DLBP with balancing issues, the hazardousness of parts, and other factors. They developed a generic MILP model for the above problem and their proposed method proved effective after a series of tests. There are literature sources [144,145,146] which have also studied the exact mathematical methods to solve the DLBP, but still could avoid the problem of not being able to produce better solutions when encountering large-scale problems.
In conclusion, the DLBP has been well-researched and developed over decades. The exact mathematical methods and heuristics algorithm have shown their effectiveness at different scales of problems.

4.3. Integrated Disassembly and Reassembly

Reassembly is the operation following disassembly. Reassembly refers to the assembly of reused parts, remanufactured parts, and original manufacturing parts through specific processes to produce reusable products. However, because it is not the same as normal assembly, reassembly will encounter different problems. For example, uncertainty in reassembly can lead to a huge increase in the complexity of the problem. The quantity or quality of the remanufactured parts is uncertain, which leads to a decline in production efficiency, to unstable product quality, and to many other problems [147].
A few literature sources investigated the optimization of only reassembly but without considering disassembly. For example, Su et al. [148] proposed an optimal selective-assembly method for remanufacturing based on an ant colony algorithm in order to gain optimal reassembly combinations and reduce the influence of the uncertainty factors on the quality. Additionally, Liu et al. [149] proposed a simulated annealing genetic algorithm to solve the assembly deviation degree on-line optimization model.
As mentioned above, optimization that only considers reassembly is incomplete. Therefore, it is necessary to consider the complexities of reassembly when solving any disassembly problem, that is, the integrated problem of disassembly and reassembly. For example, Behdad and Thuston [150] proposed graph-based integer linear programming combined with multi-attribute utility analysis to obtain the optimal sequence of disassembly operations which considers the costs and uncertainties of both disassembly and reassembly. Su et al. [151] developed a multi-objective optimization method based on the TS-NSGAII hybrid algorithm which provided a new direction for the optimization of the remanufacturing system. Li et al. [152] established an optimization decision-making model for the reassembly process, and proposed a decision-making method based on the improved T-S FNN which focused on minimizing the remanufacturing time and costs. Oh and Behad [153] proposed a network flow graph and integer linear programming to produce solutions of the type and number of parts that should be reassembled and procured. Some literature sources focused on the whole remanufacturing system; Lahmar et al. [154] studied the remanufacturing production planning problem to minimize economic costs and carbon emissions. They developed a non-dominated sorting genetic algorithm (NSGA-II)-based approach to overcome the complexity of the whole remanufacturing system. Polotski et al. [155] investigated a hybrid manufacturing–remanufacturing system considering the optimization of manufacturing, remanufacturing, and maintenance policies. The stochastic dynamic programming approach was used to address this problem. In summary, it is a trend to study the optimization of the whole remanufacturing system in order to fully optimize all aspects of the system.

5. Analysis and Discussion

This section will discuss and analyze the above-mentioned literature sources from two aspects: optimization methodology and problem uncertainty.

5.1. Optimization Methodology

The problems described in Section 2 to Section 4 are essentially COPs. For COPs, the most important step is how to solve them after establishing the relevant mathematical model, and the solution methods are mainly divided into exact and heuristic or metaheuristic algorithms. The exact algorithm includes the branch and bound method, the dynamic programming method, the cutting-plane method, etc. However, due to the complexity of practical problems and the NP-hard attribute of most COPs, it is difficult for the exact algorithm to obtain a satisfactory solution for large-scale problems in a reasonable time. Therefore, most of the current research focuses on the development of heuristic or metaheuristic algorithms. This section will analyze the solution methods of the COPs mentioned in the above sections.
Table 5, Table 6 and Table 7 summarize exact algorithms, heuristic or metaheuristic algorithm, and some other algorithms, respectively. From the results of horizontal comparison, the number and types of heuristic or metaheuristic algorithm are far greater than those of the exact algorithm. This shows that in the field of RL and remanufacturing, using heuristic or metaheuristic algorithms to solve problems is the mainstream method of current research. Moreover, some classical algorithms have many applications in different problems, such as genetic algorithms [156], particle swarm optimization [157], ant colony algorithms [158], simulated annealing [159], and Tabu search [160].
Deep reinforcement learning (DRL) solving COPs in the process of EOL product recovery has attracted extensive attention in recent years. Bengio et al. [161] proposed three types of paradigms for the application of machine learning to COPs. Lei et al. [162] proposed an end-to-end DRL framework to solve the TSP and the CVRP. Yang et al. [163] proposed the framework of robotic disassembly sequence planning using DRL to solve the robotic disassembly sequence planning problem. In general, compared with heuristic or metaheuristic algorithms, DRL is seldom used to solve COPs in the process of EOL product recovery at present. However, DRL has been proved to be superior to metaheuristic algorithms in solving certain problems. Therefore, future research can focus more on DRL.

5.2. Problem Uncertainty

Due to the complexity of the reality and the instability of the state of EOL products, the recovery process will face a series of uncertainties. At present, most of the studies only have considered the deterministic conditions, but the uncertain studies are more practical.
In the stage of facility location and the VRP in RL, it is easy to face uncertainty of quantity, facility capacity, demand, etc. Therefore, Roghanian and Pazhoheshfar [21] considered the uncertainty degree of the demands, capacities, and quantity of EOL products, and proposed a P-MILP model to decide which subsets of processing and disassembly centers will be opened. Lee et al. [34] established a two-stage stochastic programming model which assumed the demand of forward items and the supply of returned products on customers to be stochastic parameters with known distribution. To solve the S3PRLP selection problem with unknown attributes and decision-maker weights, Arunodaya et al. [47] developed a hybrid methodology that combined CRITIC and EDAS methods with Fermatean fuzzy sets (FFSs). In addition, there is also other research on uncertainty in the collection stage of EOL products [36,38,39].
In the area of scheduling in remanufacturing, it often faces the uncertainty of the quality of old products, the demand for new products, and the supply of raw materials. Many scholars have studied the uncertainty in this field [95,96,97,113]. Kongar et al. [70] established a multi-criteria optimization model of a disassembly-to-order (DTO) system under uncertainty and adopted the fuzzy goal programming technique to solve the problem. Because real-world data on the demand for used components is frequently ambiguous, vague, or imprecise, Barba-Gutiérrez et al. [72] used a fuzzy logic approach to develop the reverse MRP algorithm, incorporating subjectivity and imprecision into the model formulation and solution process. Other similar studies such as Liu and Zhang [80] studied the capacitated disassembly-scheduling problem under stochastic yield and demand. Wen et al. [92] optimized the integration of remanufacturing production planning and a scheduling system under uncertainty. He [93] developed a useful optimization method for the production scheduling in remanufacturing under uncertain conditions. Peng et al. [94] studied a Petri-net-based scheduling scheme and energy model for the remanufacturing of a cylinder block under uncertainty.
In the field of disassembly in remanufacturing, there are many failure features, such as wear, fracture, deformation, and corrosion, which may influence the disassembly time and cost. Behdad et al. [132] used immersive computing technology as a tool to explore an alternative disassembly sequence scheme in an intuitive manner, taking into account uncertain conditions such as time, cost, and the probability of causing damage. Liu et al. [144] researched the DLBP with partial uncertain knowledge, that is, the task-processing time mean and covariance matrix. A new distributionally robust formulation with a joint chance constraint was proposed. Behdad and Thurston [150] considered the costs and uncertainties associated with disassembly and reassembly. To find the best set of tradeoffs, graph-based integer linear programming was combined with multi-attribute utility analysis.

6. Conclusions

The COPs in RL and remanufacturing have important academic value and practical value. In this paper, we divided the COPs into three categories, including facility location and the VRP in RL, scheduling in remanufacturing, and disassembly in remanufacturing; each of them contained several subcategories. At present, the research on these COPs mainly focuses on mathematical models and optimization methodology, which are also the two perspectives of this paper to review the current literature.
At the mathematical model level, through the analysis of this paper, the following suggestions are proposed for future research. Firstly, concerning the facility location and VRP in RL, researchers can pay more attention to the hybrid network structure, as described in Section 2, which can reduce the cost of logistics facilities and improve logistics efficiency. In addition to the uncertainty of the quantity and quality of EOL products, the demand for remanufactured products is also uncertain. Therefore, how to study the hybrid network structure under uncertain conditions may be the direction that researchers should work hard towards. Secondly, in the area of scheduling in remanufacturing, scholars can consider more practical factors, such as multi-objective, limited buffer, uncertainty of task arrival time, etc. Moreover, the combination of the disassembly process and the scheduling process is also a direction that can be considered. Thirdly, for disassembly in remanufacturing, researchers can conduct more study on two-sided or U-shaped disassembly lines. Due to the danger of disassembly operations, human–robotic cooperation is also a field of concern. Similarly, due to the poor quality of EOL products, how to carry out disassembly sequence planning in the case of disassembly failure will be a reality that has to be considered.
At the optimization methodology level, DRL can solve the COPs end-to-end, thus avoiding the complex design of traditional optimization algorithms and its characteristics of low efficiency and high complexity. Therefore, researchers can consider developing relevant DRL algorithms.

Author Contributions

Conceptualization, Y.R.; project administration, H.G.; writing—original draft preparation X.L., Z.X. and H.Z.; writing—review and editing, X.L.; supervision, C.Z. All authors have read and agreed to the published version of the manuscript.

Funding

The research is financially supported by the National Natural Science Foundation of China (No. 52205526, No. 52205538), the Basic and Applied Basic Research Project of Guangzhou Basic Research Program (202201010284), the National Foreign Expert Project of Ministry of Science and Technology of China (G2021199026L), the Guangdong Province Graduate Education Innovation Project (82620516), the National Key Research and Development Program of China (2021YFB3301701), the Guangzhou Leading Innovation Team Program (201909010006), the Guangdong Province “Quality Engineering” Construction Project (210308), the Research Project of Characteristic Innovation of University Teachers (2021DZXX01), and Zhuhai Science and Technology Planning Project in the Field of Social Development (2220004000302).

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Stock, J.R. Reverse Logistics: White Paper; Council of Logistics Management: Lombard, IL, USA, 1992. [Google Scholar]
  2. Zhang, X.; Zou, B.; Feng, Z.; Wang, Y.; Yan, W. A Review on Remanufacturing Reverse Logistics Network Design and Model Optimization. Processes 2021, 10, 84. [Google Scholar] [CrossRef]
  3. Chanintrakul, P.; Coronado Mondragon, A.E.; Lalwani, C.; Wong, C.Y. Reverse logistics network design: A state-of-the-art literature review. Int. J. Bus. Perform. Supply Chain Model. 2009, 1, 61–81. [Google Scholar] [CrossRef]
  4. Waidyathilaka, E.; Tharaka, V.K.; Wickramarachchi, A.P.R. Trends in Green Vehicle Routing in Reverse Logistics. In Proceedings of the International Conference on Industrial Engineering and Operations Management (IEOM), Bangkok, Thailand, 5–7 March 2019. [Google Scholar]
  5. Han, H.; Ponce Cueto, E. Waste collection vehicle routing problem: Literature review. PROMET Traffic Transp. 2015, 27, 345–358. [Google Scholar] [CrossRef] [Green Version]
  6. Majumder, P.; Groenevelt, H. Competition in remanufacturing. Prod. Oper. Manag. 2001, 10, 125–141. [Google Scholar] [CrossRef]
  7. Nasr, N.; Thurston, M. Remanufacturing: A key enabler to sustainable product systems. Rochester Instit. Technol. 2006, 23, 14–17. [Google Scholar]
  8. Laili, Y.; Li, Y.; Fang, Y.; Pham, D.T.; Zhang, L. Model review and algorithm comparison on multi-objective disassembly line balancing. J. Manuf. Syst. 2020, 56, 484–500. [Google Scholar] [CrossRef]
  9. Zhou, Z.; Liu, J.; Pham, D.T.; Xu, W.; Ramirez, F.J.; Ji, C.; Liu, Q. Disassembly sequence planning: Recent developments and future trends. Proc. Instit. Mech. Eng. Part B J. Eng. Manuf. 2019, 233, 1450–1471. [Google Scholar] [CrossRef]
  10. Morgan, S.D.; Gagnon, R.J. A systematic literature review of remanufacturing scheduling. Int. J. Prod. Res. 2013, 51, 4853–4879. [Google Scholar] [CrossRef]
  11. Wang, Y.; Mendis, G.P.; Peng, S.; Sutherland, J.W. Component-oriented reassembly in remanufacturing systems: Managing uncertainty and satisfying customer needs. J. Manuf. Sci. Eng. 2019, 141, 021005. [Google Scholar] [CrossRef]
  12. Fleischmann, M.; Bloemhof-Ruwaard, J.M.; Beullens, P.; Dekker, R. Reverse logistics network design. In Reverse Logistics; Springer: Berlin/Heidelberg, Germany, 2004; pp. 65–94. [Google Scholar]
  13. Sasikumar, P.; Kannan, G.; Haq, A.N. A multi-echelon reverse logistics network design for product recovery—A case of truck tire remanufacturing. Int. J. Adv. Manuf. Technol. 2010, 49, 1223–1234. [Google Scholar] [CrossRef]
  14. Liao, T.Y. Reverse logistics network design for product recovery and remanufacturing. Appl. Math. Model. 2018, 60, 145–163. [Google Scholar] [CrossRef]
  15. Alumur, S.A.; Nickel, S.; Saldanha-da-Gama, F.; Verter, V. Multi-period reverse logistics network design. Eur. J. Oper. Res. 2012, 220, 67–78. [Google Scholar] [CrossRef]
  16. Alshamsi, A.; Diabat, A. A reverse logistics network design. J. Manuf. Syst. 2015, 37, 589–598. [Google Scholar] [CrossRef]
  17. Demirel, E.; Demirel, N.; Gökçen, H. A mixed integer linear programming model to optimize reverse logistics activities of end-of-life vehicles in Turkey. J. Clean. Prod. 2016, 112, 2101–2113. [Google Scholar] [CrossRef]
  18. Alshamsi, A.; Diabat, A. A Genetic Algorithm for Reverse Logistics network design: A case study from the GCC. J. Clean. Prod. 2017, 151, 652–669. [Google Scholar] [CrossRef]
  19. Reddy, K.N.; Kumar, A.; Ballantyne, E.E.F. A three-phase heuristic approach for reverse logistics network design incorporating carbon footprint. Int. J. Prod. Res. 2019, 57, 6090–6114. [Google Scholar] [CrossRef]
  20. Reddy, K.N.; Kumar, A.; Sarkis, J.; Tiwari, M.K. Effect of carbon tax on reverse logistics network design. Comput. Ind. Eng. 2020, 139, 106184. [Google Scholar] [CrossRef]
  21. Roghanian, E.; Pazhoheshfar, P. An optimization model for reverse logistics network under stochastic environment by using genetic algorithm. J. Manuf. Syst. 2014, 33, 348–356. [Google Scholar] [CrossRef]
  22. Tari, I.; Alumur, S.A. Collection center location with equity considerations in reverse logistics networks. INFOR Inf. Syst. Oper. Res. 2014, 52, 157–173. [Google Scholar] [CrossRef] [Green Version]
  23. Zarei, M.; Mansour, S.; Husseinzadeh Kashan, A.; Karimi, B. Designing a reverse logistics network for end-of-life vehicles recovery. Math. Probl. Eng. 2010, 2010, 649028. [Google Scholar] [CrossRef]
  24. Wang, H.F.; Hsu, H.W. A closed-loop logistic model with a spanning-tree based genetic algorithm. Comput. Oper. Res. 2010, 37, 376–389. [Google Scholar] [CrossRef]
  25. Pishvaee, M.S.; Torabi, S.A.; Razmi, J. Credibility-based fuzzy mathematical programming model for green logistics design under uncertainty. Comput. Ind. Eng. 2012, 62, 624–632. [Google Scholar] [CrossRef]
  26. Zohal, M.; Soleimani, H. Developing an ant colony approach for green closed-loop supply chain network design: A case study in gold industry. J. Clean. Prod. 2016, 133, 314–337. [Google Scholar] [CrossRef]
  27. Devika, K.; Jafarian, A.; Nourbakhsh, V. Designing a sustainable closed-loop supply chain network based on triple bottom line approach: A comparison of metaheuristics hybridization techniques. Eur. J. Oper. Res. 2014, 235, 594–615. [Google Scholar] [CrossRef]
  28. Fard, A.M.F.; Gholian-Jouybari, F.; Paydar, M.M.; Hajiaghaei-Keshteli, M. A bi-objective stochastic closed-loop supply chain network design problem considering downside risk. Ind. Eng. Manag. Syst. 2017, 16, 342–362. [Google Scholar]
  29. Fard, A.M.F.; Hajaghaei-Keshteli, M. A tri-level location-allocation model for forward/reverse supply chain. Appl. Soft Comput. 2018, 62, 328–346. [Google Scholar] [CrossRef]
  30. Pishvaee, M.S.; Rabbani, M.; Torabi, S.A. A robust optimization approach to closed-loop supply chain network design under uncertainty. Appl. Math. Model. 2011, 35, 637–649. [Google Scholar] [CrossRef]
  31. Chaabane, A.; Ramudhin, A.; Paquet, M. Design of sustainable supply chains under the emission trading scheme. Int. J. Prod. Econ. 2012, 135, 37–49. [Google Scholar] [CrossRef]
  32. Soleimani, H.; Kannan, G. A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks. Appl. Math. Model. 2015, 39, 3990–4012. [Google Scholar] [CrossRef]
  33. Hajiaghaei-Keshteli, M.; Fathollahi Fard, A.M. Sustainable closed-loop supply chain network design with discount supposition. Neural Comput. Appl. 2019, 31, 5343–5377. [Google Scholar] [CrossRef]
  34. Lee, D.H.; Dong, M.; Bian, W. The design of sustainable logistics network under uncertainty. Int. J. Prod. Econ. 2010, 128, 159–166. [Google Scholar] [CrossRef]
  35. Fleischmann, M.; Beullens, P.; Bloemhof-Ruwaard, J.M.; Van Wassenhove, L.N. The impact of product recovery on logistics network design. Prod. Oper. Manag. 2001, 10, 156–173. [Google Scholar] [CrossRef]
  36. Salema, M.I.G.; Barbosa-Povoa, A.P.; Novais, A.Q. An optimization model for the design of a capacitated multi-product reverse logistics network with uncertainty. Eur. J. Oper. Res. 2007, 179, 1063–1077. [Google Scholar] [CrossRef]
  37. Salema, M.I.G.; Barbosa-Povoa, A.P.; Novais, A.Q. Simultaneous design and planning of supply chains with reverse flows: A generic modelling framework. Eur. J. Oper. Res. 2010, 203, 336–349. [Google Scholar] [CrossRef]
  38. Cardoso, S.R.; Barbosa-Póvoa, A.P.F.D.; Relvas, S. Design and planning of supply chains with integration of reverse logistics activities under demand uncertainty. Eur. J. Oper. Res. 2013, 226, 436–451. [Google Scholar] [CrossRef]
  39. Cardoso, S.R.; Barbosa-Póvoa, A.P.; Relvas, S.; Novais, A.Q. Resilience metrics in the assessment of complex supply-chains performance operating under demand uncertainty. Omega 2015, 56, 53–73. [Google Scholar] [CrossRef]
  40. Paksoy, T.; Bektaş, T.; Özceylan, E. Operational and environmental performance measures in a multi-product closed-loop supply chain. Transp. Res. Part E Logist. Transp. Rev. 2011, 47, 532–546. [Google Scholar] [CrossRef]
  41. Mota, B.; Gomes, M.I.; Carvalho, A.; Barbosa-Povoa, A.P. Towards supply chain sustainability: Economic, environmental and social design and planning. J. Clean. Prod. 2015, 105, 14–27. [Google Scholar] [CrossRef]
  42. Gao, X. A novel reverse logistics network design considering multi-level investments for facility reconstruction with environmental considerations. Sustainability 2019, 11, 2710. [Google Scholar] [CrossRef] [Green Version]
  43. Cao, S.; Liao, W.; Huang, Y. Heterogeneous fleet recyclables collection routing optimization in a two-echelon collaborative reverse logistics network from circular economic and environmental perspective. Sci. Total Environ. 2021, 758, 144062. [Google Scholar] [CrossRef]
  44. Richnák, P.; Gubová, K. Green and reverse logistics in conditions of sustainable development in enterprises in Slovakia. Sustainability 2021, 13, 581. [Google Scholar] [CrossRef]
  45. Chen, Z.-S.; Zhang, X.; Govindan, K.; Wang, X.-J.; Chim, K.-S. Third-party reverse logistics provider selection: A computational semantic analysis-based multi-perspective multi-attribute decision-making approach. Expert Syst. Appl. 2021, 166, 114051. [Google Scholar] [CrossRef]
  46. Santana, J.C.C.; Guerhardt, F.; Franzini, C.E.; Ho, L.L.; Ribeiro, S.E.R., Jr.; Cânovas, G.; Yamamura, C.L.K.; Vanalle, R.M.; Berssaneti, F.T. Refurbishing and recycling of cell phones as a sustainable process of reverse logistics: A case study in Brazil. J. Clean. Prod. 2021, 283, 124585. [Google Scholar] [CrossRef]
  47. Mishra, A.R.; Rani, P.; Pandey, K. Fermatean fuzzy CRITIC-EDAS approach for the selection of sustainable third-party reverse logistics providers using improved generalized score function. J. Ambient Intell. Hum. Comput. 2022, 13, 295–311. [Google Scholar] [CrossRef]
  48. Chen, C.-M.; Xie, W.-C.; Li, L.-L.; Fan, S.-S.; Jiang, W.-B. The Research on Logistics Vehicle Path Optimization of Improved Ant Colony Algorithm. Adv. Sci. Lett. 2012, 11, 493–497. [Google Scholar] [CrossRef]
  49. Foroutan, R.A.; Rezaeian, J.; Mahdavi, I. Green vehicle routing and scheduling problem with heterogeneous fleet including reverse logistics in the form of collecting returned goods. Appl. Soft Comput. 2020, 94, 106462. [Google Scholar] [CrossRef]
  50. Chaabane, A.; Montecinos, J.; Ouhimmou, M.; Khabou, A. Vehicle routing problem for reverse logistics of End-of-Life Vehicles (ELVs). Waste Manag. 2021, 120, 209–220. [Google Scholar] [CrossRef]
  51. Desrosiers, J.; Lübbecke, M.E. Branch-price-and-cut algorithms. In Encyclopedia of Operations Research and Management Science; John Wiley & Sons: Chichester, UK, 2011; pp. 109–131. [Google Scholar]
  52. Xu, D.; Li, K.; Zheng, P.; Tian, Q. Multi-parking, multi-vehicle, multi-category supply and demand unmatched and arbitrarily splittable delivery vehicle routing problem optimization. J. Manag. 2020, 17, 1086–1095. [Google Scholar]
  53. Fan, H.; Liu, H.; Liu, P.; Ren, X. Optimization of the simultaneous distribution and collection path of irregular vehicles with fuzzy collection demand. Control Theory Appl. 2020, 1, 14. [Google Scholar]
  54. Guo, F.; Yang, J.; Yang, C. Research on path optimization and charging strategy of multi-model electric vehicles considering differentiated service time. Chin. Manag. Sci. 2019, 27, 118–128. [Google Scholar]
  55. Zhang, M.; Pratap, S.; Zhao, Z.; Prajapati, D.; Huang, G.Q. Forward and reverse logistics vehicle routing problems with time horizons in B2C e-commerce logistics. Int. J. Prod. Res. 2021, 59, 6291–6310. [Google Scholar] [CrossRef]
  56. Dethloff, J. Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR-Spektrum 2001, 23, 79–96. [Google Scholar] [CrossRef]
  57. Masson, R.; Ropke, S.; Lehuédé, F.; Péton, O. A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes. Eur. J. Oper. Res. 2014, 236, 849–862. [Google Scholar] [CrossRef]
  58. Nagy, G.; Wassan, N.A.; Speranza, M.G.; Archetti, C. The vehicle routing problem with divisible deliveries and pickups. Transp. Sci. 2015, 49, 271–294. [Google Scholar] [CrossRef] [Green Version]
  59. Ghilas, V.; Demir, E.; Van Woensel, T. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Comput. Oper. Res. 2016, 72, 12–30. [Google Scholar] [CrossRef]
  60. Gschwind, T.; Irnich, S.; Rothenbächer, A.K.; Tilk, C. Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. Eur. J. Oper. Res. 2018, 266, 521–530. [Google Scholar] [CrossRef] [Green Version]
  61. Goeke, D. Granular tabu search for the pickup and delivery problem with time windows and electric vehicles. Eur. J. Oper. Res. 2019, 278, 821–836. [Google Scholar] [CrossRef]
  62. Wolfinger, D. A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments. Comput. Oper. Res. 2021, 126, 105110. [Google Scholar] [CrossRef]
  63. Haddad, M.N.; Martinelli, R.; Vidal, T.; Ochi, L.S.; Martins, S.; Jamilson, M.; Souza, J.F.M.; Hartl, R. Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. Eur. J. Oper. Res. 2018, 270, 1014–1027. [Google Scholar] [CrossRef]
  64. Gupta, S.M.; Taleb, K.N. Scheduling disassembly. Int. J. Prod. Res. 1994, 32, 1857–1866. [Google Scholar] [CrossRef]
  65. Taleb, K.N.; Gupta, S.M.; Brennan, L. Disassembly of complex product structures with parts and materials commonality. Prod. Plan. Control 1997, 8, 255–269. [Google Scholar] [CrossRef]
  66. Kim, H.J.; Lee, D.H.; Xirouchakis, P.; Züst, R. Disassembly scheduling with multiple product types. CIRP Ann. 2003, 52, 403–406. [Google Scholar] [CrossRef]
  67. Lee, D.H.; Kim, H.J.; Choi, G.; Xirouchakis, P. Disassembly scheduling: Integer programming models. Proc. Instit. Mech. Eng. Part B J. Eng. Manuf. 2004, 218, 1357–1372. [Google Scholar] [CrossRef]
  68. Lee, D.H.; Xirouchakis, P. A two-stage heuristic for disassembly scheduling with assembly product structure. J. Oper. Res. Soc. 2004, 55, 287–297. [Google Scholar] [CrossRef]
  69. Inderfurth, K.; Langella, I.M. Heuristics for solving disassemble-to-order problems with stochastic yields. Or Spectr. 2006, 28, 73–99. [Google Scholar] [CrossRef]
  70. Kongar, E.; Gupta, S.M. Disassembly to order system under uncertainty. Omega 2006, 34, 550–561. [Google Scholar] [CrossRef]
  71. Kongar, E.; Gupta, S.M. A multi-criteria decision making approach for disassembly-to-order systems. J. Electron. Manuf. 2002, 11, 171–183. [Google Scholar] [CrossRef]
  72. Barba-Gutiérrez, Y.; Adenso-Díaz, B. Reverse MRP under uncertain and imprecise demand. Int. J. Adv. Manuf. Technol. 2009, 40, 413–424. [Google Scholar] [CrossRef]
  73. Barba-Gutiérrez, Y.; Adenso-Diaz, B.; Gupta, S.M. Lot sizing in reverse MRP for scheduling disassembly. Int. J. Prod. Econ. 2008, 111, 741–751. [Google Scholar] [CrossRef]
  74. Kim, D.H.; Lee, D.H. A heuristic for multi-period disassembly leveling and scheduling. In Proceedings of the 2011 IEEE/SICE International Symposium on System Integration (SII), Kyoto, Japan, 20–22 December 2011; pp. 762–767. [Google Scholar]
  75. Kim, D.H.; Doh, H.H.; Lee, D.H. Multi-period disassembly levelling and lot-sizing for multiple product types with parts commonality. Proc. Instit. Mech. Eng. Part B J. Eng. Manuf. 2018, 232, 867–878. [Google Scholar] [CrossRef]
  76. Lee, D.H.; Xirouchakis, P.; Zust, R. Disassembly scheduling with capacity constraints. CIRP Ann. 2002, 51, 387–390. [Google Scholar] [CrossRef]
  77. Kim, J.-G.; Jeon, H.-B.; Kim, H.-J.; Lee, D.-H.; Xirouchakis, P. Capacitated disassembly scheduling: Minimizing the number of products disassembled. In Proceedings of the International Conference on Computational Science and Its Applications, Singapore, 9–12 May 2005; pp. 538–547. [Google Scholar]
  78. Kim, H.J.; Lee, D.H.; Xirouchakis, P. A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints. J. Oper. Res. Soc. 2006, 57, 1231–1240. [Google Scholar] [CrossRef]
  79. Prakash, P.K.S.; Ceglarek, D.; Tiwari, M.K. Constraint-based simulated annealing (CBSA) approach to solve the disassembly scheduling problem. Int. J. Adv. Manuf. Technol. 2012, 60, 1125–1137. [Google Scholar] [CrossRef]
  80. Liu, K.; Zhang, Z.H. Capacitated disassembly scheduling under stochastic yield and demand. Eur. J. Oper. Res. 2018, 269, 244–257. [Google Scholar] [CrossRef]
  81. Ullerich, C.; Buscher, U. Flexible disassembly planning considering product conditions. Int. J. Prod. Res. 2013, 51, 6209–6228. [Google Scholar] [CrossRef]
  82. Ji, X.; Zhang, Z.; Huang, S.; Li, L. Capacitated disassembly scheduling with parts commonality and start-up cost and its industrial application. Int. J. Prod. Res. 2016, 54, 1225–1243. [Google Scholar] [CrossRef]
  83. Godichaud, M.; Amodeo, L.; Hrouga, M. Metaheuristic based optimization for capacitated disassembly lot sizing problem with lost sales. In Proceedings of the 2015 international conference on industrial engineering and systems management (IESM), Seville, Spain, 21–23 October 2015; pp. 1329–1335. [Google Scholar]
  84. Hrouga, M.; Godichaud, M.; Amodeo, L. Efficient metaheuristic for multi-product disassembly lot sizing problem with lost sales. In Proceedings of the 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Bali, Indonesia, 4–7 December 2016; pp. 740–744. [Google Scholar]
  85. Hrouga, M.; Godichaud, M.; Amodeo, L. Heuristics for multi-product capacitated disassembly lot sizing with lost sales. IFAC-PapersOnLine 2016, 49, 628–633. [Google Scholar] [CrossRef]
  86. Kim, H.J.; Xirouchakis, P. Capacitated disassembly scheduling with random demand. Int. J. Prod. Res. 2010, 48, 7177–7194. [Google Scholar] [CrossRef]
  87. Tian, X.; Zhang, Z.H. Capacitated disassembly scheduling and pricing of returned products with price-dependent yield. Omega 2019, 84, 160–174. [Google Scholar] [CrossRef]
  88. Zhou, F.; He, Y.; Ma, P.; Lim, M.K.; Pratap, S. Capacitated disassembly scheduling with random demand and operation time. J. Oper. Res. Soc. 2022, 73, 1362–1378. [Google Scholar] [CrossRef]
  89. Yuan, G.; Yang, Y.; Tian, G.; Fathollahi-Fard, A.M. Capacitated multi-objective disassembly scheduling with fuzzy processing time via a fruit fly optimization algorithm. Environ. Sci. Pollut. Res. 2022; ahead-of-print. [Google Scholar]
  90. Slama, I.; Ben-Ammar, O.; Dolgui, A.; Masmoudi, F. New mixed integer approach to solve a multi-level capacitated disassembly lot-sizing problem with defective items and backlogging. J. Manuf. Syst. 2020, 56, 50–57. [Google Scholar] [CrossRef]
  91. Slama, I.; Ben-Ammar, O.; Dolgui, A.; Masmoudi, F. Genetic algorithm and Monte Carlo simulation for a stochastic capacitated disassembly lot-sizing problem under random lead times. Comput. Ind. Eng. 2021, 159, 107468. [Google Scholar] [CrossRef]
  92. Wen, H.; Hou, S.; Liu, Z.; Yongjiang, L. An optimization algorithm for integrated remanufacturing production planning and scheduling system. Chaos Solitons Fractals 2017, 105, 69–76. [Google Scholar] [CrossRef]
  93. He, P. Optimization and simulation of remanufacturing production scheduling under uncertainties. Int. J. Simul. Model. 2018, 17, 734–743. [Google Scholar] [CrossRef]
  94. Peng, S.; Li, T.; Zhao, J.; Guo, Y.; Lv, S.; Tan, G.Z.; Zhang, H. Petri net-based scheduling strategy and energy modeling for the cylinder block remanufacturing under uncertainty. Robot. Comput. Int. Manuf. 2019, 58, 208–219. [Google Scholar] [CrossRef]
  95. Zhang, H.P. Optimization of remanufacturing production scheduling considering uncertain factors. Int. J. Simul. Model. 2019, 18, 344–354. [Google Scholar] [CrossRef]
  96. Shi, J.; Zhang, W.; Zhang, S.; Chen, J. A new bifuzzy optimization method for remanufacturing scheduling using extended discrete particle swarm optimization algorithm. Comput. Ind. Eng. 2021, 156, 107219. [Google Scholar] [CrossRef]
  97. Kim, H.J.; Lee, D.H.; Xirouchakis, P. Disassembly scheduling: Literature review and future research directions. Int. J. Prod. Res. 2007, 45, 4465–4484. [Google Scholar] [CrossRef]
  98. Stanfield, P.M.; King, R.E.; Hodgson, T.J. Determining sequence and ready times in a remanufacturing system. IIE Trans. 2006, 38, 565–575. [Google Scholar] [CrossRef]
  99. Kim, M.G.; Yu, J.M.; Lee, D.H. Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines. Int. J. Prod. Res. 2015, 53, 1819–1831. [Google Scholar] [CrossRef]
  100. Qu, C.; Fu, Y.; Yi, Z.; Tan, J. Solutions to no-wait flow shop scheduling problem using the flower pollination algorithm based on the hormone modulation mechanism. Complexity 2018, 2018, 1973604. [Google Scholar] [CrossRef] [Green Version]
  101. Wang, W.; Tian, G.; Yuan, G.; Pham, D.T. Energy-time tradeoffs for remanufacturing system scheduling using an invasive weed optimization algorithm. J. Intell. Manuf. 2021, 1–19. [Google Scholar] [CrossRef]
  102. Wang, W.; Tian, G.; Zhang, H.; Xu, K.; Miao, Z. Modeling and scheduling for remanufacturing systems with disassembly, reprocessing, and reassembly considering total energy consumption. Environ. Sci. Pollut. Res. 2021; ahead-of-print. [Google Scholar]
  103. Guide, V.D.R., Jr. Scheduling using drum-buffer-rope in a remanufacturing environment. Int. J. Prod. Res. 1996, 34, 1081–1091. [Google Scholar] [CrossRef]
  104. Guide, V.D.R., Jr. Scheduling with priority dispatching rules and drum-buffer-rope in a recoverable manufacturing system. Int. J. Prod. Econ. 1997, 53, 101–116. [Google Scholar]
  105. Souza, G.C.; Ketzenberg, M.E.; Guide, V.D.R., Jr. Capacitated remanufacturing with service level constraints. Prod. Oper. Manag. 2002, 11, 231–248. [Google Scholar] [CrossRef]
  106. Guide, V.D.R., Jr.; Souza, G.C.; Van Der Laan, E. Performance of static priority rules for shared facilities in a remanufacturing shop with disassembly and reassembly. Eur. J. Oper. Res. 2005, 164, 341–353. [Google Scholar] [CrossRef]
  107. Li, L.; Li, C.; Tang, Y. A color petri net based scheduling model for remanufacturing system with stochastic process routing. In Proceedings of the 2014 IEEE International Conference on Automation Science and Engineering (CASE), New Taipei, Taiwan, 18–22 August 2014; pp. 474–479. [Google Scholar]
  108. Kang, C.; Hong, Y.S. Dynamic disassembly planning for remanufacturing of multiple types of products. Int. J. Prod. Res. 2010, 50, 6236–6248. [Google Scholar] [CrossRef]
  109. Lin, D.; Teo, C.C.; Lee, C.K.M. Heuristics for integrated job assignment and scheduling in the multi-plant remanufacturing system. Int. J. Prod. Res. 2015, 53, 2674–2689. [Google Scholar] [CrossRef]
  110. Giglio, D.; Paolucci, M.; Roshani, A. Integrated lot sizing and energy-efficient job shop scheduling problem in manufacturing/remanufacturing systems. J. Clean. Prod. 2017, 148, 624–641. [Google Scholar] [CrossRef]
  111. Yu, J.M.; Lee, D.H. Scheduling algorithms for job-shop-type remanufacturing systems with component matching requirement. Comput. Ind. Eng. 2018, 120, 266–278. [Google Scholar] [CrossRef]
  112. Li, L.; Li, C.; Li, L.; Tang, Y. An integrated approach for remanufacturing job shop scheduling with routing alternatives. Math. Biosci. Eng. 2019, 16, 2063–2085. [Google Scholar] [CrossRef]
  113. Fu, Y.; Zhou, M.C.; Guo, X.; Qi, L. Stochastic multi-objective integrated disassembly-reprocessing-reassembly scheduling via fruit fly optimization algorithm. J. Clean. Prod. 2021, 278, 123364. [Google Scholar] [CrossRef]
  114. Zhang, W.; Zheng, Y.; Ahmad, R. The integrated process planning and scheduling of flexible job-shop-type remanufacturing systems using improved artificial bee colony algorithm. J. Intell. Manuf. 2022, 1–26. [Google Scholar] [CrossRef]
  115. Guo, X.; Zhou, M.C.; Abusorrah, A.; Alsokhiry, F.; Sedraoui, K. Disassembly sequence planning: A survey. IEEE/CAA J. Autom. Sin. 2020, 8, 1308–1324. [Google Scholar] [CrossRef]
  116. Tseng, H.-E.; Chang, C.-C.; Lee, S.-C.; Huang, Y.-M. A block-based genetic algorithm for disassembly sequence planning. Expert Syst. Appl. 2018, 96, 492–505. [Google Scholar] [CrossRef]
  117. ElSayed, A.; Kongar, E.; Gupta, S.M.; Sobh, T. A robotic-driven disassembly sequence generator for end-of-life electronic products. J. Intell. Robot. Syst. 2012, 68, 43–52. [Google Scholar] [CrossRef]
  118. Li, H.J.; Jiang, J.; Wang, Y.F. Disassembly sequence planning based on extended interference matrix and genetic algorithm. Comput. Eng. Des. 2013, 34, 1064–1068. [Google Scholar]
  119. Zhong, L.; Youchao, S.; Okafor, E.G.; Haiqiao, W. Disassembly sequence planning for maintenance based on metaheuristic method. Aircr. Eng. Aerosp. Technol. 2011, 83, 138–145. [Google Scholar] [CrossRef]
  120. Guo, X.; Zhou, M.; Liu, S.; Qi, L. Lexicographic multiobjective scatter search for the optimization of sequence-dependent selective disassembly subject to multiresource constraints. IEEE Trans. Cybern. 2019, 50, 3307–3317. [Google Scholar] [CrossRef]
  121. Liu, J.; Zhou, Z.; Pham, D.T.; Xu, W.; Ji, C.; Liu, Q. Robotic disassembly sequence planning using enhanced discrete bees algorithm in remanufacturing. Int. J. Prod. Res. 2018, 56, 3134–3151. [Google Scholar] [CrossRef]
  122. Tao, F.; Bi, L.; Zuo, Y.; Nee, A.Y.C. Partial/parallel disassembly sequence planning for complex products. J. Manuf. Sci. Eng. 2018, 140, 011016. [Google Scholar] [CrossRef]
  123. Guo, H.; Chen, Z.; Ren, Y.; Qu, T.; Li, J. Research on disassembly sequence and disassembly length integrated decision of End-of-life products based on parts recovery comprehensive evaluation. J. Mech. Eng. 2022, 58, 258–268. [Google Scholar]
  124. Ren, Y.; Zhang, C.; Zhao, F.; Xiao, H.; Tian, G. An asynchronous parallel disassembly planning based on genetic algorithm. Eur. J. Oper. Res. 2018, 269, 647–660. [Google Scholar] [CrossRef]
  125. Ren, Y.; Meng, L.; Zhang, C.; Zhao, F.; Saif, U.; Huang, A.; Mendis, G.P.; Sutherland, J.W. An efficient metaheuristics for a sequence-dependent disassembly planning. J. Clean. Prod. 2020, 245, 118644. [Google Scholar] [CrossRef]
  126. Ren, Y.; Tian, G.; Zhao, F.; Yu, D.; Zhang, C. Selective cooperative disassembly planning based on multi-objective discrete artificial bee colony algorithm. Eng. Appl. Artif. Intell. 2017, 64, 415–431. [Google Scholar] [CrossRef]
  127. Lu, Q.; Ren, Y.; Jin, H.; Meng, L.; Li, L.; Zhang, C.; Sutherland, J.W. A hybrid metaheuristic algorithm for a profit-oriented and energy-efficient disassembly sequencing problem. Robot. Comput. Integr. Manuf. 2020, 61, 101828. [Google Scholar] [CrossRef]
  128. Zhu, B.; Sarigecili, M.I.; Roy, U. Disassembly information model incorporating dynamic capabilities for disassembly sequence generation. Robot. Comput. Integr. Manuf. 2013, 29, 396–409. [Google Scholar] [CrossRef]
  129. Costa, C.M.; Veiga, G.; Sousa, A.; Rocha, L.; Oliveira, E.; Cardoso, H.L.; Thomas, U. Automatic generation of disassembly sequences and exploded views from solidworks symbolic geometric relationships. In Proceedings of the 2018 IEEE International Conference on Autonomous Robot Systems and Competitions (ICARSC), Torres Vedras, Portugal, 25–27 April 2018; pp. 211–218. [Google Scholar]
  130. Lambert, A.J.D.; Gupta, S.M. Methods for optimum and near optimum disassembly sequencing. Int. J. Prod. Res. 2008, 46, 2845–2865. [Google Scholar] [CrossRef]
  131. Ma, Y.S.; Jun, H.B.; Kim, H.W.; Lee, D.-H. Disassembly process planning algorithms for end-of-life product recovery and environmentally conscious disposal. Int. J. Prod. Res. 2011, 49, 7007–7027. [Google Scholar] [CrossRef]
  132. Behdad, S.; Berg, L.P.; Thurston, D.; Vance, J.M. Leveraging virtual reality experiences with mixed-integer nonlinear programming visualization of disassembly sequence planning under uncertainty. J. Mech. Des. 2014, 136, 041005. [Google Scholar] [CrossRef] [Green Version]
  133. Gungor, A.; Gupta, S.M. Disassembly line balancing. In Proceedings of the 1999 Annual Meeting of the Northeast Decision Sciences Institute, Newport, RI, USA, 24–26 March 1999. [Google Scholar]
  134. Özceylan, E.; Kalayci, C.B.; Güngör, A.; Gupta, S.M. Disassembly line balancing problem: A review of the state of the art and future directions. Int. J. Prod. Res. 2019, 57, 4805–4827. [Google Scholar] [CrossRef] [Green Version]
  135. Yin, T.; Zhang, Z.; Zhang, Y.; Wu, T.; Liang, W. Mixed-integer programming model and hybrid driving algorithm for multi-product partial disassembly line balancing problem with multi-robot workstations. Robot. Comput. Integr. Manuf. 2022, 73, 102251. [Google Scholar] [CrossRef]
  136. Li, Z.; Janardhanan, M.N. Modelling and solving profit-oriented U-shaped partial disassembly line balancing problem. Expert Syst. Appl. 2021, 183, 115431. [Google Scholar] [CrossRef]
  137. Wang, K.; Li, X.; Gao, L.; Li, P.; Sutherland, J.W. A discrete artificial bee colony algorithm for multiobjective disassembly line balancing of end-of-life products. IEEE Trans. Cybern. 2021, 52, 7415–7426. [Google Scholar] [CrossRef] [PubMed]
  138. Ren, Y.; Zhang, C.; Zhao, F.; Triebe, M.J.; Meng, L. An MCDM-based multiobjective general variable neighborhood search approach for disassembly line balancing problem. IEEE Trans. Syst. Man Cybern. Syst. 2018, 50, 3770–3783. [Google Scholar] [CrossRef]
  139. Ren, Y.; Zhang, C.; Zhao, F.; Tian, G.; Lin, W.; Meng, L.; Li, H. Disassembly line balancing problem using interdependent weights-based multi-criteria decision making and 2-Optimal algorithm. J. Clean. Prod. 2018, 174, 1475–1486. [Google Scholar] [CrossRef]
  140. Ren, Y.; Yu, D.; Zhang, C.; Tian, G.; Meng, L.; Zhou, X. An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem. Int. J. Prod. Res. 2017, 55, 7302–7316. [Google Scholar] [CrossRef]
  141. Ren, Y.; Meng, L.; Zhang, C.; Lu, Q.; Tian, G. Multi-criterion decision making for disassembly line balancing problem. Procedia CIRP 2019, 80, 542–547. [Google Scholar] [CrossRef]
  142. Yılmaz, Ö.F.; Yazıcı, B. Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: An optimization model and solution approaches. Ann. Oper. Res. 2021, 319, 1793–1843. [Google Scholar] [CrossRef]
  143. Edis, E.B.; Ilgin, M.A.; Edis, R.S. Disassembly line balancing with sequencing decisions: A mixed integer linear programming model and extensions. J. Clean. Prod. 2019, 238, 117826. [Google Scholar] [CrossRef]
  144. Liu, M.; Liu, X.; Chu, F.; Zheng, F.; Chu, C. Robust disassembly line balancing with ambiguous task processing times. Int. J. Prod. Res. 2020, 58, 5806–5835. [Google Scholar] [CrossRef]
  145. Budak, A. Sustainable reverse logistics optimization with triple bottom line approach: An integration of disassembly line balancing. J. Clean. Prod. 2020, 270, 122475. [Google Scholar] [CrossRef]
  146. Han, H.J.; Yu, J.M.; Lee, D.H. Mathematical model and solution algorithms for selective disassembly sequencing with multiple target components and sequence-dependent setups. Int. J. Prod. Res. 2013, 51, 4997–5010. [Google Scholar] [CrossRef]
  147. Liu, C.; Zhu, Q.; Wei, F.; Rao, W.; Liu, J.; Hu, J.; Cai, W. A review on remanufacturing assembly management and technology. Int. J. Adv. Manuf. Technol. 2019, 105, 4797–4808. [Google Scholar] [CrossRef]
  148. Su, B.; Huang, X.M.; Ren, Y.H.; Wang, F.; Xiao, H.; Zheng, B. Research on selective assembly method optimization for construction machinery remanufacturing based on ant colony algorithm. J. Mech. Eng. 2017, 53, 60–68. [Google Scholar] [CrossRef]
  149. Liu, M.; Sun, Z.; Ge, M.; Wang, C.; Wang, Q. Remanufacturing Quality Optimization Method of Complex Mechanical Products Based on Assembly Deviation Degree. China Mech. Eng. 2014, 25, 1473. [Google Scholar]
  150. Behdad, S.; Thurston, D. Disassembly and reassembly sequence planning tradeoffs under uncertainty for product maintenance. J. Mech. Des. 2012, 134, 041011. [Google Scholar] [CrossRef]
  151. Su, C.; Shi, Y.; Dou, J. Multi-objective optimization of buffer allocation for remanufacturing system based on TS-NSGAII hybrid algorithm. J. Clean. Prod. 2017, 166, 756–770. [Google Scholar] [CrossRef]
  152. Li, C.; Feng, Y.; Du, Y. Decision-making method for used components remanufacturing process plan based on modified FNN. Comput. Integr. Manuf. Syst. 2016, 22, 728–737. [Google Scholar]
  153. Oh, Y.; Behdad, S. Simultaneous reassembly and procurement planning in assemble-to-order remanufacturing systems. Int. J. Prod. Econ. 2017, 184, 168–178. [Google Scholar] [CrossRef]
  154. Lahmar, H.; Dahane, M.; Mouss, N.K.; Haoues, M. Production planning optimisation in a sustainable hybrid manufacturing remanufacturing production system. Procedia Comput. Sci. 2022, 200, 1244–1253. [Google Scholar] [CrossRef]
  155. Polotski, V.; Kenne, J.P.; Gharbi, A. Joint production and maintenance optimization in flexible hybrid Manufacturing–Remanufacturing systems under age-dependent deterioration. Int. J. Prod. Econ. 2019, 216, 239–254. [Google Scholar] [CrossRef]
  156. Holland, J.H. Genetic algorithms. Sci. Am. 1992, 267, 66–73. [Google Scholar] [CrossRef]
  157. Kennedy, J.; Eberhart, R. Particle swarm optimization. In Proceedings of the ICNN’95-International Conference on Neural Networks, Perth, WA, Australia, 27 November–1 December 1995; Volume 4, pp. 1942–1948. [Google Scholar]
  158. Dorigo, M.; Birattari, M.; Stutzle, T. Ant colony optimization. IEEE Comput. Intell. Mag. 2006, 1, 28–39. [Google Scholar] [CrossRef]
  159. Kirkpatrick, S.; Gelatt, C.D., Jr.; Vecchi, M.P. Optimization by simulated annealing. Science 1983, 220, 671–680. [Google Scholar] [CrossRef]
  160. Glover, F.; Laguna, M. Tabu search. In Handbook of Combinatorial Optimization; Springer: Boston, MA, USA, 1998; pp. 2093–2229. [Google Scholar]
  161. Bengio, Y.; Lodi, A.; Prouvost, A. Machine learning for combinatorial optimization: A methodological tour d’horizon. Eur. J. Oper. Res. 2021, 290, 405–421. [Google Scholar] [CrossRef]
  162. Lei, K.; Guo, P.; Wang, Y.; Wu, X.; Zhao, X. Solve routing problems with a residual edge-graph attention neural network. Neurocomputing 2022, 508, 79–98. [Google Scholar] [CrossRef]
  163. Yang, C.; Xu, W.; Liu, J.; Yao, B.; Hu, Y. Robotic Disassembly Sequence Planning Considering Robotic Movement State Based on Deep Reinforcement Learning. In Proceedings of the 2022 IEEE 25th International Conference on Computer Supported Cooperative Work in Design (CSCWD), Hangzhou, China, 4–6 May 2022; pp. 183–189. [Google Scholar]
Mathematics 11 00298 g001 550
Figure 1. General network structure.
Figure 1. General network structure.
Mathematics 11 00298 g001
Mathematics 11 00298 g002 550
Figure 2. Closed-loop network structure.
Figure 2. Closed-loop network structure.
Mathematics 11 00298 g002
Mathematics 11 00298 g003 550
Figure 3. Hybrid network structure.
Figure 3. Hybrid network structure.
Mathematics 11 00298 g003
Mathematics 11 00298 g004 550
Figure 4. Composition of a typical remanufacturing system.
Figure 4. Composition of a typical remanufacturing system.
Mathematics 11 00298 g004
Mathematics 11 00298 g005 550
Figure 5. The three steps in DSP.
Figure 5. The three steps in DSP.
Mathematics 11 00298 g005
Mathematics 11 00298 g006 550
Figure 6. An example of the DLBP.
Figure 6. An example of the DLBP.
Mathematics 11 00298 g006
Table
Table 1. Previous reviews about RL and remanufacturing.
Table 1. Previous reviews about RL and remanufacturing.
ArticleAreaPerspectives
[2]Facility location in RLA comprehensive review of remanufacturing RL and closed-loop supply chain network design.
[3]Facility location in RLA review of various quantitative models that have been proposed to solve RL network design.
[4]VRP in RLExtensively analyzed the existing literature of the VRP in RL to identify the current trends, research gaps, and the limitations in the adaptability to real world.
[5]VRP in RLReviewed the major contribution about waste collection in VRP.
[8]DLBP in remanufacturingReviewed recent models to summarize the input data, parameters, decision variables, constraints, and objectives of the DLBP.
[9]DSP in remanufacturingReviewed the existing DSP methods from the perspectives of disassembly mode, disassembly modelling, and planning method.
[10]Scheduling in remanufacturingClassified the scheduling literature in remanufacturing into single and multiple products, disassembly, and integrated scheduling, and further subdivided through part capacity, commonality, and deterministic/stochastic parameters.
Table
Table 2. Mathematical model of general network structure.
Table 2. Mathematical model of general network structure.
NOYearsTypeNum. of ObjectivesProductsSolution
[13]2010MINLPOne (maximize profit)Tire retreadingLingo 8.0
[15]2012MILPOne (maximize profit)Washing machines
and tumble dryers		CPLEX
[21]2014P-MILPOne (minimize the total cost)Hypothetical problemGenetic algorithm
[22]2014M-MILPThree (minimize total cost, ensure equity among different firms, and provide stable product flow to each company within the planning scope)Electrical waste and electronic equipmentCPLEX
[16]2015MILPOne (maximize profit)Washing machines
and tumble dryers		CPLEX
[17]2016MILPOne (maximize profit)VehiclesCPLEX
[18]2017MILPOne (maximize profit) Genetic algorithm
[14]2018MINLPOne (maximize profit)Waste recyclingHybrid genetic algorithm
[19]2019MILPOne (minimize the total cost)Lithium-ion batteriesThree-phase heuristic
[20]2020MILPOne (maximize profit)Numerical researchCPLEX
Table
Table 3. Mathematical model of CLNS.
Table 3. Mathematical model of CLNS.
NOYearsTypeObjectivesNetwork StagesSolutionOutputs
[24]2010MILPMC, MEISC, PC, DC, CZ, RYCEFL, PA, I, PT, TM, CR
[30]2011MILPMC, MEI, MSSC, PC, DC, CZ, CC, RDC, RCC, RMC, RYC, DICOMSO, FL, A, PA, PT, TA, NP
[31]2012SMIPMCSC, PC, DC, CZ, CC, RDC, RCC, RMC, RYC, DICOMSO, FL, A, PA, PT, TA, NP
[25]2012MILPMCPC, DC, RCCOMFL, FC, A, PA
[27]2014FMIPMC, MEIPC, CZ, CC, RCC (Steel), RCC(Plastic), DICIFSFL, TA, PA, NP
[32]2015SMIPMCCZ, CZ, CC, RDC, RCC, DICEFL, TA, QND
[26]2016MINLPMCSC, PC, CZ, W, DC, RMC, RCCE, OMFC, TA, UP, I, NP
[28]2017MILPMCSC, PC, DC, CZ, D, RMC, RDC, DICGAFL, PA, TA
[29]2018MILPMC, MEICC, DC, CZ, SC, RYCOMFL, A, NP, CS, TA
[33]2019MINLPMC, MEI, MSSC, PC, DC, CZ, CC, RDC, RCC, RMC, RYC, DICOMSO, FL, A, PA, PT, TA, NP, DC
Table
Table 4. Abbreviations comparison table.
Table 4. Abbreviations comparison table.
ItemContentNotation
ObjectivesMin cost/max profitMC
Min environment impactsMEI
Max social benefitsMS
Network StagesSupply centersSC
Production centersPC
Distribution centersDC
WarehousesW
Customer zones (retail outlets)CZ
Collection/inspection centersCC
DismantlersD
Redistribution centersRDC
Recovering centersRCC
Remanufacturing centersRMC
Recycling centersRYC
Disposal/incineration centersDIC
Solution MethodExactE
Genetic-algorithm-basedGA
Other metaheuristicsOM
Interactive fuzzy solution approachIFS
OutputsSuppliers/ordersSO
Facilities locationFL
Facility capacityFC
AllocationA
DiscountDC
Production amountPA
Utilization of production centers UP
Production technologyPT
Transportation amountTA
Transportation modeTM
Number of vehiclesNV
InventoryI
Number of used products which are processedNP
Carbon credits sold/purchasedCS
Quantity of non-satisfied demandQND
Table
Table 5. Exact algorithms.
Table 5. Exact algorithms.
AreaMethodsReference
Facility location and VRP in RLLingo[13,25,31,40]
CPLEX[15,16,17,20,22,30,37,38,39,42]
Branch and bound[36,51,57,60,63]
Scheduling in remanufacturingCPLEX[77]
Dynamic programming[87]
Disassembly in remanufacturingCPLEX[143]
Improved augmented Epsilon constraint[145]
Table
Table 6. Heuristic or metaheuristic algorithms.
Table 6. Heuristic or metaheuristic algorithms.
AreaMethodsReference
Facility location and VRP in RLGenetic algorithm[14,18,21,23,24,43,49]
Three-phase heuristic approach[19]
Three different hybridization methods[27]
Hybrid genetic algorithm and particle swarm optimization[32]
Ant colony algorithm[26,48]
Imperialist competitive algorithm[28]
Tri-level metaheuristics[29]
Hybrid Keshtel and genetic algorithm[33]
Parallel differential evolutionary algorithm[55]
Simulated annealing[49]
Two-phased heuristic[50]
Insertion-based heuristics[56]
Tabu search[58,61]
Neighborhood search[59,62,63]
Scheduling in remanufacturingGenetic algorithm[83,102,109]
Two-phased heuristic[67,75,82,105]
One-to-many heuristic
One-to-one heuristic		[69]
Greedy algorithm[74]
Simulated annealing[79,111]
Particle swarm optimization[80,87,96]
Fruit fly optimization[89,113]
Hybrid genetic algorithm[84,85,88,90,91,92,93,95]
CDS[98]
Nawaz–Enscore–Ham-based[75,99]
Priority-rule-based heuristic[75]
Integrated gradients[75]
Flower pollination algorithm[100]
Multi-objective invasive weed optimization[101]
Hybrid metaheuristic using simulated annealing and tabu search[107]
Hybrid metaheuristic using SA and MST rule[112]
Artificial bee colony algorithm[114]
Disassembly in remanufacturingGenetic algorithm[116,117,118,124,125]
Particle swarm optimization[119]
Scatter search algorithm[120]
Discrete bees algorithm[121,126,127,137]
Tabu search[122,151]
Variable neighborhood search[127,138]
Greedy search algorithm[129]
Two-phase algorithm[131]
Hybrid driving algorithm based on a three-layer encoding method[135]
Discrete cuckoo search[136]
2-optimal algorithm[139]
Gravitational search algorithm[140]
Fast-ranking heuristic approach[141]
Non-dominated sorting genetic algorithm-II[142,151,154]
Two-stage parameter-adjusting heuristic[144]
Branch and fathoming algorithm[146]
Ant colony algorithm[148]
Simulated annealing genetic algorithm[149]
Table
Table 7. Other algorithms.
Table 7. Other algorithms.
AreaMethodsReference
Facility location and VRP in RLIntegrating the sample average approximation scheme with an importance sampling strategy[34]
ReCiPe life cycle assessment methodology[41]
Fermatean fuzzy CRITIC-EDAS approach[47]
Scheduling in remanufacturingReverse material requirement planning algorithm [64,65,72]
Fuzzy goal programming technique[70]
Outer approximation-based solution algorithm[80]
Dynamic window approach[94]
Drum–buffer–rope-based scheduling approach[103,104]
Disassembly in remanufacturingChoquet integral[123]
Immersive computing technology[132]
Multi-attribute utility analysis
Takagi–Sugeno fuzzy neural network		[150]
[152]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ren, Y.; Lu, X.; Guo, H.; Xie, Z.; Zhang, H.; Zhang, C. A Review of Combinatorial Optimization Problems in Reverse Logistics and Remanufacturing for End-of-Life Products. Mathematics 2023, 11, 298. https://doi.org/10.3390/math11020298

AMA Style

Ren Y, Lu X, Guo H, Xie Z, Zhang H, Zhang C. A Review of Combinatorial Optimization Problems in Reverse Logistics and Remanufacturing for End-of-Life Products. Mathematics. 2023; 11(2):298. https://doi.org/10.3390/math11020298

Chicago/Turabian Style

Ren, Yaping, Xinyu Lu, Hongfei Guo, Zhaokang Xie, Haoyang Zhang, and Chaoyong Zhang. 2023. "A Review of Combinatorial Optimization Problems in Reverse Logistics and Remanufacturing for End-of-Life Products" Mathematics 11, no. 2: 298. https://doi.org/10.3390/math11020298

APA Style

Ren, Y., Lu, X., Guo, H., Xie, Z., Zhang, H., & Zhang, C. (2023). A Review of Combinatorial Optimization Problems in Reverse Logistics and Remanufacturing for End-of-Life Products. Mathematics, 11(2), 298. https://doi.org/10.3390/math11020298

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop