# Optimization Model and Algorithm of Empty Pallets Dispatching under the Time-Space Network of Express Shipment

Authors: Kang Zhou; Shiwei He; Rui Song; Xiaole Guo; Kaiming Li
Journal: Journal of Advanced Transportation
 (2018)

---

## Abstract

Relying on the express freight network, the dispatching of empty pallets based on the pallet pool mode is studied to reuse pallets with the minimum transport cost, enhance the pallet utilization rate, reduce the waste of resources, and save the cost of logistics. Considering the influence of transport efficiency for different modes in transportation process, differences of transportation cost, carbon emissions, and transportation timeliness of demand points required, an optimization model is constructed. The objective of the model is to minimize the total cost including transportation cost, inventory cost, lease cost, and loss cost. According to the structural characteristics of the model, genetic algorithm and improved cloud clonal selection operation is used to solve the model. Finally, the validity and rationality of the optimization model are verified by a case study. The result shows that the total dispatching cost of considering time requirement is 1.8 times the cost without considering the time requirement, respectively, both less than the total cost of pallets leasing. Moreover, when there are 3 supply points and 2 demand points and the number of iterations is 100, after the algorithms are run for 30 times, the worst values are 9305 and 8317 for genetic algorithm and the improved cloud clonal selection operation, respectively. Therefore, the efficiency of the improved cloud clonal selection operation is higher than genetic algorithm.


---

## Body

## 1. Introduction

With the rapid development of logistics technology, express freight transportation service and electronic commerce on a global scale, demand for small-batch, multicategory, and high value-added express freight transportation service grows continually. Traditional mode of load and transportation is replaced by unitized logistics mode gradually. In unitized logistics mode, bulk cargo is loaded as goods unit with integrated packaging apparatuses (refer to devices that assemble goods into a complete, unified volume unit and are structurally convenient for mechanical handling and storage) and fixed by machine. In this mode, the efficiency of cargo handling and transportation can be improved and transportation cost, carbon emission, freight loss, and damage can be reduced. Integrated packaging apparatuses, such as pallets, container cages, and circulation boxes, are widely used in unitized logistics mode for its cheap, efficient, and convenient features.In the efficiency of pallet loading, Zhou et al. [1] (2013) indicated that integrated packaging apparatuses can make cargo handling more convenient, transportation more efficient, and transportation cost lower. Moreover, several studies have been conducted on usage pattern and benefit analysis of integrated packaging apparatuses. Martins and Dell [2] (2008) presented new bounds, heuristics, and an exact algorithm for the pallet loading problem. Raballand and Carroll [3] (2007) presented options for exporters to mitigate the adverse effects of pallet standards multiplicity. Lau et al. [4] (2009) presented a hybrid approach to solve the profit-based multipallet loading problem. In the management and dispatching of pallet, Doungpattra et al. [5] (2012) developed a computer simulation model based on the empirical case to analyze the flow of pallets from the factory, the subcontractors, and the distribution center and to determine the system performance measures. Ray et al. [6] (2006) established cost variable categories for two pallet load systems and simulation modeling of each pallet system was performed. Elia and Gnoni [7] (2015) analyzed pallet management systems and developed a simulation-based tool to support logistic managers to design effective organizational scenarios for pallet management systems. Roy et al. [8] (2016) analyzed the existing industry strategies for managing pallets. Guaman-Siller et al. [9] (2010) revealed two ways, i.e., according to retailers’ level of integration with their suppliers and according to retailers’ managerial orientation toward pallets, to classify retailers with qualitative research methodology. Carrano et al. [10] (2014) presented a prescribed approach for estimating the carbon footprint, or greenhouse gas emissions, which arise across all phases of a pallet life cycle, and quantified the impact of contributing materials, processes, and activities in each phase.One-way transportation and disposable use reduce service efficiency of integrated packaging apparatuses, which also increases transportation cost, wastes vast resources, and is not low-carbon. Therefore, it is necessary to build the integrated packaging apparatuses pool system to share and recycle integrated packaging apparatuses by dispatching them reasonably to improve service efficiency, reduce transportation cost, and resource waste.The volumes of freight transported with integrated packaging apparatuses are unbalanced in different areas, which usually leads to unbalanced distribution of integrated packaging apparatuses. It is necessary to dispatch integrated packaging apparatuses to balance the demand in different areas and reduce resource waste [11]. Few studies have focused on the optimization of dispatching integrated packaging apparatuses. Ren and Zhang [12–14] and Ren et al. [15] introduced the pallet pool system and an improved system was proposed. Besides, stochastic factors in the process of pallet allocation were analyzed and a stochastic programming model was presented. Wu et al. [16] (2016) developed a deterministic model and a multiscenario model to optimally allocate pallets in the certain and uncertain situation, respectively. Tornese et al. [17] (2018) developed an analytical model to quantify the effects of repair facility location and pallet service conditions on a pallet pooling system's economic and environmental performance and developed a simulation model to investigate two common operational policies, cross-docking and take-back, and to quantify the impact of pallet handling and loading conditions and customer network structures on several key performance indicators. In order to frame and model the environmental issues and impacts associated with the management of pallets throughout the entire life cycle, Mazeika-Bilbao et al. [18] (2011) used the space-time network to express physical flow of pallets, manufacture, and end of life. However, the abovementioned researches only optimize delivery and collection of pallets in a small area while transportation mode, demand for different kinds of integrated packaging apparatuses, and time constraint are neglected.Contrary to transporting pallets with special trains which results in high transportation cost, this paper proposes an optimization model to dispatch pallets between service centers based on express freight transportation network. Express freight transportation network optimization has been studied [19]. The differences between railway transportation and highway transportation in freight rates, transportation distance, carbon emission, and damage rate of goods are considered. The objective is to minimize total dispatching cost and time constraint for pallet demand points is considered. An improved cloud clonal selection operation is presented to solve the model and obtain the scheme of dispatching with minimal cost.The structure of the remainder of this paper is as follows: in the second section, the problem that needs to be solved is described and a pallet dispatching model is developed. The topic of the third section is to describe the solution method. Then, in the fourth section, a computational example is described. The paper is concluded in the fifth section.


