making! PAPER The e-magazine for the Fibrous Forest Products Sector
Produced by: The Paper Industry Technical Association
Publishers of: Paper Technology International ®
Volume 8 / Number 1 / 2022
PAPER making! FROM THE PUBLISHERS OF PAPER TECHNOLOGY INTERNATIONAL ® FROM THE PUBLISHERS OF PAPER TE Volume 8, Number 1, 2022
CONTENTS:
FEATURE ARTICLES: 1. Tissue : Energy saving by efficiency scheduling under Time-of-Use tariffs. 2. Pulping : Using Green Chemistry for a Circular Economy. 3. Nanocellulose : Application of NCC suspensions to papermaking. 4. Fillers : Nano-silica papermaking fillers prepared from rice straw ash. 5. Corrugated : Modelling warp in corrugated cardboard. 6. Pulp : Coffee silverskin as a pulp substitute in the context of Circular Economy. 7. Wood Panel : Flexural rigidity and modelling of moduli of elasticity of OSB. 8. Water Treatment : A new strategy for handling papermaking waste water. 9. Biopolymers : Sustainable additives in pulp and paper – a comprehensive review. 10. Leadership : The 8 most common leadership styles. 11. Management : How to develop a project plan – 12 steps to success. 12. Meeting Etiquette : 8 rules to improve professional meetings.
SUPPLIERS NEWS SECTION: News / Products / Services :
Section 1 – PITA Corporate Members: ABB / ARCHROMA / BUCKMAN / VALMET
Section 2 – PITA Non-Corporate Members VOITH
DATA COMPILATION: Events : PITA Courses & International Conferences / Exhibitions
Installations : Overview of equipment orders and installations since November 2021 Research Articles : Recent peer-reviewed articles from the technical paper press Technical Abstracts : Recent peer-reviewed articles from the general scientific press
The Paper Industry Technical Association (PITA) is an independent organisation which operates for the general benefit of its members – both individual and corporate – dedicated to promoting and improving the technical and scientific knowledge of those working in the UK pulp and paper industry. Formed in 1960, it serves the Industry, both manufacturers and suppliers, by providing a forum for members to meet and network; it organises visits, conferences and training seminars that cover all aspects of papermaking science. It also publishes the prestigious journal Paper Technology International ® and the PITA Annual Review , both sent free to members, and a range of other technical publications which include conference proceedings and the acclaimed Essential Guide to Aqueous Coating .
Page 1 of 1
Contents
PAPER making! FROM THE PUBLISHERS OF PAPER TECHNOLOGY INTERNATIONAL ® FROM THE PUBLISHERS OF PAPER TE Volume 8, Number 1, 2022
Energy Saving for Tissue Paper Mills by Energy-Efficiency Scheduling under Time-of-Use Electricity Tariffs ZHIQIANG ZENG 1 , XIAOBIN CHEN 2 AND KAIYAO WANG 1 . Environmental concerns and soaring energy prices have brought huge pressure of energy saving and emission reduction to tissue paper mills. Electricity is one of the main energy sources of tissue paper mills. The production characteristics of tissue paper mills make it easy to decrease energy cost by using time-of- use (TOU) electricity tariffs. This study investigates the bi-objective energy-efficiency scheduling of tissue paper mills under time-of-use electricity tariffs, the objectives of which are makespan and energy cost. First, considering the processing energy cost, setup energy cost, and transportation energy cost, an energy cost model of a tissue paper mill under TOU electricity tariffs is established. Second, the energy-efficiency scheduling model under TOU electricity tariffs is built based on the energy cost model. Finally, on the basis of decomposition and teaching – learning optimization, this study proposes a novel multi-objective evolutionary algorithm and further combined with the variable neighborhood search to solve the problem. The case study results demonstrate that our study of tissue paper mill energy saving is feasible, and the proposed method has better performance than the existing methods. Contact information: 1 Faculty of Intelligent Manufacturing, Wuyi University, Jiangmen 529020, China. 2 College of Chemical and Material Engineering, Quzhou University, Quzhou 324000, China. Processes 2021, 9, 274. https://doi.org/10.3390/pr9020274 Creative Commons Attribution 4.0 International License
The Paper Industry Technical Association (PITA) is an independent organisation which operates for the general benefit of its members – both individual and corporate – dedicated to promoting and improving the technical and scientific knowledge of those working in the UK pulp and paper industry. Formed in 1960, it serves the Industry, both manufacturers and suppliers, by providing a forum for members to meet and network; it organises visits, conferences and training seminars that cover all aspects of papermaking science. It also publishes the prestigious journal Paper Technology International ® and the PITA Annual Review , both sent free to members, and a range of other technical publications which include conference proceedings and the acclaimed Essential Guide to Aqueous Coating .
Article 1 – Tissue & Energy
Page 1 of 25
processes
Article Energy Saving for Tissue Paper Mills by Energy-Efficiency Scheduling under Time-of-Use Electricity Tariffs
Zhiqiang Zeng 1, * , Xiaobin Chen 2 and Kaiyao Wang 1
1 Faculty of Intelligent Manufacturing, Wuyi University, Jiangmen 529020, China; wang.kaiyao@outlook.com 2 College of Chemical and Material Engineering, Quzhou University, Quzhou 324000, China; xbchen24264@163.com * Correspondence: zhiqiang.zeng@outlook.com Abstract: Environmental concerns and soaring energy prices have brought huge pressure of energy saving and emission reduction to tissue paper mills. Electricity is one of the main energy sources of tissue paper mills. The production characteristics of tissue paper mills make it easy to decrease energy cost by using time-of-use (TOU) electricity tariffs. This study investigates the bi-objective energy-efficiency scheduling of tissue paper mills under time-of-use electricity tariffs, the objectives of which are makespan and energy cost. First, considering the processing energy cost, setup energy cost, and transportation energy cost, an energy cost model of a tissue paper mill under TOU electricity tariffs is established. Second, the energy-efficiency scheduling model under TOU electricity tariffs is built based on the energy cost model. Finally, on the basis of decomposition and teaching– learning optimization, this study proposes a novel multi-objective evolutionary algorithm and further combined with the variable neighborhood search to solve the problem. The case study results demonstrate that our study of tissue paper mill energy saving is feasible, and the proposed method has better performance than the existing methods.
Keywords: tissue paper mill; energy saving; time-of-use electricity tariffs; multi-objective optimization
Citation: Zeng, Z.; Chen, X.; Wang, K. Energy Saving for Tissue Paper Mills by Energy-Efficiency Scheduling under Time-of-Use Electricity Tariffs. Processes 2021 , 9 , 274. https://doi.org/10.3390/ pr9020274
1. Introduction The paper industry is an energy-intensive industry. In 2019, its energy consumption reached 1483.2 trillion British thermal units (Btu), of which electricity consumption was 205.3 trillion Btu. [1]. At the same time, the carbon dioxide emissions of the paper industry reached 48 million tons in 2019, accounting for 4.45% of the total carbon dioxide emissions of the manufacturing industry [2]. Under the pressure from environmental degradation and rising energy costs, the papermaking industry is faced with huge energy-saving and emission reducing pressure. Studying the energy-efficiency scheduling under the time-of- use (TOU) electricity tariffs is of great significance for papermaking enterprises to improve energy efficiency. In general, one day can be divided into three periods based on the electricity demand, namely, the on-peak period, the mid-peak period, and the non-peak period. Due to the imbalance in the demand for electricity, waste will be generated in the off-peak or mid-peak periods, while the demand will exceed the supply during the on-peak period. To deal with this issue, the TOU pricing scheme is used to encourage users to use electricity in the mid-peak period and off-peak period, thus balancing the demand of electricity. In the production process, the electricity consumption of each job is different, indicating that the operation with high electricity consumption is arranged in off-peak or mid-peak periods and the operation with low electricity consumption is arranged in an on-peak period, so that the electricity cost can be decreased. The energy-efficiency scheduling under TOU electricity tariffs is based on above idea, which has attracted more attention in recent years.
Received: 8 December 2020 Accepted: 27 January 2021 Published: 31 January 2021
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affil- iations.
Copyright: © 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https:// creativecommons.org/licenses/by/ 4.0/).
Processes 2021 , 9 , 274. https://doi.org/10.3390/pr9020274
https://www.mdpi.com/journal/processes
Processes 2021 , 9 , 274
2of 24
Mouzon and Yildirim are the pioneers that regard energy consumption as the objec- tive of production scheduling [3]. Energy-efficiency scheduling mainly improves energy efficiency in two ways: reducing energy consumption and reducing energy cost by schedul- ing. The existing research on energy-efficiency scheduling focuses on how to decrease energy consumption in different stages, such as decreasing the energy consumption in the processing stage, the setup stage, and the standby stage [4–9]. Recently, energy-efficiency scheduling decreases energy cost considering both energy consumption and energy price. Energy-efficiency scheduling under TOU electricity tariffs is an efficient way to reduce energy cost. Scholars have carried out a lot of research on energy-efficiency scheduling under TOU electricity tariffs in different generic manufacturing systems. Simple manu- facturing systems, such as single machine and parallel machine, have been studied by many researchers [10–13]. However, there are few reports on complex manufacturing systems, such as flow shop, flexible flow shop, job shop, flexible job shop, etc. [14–16]. The generic manufacturing systems are different from the real manufacturing systems. In order to study the energy-efficiency scheduling models in line with the actual manufacturing system, some scholars have investigated energy-efficiency scheduling in the actual pro- duction and manufacturing system, such as hardware manufacturing and iron and steel industry [17–22]. According to different production stages, the energy cost mainly consists of processing energy cost, setup energy cost, standby energy cost, etc. [23]. Many studies discuss process- ing energy cost, which accounts for the largest proportion of the total energy cost [24,25]. Setup energy cost cannot be ignored in many industries, especially in the processing indus- try. In addition, transport energy cost may be negligible in many industries, but it cannot be ignored in heavy industry. Setup time and transportation time may span multiple time periods, leading to different electricity prices in the same setup stage or transportation stage. Consequently, it is difficult to build an efficient energy cost model. Many research studies on energy-efficiency scheduling under TOU electricity tariffs fails to consider the setup energy cost and the transportation energy cost. The feasibility of reducing material wastage and energy consumption in tissue pa- per mills has been proved through production scheduling [26]. Energy consumption in tissue paper mills can be decreased by combining process optimization and production scheduling [27]. However, the previous research fails to consider TOU electricity tariffs. This study investigates the energy-efficiency scheduling under TOU electricity tariffs for tissue paper mills. There are three main contributions in this paper: First, a new mathe- matical model of energy-efficiency scheduling under TOU electricity tariffs is established for tissue paper mills. Energy cost includes processing energy cost, setup energy cost and transportation energy cost. Second, a novel Multi-Objective Evolutionary Algorithm based on Decomposition and Teaching–Learning-Based Optimization (MOEA/DTL) is proposed, which further improves the performance of the MOEA/DTL by Variable Neighborhood Search (IMOEA/DTLB). Third, the effectiveness of the proposed IMOEA/DTL is verified by carrying out a case study. Lastly, the energy-saving potential of the IMOEA/DTL is evaluated based on a practical scheduling problem in a tissue paper mill. This paper is structured as follows. In Section 2, the production process and the energy-efficiency scheduling of tissue paper mills under electricity tariffs are described. Moreover, an energy cost model under TOU electricity tariffs is built, and the energy- efficiency scheduling model under TOU electricity tariffs is built. Section 3 introduces the proposed IMOEA/DTL method. Section 4 verifies the feasibility of the study and the effectiveness of the proposed algorithm by carrying out a case study. Finally, Section 5 summarizes the study and proposes the future research direction. 2. Problem Description and Modeling As shown in Figure 1, the production of a tissue paper mill mainly includes two stages, namely the pulping and papermaking stage and the conversion stage. In the pulping and papermaking stage, the first production unit is the stock preparation system, which is
Processes 2021 , 9 , 274
3of 24
composed of a pulper, a refiner, and a chest. The pulper is the first equipment used in the pulping and papermaking stage. The paperboard is first mixed with water and then disintegrated by the pulper to obtain the pulp with a certain concentration. The obtained pulp is stored in the chest (there are usually multiple chests). However, the quality of the pulp disintegrated by the pulper cannot meet the requirements of papermaking. Therefore, it is necessary to further improve the quality of the pulp using the refiner. The pulp obtained by the refiner will be stored in other chests. The pulper and the refiner operate intermittently, which mainly depends on the liquid level of the chest. Afterwards, the pulp is sent to the forming sector through the approach flow system. The forming sector removes part of the water, and finally, the paper is formed. Next, the paper is further dehydrated by the press section. The dryness of the paper from the press section falls far short of the requirements. Paper is dried in the dryer section to make the dryness of the paper meet the requirements. The last step of the pulping and papermaking stage is the winding section. The paper is reeled by the reel cylinder, thus forming the parent roll. The parent roll will be further processed in the conversion stage.
Figure1. Production process of tissue paper mills.
In the conversion stage, a certain number of parent rolls are simultaneously rolled into reels using the winder, and the number of the parent rolls depends on the numbers of paper layers in the finished product. The reel paper is cut into small reels with a cutter. Finally, the small reels are packaged into the finished product by the packaging machine. Discrete production mainly occurs in the pulping process and the processing between the pulping and papermaking stage and the conversion stage. The processing is continuous in the papermaking or conversion stage. The interval time between two stages is uncertain. Different from other flow shops, only when enough parent rolls are produced in the papermaking stage can the conversion stage be started, rather than after finishing a roll of parent roll in the papermaking stage. The interval time between two stages is related to the product characteristics and the machine speed. Too long of an interval time
Processes 2021 , 9 , 274
4of 24
will increase the pressure on work-in-process inventory. However, a short interval time is likely to cause frequent downtime of the machine in the conversion stage. Therefore, it is important to determine the optimal interval time in the production scheduling. The scheduling of a tissue paper mill, which is two-stage flexible flow shop scheduling, is composed of the pulping and papermaking stage and the conversion stage. Each job is processed by a production line in the pulping and papermaking stage and a production line in the conversion stage. The energy consumption in the processing stage accounts for the vast majority of energy consumption in tissue paper mills. Product characteristics can deter- mine the processing energy consumption. Different product characteristics mean different process parameters, and the energy consumed by machines under different process parame- ters varies significantly. For example, the products with high grammage will consume more energy in the papermaking stage, and vice versa. Under TOU electricity tariffs, the energy cost can be reduced in two ways: (i) arranging the job to the production line with low processing energy consumption; and (ii) arranging the job with high grammage production in the off-peak or mid-peak period and the job with low grammage production in the on-peak period. When there are two different consecutive jobs, production changeover will occur in tissue paper mills. The parameters of the machine should be adjusted to process the new later job, which will consume a lot of energy in the setup stage. In general, the setup energy cost can be reduced by arranging jobs with lower setup energy consumption processed consecutively. Under TOU electricity tariffs, the setup energy cost can be further reduced by arranging the jobs with higher setup energy consumption processed in the off-peak or mid-peak period and the jobs with lower setup energy consumption processed in the on-peak period. The parent rolls produced in the pulping and papermaking stage should be transported to the conversion stage for further processing. The transport energy consumption is related to the distance between the papermaking line and the conversion line. Similarly, the transportation distance can be shortened to decrease the transport energy cost. Moreover, the transport energy cost can be further reduced by arranging the jobs with high transportation energy consumption in the off-peak or mid-peak period and the jobs with low transportation energy consumption in the on-peak period. Tissue paper mills can decrease the energy cost by utilizing the TOU electricity pricing scheme in job scheduling. Table 1 shows the TOU electricity tariffs in Guangdong, China.
Table1. Time-of-use (TOU) electricity tariffs implemented in Guangdong.
Period Type
Time Periods
Electricity Price (CNY/kWh)
Off-peak Mid-peak On-peak
00:00–08:00
0.3351 0.6393 1.0348
08:00–09:00; 12:00–19:00; 22:00–24:00
09:00–12:00; 19:00–22:00
2.1. Energy Cost Modeling According to the characteristics of energy consumption in tissue paper mills, this study mainly considers energy cost from three aspects: processing energy cost, setup energy cost, and transportation energy cost. Processing energy cost is related to processing energy consumption and electricity price. Under the TOU electricity pricing scheme, different electricity prices are set for different periods in a day. This study establishes a processing energy cost model combined with the TOU electricity pricing scheme and the processing energy consumption. The processing energy cost model is as below.
m ∑ j = 1 n ∑ i = 1 ( EP 1 + EP 2 + EP 3 + EP 4 ) ∗ O i , j
(1)
EP =
EP 1 = MIN CEIL S i , j − S i , j , FG CEIL S i , j + T i , j , CEIL S i , j × U i , j × P FLOOR ( MOD ( S i , j , K ))
(2)
Processes 2021 , 9 , 274
5of 24
FLOOR ( MOD ( S i , j , K )+( T i , j − FIX ( T i , j , K ) ∗ K )) ∑ k = CEIL ( MOD ( S i , j , K ))
P k × U i , j
EP 2 =
(3)
EP 3 = S i , j + T i , j − FLOOR S i , j + T i , j × U i , j × P FLOOR ( MOD ( S
(4)
i , j + T i , j , K ))
K ∑ k = 1
EP 4 = FIX T i , j , K ×
P k × U i , j
(5)
where EP is the processing energy cost, and Equation (1) is the calculation formula of the processing energy cost. The processing energy cost is divided into four parts, namely EP 1, EP 2, EP 3, and EP 4. Equation (2) represents the processing energy cost from the start of the job to the next period. Equation (3) represents the processing energy cost from the next period of the start of the job to the previous period of the completion of the job. Equation (4) represents the processing energy cost from the previous period of the completion of the job to the completion of the job. If the job spans for several cycles, Equation (5) represents the processing energy cost of the job in several cycles. m and n are the numbers of production lines and jobs, respectively. O i , j denotes whether production line j processes job i . O i , j is set to one when production line j processes job i ; otherwise, it is set to zero. CEIL is a function that rounds up to an integer. T i , j is the processing time of job i in production line j . S i , j is the start time of job i processed in production line j . Function FG has two parameters. When the first parameter is equal to the second parameter, FG is set to one; otherwise, it is set to zero. U i , j represents the power of job i in production line j , P k represents the electricity price in k period. FLOOR is a function that rounds down to an integer, K is the number of periods, MOD represents modulo operation, and FIX is the quotient operation. The setup time is up to several hours, especially in the pulping and papermaking stage, which cannot be ignored in tissue paper mills. Under the TOU electricity pricing scheme, the machine setup energy cost may be different when the setup occurs at different periods due to different energy prices in different periods. The off-peak or mid-peak period has lower setup energy cost compared with the on-peak period. Moreover, the setup may span multiple periods. The setup energy cost model is formulated as follows:
N j ∑ i = 1
m ∑ j = 1
ES 1 + ES 2 + ES 3 + ES 4
(6)
ES =
ES 1 = MIN CEIL F i
, FG CEIL F i P FLOOR ( MOD ( F i
− 1, j − × US i , i
− 1, j
, CEIL F i
− 1, j
F i
TS i , i
− 1, j +
− 1, j
(7)
− 1, j ×
, K ))
− 1, j
, K )+( TS i , i
, K ) × K ))
FLOOR ( MOD ( F i
FIX ( TS i , i
− 1, j −
− 1, j
− 1, j
− 1, j
∑ k = CEIL ( MOD ( F i
ES 2 =
(8)
P k × US i , i
, K ))
− 1, j
FLOOR F i − 1, j +
ES 3 = F i
− 1, j ×
TS i , i
TS i , i
US i , i
− 1, j −
− 1, j +
− 1, j +
− 1, j
(9)
× P FLOOR ( MOD ( F i
, K ))
TS i , i
− 1, j
K ∑ k = 1
ES 4 = FIX TS i , i
, K ×
− 1, j
(10)
P k × US i , i
− 1, j
where ES represents the setup energy cost, and Equation (6) is the calculation formula of the setup energy cost. The setup energy cost is divided into four parts, namely ES 1, ES 2, ES 3, and ES 4. Equation (7) represents the setup energy cost from the start of the setup to the next period. Equation (8) represents the setup energy cost from the next period of the start of the setup to the previous period of the completion of the setup. Equation (9) represents the setup energy cost from the previous period of the completion of the setup to the completion of the setup. If the setup spans for several cycles, Equation (10) represents the setup energy cost of the job in several cycles. N j represents the number of
Processes 2021 , 9 , 274
6of 24
jobs processed in production line j , F i − 1, j is the completion time of job i − 1 in production − 1, j is the setup time in the conversion from job i − 1 to job i in production line j . − 1, j is the power when job i − 1 is converted to job i in production line j . In tissue paper mills, the parent roll produced in the papermaking line should be transported to the conversion line for further processing. However, the distance between papermaking lines and conversion lines is different. The longer the distance, the higher the energy cost of transporting the parent roll from the papermaking line to the conversion line. The transportation time in tissue paper mills is up to tens of minutes. In the production scheduling process, it is necessary to consider the processing route with short distance to reduce the transportation energy cost. Under the TOU electricity pricing scheme, the transportation energy cost varies in different time periods. Similarly, the transportation time may span multiple time periods. The transportation energy cost model of tissue paper mills is formulated as below: line j , TS i , i US i , i
m 2 ∑ l = 1 ( TP 1 × P 1 + TP 2 × P 2 + TP 3 × P 3 ) × W i × TC
O i , h , l (11)
m 1 ∑ h = 1
n ∑ i = 1
ET =
ET 1 ( 1 )+ ET 2 ( 1 )+ ET 3 ( 1 )
TP 1 =
(12)
∑ 3 s = 1 ( ET 1 ( s )+ ET 2 ( s )+ ET 3 ( s ))
ET 1 ( 2 )+ ET 2 ( 2 )+ ET 3 ( 2 )
(13)
TP 2 =
∑ 3 s = 1 ( ET 1 ( s )+ ET 2 ( s )+ ET 3 ( s ))
ET 1 ( 3 )+ ET 2 ( 3 )+ ET 3 ( 3 )
TP 3 =
(14)
∑ 3 s = 1 ( ET 1 ( s )+ ET 2 ( s )+ ET 3 ( s ))
ET 1 ( s )= MIN ( CEIL ( S i , l ) − S i , l , FG ( CEIL ( S i , l + T i , l ) , CEIL ( S i , l ))) × Q FLOOR MOD S i , j , K , s
(15)
FLOOR ( MOD ( S i , l , K )+( T i , l − FIX ( T i , l , K ) × K )) ∑ k = CEIL ( MOD ( S i , j , K ))
Q ( k , s )
(16)
ET 2 ( s )=
ET 3 ( s )=( S i , l + T i , l − FLOOR ( S i , l + T i , l )) × Q FLOOR MOD S i , j , K , s (17) ET 4 ( s )= FIX ( T i , l , K ) × K ∑ k = 1 Q ( k , s ) (18) where ET is the transportation energy cost, Equations (12)–(14) calculate the proportions of the processing time of job i in the off-peak, mid-peak, and on-peak periods to the total processing time, respectively. Equation (15) represents the transportation energy cost from the start of the transportation to the next period. Equation (16) represents the transportation energy cost from the next period of the start of the transportation to the previous period of the complete of the transportation. Equation (17) represents the transportation energy cost from the previous period of the completion of the transportation to the completion of the transportation. If the transportation spans for several cycles, Equation (18) represents the transportation energy cost of the job in several cycles. m 1 represents the number of production lines in the pulping and papermaking stage, while m 2 is the number of production lines in the conversion stage. TP 1, TP 2, and TP 3 represent the proportions of the processing time of job i in the off-peak, mid-peak, and on-peak periods to the total processing time, respectively. W i is the scale of job i . C ∑ m 1 h = 1 O i , h , l represents energy consumed by transporting job i from papermaking line h to conversion line l . The function Q ( k , s ) can judge whether the time period k belongs to period type s . The parameter s is the period type, and s values equal to 1, 2, and 3, respectively represent the off-peak, mid-peak, and on-peak period, respectively.
Processes 2021 , 9 , 274
7of 24
2.2. Energy-Efficiency Scheduling Modeling In the pulping and papermaking stage or the conversion stage, there are multiple parallel production lines with different speeds. Each job must be first processed in a production line in the first stage and then processed in a production line in the second stage. The pulping and papermaking line or the conversion line only processes one job at a time. In this study, the job cannot be stopped once being processed in the pulping and papermaking line or the conversion line. In addition, the time interval between two stages is uncertain. The scheduling problem is the variant of a two-stage flexible flow shop scheduling problem. According to the production scheduling characteristics of tissue paper mills and the above established energy cost model, the energy-efficiency scheduling model is as below. The model in this study contains two optimization objectives, which are multi-objective optimization problems. Multi-objective optimization problems are different from single-objective optimization problems. The quality of the solution needs to be evaluated through the dominance relationship. When all the objectives of solution S1 are better than all the objectives of solution S2, it can be said that S1 dominates S2. If S1 only has some objectives better than S2, then S1 and S2 are non-dominated. If a solution is not dominated by any other solution, the solution is called a non-dominated solution. The solution to the multi-objective optimization problem is a set of non-dominated solutions. min ( MAX ( C i )) ∀ i ∈{ 1,2, . . . , n } min ( EP + ES + ET ) (19) n ∑ i = 1 m 1 ∑ j = 1 O i , j = 1 (20)
m 2 ∑ j = 1
n ∑ i = 1
O i , j = 1
(21)
j ∈ 1, . . . , m ; ∀ l ∈ 2, . . . , N j
(22)
I j , l ≥ F j , l
TS l , l
− 1, j ∀
− 1 +
V i , h × O i , h , W i ∀ i = 1, . . . , n
B i ,2 ≥ B i ,1 + f
m 1 ∑ l = 1
m 2 ∑ h = 1
V i , l × O i , l ,
(23)
f ( v 1, v 2, w )=
H v 1
v 1 ≥ v 2 v 1 < v 2
(24)
w v 1 −
w v 2 +
H v 1
m 1 + m 2 = m
(25)
m ∑ j = 1
(26)
N j = n
Formula (19) is the optimization objectives, and there are two optimization objectives, which are makespan and energy cost. C i is the completing time of the job i in conversion line. Constraint (20) guarantees every job can and must be processed once in the pulping and papermaking line. Constraint (21) guarantees that every job can and must be processed once in the conversion line. Constraint (22) guarantees that every papermaking line or converting line can only process one job at the same time, indicating that only when the previous job and the setup are complete can the next job be started, where I j , l is the beginning time of the l -th job in production line j . Constraint (23) guarantees there is a time interval between two stages. B i ,1 is the beginning time of job i in the papermaking line, and B i ,2 is the beginning time of job i in the conversion line. There is a time interval between B i ,1 and B i ,2 ,where f ∑ m 1 l = 1 V l × O i , l , ∑ m 2 h = 1 V h × O i , h , W i represents the time interval, which is related to the speed of the papermaking line l when processing job i ( V i , l ), the speed of the conversion line h when processing job i ( V i , h ), and the scale of job ( W i ). Formula (24) is the calculation method of the time interval between B i ,1 and B i ,2 ,where H represents the value
Processes 2021 , 9 , 274
8of 24
of the length of the parent roll multiplying the number of paper layers in finished products. Formulas (25) and (26) are equality constraints. 3. The Proposed Optimization Algorithm In this section, the MOEA/DTL is proposed based on two outstanding methods, namely teaching-learning-based optimization (TLBO) and MOEA/D. In order to further improve the quality of the solutions, a variable neighborhood search (VNS) algorithm is designed to be combined with the MOEA/DTL to improve the performance of the algorithm (IMOEA/DTL). 3.1. MOEA/DTL MOEA/D uses multiple weight vectors to decompose the multi-objective optimiza- tion problem into multiple single-objective sub-optimization problems. When the weight vectors are distributed uniformly, the MOEA/D assumes Pareto optimal solutions with uniform distribution generated by combining the solutions of sub-optimization prob- lems. Every individual is corresponding to a sub-optimization problem in MOEA/D. In each iteration of MOEA/D, each individual exchanges information with neighbors and coevolves [28]. The flow chart of the standard MOEA/D is shown in Figure 2.
Figure2. The flow chart of Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D).
Processes 2021 , 9 , 274
9of 24
The input parameters are consistent with the input parameters of the proposed algo- rithm; refer to the input parameters of the proposed algorithm below. The initialization is the same as the proposed algorithm; refer to the proposed algorithm below. g te x i λ i , z is the decomposition approach. There are many decomposition approaches; among them, the boundary intersection approach, Tchebycheff approach, and weighted sum approach are three popular decomposition approaches. The basic idea of TLBO is to simulate the learning process of the class, which is completed in two phases: the teaching phase and the learning phase. Each individual learns from the teacher (the best individual is selected as the teacher) in the teaching phase. Individuals learn from each other (an individual is randomly selected) in the learning phase. The TLBO is originally designed to solve the continuous optimization problem because the formulas used to update individuals in the teaching and learning phase are continuous variable oriented. Some changes should be made when the scheduling problem is solved by the TLBO. This study modifies the TLBO by replacing the update formula by the discrete crossover operation. According to the idea of MOEA/D and TLBO, this study proposes a hybrid method (MOEA/DTL). The Figure 3 shows the flow chart of MOEA/DTL. The details of the proposed MOEA/DTL are shown in Algorithm 1.
Figure3. The flow chart of Multi-Objective Evolutionary Algorithm based on Decomposition and Teaching–Learning-Based Optimization (MOEA/DTL).
Processes 2021 , 9 , 274
10of 24
Algorithm 1 MOEA/DTL 1. Initialize the population scale and the number of subproblems. 2. Initialize the maximum number of iterations ( Mt ). 3. Initialize a set of N weight vectors with uniform distribution ( λ 1 , λ 2 , . . . , λ N ). 4. Initialize the number of neighbors for every weight vector ( T ). 5. Set the external population EP = Φ . 6. for each i = 1 to N do 7. The nearest T weight vectors of the i -th weight vector is calculated according to Euclidean distances. 8. Set B ( i )= λ i 1 , λ i 2 , . . . , λ i T ,where B ( i ) is the neighbors of λ i with T weight vectors. 9. endfor 10. Generate x 1 , x 2 , . . . , x N by a specific method. 11. FV i = F x i is set by the decomposition approach. 12. Set z =( z 1 , z 2 , . . . , z n ) T ,where z j = min 1 ≤ i ≤ N f j x i , f j x i is the j -th objective of solution x i . 13. while true do 14. for i = 1 to N do 15. Teaching phase: 16. if x i is not the best individual among its T neighbors 17. An individual from its T neighbors is randomly set as teacher Th witha probability Ps , or an individual is randomly selected from EP as teacher Th witha probability 1- Ps . 18. else 19. An individual is randomly selected from EP as Th . 20. end if 21. A new individual y is generated by a crossover operation from x i and Th . 22. Mutation operation is applied to y with probability Pm to generate a new individual y . 23. for each j ∈ [ 1, . . . , m ] do 24. Set z j = min z j , f j ( y ) . If g te y λ i , z ≤ g te x i λ i , z , set x i = y and FV i = F ( y ) . 25. endfor 26. Learning phase: 27. for each j ∈ B ( i ) do 28. if x j is not the best individual in the T neighbors of x i 29. A new individual y is first generated by crossover operation from x i and x j . 30. A new individual y is generated by applying the mutation operation to y with probability Pm . 31. else 32. Continue to the next iteration. 33. end if 34. for each j ∈ [ 1, . . . , m ] do 35. set z j = min z j , f j ( y ) . 36. if g te y λ i , z ≤ g te x i λ i , z 37. Set x i = y and FV i = F ( y ) . 38. end if 39. endfor 40. endfor 41. endfor 42. Update EP : a new non-dominated set is selected from EP and the new population as the new EP , and get rid of the duplicate solution. If the size of EP is smaller than the setting value, some randomly generated individuals ( EP ) are added to EP until the size of EP is equal to the setting value. 43. for each i = 1 to size ( EP ) do 44. An individual x i is randomly selected from EP − EP , and an individual x j is ran- bdomly selected from EP − EP with a probability Pc , or an individual x j is selected from EP with a probability 1 − Pc . 45. Anew y is generated by crossover operation from x i and x j .
Processes 2021 , 9 , 274
11of 24
Algorithm 1 Cont. 46.
Mutation operation is applied to y with probability Pm to generate a new y .
47.
endfor
48. Update EP : select a new non-dominated set from EP and the new population as the new
EP 49. 50. 51. 52.
if the stopping criterion is not satisfied
Continue.
else
Stop and output EP .
53. end if 54. endwhile
The weight vectors can determine the quality of solution obtained by MOEA/DTL. With the uniformly distributed weight vectors, the solution obtained by MOEA/DTL is more evenly distributed and closer to the Pareto optimal solution. Thus, the method of gen- erating some weight vectors with even distribution is of great importance to MOEA/DTL. In this study, a number of weight vectors are generated as follows: Step (1) Set γ = γ 1 , γ 2 , . . . , γ N + 1 ,where γ i = γ i 1 , γ i 2 For each i = 0 to N , do: γ i 1 = i N , γ i 2 = 1 − i N . Step (2) Generate weight vectors λ = λ 1 , λ 2 , . . . , λ N by randomly selecting N vectors from γ . The parameter Ps is one of the important factors affecting the convergence speed of the algorithm. If Ps is too small, it means that most of the teachers are from the global optimal individual, and it is easy to fall into the local optimal value. If Ps is too large, it means that most of the teachers come from the best individuals in the neighborhood, and the convergence speed will be slower. The value of Ps between 0.7 and 0.9 is reasonable. The decomposition approach is also important for MOEA/DTL. The makespan and the energy cost are converted into an objective using the weighted sum approach. The makespan and the energy cost are the two different scalar objectives. Therefore, the decomposition method must have the function of normalization. The decomposition approach is as below:
j × f j x f max j
j
i − f min min j
λ i
m ∑ j = 1
g i =
(27)
− f
where g i is the scalar optimization objective of solution x i , f max j
is the maximum of the j -th
objective, and f min j
is the minimum of the j -th objective.
3.2. Variable Neighborhood Search With the advantages of high efficiency and simple implementation, the Variable Neighborhood Search (VNS) algorithm has been successfully applied in many engineering fields [29,30]. The VNS algorithm uses the neighborhood structure of different actions to search alternately, thus achieving a good balance between concentration and evacuation. Firstly, the VNS is carried out in a small neighborhood. If the quality of the solution cannot be improved, VNS will be carried out in a larger neighborhood. When a better solution is found, the VNS is conducted in a smaller neighborhood again. The cycle is repeated until the end of the algorithm. The VNS algorithm is simple in principle, easy to implement, and has good optimization performance. The procedure of the VNS algorithm used in this paper is shown in Algorithm 2:
Processes 2021 , 9 , 274
12of 24
Algorithm 2 VNS 1. Construct the set of neighborhood structures S i , i = 1,2,3. 2. Set the maximum iterations M for searching in the first, second, and third neighborhood
structures M 1, M 2, M 3. 3. Set the initial solution. 4. for each i ∈ [ 1,2, . . . , M ] do 5.
for each j ∈ [ 1,2, . . . , M 1 ] do
6. Based on the current solution, the first neighborhood structure S 1 is used to search for better solutions than the current solution, and it means that the solutions found can dominate the current solution. 7. endfor 8. for each j ∈ [ 1,2, . . . , M 2 ] do 9. Based on the current solution, the second neighborhood structure S 2 is used to search for better solutions than the current solution, and it means that the solutions found can dominate the current solution. 10. endfor 11. for each j ∈ [ 1,2, . . . , M 3 ] do 12. Based on the current solution, the third neighborhood structures S 3 is used to search for better solutions than the current solution, and it means that the solutions found can dominate the current solution. 13. endfor 14. If the stopping criteria are not satisfied, continue; otherwise, stop and output the best solution. 15. endfor The core of the VNS algorithm lies in the design of neighborhood structure set. In the production scheduling, the neighborhood structure of VNS can be obtained by exchang- ing the order of two jobs or inserting one job before another. This study designs three neighborhood structures, which are S 1 , S 2 , and S 3 . The neighborhood solutions of S 1 are generated as follows: select two jobs randomly and exchange their positions to generate a new neighborhood solution. The neighborhood solutions of S 2 are generated as follows: select three jobs randomly and then disrupt their order to generate five new neighborhood solutions. The neighborhood solutions of S 3 are generated as follows: select four jobs randomly and then disrupt their order to generate 23 new neighborhood solutions. The parameters M , M1 , M2 , and M3 affect the search range. A large value means a large search range, but at the same time, it reduces the operating efficiency of the algorithm. On the contrary, the operating efficiency of the algorithm will improve, but it means that the search range becomes smaller. In order to balance the two, it is reasonable to set their value within10. 3.3. IMOEA/DTL Despite the outstanding global search capability of MOEA/DTL, it is likely to miss the locally better solution because MOEA/DTL does not search the neighborhood of the solution in detail in each iteration process. The MOEA/DTL is combined with VNS (IMOEA/DTL) to enhance its local search ability and performance. In IMOEA/DTL, the solution obtained in each iteration of MOEA/DTL is searched locally using the VNS algorithm to find a better solution. This study carries out VNS after the first update of EP , and VNS is carried out as Algorithm 3.
Algorithm 3 Combination method of VNS and MOEA/DTL 1. for each i ∈ [ 1,2, . . . , N ] do 2. nex _ x i = VNS x i 3. endfor 4. Output the new population.
Processes 2021 , 9 , 274
13of 24
4. Case Study In order to demonstrate the feasibility of the energy-efficiency scheduling model under TOU electricity tariffs for tissue paper mills and the superiority of the proposed IMOEA/DTL, three popular multi-objective optimization algorithms, namely, MOEA/D- MR [31], Non-dominated Sorting Genetic Algorithm II (NSGA-II), and Strength Pareto Evolutionary Algorithm 2 (SPEA2), are compared with the IMOEA/DTL in eight schedul- ing problems. The energy-saving potential of the IMOEA/DTL is evaluated by comparing IMOEA/DTL with workers in practice. The whole experiments are implemented in MAT- LAB2015b. 4.1. Experiment Data The data are collected from a tissue paper mill in Guangdong, China. The data are collected from the Jiangmen branch of Vinda Paper (China) Co., Ltd., Jiangmen City, Guang- dong Province, China. The data collection time is from 2017 to 2018. The scheduling data and product process data are mainly collected from the production scheduling department. These data come from the enterprise resource planning system. Machine data and energy consumption data are automatically collected by the manufacturing execution system. There are six production lines in the pulping and papermaking stage and seven production lines in the conversion stage. A total of 16 scheduling instances are generated randomly, the numbers and names of jobs in each scheduling problem are listed in Table 2. In each scheduling problem, the size of each job is generated randomly and obeys uniform distri- bution in the range of [10,000, 600,000]. In the tissue paper mill, the speed of the production line varies with the type of products, but each production line has a maximum speed. The maximum speeds in the pulping and papermaking stage and the conversion stage are shown as Table 3. Similarly, the power of each production line also varies with the product type. The maximum power of the pulping and papermaking stage and the conversion stage is shown Table 4. The setup energy consumption is dependent on the setup time and the setup power. In this study, the setup time of the pulping and papermaking stage and the conversion stage is randomly generated based on the real situation. The setup time of the pulping and papermaking stage shows uniform distribution in the range of [10, 100], while the setup time of the conversion stage shows uniform distribution in the range of [10, 60]. Table 5 lists the setup power of the pulping and papermaking stage and the conversion stage. The transportation energy consumption is related to the distance between production lines. The transportation energy consumption per unit product is shown in Table 6.
Table2. The name and number of jobs of 16 scheduling problems.
Problems
JobNumber
Job1 Job2 Job3 Job4 Job5 Job6 Job7 Job8 Job9
50 60 70 80 90
100 110 120 130 140 150 160 170 180 190 200
Job10 Job11 Job12 Job13 Job14 Job15 Job16
Processes 2021 , 9 , 274
14of 24
Table3. The maximum speed of the production line in the pulping and papermaking stage and the converting stage.
Pulping and Papermaking Stage
Speed (m/min)
Converting Stage
Speed (bag/min)
PL1 PL2 PL3 PL4 PL5 PL6
990 950
BL1 BL2 BL3 BL4 BL5 BL6 BL7
260 320 330 325 335 360 400
1010
970
1050 1110
Table4. The maximum power of the production line in the pulping and papermaking stage and the converting stage.
Pulping and Papermaking Stage
Power (kW)
Converting Stage
Power (kW)
PL1 PL2 PL3 PL4 PL5 PL6
1210 1280 1380 1470 1330 1490
BL1 BL2 BL3 BL4 BL5 BL6 BL7
130 145 148 120 138 135 137
Table 5. The setup power of the production line in the pulping and papermaking stage and the converting stage.
Pulping and Papermaking Stage
Power (kW)
Converting Stage
Power (kW)
PL1 PL2 PL3 PL4 PL5 PL6
813 821 878 902 870 922
BL1 BL2 BL3 BL4 BL5 BL6 BL7
82 97 70 87 91 88
104
Table6. The transportation energy consumptions per unit product (kW).
BL1
BL2
BL3
BL4
BL5
BL6
BL7
PL1 PL2 PL3 PL4 PL5 PL6
4 5
6 3
16 15
17 16
18 19
20 23 19 15
24 25 21 16
16 17 26 27
18 15 27 26
3 5
4 2
6 3
22 23
20 21
17 18
4 3
3 5
4.2. Performance Metrics The performance of the IMOEA/DTL, MOEA/D-MR, NSGA-II, and SPEA2 is evalu- ated using two metrics, which are Hypervolume indicator ( HV -metric) and Set Coverage ( C -metric). C -metric reflects the dominance between two non-dominated solution sets. A and B represent two non-dominated solutions, C ( A , B ) can be defined as the proportion of
Processes 2021 , 9 , 274
15of 24
solutions in B that are dominated by at least one solution in A . The formulation of C ( A , B ) is shown as follows. C ( A , B )= |{ b ∈ B | a ∈ A : a b }| | B | (28) The C ( A , B ) equal to one means that all solutions in B are dominated by some solutions in A . Meanwhile, C ( A , B ) equal to zero means there is no solution in B dominated by the solutions in A . When C ( A , B ) is greater than C ( B , A ) , then the quality of the solution A is better than that of B . The HV -metric of a non-dominated set can be represented by the size of portion of objective space that is dominated by those solutions collectively and bounded above by a reference point. The HV -metric can not only assess the proximity of the non-dominated set but also can assess the diversity of the non-dominated set. The HV -metric needs to be given a reference point, where we use the maximum value of the solutions obtained by all algorithms. When the HV -metric has a larger value, the approximate non-dominated solution set is better. Moreover, considering the randomness of the evolutionary algorithm, this study carries out the Wilcoxon signed-rank test to detect whether the results obtained by different algorithms are different significantly. The significance level is 0.05. A p -value of the Wilcoxon signed-rank test less than 0.05 indicates significant differences between the two algorithms. 4.3. Parameters Setting Table 7 summarizes the parameters of IMOEA/DTL, MOEA/D-MR, SPEA2, and NSGA-II. The population size and the maximum iterations are set as the same value to compare the performance of IMOEA/DTL, MOEA/D-MR, SPEA2, and NSGA-II. The parameters of NSGA-II, SPEA2, and MOEA/D-MR are set based on some literature and the trial and error method [31–35]. Moreover, considering the randomness of the evolutionary algorithm, three algorithms are run ten times for each scheduling problem, and the result is the average of ten times. Table 7. Parameters setting of MOEA/D-MR, Strength Pareto Evolutionary Algorithm 2 (SPEA2), Non-dominated Sorting Genetic Algorithm II (NSGA-II), and MOEA/DTL by Variable Neighborhood Search (IMOEA/DTL).
MOEA/D-MR
SPEA2
NSGA-II
IMOEA/DTL N : 100 Mt : 100 Size of EP: 100 T: 10 Ps: 0.7 Pm: 0.3 Pc: 0.7 M: 5 M1: 10
N : 100 Mt : 100 F: 0.5 CR: 0.2 H: 99 Tm: 10 Tr: 10
N : 100 Size of archive: 100 Mt : 100 Pc: 0.8 Pm: 0.2
N : 100 Mt : 100 Pc: 0.8 Pm: 0.2
M2: 5 M3: 3
4.4. Results and Discussion Table 8 describes the mean C -metric of the solutions obtained by IMOEA/DTL, MOEA/D-MR, SPEA2, and NSGA-II. W, X, Y, and Z represent the solutions obtained by MOEA/D-MR, NSGA-II, SPEA2, and IMOEA/DTL, respectively. From Table 8, it can be seen that C ( Z , W ) is larger than C ( W , Z ) , C ( Z , X ) is larger than C ( X , Z ) , and C ( Z , Y ) is larger than C ( Y , Z ) in 16 scheduling problems. The values of C ( Z , W ) , C ( Z , X ) and C ( Z , Y ) are close to one in the eight scheduling problems. Meanwhile, the values of C ( W , Z ) , C ( X , Z ) , and C ( Y , Z ) are almost equal to zero. The C -metric indicates that other
Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Page 8 Page 9 Page 10 Page 11 Page 12 Page 13 Page 14 Page 15 Page 16 Page 17 Page 18 Page 19 Page 20 Page 21 Page 22 Page 23 Page 24 Page 25 Page 26 Page 27 Page 28 Page 29 Page 30 Page 31 Page 32 Page 33 Page 34 Page 35 Page 36 Page 37 Page 38 Page 39 Page 40 Page 41 Page 42 Page 43 Page 44 Page 45 Page 46 Page 47 Page 48 Page 49 Page 50 Page 51 Page 52 Page 53 Page 54 Page 55 Page 56 Page 57 Page 58 Page 59 Page 60 Page 61 Page 62 Page 63 Page 64 Page 65 Page 66 Page 67 Page 68 Page 69 Page 70 Page 71 Page 72 Page 73 Page 74 Page 75 Page 76 Page 77 Page 78 Page 79 Page 80 Page 81 Page 82 Page 83 Page 84 Page 85 Page 86 Page 87 Page 88 Page 89 Page 90 Page 91 Page 92 Page 93 Page 94 Page 95 Page 96 Page 97 Page 98 Page 99 Page 100 Page 101 Page 102 Page 103 Page 104 Page 105 Page 106 Page 107 Page 108 Page 109 Page 110 Page 111 Page 112 Page 113 Page 114 Page 115 Page 116 Page 117 Page 118 Page 119 Page 120 Page 121 Page 122 Page 123 Page 124 Page 125 Page 126 Page 127 Page 128 Page 129 Page 130 Page 131 Page 132 Page 133 Page 134 Page 135 Page 136 Page 137 Page 138 Page 139 Page 140 Page 141 Page 142 Page 143 Page 144 Page 145 Page 146 Page 147 Page 148 Page 149 Page 150 Page 151 Page 152 Page 153 Page 154 Page 155 Page 156 Page 157 Page 158 Page 159 Page 160 Page 161 Page 162 Page 163 Page 164 Page 165 Page 166 Page 167 Page 168 Page 169 Page 170 Page 171 Page 172 Page 173 Page 174 Page 175 Page 176 Page 177 Page 178 Page 179 Page 180 Page 181 Page 182 Page 183 Page 184 Page 185 Page 186 Page 187 Page 188 Page 189 Page 190 Page 191 Page 192 Page 193 Page 194 Page 195 Page 196 Page 197 Page 198 Page 199 Page 200Made with FlippingBook - Online magazine maker