## 2. Problem Formulation

### 2.1. Problem Description

Express freight transportation time-space network can describe the process of transportation and operation of different transportation modes directly. In this paper, the pallet dispatching network based on highway and railway is considered. For railway transportation, the service network is optimized based on the given wagon flow reorganization plan and marshaling plan, while highway transportation is based on the existing transportation mode and frequency.The decision period is divided into several units to describe the time factors of the dispatching system. In this paper, the decision period is 1 week and one unit is 24 hours, and then the time-space network is shown in Figure1 and “A,” “B,” “C,” and “D” are freight terminals. After the decision period, a super node (a virtual node) is set for each terminal to make it the end point of the transportation arcs which cannot reach the terminal, i.e., Node 8 in Figure 1. The smaller the gap between the super node and the transportation deadline of the demand points is, the smaller the punishment will be.Figure 1
The time-space network of physical network for empty pallet dispatching.The purpose of pallet dispatching is to transport pallets from supply points to demand points with minimal dispatching cost and in reasonable time [20]. If the dispatching cost is higher than leasing cost, pallets should be leased out to the demand points out of the pallet pool system instead of being transported between the supply points and demand points. Moreover, the carbon emission volumes of different transportation modes are different. Therefore, the impact of transportation on environment is considered and carbon emission cost is considered as one term of optimization objective. Furthermore, warehouse cost and damage rate of goods can also influence the dispatching scheme.


### 2.2. Assumptions

Throughout this paper, the following assumptions are made in our model formulation.Assumption 1.
The demand is deterministic and can always be satisfied by dispatching or leasing.Assumption 2.
Each route starts from supply points and ends with demand points. Departure frequencies or marshaling plans of different transportation modes are fixed in the decision period.Assumption 3.
The type of pallet is divided by weight; the same type of pallets with different materials can be regarded as the same pallets.Assumption 4.
The demand time for pallets is not related to the type of pallet.Assumption 5.
Costs cannot change in the decision period.Assumption 6.
During transportation, pallets are considered as goods.


## 2.1. Problem Description

Express freight transportation time-space network can describe the process of transportation and operation of different transportation modes directly. In this paper, the pallet dispatching network based on highway and railway is considered. For railway transportation, the service network is optimized based on the given wagon flow reorganization plan and marshaling plan, while highway transportation is based on the existing transportation mode and frequency.The decision period is divided into several units to describe the time factors of the dispatching system. In this paper, the decision period is 1 week and one unit is 24 hours, and then the time-space network is shown in Figure1 and “A,” “B,” “C,” and “D” are freight terminals. After the decision period, a super node (a virtual node) is set for each terminal to make it the end point of the transportation arcs which cannot reach the terminal, i.e., Node 8 in Figure 1. The smaller the gap between the super node and the transportation deadline of the demand points is, the smaller the punishment will be.Figure 1
The time-space network of physical network for empty pallet dispatching.The purpose of pallet dispatching is to transport pallets from supply points to demand points with minimal dispatching cost and in reasonable time [20]. If the dispatching cost is higher than leasing cost, pallets should be leased out to the demand points out of the pallet pool system instead of being transported between the supply points and demand points. Moreover, the carbon emission volumes of different transportation modes are different. Therefore, the impact of transportation on environment is considered and carbon emission cost is considered as one term of optimization objective. Furthermore, warehouse cost and damage rate of goods can also influence the dispatching scheme.


## 2.2. Assumptions

Throughout this paper, the following assumptions are made in our model formulation.Assumption 1.
The demand is deterministic and can always be satisfied by dispatching or leasing.Assumption 2.
Each route starts from supply points and ends with demand points. Departure frequencies or marshaling plans of different transportation modes are fixed in the decision period.Assumption 3.
The type of pallet is divided by weight; the same type of pallets with different materials can be regarded as the same pallets.Assumption 4.
The demand time for pallets is not related to the type of pallet.Assumption 5.
Costs cannot change in the decision period.Assumption 6.
During transportation, pallets are considered as goods.


## 3. Objectives and Constraints

### 3.1. Objectives

Mathematically, the objective functions are as follows:(1)min⁡C=∑o∈O∑d∈D∑p∈P∑a∈A∑v∈Vγodpδodpaca+βac0gv+ρacvxodpv+∑o∈O∑v∈Vqovcov+∑d∈D∑d∈Drdvcdv(2)min⁡T′=max⁡todpv-ldv,0+max⁡edv-todpv,0.Equation (1) minimizes the total cost including transportation cost, warehouse cost, and leasing cost. O represents the set of supply points, o∈O. The set of demand points is denoted by D,d∈D.P denotes the set of transportation routes with each route p∈P. The set of directed arcs is defined as A=Ar∪Ah, where Ar is the set of transportation arcs and Ah is the set of delay arcs at the points, a∈A. Transportation arcs with two transportation modes are split into two arcs. The set of pallet types is denoted by V,v∈V. The binary variable γodp is introduced, and it equals 1 if and only if pallets are transported from o to d via route p. A binary variable δodpa is used, having value 1 if and only if route p is chosen to transport pallets and arc a is in the route. For each arc a∈A, an arc cost is defined as ca. If a∈Ar,ca is transportation cost of arc a. If a∈Ah,ca is delay cost at the point, i.e., reloading cost or waiting cost. Carbon emission of cargo per unit mass is defined as βa.c0 represents unit carbon emission cost. gv is used to represent mass of a pallet of type v. cv is used to represent unit damage cost of a pallet of type v. ρa is used to represent the damage rate of pallets on arc a. Decision variables xodpv model the number of pallets of type v transported from supply point o to demand point d via route p. Each demand point d is associated with leasing price of pallets of type v which is denoted by cdv and the number of pallets of type v to be leased which is defined as rdv. Analogously, for each supply point o∈O, unit warehouse cost of pallets of type v is defined as cov and the number of pallets of type v in the supply point is defined as qov, qov=sov-∑d∈D∑p∈Pxodpv,∀o∈O,v∈V.Equation (2) indicates that total transportation time should satisfy the demand, which means that T′ should be minimized. The set of unit periods is denoted by T,t∈T. For each demand point d, the expected earliest duration edv is defined and the latest duration is defined as ldv.todpv is defined as the actual transportation duration from supply point o to demand point d via route p and todpv=Tod=n·t.


### 3.2. Constraints

Three types of constraints encountered in a real pallet dispatching problem are considered in the model.(i) Supply constraint is as follows:(3)sov≥∑d∈D∑p∈Pxodpv,∀o∈O,v∈V,where sov represents the number of pallets of type v which can be supplied by supply point o, while ∑d∈D∑p∈Pxodpv represents the total number of pallets of type v supplied by supply point o. Hence, ∑d∈D∑p∈Pxodpv cannot be bigger than sov.(ii) Demand constraint is as follows:(4)∑o∈O∑p∈P∑a∈Axodpv1-ρa+rdv≥ddv,∀d∈D,v∈V,where ddv represents the number of pallets of type v needed by demand point d. ∑o∈O∑p∈P∑a∈Axodpv1-ρa represents the total number of undamaged pallets of type v transported to demand point d via route p. The sum of the total number of undamaged pallets of type v and rdv, i.e., the number of pallets of type v leased by demand point d, cannot be smaller than ddv.(iii) Arc capacity constraint is as follows:(5)wa≥∑o∈O∑d∈D∑p∈P∑v∈Vδodpaxodpv,∀a∈A,where wa represents the capacity of arc a. If a∈Ar,wa represents the maximal transportation capacity of the arc; however, when a∈Ah,wa represents the capacity of points, such as handling capacity and warehouse capacity. The number of pallets transported through arc a in each period cannot exceed wa.


### 3.3. Model Processing

Let functionftodpv denote the penalty cost for pallets of type v that cannot be transported to demand point d on time:(6)ftodpv=max⁡M2vtodpv-ldv,0+max⁡M1vedv-todpv,0,where M1v represents the penalty coefficient for pallets arriving in advance. If early arrival is forbidden, M1v is ∞. M2v is used to represent the penalty coefficient for pallets arriving late. When arriving late is not allowed, M2v is ∞. Extra cost caused by pallets not arriving on time is defined as Ce which should be minimized and calculated by the following:(7)Ce=∑o∈O∑d∈D∑p∈P∑v∈VftodpvxodpvTherefore, the objective function to minimize total cost can be defined as follows:(8)min⁡C′=∑o∈O∑d∈D∑p∈P∑a∈A∑v∈Vγodpδodpaca+βac0gv+ρacvxodpv+∑o∈O∑v∈Vqovcov+∑d∈D∑v∈Vrdvcdv+∑o∈O∑d∈D∑p∈P∑v∈Vftodpvxodpv.


## 3.1. Objectives

Mathematically, the objective functions are as follows:(1)min⁡C=∑o∈O∑d∈D∑p∈P∑a∈A∑v∈Vγodpδodpaca+βac0gv+ρacvxodpv+∑o∈O∑v∈Vqovcov+∑d∈D∑d∈Drdvcdv(2)min⁡T′=max⁡todpv-ldv,0+max⁡edv-todpv,0.Equation (1) minimizes the total cost including transportation cost, warehouse cost, and leasing cost. O represents the set of supply points, o∈O. The set of demand points is denoted by D,d∈D.P denotes the set of transportation routes with each route p∈P. The set of directed arcs is defined as A=Ar∪Ah, where Ar is the set of transportation arcs and Ah is the set of delay arcs at the points, a∈A. Transportation arcs with two transportation modes are split into two arcs. The set of pallet types is denoted by V,v∈V. The binary variable γodp is introduced, and it equals 1 if and only if pallets are transported from o to d via route p. A binary variable δodpa is used, having value 1 if and only if route p is chosen to transport pallets and arc a is in the route. For each arc a∈A, an arc cost is defined as ca. If a∈Ar,ca is transportation cost of arc a. If a∈Ah,ca is delay cost at the point, i.e., reloading cost or waiting cost. Carbon emission of cargo per unit mass is defined as βa.c0 represents unit carbon emission cost. gv is used to represent mass of a pallet of type v. cv is used to represent unit damage cost of a pallet of type v. ρa is used to represent the damage rate of pallets on arc a. Decision variables xodpv model the number of pallets of type v transported from supply point o to demand point d via route p. Each demand point d is associated with leasing price of pallets of type v which is denoted by cdv and the number of pallets of type v to be leased which is defined as rdv. Analogously, for each supply point o∈O, unit warehouse cost of pallets of type v is defined as cov and the number of pallets of type v in the supply point is defined as qov, qov=sov-∑d∈D∑p∈Pxodpv,∀o∈O,v∈V.Equation (2) indicates that total transportation time should satisfy the demand, which means that T′ should be minimized. The set of unit periods is denoted by T,t∈T. For each demand point d, the expected earliest duration edv is defined and the latest duration is defined as ldv.todpv is defined as the actual transportation duration from supply point o to demand point d via route p and todpv=Tod=n·t.


## 3.2. Constraints

Three types of constraints encountered in a real pallet dispatching problem are considered in the model.(i) Supply constraint is as follows:(3)sov≥∑d∈D∑p∈Pxodpv,∀o∈O,v∈V,where sov represents the number of pallets of type v which can be supplied by supply point o, while ∑d∈D∑p∈Pxodpv represents the total number of pallets of type v supplied by supply point o. Hence, ∑d∈D∑p∈Pxodpv cannot be bigger than sov.(ii) Demand constraint is as follows:(4)∑o∈O∑p∈P∑a∈Axodpv1-ρa+rdv≥ddv,∀d∈D,v∈V,where ddv represents the number of pallets of type v needed by demand point d. ∑o∈O∑p∈P∑a∈Axodpv1-ρa represents the total number of undamaged pallets of type v transported to demand point d via route p. The sum of the total number of undamaged pallets of type v and rdv, i.e., the number of pallets of type v leased by demand point d, cannot be smaller than ddv.(iii) Arc capacity constraint is as follows:(5)wa≥∑o∈O∑d∈D∑p∈P∑v∈Vδodpaxodpv,∀a∈A,where wa represents the capacity of arc a. If a∈Ar,wa represents the maximal transportation capacity of the arc; however, when a∈Ah,wa represents the capacity of points, such as handling capacity and warehouse capacity. The number of pallets transported through arc a in each period cannot exceed wa.


## 3.3. Model Processing

Let functionftodpv denote the penalty cost for pallets of type v that cannot be transported to demand point d on time:(6)ftodpv=max⁡M2vtodpv-ldv,0+max⁡M1vedv-todpv,0,where M1v represents the penalty coefficient for pallets arriving in advance. If early arrival is forbidden, M1v is ∞. M2v is used to represent the penalty coefficient for pallets arriving late. When arriving late is not allowed, M2v is ∞. Extra cost caused by pallets not arriving on time is defined as Ce which should be minimized and calculated by the following:(7)Ce=∑o∈O∑d∈D∑p∈P∑v∈VftodpvxodpvTherefore, the objective function to minimize total cost can be defined as follows:(8)min⁡C′=∑o∈O∑d∈D∑p∈P∑a∈A∑v∈Vγodpδodpaca+βac0gv+ρacvxodpv+∑o∈O∑v∈Vqovcov+∑d∈D∑v∈Vrdvcdv+∑o∈O∑d∈D∑p∈P∑v∈Vftodpvxodpv.


## 4. Solution Method

In 1959, clonal selection theory was proposed by Burnet. Clonal selection operation simulates the microevolutionary process in immune system. High-frequency variation is introduced to keep the diversity of the population and multipeaks searching [21, 22]. Clonal selection operation is introduced by Huang in detail [23].In cloud clonal selection operation, stochastic and stabilized cloud model is used to optimize immunity operation in traditional clonal selection operation, which means that crossover and mutation are executed by cloud generator. Cloud model is proposed by Li to perform the uncertain transformation from qualitative concept to quantitative description or otherwise [24]. As the methodology to implement cloud model, cloud generator is the tool to connect quality with quantity and make mapping between qualitative and quantitative concepts. The most common cloud generators include forward cloud generator, backward cloud generator, X condition cloud generator, and Y condition cloud generator [25]. In this paper, Y condition cloud generator is used to perform crossover operator. For Y condition cloud generator, three digital characteristics, i.e., E,E1, and H, and cloud generator with subject degree y=y0 are given. E indicates the center-of-gravity position of cloud drops in number field, reflecting the coordinate of qualitative concept in number field. E1 is the uncertainty measurement of qualitative concept reflecting the number field range which can be accepted by the linguistic value and the probability that those points can represent this linguistic value. H is degree of dispersion of E1 reflecting the cohesion of certainty of the notion that each numeric represents the linguistic value. Moreover, H also reflects condensation degree of cloud drops [26, 27]. As the basis of the uncertain inference based on cloud model, Y condition cloud generator consists of two main stages:(1)
Generate normal random numberE1′ with expectance E1 and standard deviation H.(2)
Obtain cloud drops according toQc=E±-2ln⁡μE1′, where μ represents certainty degree.Improved cloud clonal selection operation can generate different digital characteristics to control algorithm parameters according to affinities in different stage. At the beginning of the algorithm, the digital characteristics are bigger to update the population with a high probability. The digital characteristics are smaller to preserve excellent individuals and quicken constringency in the later period of the optimization. The algorithm can keep the diversity of the population and guarantee powerful ability of both global search and local search. Binary coding method is adopted for antibody of which the length is the number of routes which can be chosen between supply points and demand points. If one route is chosen, the corresponding gene will be 1. Initial antibodies are generated randomly. The algorithm flowchart is presented in Figure2.Figure 2
Flowchart of cloud clonal selection operation.


### 4.1. Clone

Clone populationA to obtain population A′ is as follows:(9)A′=a1′,a2′,⋯,am′T,where ai′=Ii×ai, i=1,2,⋯,m, and Ii is a qi-dimensional row vector with all elements 1, which is called qi-clone for antibody ai. Clone scale for ai should be adjusted based on the affinities of ai to antigens and the similarities between ai and other antibodies. The clone scale is calculated according to the following formulation:(10)qi=ncfai∑j=1mfajφi,i=1,2,⋯,m,where ∙ is a function to round up the input to an integer. nc indicates a fixed value related to clone scale and nc>m. f(ai) represents the affinity of ai to antigens. φi is the similarity of ai to other antibodies and its value can be obtained by the following:(11)φi=min⁡exp⁡ai-aj,i≠j;i,j=1,2,⋯,m,where · indicates Euclidean distance after unitization processing; therefore, 0≤·≤1. Obviously, the smaller the antibodies are, the more similar they will be and the stronger the inhibition will be, and, hence, the smaller φi will be.


### 4.2. Immunity Operation

Immunity operation consists of two stages, i.e., crossover and mutation. Cloud model is used to update antibodies for its randomness and stability [28].


#### 4.2.1. Crossover

Antibodyai′ can be crossed with antibody aj′ as follows.Step 1.
Certainty degreeμ is obtained according to the following:(12)μ=μmax-fmax-fai′fmax-fminμmax-μmin.Step 2.
ExpectanceE is generated by the following:(13)E=fai′fai′+faj′ai′+faj′faj′+faj′aj′.Step 3.
EntropyE1 is generated by the following:(14)E1=Search  range  of  variablesk1.Step 4.
HyperentropyH is generated by the following:(15)H=E1k2.Step 5.
Child antibodiesx1 and x2 are generated by Y condition cloud generator.Step 6.
Compare the affinities ofx1 and x2 and replace ai′ with the child antibody of which the affinity is bigger.
After crossover, populationA′ is updated to(16)A′′=a1′′,a2′′,⋯,am′′T.


#### 4.2.2. Mutation

For antibodyai′′, mutation can be executed as follows.Step 1.
SetE to the original antibody.Step 2.
E 1 is generated according to the following:(17)E1=Search  range  of  variablesk3.Step 3.
H is generated by the following:(18)H=E1k4,where k1~k4 are control coefficients.Step 4.
Cloud dropx,μ is generated with basic cloud generator. Then, random number Te is generated and the antibody is updated if μ>Te.
After mutation, populationA′′ is updated to(19)A′′′=a1′′′,a2′′′,⋯,am′′′T.


#### 4.2.3. Clone Selection Operation

Clone selection operation is to select excellent individuals from offspring obtained by antibodies’ clone operation to form a new population [29]. In clone selection operation, parents and offspring are mixed and then individuals with the biggest affinities are selected as the next population to avoid algorithm degradation.


## 4.1. Clone

Clone populationA to obtain population A′ is as follows:(9)A′=a1′,a2′,⋯,am′T,where ai′=Ii×ai, i=1,2,⋯,m, and Ii is a qi-dimensional row vector with all elements 1, which is called qi-clone for antibody ai. Clone scale for ai should be adjusted based on the affinities of ai to antigens and the similarities between ai and other antibodies. The clone scale is calculated according to the following formulation:(10)qi=ncfai∑j=1mfajφi,i=1,2,⋯,m,where ∙ is a function to round up the input to an integer. nc indicates a fixed value related to clone scale and nc>m. f(ai) represents the affinity of ai to antigens. φi is the similarity of ai to other antibodies and its value can be obtained by the following:(11)φi=min⁡exp⁡ai-aj,i≠j;i,j=1,2,⋯,m,where · indicates Euclidean distance after unitization processing; therefore, 0≤·≤1. Obviously, the smaller the antibodies are, the more similar they will be and the stronger the inhibition will be, and, hence, the smaller φi will be.


## 4.2. Immunity Operation

Immunity operation consists of two stages, i.e., crossover and mutation. Cloud model is used to update antibodies for its randomness and stability [28].


### 4.2.1. Crossover

Antibodyai′ can be crossed with antibody aj′ as follows.Step 1.
Certainty degreeμ is obtained according to the following:(12)μ=μmax-fmax-fai′fmax-fminμmax-μmin.Step 2.
ExpectanceE is generated by the following:(13)E=fai′fai′+faj′ai′+faj′faj′+faj′aj′.Step 3.
EntropyE1 is generated by the following:(14)E1=Search  range  of  variablesk1.Step 4.
HyperentropyH is generated by the following:(15)H=E1k2.Step 5.
Child antibodiesx1 and x2 are generated by Y condition cloud generator.Step 6.
Compare the affinities ofx1 and x2 and replace ai′ with the child antibody of which the affinity is bigger.
After crossover, populationA′ is updated to(16)A′′=a1′′,a2′′,⋯,am′′T.


### 4.2.2. Mutation

For antibodyai′′, mutation can be executed as follows.Step 1.
SetE to the original antibody.Step 2.
E 1 is generated according to the following:(17)E1=Search  range  of  variablesk3.Step 3.
H is generated by the following:(18)H=E1k4,where k1~k4 are control coefficients.Step 4.
Cloud dropx,μ is generated with basic cloud generator. Then, random number Te is generated and the antibody is updated if μ>Te.
After mutation, populationA′′ is updated to(19)A′′′=a1′′′,a2′′′,⋯,am′′′T.


### 4.2.3. Clone Selection Operation

Clone selection operation is to select excellent individuals from offspring obtained by antibodies’ clone operation to form a new population [29]. In clone selection operation, parents and offspring are mixed and then individuals with the biggest affinities are selected as the next population to avoid algorithm degradation.


## 4.2.1. Crossover

Antibodyai′ can be crossed with antibody aj′ as follows.Step 1.
Certainty degreeμ is obtained according to the following:(12)μ=μmax-fmax-fai′fmax-fminμmax-μmin.Step 2.
ExpectanceE is generated by the following:(13)E=fai′fai′+faj′ai′+faj′faj′+faj′aj′.Step 3.
EntropyE1 is generated by the following:(14)E1=Search  range  of  variablesk1.Step 4.
HyperentropyH is generated by the following:(15)H=E1k2.Step 5.
Child antibodiesx1 and x2 are generated by Y condition cloud generator.Step 6.
Compare the affinities ofx1 and x2 and replace ai′ with the child antibody of which the affinity is bigger.
After crossover, populationA′ is updated to(16)A′′=a1′′,a2′′,⋯,am′′T.


## 4.2.2. Mutation

For antibodyai′′, mutation can be executed as follows.Step 1.
SetE to the original antibody.Step 2.
E 1 is generated according to the following:(17)E1=Search  range  of  variablesk3.Step 3.
H is generated by the following:(18)H=E1k4,where k1~k4 are control coefficients.Step 4.
Cloud dropx,μ is generated with basic cloud generator. Then, random number Te is generated and the antibody is updated if μ>Te.
After mutation, populationA′′ is updated to(19)A′′′=a1′′′,a2′′′,⋯,am′′′T.


## 4.2.3. Clone Selection Operation

Clone selection operation is to select excellent individuals from offspring obtained by antibodies’ clone operation to form a new population [29]. In clone selection operation, parents and offspring are mixed and then individuals with the biggest affinities are selected as the next population to avoid algorithm degradation.


## 5. Computational Example

One pallet pool system includes 3 supply points (o1, o2, and o3), 2 demand points (d1 and d2), and 5 transfer points (n1~n5). There are 3 commonly used types of pallets (v1, v2, and v3) and the masses of the 3 types of pallets are 20kg, 18kg, and 15kg, respectively. Relevant data were obtained via questionnaires and interviews. The supplies and demands are shown in Table 1. The transport prices and carbon emissions are presented in Table 2. The departure frequencies and routes are presented in Figure 3. Decision period is 1 week and unit period is 24h.Table 1
Parameters of supply and demand.
Pallets  type Leasing price ($) Supply point Storage cost in decision period ($/t) Supply Demand  point Demand Transport time requirement (d) The shortest time The longest time v 1 1.2 o 1 0.29 5 020 d 1 1 046 5 7 o 2 0.28 3 200 o 3 0.22 2 480 d 2 3 089 4 7  v 2 1 o 1 0.29 3 610 d 1 743 5 6 o 2 0.28 4 900 o 3 0.22 1 210 d 2 1 615 4 6  v 3 1.3 o 1 0.29 2 600 d 1 1 615 5 7 o 2 0.28 4 260 o 3 0.22 1 100 d 2 862 4 7Table 2
Related parameters of two transport modes.
Transportation mode Highway Railway Transport prices per kilometer ($/t) 0.07 0.01 Carbon emissions per kilometer (kg/t) 0.0796 0.028Figure 3
The initial time-space network of transportation.The data of carbon emission are obtained according to the revision of the German Railway 2008 annual environmental report on CO2 emission statistics.In this paper, the penalty coefficient of additional cost caused by early arrival of pallets is unit warehouse cost, while the penalty of additional cost caused by delay of pallets is unit pallet leasing cost. The damage rate of pallets is defined asρa which is 0.4% if pallets are transported in highway and 0.3% if pallets are transported in railway and 0.5% when pallets are transferred. The transport cost of the arcs of which the end points are the super node is ∞. Reloading cost is $3.2 per ton.The other correlative parameters arec1=6,c2=10,c3=6,c4=10, μmax=0.9, and μmin=0.2 and the number of iterations is 100. Both improved cloud clonal selection operation and genetic algorithm are implemented in MATLAB to solve the problem, respectively.The improved cloud clonal selection operation and genetic algorithm are repeated 30 times [30]. The dispatching schemes with and without consideration of time limit are obtained, which are shown in Scheme 1 (see Table 3) and Scheme 2 (see Table 4 and Figure 4), respectively. For Scheme 2, the efficiency of the two algorithms is presented in Table 5 and Figure 5. It can be observed that the two algorithms can obtain the same result as ILOG CPLEX. However, when the size of the problem is too large, it is too long for ILOG CPLEX to obtain the optimal solution.Table 3
Dispatching scheme 1.
Demand  point Transport route Dispatching amount Leasing  amount Objective ($) d 1 o 1-d1:  a1-a2-a3-a4-a5 1004, 722, 520 0 3821 o 2-d1: a7 46, 23, 1100 o 3-d1: no dispatching 0, 0, 0 d 2 o 1-d2: no dispatching 0, 0, 0 0 o 2-d2: a8-a9-a10 863, 950, 287 o 3-d2:  a15;  a16-a17-a18;  a19-a20-a21-a22 2237, 670, 578Table 4
Dispatching scheme 2.
Demand  point Transport route Dispatching amount Leasing  amount Objective ($) d 1 o 1-d1: a6-a4-a5 1050, 0, 866 0 6988 o 2-d1: no dispatching 0, 0, 0 o 3-d1: a11 0, 746, 756 d 2 o 1-d2: no dispatching 0, 0, 0 1956 o 2-d2: a8-a9-a10 1066, 505, 529 o 3-d2: a16-a17-a18;  a19-a20-a21-a22 826, 360, 336Table 5
Comparison of optimization results for two methods.
Algorithms Running  time (s) Best iteration number Average iteration number Best value Worst  value ICCSO 25 14 32 6988 8317 GA 103 24 56 6988 9305Figure 4
The optimized time-space network of the empty pallet dispatching.Figure 5
Convergence effect of two algorithms.All demand points can be satisfied by dispatching without considering time limit and the total dispatching cost is $3821. If time limit is considered, some routes will change. For example, the route betweeno1 andd1 will change froma1-a2-a3-a4-a5 toa6-a4-a5. New routes will be generated because some demand points are satisfied by leasing instead of dispatching. Total penalty cost will increase to $6988; it is more than 1.8 times the cost of ignoring time requirements, because leasing cost is higher than dispatching cost and time penalty cost is considered. If all demand points are satisfied by leasing, total leasing cost will be $10499; this is more than 1.5 times the result of optimization. Therefore, dispatching pallets within time limit can improve the use ratio of pallets and reduce leasing cost. This can effectively reduce the cost of enterprises and improve economic benefits.In addition, the two algorithms have almost the same accuracy and can both obtain the optimal solution. Improved cloud clonal selection operation performance is better than genetic algorithm in terms of run time, the number of iterations, and convergence effect. As shown in Table5, the shortest run times of genetic algorithm and improved cloud clonal selection operation are 103s and 25s, respectively. Hence, the better solution can be obtained by improved cloud clonal selection operation. Figure 5 illustrates the convergence process of the two algorithms.


## 6. Concluding Remarks

The main contributions and future work can be summarized as follows.(1) The pallet dispatching problem is analyzed based on time-space network and reasonable routes to dispatch pallets are selected without changing the departure plans.(2) Related factors which influence pallet dispatching are analyzed and a model with correlative constraints and objective that is to minimize dispatching cost is proposed. Improved cloud clonal selection operation and genetic algorithm are adopted to solve the model. Finally, a computational example is used to verify the feasibility of the model and the efficiency of the algorithm and provide the basis for solving large-scale problems.(3) Based on existing express service, generating pallets dispatching scheme by optimization is practical and can illustrate the benefit of pallets dispatching. The computational example shows that the model and algorithm have good practical value in the optimization of pallet dispatching. From the calculation results, it is not difficult to find that the pallet dispatching optimization has obvious economic and social benefits.(4) The model and algorithm are also applicable to the dispatching of similar packaging apparatuses. Therefore, this paper can provide theoretical guidance for dispatching integrated packaging apparatuses.(5) In the process of dispatching pallet, there are many uncertainties factors, such as demand uncertainty and damage rate uncertainty, which should be studied in the future.(6) In addition, the sensitivity analysis of model parameters and the application of the model in more large-scale data need to be further studied.



---

*Source: 1897936-2018-11-13.xml*