# An Empirical Study for Green Transportation Scheme of Municipal Solid Waste Based on Complex Data Model Analysis

Authors: Chunlin Xin; Lingjie Wang; Bin Liu; Yu-Hsi Yuan; Sang-Bing Tsai
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

Solid waste management and air pollution are two pressing issues in the functioning of large cities. This paper studies the optimization problem of the green transportation route of municipal solid waste and establishes a mathematical planning model based on real-time traffic conditions of the city and consideration of a time window and multiple transfer stations with the goal of minimizing energy consumption. In the optimal green transportation process in this paper, comprehensive consideration of vehicle speed, vehicle load, road gradient, and driving distance in different road sections based on real-time traffic conditions is incorporated, which has a better fuel-saving potential than the shortest path. A green transportation program can alleviate the air pollution problem in big cities and promote energy conservation and emission reduction in solid waste transportation.


---

## Body

## 1. Introduction

With the development of the economy and the rise in the level of urbanization, the amount of municipal solid waste (MSW) is increasing day by day. We estimated that by 2030, the amount of MSW in China will reach 409 million tons, and the solid waste issue will be serious. The MSW treatment system includes collection, transportation, transfer, and final treatment. The cost of the transportation link accounts for 60%–80% of the total treatment cost [1]. Solid waste collection and transportation are limited by the load and capacity of vehicles, and these factors have a significant impact on the optimization of solid waste transportation routes. Since the turn of the century, energy and environmental issues have become hot topics globally. Carbon dioxide is one of the main sources of greenhouse gases, and the transportation industry, as the second most energy-intensive industry, accounts for 20% of the global emissions owing to its exhaust emissions [2]. Fuel consumption accounts for about 33% of the entire society’s total consumption, which makes the implementation of green transportation an inevitable trend for energy conservation, emission reduction, and air protection [3]. Therefore, it is of significance to study the optimization problem of green transportation routes of domestic waste with capacity limitation to reduce the treatment cost.


### 1.1. Capacitated Vehicle Routing Problem (CVRP)

The Vehicle Routing Problem (VRP) is a typical NP-hard problem. Based on different constraints, these problems can be divided into several categories, the most classic of which is the CVRP, also known as the classic VRP problem. CVRP refers to the capacitated vehicle routing problem, and it sets the capacitated constraint for the vehicle. Many scholars have conducted research on this and set relevant constraints and studied different types of CVRPs [4]. Aiming at the minimum driving distance of vehicles, Faiza [5] developed a decision support system with an integrated taboo search module to solve the CVRP problem and applied it to a food delivery company on Janduba Island in northwestern Tunisia. It was verified that the central processing unit running time of the decision support system was short. Hannan [6] proposed an improved particle swarm optimization algorithm based on the CVRP, which introduced a dataset with different threshold waste levels and scheduling concepts, and determined the best waste collection and route optimization solutions. Wang [7] studied the problem of vehicle routing with a capacity restriction. By establishing a mathematical model and using genetic algorithms (GAs) to plan the paths of logistics vehicles, the lowest logistics and transportation costs were obtained. Ali [8] proposed a new hybrid algorithm based on gravitational simulation local search and a GA to solve the CVRP problem with the goal of minimum travel distance. The experimental results showed that the algorithm is efficient and can obtain a better solution than many other alternatives.


### 1.2. Green Transportation

Green transportation refers to transportation characterized by saving energy and reducing exhaust emissions. It takes environmental factors into consideration. The green vehicle routing problem has been studied by a large number of scholars since 2006 [9]. Ghannadpour [10] set minimum energy consumption as one of the optimization objectives when optimizing the vehicle route, considered the distance and load factors, and solved optimal route planning by using a hybrid genetic algorithm. Demir [11] studied the double-objective pollution path problem aimed at minimizing fuel consumption and travel time, and proposed an adaptive large neighborhood search algorithm, combined with a speed optimization procedure, to solve the bi-objective Pollution-Routing Problem. Mohammad [12] introduced a green vehicle routing system, established a fuel consumption model, and achieved energy saving and emission reduction. Yoshi-nori [13] established a model with the objective function of minimizing energy consumption and carbon emissions and solved it using a multi-objective heuristic algorithm. Xiao [14] and other scholars proposed a model for calculating fuel consumption that posited a linear relationship between load and distance and fuel consumption. This model has been widely adopted.There are few studies that consider energy consumption in the optimization of the transportation route of MSW. In studies, scholars have focused on different factors that affect fuel consumption. Some scholars hold that the emissions from solid waste collection vehicles are proportional only to the route distance, and therefore, a route optimization model aiming at the shortest distance is justified. However, the influence of other factors on fuel consumption is not considered [15]. Zsigraiova [16] pursued minimization of labor cost, fuel cost, and maintenance cost as the goal, and conducted sensitivity analysis with different loading weights in different roads as variables. It was demonstrated that the change of load has substantial influence on fuel consumption during transportation, but no specific path optimization was carried out. Tavares [17] set the objective as minimizing fuel consumption, considered the influence of road slope and vehicle load, and optimized the route by using geographic information system 3D route modeling. Compared with the shortest route, the proposed route reduced fuel consumption by 52%, but this study did not report a specific formula for calculating fuel consumption. In the following year, Tavares used the COPERT model to calculate fuel consumption and considered the relationship between speed, load, slope, and fuel consumption. However, the author used constant speed to calculate and did not consider that the speed is dynamically changing in different sections in reality.In addition to this summary of the research on transportation of MSW from the two dimensions of route optimization and green transportation, a literature review is tabulated in Table1.Table 1
Comparison of the related literature.
SubjectCruise constraintInfluencing factors of oil consumptionDistanceLoadSlopeVariable speedApaydin, Omer; Gonullu, M. Talha (2008)✓Li, Cheng ZhiZhang, Yan Liu, Zhi Hui Meng, Xian Yong, Du, Jing (2014)✓Zsigraiova, Zdena Semiao, Viriato Beijoco, Filipa (2013)✓✓✓Tavares, G. Zsigraiova, Z.Semiao, V. Carvalho, M. G. (2009)✓✓✓Jin Li, Danping Wang, Jianghua Zhang (2018)✓✓✓HE Dongdong, Li Yinzhen (2018)✓✓Analysis of a green transportation scheme of municipal solid waste based on traffic big data✓✓✓✓✓We can note two shortcomings in the existing research on solid waste transportation:(1)
The solid waste transportation route problem is described as a simple vehicle route problem. After the vehicle leaves from a service point, it stops work only after completing one service. Without considering the fact that the vehicle may continue to work at the next collection point after emptying at the transfer station because it does not reach the maximum working time, the vehicle can cruise many times during service hours and working hours, thus improving the utilization rate of the vehicle and the collection and transportation efficiency of the whole solid waste collection and transportation system.(2)
The factors affecting fuel consumption can be divided into two categories: one is the factors unrelated to the vehicle path, such as vehicle model, engine displacement, and performance. The other is the factors closely related to vehicle routes, such as vehicle driving distances, road slopes, driving speeds, and different vehicle loads on different routes. In the green solid waste collection and transportation system, the parameters of the solid waste vehicle are fixed, mainly because the vehicle path factor in the transportation process has a major impact on the transportation cost. For the calculation of energy consumption, the distance is often taken as a single influencing factor without considering the joint influence of multiple factors such as distance, speed, load, and road slope. In route selection, the speed is often set to a fixed value, which ignores the reality that the vehicle is driving at a variable speed. The real-life transportation network is time-varying, change of speed is inevitable, and fuel consumption of vehicles is affected by changing speed.Traffic big data have applications in solid waste collection and transportation. Urban traffic big data integrate and process road information, vehicle GPS information, and electronic map positioning and navigation data produce real-time traffic information with high accuracy and high coverage. For an urban domestic solid waste collection and transportation system, a MSW management information system can be used to obtain information such as road and real-time traffic conditions. A traffic big data processing platform can be designed to dispatch solid waste transport vehicles owned by sanitation companies, and the operators of solid waste collection points can also query the vehicles through this platform to make preparations. Vehicles’ feedback information such as road conditions and locations to the MSW management information system, and the data and information of all parties are collected by a data cloud platform through the MSW management information system and the traffic big data processing platform. The application of traffic big data in domestic solid waste collection and transportation is shown in Figure1. In this paper, big data are used to obtain urban road congestion information, and according to this information, the influencing factor of vehicle running speed is described. Based on real-time road conditions of urban traffic and considering the influence of speed, load, distance, and road slope on fuel consumption, an optimization model for MSW green transportation routes with a time window and multiple transfer stations is established. The validity of the model is verified by CPLEX. As an example, the green transportation scheme of Xicheng District, Beijing, is obtained with a genetic algorithm. Finally, we compare the minimum fuel consumption target model (green transportation scheme) and the shortest distance target model (shortest path scheme). This study will help alleviate urban air pollution and promote energy conservation and emission reduction.Figure 1
Application of traffic big data in the collection and transportation processes of MSW.


## 1.1. Capacitated Vehicle Routing Problem (CVRP)

The Vehicle Routing Problem (VRP) is a typical NP-hard problem. Based on different constraints, these problems can be divided into several categories, the most classic of which is the CVRP, also known as the classic VRP problem. CVRP refers to the capacitated vehicle routing problem, and it sets the capacitated constraint for the vehicle. Many scholars have conducted research on this and set relevant constraints and studied different types of CVRPs [4]. Aiming at the minimum driving distance of vehicles, Faiza [5] developed a decision support system with an integrated taboo search module to solve the CVRP problem and applied it to a food delivery company on Janduba Island in northwestern Tunisia. It was verified that the central processing unit running time of the decision support system was short. Hannan [6] proposed an improved particle swarm optimization algorithm based on the CVRP, which introduced a dataset with different threshold waste levels and scheduling concepts, and determined the best waste collection and route optimization solutions. Wang [7] studied the problem of vehicle routing with a capacity restriction. By establishing a mathematical model and using genetic algorithms (GAs) to plan the paths of logistics vehicles, the lowest logistics and transportation costs were obtained. Ali [8] proposed a new hybrid algorithm based on gravitational simulation local search and a GA to solve the CVRP problem with the goal of minimum travel distance. The experimental results showed that the algorithm is efficient and can obtain a better solution than many other alternatives.


## 1.2. Green Transportation

Green transportation refers to transportation characterized by saving energy and reducing exhaust emissions. It takes environmental factors into consideration. The green vehicle routing problem has been studied by a large number of scholars since 2006 [9]. Ghannadpour [10] set minimum energy consumption as one of the optimization objectives when optimizing the vehicle route, considered the distance and load factors, and solved optimal route planning by using a hybrid genetic algorithm. Demir [11] studied the double-objective pollution path problem aimed at minimizing fuel consumption and travel time, and proposed an adaptive large neighborhood search algorithm, combined with a speed optimization procedure, to solve the bi-objective Pollution-Routing Problem. Mohammad [12] introduced a green vehicle routing system, established a fuel consumption model, and achieved energy saving and emission reduction. Yoshi-nori [13] established a model with the objective function of minimizing energy consumption and carbon emissions and solved it using a multi-objective heuristic algorithm. Xiao [14] and other scholars proposed a model for calculating fuel consumption that posited a linear relationship between load and distance and fuel consumption. This model has been widely adopted.There are few studies that consider energy consumption in the optimization of the transportation route of MSW. In studies, scholars have focused on different factors that affect fuel consumption. Some scholars hold that the emissions from solid waste collection vehicles are proportional only to the route distance, and therefore, a route optimization model aiming at the shortest distance is justified. However, the influence of other factors on fuel consumption is not considered [15]. Zsigraiova [16] pursued minimization of labor cost, fuel cost, and maintenance cost as the goal, and conducted sensitivity analysis with different loading weights in different roads as variables. It was demonstrated that the change of load has substantial influence on fuel consumption during transportation, but no specific path optimization was carried out. Tavares [17] set the objective as minimizing fuel consumption, considered the influence of road slope and vehicle load, and optimized the route by using geographic information system 3D route modeling. Compared with the shortest route, the proposed route reduced fuel consumption by 52%, but this study did not report a specific formula for calculating fuel consumption. In the following year, Tavares used the COPERT model to calculate fuel consumption and considered the relationship between speed, load, slope, and fuel consumption. However, the author used constant speed to calculate and did not consider that the speed is dynamically changing in different sections in reality.In addition to this summary of the research on transportation of MSW from the two dimensions of route optimization and green transportation, a literature review is tabulated in Table1.Table 1
Comparison of the related literature.
SubjectCruise constraintInfluencing factors of oil consumptionDistanceLoadSlopeVariable speedApaydin, Omer; Gonullu, M. Talha (2008)✓Li, Cheng ZhiZhang, Yan Liu, Zhi Hui Meng, Xian Yong, Du, Jing (2014)✓Zsigraiova, Zdena Semiao, Viriato Beijoco, Filipa (2013)✓✓✓Tavares, G. Zsigraiova, Z.Semiao, V. Carvalho, M. G. (2009)✓✓✓Jin Li, Danping Wang, Jianghua Zhang (2018)✓✓✓HE Dongdong, Li Yinzhen (2018)✓✓Analysis of a green transportation scheme of municipal solid waste based on traffic big data✓✓✓✓✓We can note two shortcomings in the existing research on solid waste transportation:(1)
The solid waste transportation route problem is described as a simple vehicle route problem. After the vehicle leaves from a service point, it stops work only after completing one service. Without considering the fact that the vehicle may continue to work at the next collection point after emptying at the transfer station because it does not reach the maximum working time, the vehicle can cruise many times during service hours and working hours, thus improving the utilization rate of the vehicle and the collection and transportation efficiency of the whole solid waste collection and transportation system.(2)
The factors affecting fuel consumption can be divided into two categories: one is the factors unrelated to the vehicle path, such as vehicle model, engine displacement, and performance. The other is the factors closely related to vehicle routes, such as vehicle driving distances, road slopes, driving speeds, and different vehicle loads on different routes. In the green solid waste collection and transportation system, the parameters of the solid waste vehicle are fixed, mainly because the vehicle path factor in the transportation process has a major impact on the transportation cost. For the calculation of energy consumption, the distance is often taken as a single influencing factor without considering the joint influence of multiple factors such as distance, speed, load, and road slope. In route selection, the speed is often set to a fixed value, which ignores the reality that the vehicle is driving at a variable speed. The real-life transportation network is time-varying, change of speed is inevitable, and fuel consumption of vehicles is affected by changing speed.Traffic big data have applications in solid waste collection and transportation. Urban traffic big data integrate and process road information, vehicle GPS information, and electronic map positioning and navigation data produce real-time traffic information with high accuracy and high coverage. For an urban domestic solid waste collection and transportation system, a MSW management information system can be used to obtain information such as road and real-time traffic conditions. A traffic big data processing platform can be designed to dispatch solid waste transport vehicles owned by sanitation companies, and the operators of solid waste collection points can also query the vehicles through this platform to make preparations. Vehicles’ feedback information such as road conditions and locations to the MSW management information system, and the data and information of all parties are collected by a data cloud platform through the MSW management information system and the traffic big data processing platform. The application of traffic big data in domestic solid waste collection and transportation is shown in Figure1. In this paper, big data are used to obtain urban road congestion information, and according to this information, the influencing factor of vehicle running speed is described. Based on real-time road conditions of urban traffic and considering the influence of speed, load, distance, and road slope on fuel consumption, an optimization model for MSW green transportation routes with a time window and multiple transfer stations is established. The validity of the model is verified by CPLEX. As an example, the green transportation scheme of Xicheng District, Beijing, is obtained with a genetic algorithm. Finally, we compare the minimum fuel consumption target model (green transportation scheme) and the shortest distance target model (shortest path scheme). This study will help alleviate urban air pollution and promote energy conservation and emission reduction.Figure 1
Application of traffic big data in the collection and transportation processes of MSW.


## 2. Establishment of the Model

### 2.1. Problem Description

In this paper, we set the aim as minimum fuel consumption. We incorporate the locations of existing solid waste points and big data information of real-time road conditions between points; consider the influence of speed, load, slope, distance, and other factors; and optimize the access sequence and route selection in the solid waste transportation process. We identify the route arrangement with the minimum fuel consumption and obtain the green transportation scheme. Our goal is to support the objectives of saving energy, reducing emissions, and protecting the environment. As shown in Figure2, the problem is described as multiple homogeneous vehicles starting from the parking lot and collecting solid waste at unserved solid waste collection points in turns. When a vehicle is full and cannot continue to load solid waste, it is sent to the transfer station for emptying and unloading and then continues to collect after emptying until all solid waste collection points are served. After all solid waste is transported to the transfer station, all vehicles finally return to the garage. The process is shown in Figure 3. This paper defines “cruise” as the process from empty to empty, and the number of cruises of vehicles is the number of times the vehicles travel from the collection point to the transfer station.Figure 2
Optimization of MSW transportation routes based on real-time road conditions.Figure 3
Flow chart of MSW transportation.In Figure3, the transportation routes of two cars are shown to illustrate the transportation process of MSW. The green box on the left indicates the path of vehicle 1. Vehicle 1 starts from the depot to serve several solid waste collection points, enters the transfer station, empties, and then returns to the depot to finish the work. This constitutes only one cruise. The yellow box on the right represents the route of car 2 and two cruises. After vehicle 2 arrives at the first transfer station and empties, it completes the first cruise indicated by the orange arrow, but because it does not reach the maximum working time, it continues to work at the collection point. After serving another collection point, it empties at the transfer station, completes the second cruise indicated by the blue arrow, and returns to the depot to finish the work.The main constraints of the model include time window constraints of each node, maximum vehicle capacity constraints, and vehicle route capacity constraints:(1)
Depot constraint: all homogeneous vehicles start from the depot and must return to the depot after service.(2)
Access uniqueness constraint: each solid waste collection point must be accessed only once.(3)
Vehicle maximum capacity constraint: the maximum load capacity of each vehicle isQ, and all vehicles are of the same type.(4)
Cruise constraint: a vehicle can go through many times from empty to empty in the longest working time. That is, a vehicle can continue to serve at the next collection point after being emptied at the transfer station.(5)
Constraint on the maximum working time of vehicles: the maximum working time of vehicles is seven hours per day, and vehicles can cruise during working hours. That is, they can continue to collect after being fully loaded and emptied.(6)
Time window constraint: all collection points and transfer stations have time window constraints, and vehicles can only serve them within the specified time window.


### 2.2. Symbols and Variables

The optimization model of the solid waste green transportation path based on energy consumption can be expressed by a plane graphG=N,A, where the point set N0=0 represents the parking lot, NC=1,2,…,n is the collection point, and NS=n+1,n+2,…n+m is the transfer station. N is the point set. A is the set of line segments between any two points. See Table 2 for specific parameters of the model.Table 2
Model parameters.
SymbolDescriptionei,liThe earliest and latest service start time of nodei, i∈NωikStarting service time of vehicleK at node isiService hours at nodeiTThe maximum working time of the vehicleM∞Infinite numberdijDistance between nodei and node jvijTravel speed of vehicle between nodesi and j.qiSolid waste quantity of collection nodeiQikAccumulated load capacity of vehiclek at node iQMaximum load of vehicleKTotal number of vehiclesxijkcVehiclek is 1 from i to j in the c cruise, otherwise it is 0


### 2.3. Calculation of Fuel Consumption

Many scholars have studied the automobile energy consumption model. In this paper, the Comprehensive Fuel Consumption Model (CMCE) proposed by Demir [18] is used to calculate fuel consumption. Engine power demand is mainly obtained by engine traction power, and engine traction power (unit: kW) is expressed as follows:(1)Ptract=Ma+Mgsinθ+0.5CdρSv2+MgCrcosθv1000.Traction power is converted into engine powerP (kW); the calculation formula is as follows:(2)P=Ptractηtf+Pacc.If the fuel consumption rate generated by the engine speed module is expressed by kfNVS, then the fuel consumption rate FR of the vehicle is(3)FR=ξkfNVs+P/ημ.In formula (1), the factors affecting fuel consumption can be divided into two categories: one is the factors unrelated to vehicle path, such as vehicle model, engine displacement, and performance. The other is the factors closely related to vehicle routes, such as different vehicle driving distances, different road slopes, different driving speeds, and different vehicle loads in different routes. According to the coordinates of each node, Baidu Map was used to collect data regarding the real shortest distance of each collection point. The real road conditions can be obtained free of charge through the free interface of real-time road conditions of urban roads provided by Baidu Map software. Thus, real-time speed information can be obtained. The road slope is determined according to the real terrain provided by Baidu map. The factor classification is shown in Table 3.Table 3
Factors affecting vehicle fuel consumption.
The first category: factors that have nothing to do with the path of the vehicleg—acceleration of gravityVs—engine capacityCd—coefficient of air resistanceξ—mass ratio of fuel to airCr—rolling resistance coefficientη—engine efficiencyρ—air densityμ—heat value of dieselηtf—vehicle transmission efficiencyΨ—fuel conversion factorPacc—other energy requirements of vehiclesS—windward area of vehicleskf—engine friction factorW—empty vehicle mass (kg)N—engine speedQ—maximum vehicle load (kg)The second category: factors related to the vehicle pathQik—vehicle load (kg)dij—vehicle driving distance (m)aij—vehicle acceleration (m/square second)θij—road anglevij—vehicle speed (m/s)M—total vehicle weight (kg)


### 2.4. Model

#### 2.4.1. Objective Function

The green transportation plan: minimize the total fuel consumption during solid waste transportation; and(4)min∑k=1K∑i,j∈A∑c=1CkfNVsλdijvij+Wγλαijdij+γλαijQikdij+βγλdijvij2xijkc.The shortest route plan: minimize the travel distance during solid waste transportation:(5)min∑i=0N+M∑j=0K∑c=1Cdijxijkc.


#### 2.4.2. Flow Restrictions

Each collection point can be served only once by a vehicle in a parade:(6)∑i=0N+M∑k=1K∑c=1Cxijkc=1,∀j∈1,2,…,N,i≠j.Each vehicle can depart from the parking lot only once during the entire transportation process:(7)∑j=1N∑c=1Cx0jkc=1,∀k∈1,2,…,K.Each vehicle will eventually return to the depot from the transfer station during the transportation process:(8)∑i=N+1N+M∑c=1Cxi0kc=1,∀k∈1,2,…,K.In a cruise, the vehicle leaves the transfer station at most once (0 or 1 times):(9)∑i=N+1N+M∑j=1Nxijkc≤1,∀k∈1,2,…,K,c∈1,2,…,C.The vehicle arrives at a node and then leaves:(10)∑i=1N+Mxijkc=∑i=1N+Mxjikc,∀j∈1,2,…,N,∀k∈1,2,…,K,c∈1,2,…,C.


#### 2.4.3. Capacity Constraints

The cumulative load of each vehicle in a parade is less than the maximum load of the vehicle:(11)Qikc≤Q,i∈0,1,2,…,N+M,∀k∈1,2,…,K,c∈1,2,…,C.The vehicle is empty after arriving at the transfer station and the vehicle load becomes 0:(12)Qjkc=0,j∈N+1,N+2,…,N+M,∀k∈1,2,…,K,c∈1,2,…,C.The vehicle reaches the collection pointi, and its load increases by qi when it leaves. That is, the amount of solid waste at point i is qi:(13)Qikc+qj−Qjkc≤1−xijkcM∞,∀k∈1,2,…,K,c∈1,2,…,C,i∈0,1,2,…,N+M,j1,2,…,N.


#### 2.4.4. Time Constraints

The relationship between the arrival time, service time, and transportation time of each collection point ensures time continuity:(14)ωikc+si+dijvij−ωjkc≤1−xijkcM∞,∀k∈1,2,…,K,c∈1,2,…,C,i∈0,1,2,…,N,j1,2,…,N+M.The number of vehicle cruises will increase every time a vehicle passes through the transfer station:(15)ωikc+si+dijvij−ωjkc≤1−xijkc+1M∞,∀k∈1,2,…,K,c∈1,2,…,C,i∈N+1,N+2,…,N+M,j0,1,2,…,N.The clearing activities must be completed within the time allowed by the node (time window):(16)ei≤ωikc≤li,∀i∈0,1,2,…,N+M,k∈1,2,…,K,c∈1,2,…,C.


## 2.1. Problem Description

In this paper, we set the aim as minimum fuel consumption. We incorporate the locations of existing solid waste points and big data information of real-time road conditions between points; consider the influence of speed, load, slope, distance, and other factors; and optimize the access sequence and route selection in the solid waste transportation process. We identify the route arrangement with the minimum fuel consumption and obtain the green transportation scheme. Our goal is to support the objectives of saving energy, reducing emissions, and protecting the environment. As shown in Figure2, the problem is described as multiple homogeneous vehicles starting from the parking lot and collecting solid waste at unserved solid waste collection points in turns. When a vehicle is full and cannot continue to load solid waste, it is sent to the transfer station for emptying and unloading and then continues to collect after emptying until all solid waste collection points are served. After all solid waste is transported to the transfer station, all vehicles finally return to the garage. The process is shown in Figure 3. This paper defines “cruise” as the process from empty to empty, and the number of cruises of vehicles is the number of times the vehicles travel from the collection point to the transfer station.Figure 2
Optimization of MSW transportation routes based on real-time road conditions.Figure 3
Flow chart of MSW transportation.In Figure3, the transportation routes of two cars are shown to illustrate the transportation process of MSW. The green box on the left indicates the path of vehicle 1. Vehicle 1 starts from the depot to serve several solid waste collection points, enters the transfer station, empties, and then returns to the depot to finish the work. This constitutes only one cruise. The yellow box on the right represents the route of car 2 and two cruises. After vehicle 2 arrives at the first transfer station and empties, it completes the first cruise indicated by the orange arrow, but because it does not reach the maximum working time, it continues to work at the collection point. After serving another collection point, it empties at the transfer station, completes the second cruise indicated by the blue arrow, and returns to the depot to finish the work.The main constraints of the model include time window constraints of each node, maximum vehicle capacity constraints, and vehicle route capacity constraints:(1)
Depot constraint: all homogeneous vehicles start from the depot and must return to the depot after service.(2)
Access uniqueness constraint: each solid waste collection point must be accessed only once.(3)
Vehicle maximum capacity constraint: the maximum load capacity of each vehicle isQ, and all vehicles are of the same type.(4)
Cruise constraint: a vehicle can go through many times from empty to empty in the longest working time. That is, a vehicle can continue to serve at the next collection point after being emptied at the transfer station.(5)
Constraint on the maximum working time of vehicles: the maximum working time of vehicles is seven hours per day, and vehicles can cruise during working hours. That is, they can continue to collect after being fully loaded and emptied.(6)
Time window constraint: all collection points and transfer stations have time window constraints, and vehicles can only serve them within the specified time window.


## 2.2. Symbols and Variables

The optimization model of the solid waste green transportation path based on energy consumption can be expressed by a plane graphG=N,A, where the point set N0=0 represents the parking lot, NC=1,2,…,n is the collection point, and NS=n+1,n+2,…n+m is the transfer station. N is the point set. A is the set of line segments between any two points. See Table 2 for specific parameters of the model.Table 2
Model parameters.
SymbolDescriptionei,liThe earliest and latest service start time of nodei, i∈NωikStarting service time of vehicleK at node isiService hours at nodeiTThe maximum working time of the vehicleM∞Infinite numberdijDistance between nodei and node jvijTravel speed of vehicle between nodesi and j.qiSolid waste quantity of collection nodeiQikAccumulated load capacity of vehiclek at node iQMaximum load of vehicleKTotal number of vehiclesxijkcVehiclek is 1 from i to j in the c cruise, otherwise it is 0


## 2.3. Calculation of Fuel Consumption

Many scholars have studied the automobile energy consumption model. In this paper, the Comprehensive Fuel Consumption Model (CMCE) proposed by Demir [18] is used to calculate fuel consumption. Engine power demand is mainly obtained by engine traction power, and engine traction power (unit: kW) is expressed as follows:(1)Ptract=Ma+Mgsinθ+0.5CdρSv2+MgCrcosθv1000.Traction power is converted into engine powerP (kW); the calculation formula is as follows:(2)P=Ptractηtf+Pacc.If the fuel consumption rate generated by the engine speed module is expressed by kfNVS, then the fuel consumption rate FR of the vehicle is(3)FR=ξkfNVs+P/ημ.In formula (1), the factors affecting fuel consumption can be divided into two categories: one is the factors unrelated to vehicle path, such as vehicle model, engine displacement, and performance. The other is the factors closely related to vehicle routes, such as different vehicle driving distances, different road slopes, different driving speeds, and different vehicle loads in different routes. According to the coordinates of each node, Baidu Map was used to collect data regarding the real shortest distance of each collection point. The real road conditions can be obtained free of charge through the free interface of real-time road conditions of urban roads provided by Baidu Map software. Thus, real-time speed information can be obtained. The road slope is determined according to the real terrain provided by Baidu map. The factor classification is shown in Table 3.Table 3
Factors affecting vehicle fuel consumption.
The first category: factors that have nothing to do with the path of the vehicleg—acceleration of gravityVs—engine capacityCd—coefficient of air resistanceξ—mass ratio of fuel to airCr—rolling resistance coefficientη—engine efficiencyρ—air densityμ—heat value of dieselηtf—vehicle transmission efficiencyΨ—fuel conversion factorPacc—other energy requirements of vehiclesS—windward area of vehicleskf—engine friction factorW—empty vehicle mass (kg)N—engine speedQ—maximum vehicle load (kg)The second category: factors related to the vehicle pathQik—vehicle load (kg)dij—vehicle driving distance (m)aij—vehicle acceleration (m/square second)θij—road anglevij—vehicle speed (m/s)M—total vehicle weight (kg)


## 2.4. Model

### 2.4.1. Objective Function

The green transportation plan: minimize the total fuel consumption during solid waste transportation; and(4)min∑k=1K∑i,j∈A∑c=1CkfNVsλdijvij+Wγλαijdij+γλαijQikdij+βγλdijvij2xijkc.The shortest route plan: minimize the travel distance during solid waste transportation:(5)min∑i=0N+M∑j=0K∑c=1Cdijxijkc.


### 2.4.2. Flow Restrictions

Each collection point can be served only once by a vehicle in a parade:(6)∑i=0N+M∑k=1K∑c=1Cxijkc=1,∀j∈1,2,…,N,i≠j.Each vehicle can depart from the parking lot only once during the entire transportation process:(7)∑j=1N∑c=1Cx0jkc=1,∀k∈1,2,…,K.Each vehicle will eventually return to the depot from the transfer station during the transportation process:(8)∑i=N+1N+M∑c=1Cxi0kc=1,∀k∈1,2,…,K.In a cruise, the vehicle leaves the transfer station at most once (0 or 1 times):(9)∑i=N+1N+M∑j=1Nxijkc≤1,∀k∈1,2,…,K,c∈1,2,…,C.The vehicle arrives at a node and then leaves:(10)∑i=1N+Mxijkc=∑i=1N+Mxjikc,∀j∈1,2,…,N,∀k∈1,2,…,K,c∈1,2,…,C.


### 2.4.3. Capacity Constraints

The cumulative load of each vehicle in a parade is less than the maximum load of the vehicle:(11)Qikc≤Q,i∈0,1,2,…,N+M,∀k∈1,2,…,K,c∈1,2,…,C.The vehicle is empty after arriving at the transfer station and the vehicle load becomes 0:(12)Qjkc=0,j∈N+1,N+2,…,N+M,∀k∈1,2,…,K,c∈1,2,…,C.The vehicle reaches the collection pointi, and its load increases by qi when it leaves. That is, the amount of solid waste at point i is qi:(13)Qikc+qj−Qjkc≤1−xijkcM∞,∀k∈1,2,…,K,c∈1,2,…,C,i∈0,1,2,…,N+M,j1,2,…,N.


### 2.4.4. Time Constraints

The relationship between the arrival time, service time, and transportation time of each collection point ensures time continuity:(14)ωikc+si+dijvij−ωjkc≤1−xijkcM∞,∀k∈1,2,…,K,c∈1,2,…,C,i∈0,1,2,…,N,j1,2,…,N+M.The number of vehicle cruises will increase every time a vehicle passes through the transfer station:(15)ωikc+si+dijvij−ωjkc≤1−xijkc+1M∞,∀k∈1,2,…,K,c∈1,2,…,C,i∈N+1,N+2,…,N+M,j0,1,2,…,N.The clearing activities must be completed within the time allowed by the node (time window):(16)ei≤ωikc≤li,∀i∈0,1,2,…,N+M,k∈1,2,…,K,c∈1,2,…,C.


## 2.4.1. Objective Function

The green transportation plan: minimize the total fuel consumption during solid waste transportation; and(4)min∑k=1K∑i,j∈A∑c=1CkfNVsλdijvij+Wγλαijdij+γλαijQikdij+βγλdijvij2xijkc.The shortest route plan: minimize the travel distance during solid waste transportation:(5)min∑i=0N+M∑j=0K∑c=1Cdijxijkc.


## 2.4.2. Flow Restrictions

Each collection point can be served only once by a vehicle in a parade:(6)∑i=0N+M∑k=1K∑c=1Cxijkc=1,∀j∈1,2,…,N,i≠j.Each vehicle can depart from the parking lot only once during the entire transportation process:(7)∑j=1N∑c=1Cx0jkc=1,∀k∈1,2,…,K.Each vehicle will eventually return to the depot from the transfer station during the transportation process:(8)∑i=N+1N+M∑c=1Cxi0kc=1,∀k∈1,2,…,K.In a cruise, the vehicle leaves the transfer station at most once (0 or 1 times):(9)∑i=N+1N+M∑j=1Nxijkc≤1,∀k∈1,2,…,K,c∈1,2,…,C.The vehicle arrives at a node and then leaves:(10)∑i=1N+Mxijkc=∑i=1N+Mxjikc,∀j∈1,2,…,N,∀k∈1,2,…,K,c∈1,2,…,C.


## 2.4.3. Capacity Constraints

The cumulative load of each vehicle in a parade is less than the maximum load of the vehicle:(11)Qikc≤Q,i∈0,1,2,…,N+M,∀k∈1,2,…,K,c∈1,2,…,C.The vehicle is empty after arriving at the transfer station and the vehicle load becomes 0:(12)Qjkc=0,j∈N+1,N+2,…,N+M,∀k∈1,2,…,K,c∈1,2,…,C.The vehicle reaches the collection pointi, and its load increases by qi when it leaves. That is, the amount of solid waste at point i is qi:(13)Qikc+qj−Qjkc≤1−xijkcM∞,∀k∈1,2,…,K,c∈1,2,…,C,i∈0,1,2,…,N+M,j1,2,…,N.


## 2.4.4. Time Constraints

The relationship between the arrival time, service time, and transportation time of each collection point ensures time continuity:(14)ωikc+si+dijvij−ωjkc≤1−xijkcM∞,∀k∈1,2,…,K,c∈1,2,…,C,i∈0,1,2,…,N,j1,2,…,N+M.The number of vehicle cruises will increase every time a vehicle passes through the transfer station:(15)ωikc+si+dijvij−ωjkc≤1−xijkc+1M∞,∀k∈1,2,…,K,c∈1,2,…,C,i∈N+1,N+2,…,N+M,j0,1,2,…,N.The clearing activities must be completed within the time allowed by the node (time window):(16)ei≤ωikc≤li,∀i∈0,1,2,…,N+M,k∈1,2,…,K,c∈1,2,…,C.


## 3. Algorithm Design

In this paper, we establish that the optimization model of MSW transportation based on energy consumption is an extension of the VRP problem with capacity constraints; so, it is also an NP-complete problem. Our paper uses a heuristic algorithm.Genetic algorithm is a method to search for the better optimal solution by simulating the natural evolution process. It has strong robustness and global optimization ability, and it is suitable for solving complex multi-extreme optimization problems and combination problems [19]. Genetic Algorithm (GA) is designed and proposed according to the evolutionary laws of organisms in nature. It is a computational model that simulates the biological evolution process of natural selection and genetic mechanism of Darwin’s biological evolution theory and is a method of searching for the optimal solution by simulating the natural evolution process. The algorithm transforms the problem-solving process into a process like the crossover and mutation of chromosomal genes in biological evolution by means of mathematics and computer simulation operations. When solving more complex combinatorial optimization problems, compared with some conventional optimization algorithms, better optimization results can usually be obtained faster [20].


### 3.1. Coding Method

We formulate relevant coding rules based on actual conditions and summarize the set of feasible routes for solid waste transportation. Each chromosome in this model represents a solid waste collection route plan describing the collection order of each collection point. If there aren solid waste collection points, the code s can be set as an integer arrangement of length n.


### 3.2. Fitness Function

In the process of evolutionary search, the genetic algorithm only considers the fitness and searches according to the fitness value of the chromosomes in the population. This article sets the fitness function of chromosome asFi=1/yi+Pi, where Fi is the fitness value of chromosome i, yi is the objective function of chromosome i, and Pi is the penalty value of chromosome i.


### 3.3. Selection

After calculating the fitness value of each chromosome, the “roulette” method is used to select the best individual to directly enter the next generation, and the remaining individuals enter the crossover procedure based on the crossover probability. The basic idea is that the probability of an individual being selected is proportional to the value of its fitness function.


### 3.4. Cross Operation

The crossover operation performs the two-point crossover method. First, two chromosomes are randomly selected as the paternal parents. Second, two random natural numbersr1 and r2 are generated. Then, gene fragments between the two paternal chromosomes r1 and r2 are exchanged to obtain two offspring chromosomes.


### 3.5. Mutation Operation

For individuals who meet the mutation probability, a two-point reciprocal mutation method is used for mutation to increase the diversity of solutions. Two-point reciprocity first generates two random natural numbersr1 and r2 and then exchanges genes between r1 and r2.


## 3.1. Coding Method

We formulate relevant coding rules based on actual conditions and summarize the set of feasible routes for solid waste transportation. Each chromosome in this model represents a solid waste collection route plan describing the collection order of each collection point. If there aren solid waste collection points, the code s can be set as an integer arrangement of length n.


## 3.2. Fitness Function

In the process of evolutionary search, the genetic algorithm only considers the fitness and searches according to the fitness value of the chromosomes in the population. This article sets the fitness function of chromosome asFi=1/yi+Pi, where Fi is the fitness value of chromosome i, yi is the objective function of chromosome i, and Pi is the penalty value of chromosome i.


## 3.3. Selection

After calculating the fitness value of each chromosome, the “roulette” method is used to select the best individual to directly enter the next generation, and the remaining individuals enter the crossover procedure based on the crossover probability. The basic idea is that the probability of an individual being selected is proportional to the value of its fitness function.


## 3.4. Cross Operation

The crossover operation performs the two-point crossover method. First, two chromosomes are randomly selected as the paternal parents. Second, two random natural numbersr1 and r2 are generated. Then, gene fragments between the two paternal chromosomes r1 and r2 are exchanged to obtain two offspring chromosomes.


## 3.5. Mutation Operation

For individuals who meet the mutation probability, a two-point reciprocal mutation method is used for mutation to increase the diversity of solutions. Two-point reciprocity first generates two random natural numbersr1 and r2 and then exchanges genes between r1 and r2.


## 4. Examples

### 4.1. Model Verification

CPLEX Studio can provide a method to quickly build efficient optimization models and to solve planning and scheduling problems from diverse perspectives. An example is given below and solved with CPLEX to verify the correctness of the model.Suppose there are one parking lot, three solid waste collection points, and one transfer station in a solid waste collection and transportation network. The node number, solid waste volume (tons), and distance information (km) are shown in Table4. The road gradient is set to 0, and the vehicle speed is set to 20 km/h. The transportation path obtained by CPLEX programming is shown in Table 5. Scenario 1 requires three vehicles to participate in transportation, and each vehicle only serves one node and ends the work owing to capacity constraints. In case 2, the number of cruises was increased, and the operation was completed with only two vehicles. Vehicle 1 went through two cruises. After the first cruise, it chose a closer collection point (3) for service. In Scenario 3, two vehicles are required to complete the service, but the route result and fuel consumption are different from Scenario 2 because of the different setting of the maximum load. According to formula (4), when the road gradient and vehicle speed are fixed, distance and load are the key factors affecting fuel consumption. Vehicle 1 should choose collection point 3 with a smaller gross tonnage-kilometer after serving collection point 1 rather than the nearest collection point 2 (1-3-4 ton-km 46, 1-2-4 ton-km 57). The calculation result is consistent with logical reasoning, and path 1-3-4 is a more fuel-efficient path than 1-2-4. From Scenario 1 to Scenario 3, the total transportation distance (km) decreased from 48 to 36, and the total fuel consumption (L) decreased from 9.6447 to 7.0525, indicating that the setting of the cruise link has a significant effect on the distance reduction and fuel consumption savings in the solid waste transportation process. This demonstrates that the model proposed in this article is valid and effective.Table 4
Example description.
Depot 0Collection node 1Collection node 2Collection node 3Transfer station 4Solid waste volumeDepot 0055670Collection node 1505675Collection node 2550243Collection node 3662023Transfer station 4774200Table 5
CPLEX optimized transportation route.
SituationTransportation routeDistance (km)Sum (km)Fuel consumption (L)Sum (L)Situation 1Q = 5, C = 1V1: 0-1-4-0;V2: 0-2-4-0; V3: 0-3-4-0.17;16; 15.483.8394;3.0183; 2.7870.9.6447Situation 2Q = 5, C = 2V1: 0-1-4-3-4-0;V2: 0-2-4-023;16.394.5410;3.0183.7.5593Situation 3Q = 10, C = 2V1: 0-1-3-4-0;V2: 0-2-4-020;16.364.03423;3.0183.7.0525


### 4.2. Example Solution

The Xicheng District of Beijing is located to the west of the central city of Beijing. It has a population of 1.259 million and a regional GDP of 327.035 billion yuan. There are 15 streets and 255 communities in the jurisdiction, with a total area of 50.70 square kilometers. Owing to its flat terrain of the North China Plain, the average slope is only 12–13 per ten thousandths (Figure4).Figure 4
Map of Xicheng District, Beijing.In order to verify the effectiveness of the optimization model proposed in this paper, which takes the minimum fuel consumption as the goal and considers the influence of distance, load, slope, and speed on fuel consumption, this paper uses the solid waste compression truck collection points in the Xicheng District of Beijing to transport domestic waste. We take the transportation situation as an example to optimize the transportation route. The MSW collection and transportation system of Xicheng District includes one depot, 105 waste collection points, and one transfer station. The location of each collection point is shown in Google Earth (Figure5).Figure 5
Location map of solid waste collection points in Xicheng District, Beijing.When calculating fuel consumption in this paper, in addition to the influence of vehicle and engine models and related parameters, the influence of factors such as slope, load, distance, and speed is considered. Based on Beijing’s geographical location and actual topography (see Table6), the road slopes are set to 0 in this example. The load is the cumulative load of the vehicle during a cruise, which is determined by the transportation route and the amount of solid waste at each collection point. Distance is calculated based on the position coordinates of each point, and Baidu Map is used to calculate the shortest distance in the feasible route. For the speed setting, the real time is calculated according to the real-time traffic flow. See Table 7 for specific parameter settings.Table 6
Information on location, quantity, and time of solid waste collection and transportation in Xicheng District.
Serial numberCommunity nameLongitudeLatitudeSolid waste removal volume (tons)0Depot116.39116939.90489701Yanshou street116.3951439.9035634.262Tieshu Xiejie116.39376439.8995684.693Da’an lanying116.39406439.9002355.034Mitsui116.39654339.9016696.235Dashilan west street116.39910939.9017174.916Stone116.39916639.8979157.287Baishun116.39576239.8969555.358Meishi street east116.40381739.8981186.329Tianqiao community116.40073339.8902249.610Hufang road116.39377839.8905249.7111Yongan road116.39422239.8931477.1512Xiangchang Lu116.39784139.8933179.0413Study abroad116.40162239.89353811.9614Luchang street116.39715939.8888339.4315Xiannongtan116.40272539.886266.6616Taiping street116.39743339.8795546.6517Xuanwumen Waidong street116.38431839.9055263.218Liulichang west street116.39025939.8992874.3619Liang Jiayuan116.38906439.8985963.9820Red line116.38766939.8977113.4221Sichuan camp116.38653939.896855.7422Chunshu garden116.38465339.9001025.5823Incense camp116.38754839.9045973.4224Longquan116.38595939.8839122.0825Black kiln factory116.38477339.8875773.3726Red clay shop116.38440439.8869892.7227Fenfang liuli street116.38775739.8918552.5628Fruit lane116.38225739.8915572.0829Rice city116.38175939.8915654.6430Fuzhou pavilion116.38934839.8920552.0831Xinxingli116.39096139.8864782.0832Changchunli116.36894439.8958463.2933Changchun street116.37033739.9030823.1834Changchun street west116.36883639.9044134.2635Kangle116.37330639.9010442.2136Shangxiejie116.37628139.9037584.6137Old wall root116.3745139.8997634.438Gwangan Dongli116.3761939.8956645.2439Xiaoliujo116.37844739.902356.7140Xibianmen Dongli116.36161739.9054740.6941Xibianmen Siri116.35847339.9043920.6942Xibianmen inner street116.35928339.902074.4943Huaibaishu street South116.36018839.9014433.6844North of Huaibaishu street116.36555239.903333.5945Xuanwumen west street116.37724839.905067346Guangnei avenue east116.37396839.8960691.4747Walnut garden116.36015839.895764.5848Sanmiao street116.37032239.9039193.3749Baoguo temple116.36712639.8983935.3450Fenghua116.37806239.8929454.4451Fayuan temple116.37726839.889875.8652Niujie Dongli116.37256539.893597.5453Baiguang road116.36294839.8911094.7154South line court116.35881539.8937454.3155Caiyuan Beili116.35768439.889422.7656Spring breeze116.37182439.8902636.257Niujie Xili first District116.36887539.894053.2658Niujie Xili second District116.36903339.8901983.3559Steel institute116.36648639.8917193.4660In the plain116.3782339.8887355.1961Shuanghuaili116.37711839.8879282.0262Youbei avenue116.3715739.8886241.3263Cherry orchard116.36833939.8859452.9164Caiyuan street116.36184439.8873842.4565Chongxiao temple116.36327739.8846323.7166Jiangong Beili116.35784839.8839333.0267Jiangong nanli116.35995739.8809312.4468Xin’an zhongli116.36323539.883372.3769Xin’an nanli116.3679239.880821270Right inner back116.36706639.8790391.8171Right inner west street116.36946539.8787262.8472Confident road116.37454739.8830182.5673In the light source116.37408239.8837912.0574Half-step bridge116.3745439.8775812.275Wanboyuan116.37475139.8775060.7776Liren street116.37638339.8814082.2277Qingzhiyuan116.37788939.8784554.0378Duck bridge116.35364139.8805913.8579Youth lake116.35486539.8851484.6280Chunshukan116.35170339.8877135.7781Cabbage bay116.35419539.8921156.8782Station east street116.35131539.8946925.0583Station west street116.34821639.8842983.9584Hongju South street116.34507139.8902487.1685Hongju street116.34609939.8920027.9186Handkerchief South street116.34902839.8842292.8487Handkerchief north street116.3467439.8967355.0188Honglian north lane116.34109439.8911273.9389Honglian zhongli116.34212239.88769614.8290Honglian nanli116.34123139.88468410.7191Sanyi Dongli116.3387639.8934956.1892Longqin garden116.34861639.8916977.893Sanyili116.33633339.894663.9994Tianning temple south116.35154139.8972285.8395Tianning temple north116.35152339.8987247.4896Rongfeng116.34363439.9009555.8697Yilianxuan116.33506939.8913955.1698Lecheng116.35142139.8885575.9399No. 15 station west street116.3451939.8832885.93100Wanzi street116.33050339.8906045.4101Lotus river116.33551539.898363.43102Pony factory116.34392539.90379214.16103Malian Daozhongli116.33868439.89353.95104Maliandao116.33198739.8941233.63105Butterfly garden116.33921939.8989482.96106Majialou transit station116.3572839.8402390Table 7
Parameters related to fuel consumption.
g—acceleration of gravity9.8V—engine capacity5Cd—coefficient of air resistance0.7ξ—mass ratio of fuel to air1Cr—rolling resistance coefficient0.01η—engine efficiency0.9ρ—air density1.2K—heat value of diesel44ηtf—vehicle transmission efficiency0.4Ψ—fuel conversion factor737Pacc—other energy requirements of vehicles0A—windward area of vehicles3.912kf—engine friction factor0.2W—empty vehicle mass (t)6N—engine speed33Q—maximum vehicle load (t)15a—vehicle acceleration0θij—road gradient0


### 4.3. Results

In this example, the population size is set to 100, the maximum evolutionary iteration is 700, crossover is performed with a probability of 0.8, and mutation is performed with a probability of 0.1. After the program runs, a green transportation scheme with minimum fuel consumption as the goal is obtained. The corresponding iterative curve, the fuel consumption of each vehicle, the driving distance, and the corresponding optimal route arrangement are shown in Figure6 and Table 8. For the shortest path scheme with the goal of minimizing the driving distance, the corresponding iterative curve, the fuel consumption of each vehicle, the driving distance, and the corresponding optimal route arrangement are shown in Figure 7 and Table 9.Figure 6
Iterative curve of the shortest distance scheme.Table 8
Vehicle route optimization arrangement of the green transportation plan.
VehicleNumber of cruisesRoute arrangementFuel consumption (L)Distance (m)140⟶50⟶45⟶93⟶106⟶39⟶74⟶28⟶106⟶85⟶81⟶106⟶70⟶106⟶014.6038754250⟶68⟶106⟶89⟶106⟶100⟶92⟶106⟶47⟶58⟶60⟶106⟶69⟶55⟶106⟶016.1541267330⟶20⟶27⟶82⟶44⟶106⟶91⟶40⟶35⟶36⟶106⟶56⟶106⟶012.6936904430⟶14⟶54⟶106⟶105⟶41⟶34⟶1⟶106⟶63⟶84⟶17⟶106⟶013.9642703540⟶9⟶23⟶106⟶59⟶48⟶106⟶10⟶18⟶106⟶71⟶33⟶106⟶020.3361432640⟶12⟶104⟶106⟶52⟶51⟶106⟶79⟶38⟶78⟶106⟶6⟶4⟶106⟶017.3948846730⟶5⟶7⟶106⟶80⟶83⟶72⟶106⟶103⟶61⟶87⟶106⟶010.9431343830⟶11⟶25⟶106⟶42⟶32⟶76⟶31⟶106⟶2⟶75⟶64⟶106⟶015.3349348930⟶21⟶97⟶88⟶106⟶99⟶86⟶73⟶106⟶29⟶37⟶96⟶106⟶014.92390231030⟶3⟶16⟶46⟶106⟶67⟶22⟶24⟶43⟶106⟶15⟶106⟶015.01484091140⟶53⟶65⟶106⟶95⟶106⟶90⟶106⟶102⟶106⟶19⟶26⟶62⟶8⟶106⟶016.88423291230⟶98⟶94⟶106⟶77⟶57⟶49⟶106⟶101⟶30⟶66⟶106⟶010.94345241310⟶13⟶106⟶07.2246331Sum186.36561213Figure 7
Iterative curve of the green transportation scheme.Table 9
The optimal arrangement of the vehicle route of the shortest route plan.
VehicleNumber of cruisesRoute arrangementFuel consumption (L)Distance (m)130⟶94⟶63⟶21⟶106⟶44⟶70⟶58⟶27⟶106⟶65⟶32⟶106⟶015.2944755230⟶79⟶35⟶29⟶106⟶54⟶50⟶49⟶106⟶97⟶19⟶30⟶55⟶106⟶017.4445570340⟶2⟶96⟶106⟶99⟶37⟶106⟶84⟶45⟶101⟶106⟶33⟶95⟶106⟶018.5647776450⟶81⟶106⟶90⟶103⟶106⟶12⟶106⟶102⟶106⟶15⟶8⟶41⟶106⟶019.3446324530⟶17⟶3⟶98⟶106⟶78⟶51⟶46⟶106⟶36⟶1⟶48⟶106⟶014.7437962630⟶5⟶52⟶106⟶100⟶93⟶105⟶106⟶14⟶64⟶106⟶011.6932815730⟶13⟶106⟶87⟶61⟶23⟶67⟶106⟶86⟶82⟶16⟶106⟶029.0979801830⟶25⟶20⟶28⟶80⟶106⟶38⟶59⟶66⟶106⟶91⟶62⟶18⟶106⟶014.1538646940⟶11⟶43⟶68⟶106⟶6⟶83⟶106⟶85⟶104⟶106⟶92⟶106⟶017.66418051040⟶10⟶72⟶106⟶56⟶57⟶74⟶26⟶106⟶9⟶7⟶106⟶77⟶106⟶016.70481261130⟶22⟶24⟶40⟶34⟶106⟶47⟶53⟶73⟶106⟶88⟶42⟶75⟶106⟶013.38396291230⟶89⟶106⟶71⟶39⟶60⟶106⟶69⟶76⟶31⟶4⟶106⟶012.4534604Sum200.49537813


#### 4.3.1. Green Transportation Plan

Under the minimum fuel consumption target, the total fuel consumption of the optimized path is 186.36 liters, and the total distance is 561,213 meters. The solution results show that each vehicle has completed the cleaning and transportation of 105 solid waste collection points within the prescribed seven-hour working time and finally returned to the parking lot. In the model with the goal of minimum fuel consumption (green transportation scheme), a total of 13 vehicles participate in transportation activities, of which one vehicle cruises five times, four vehicles cruise four times, seven vehicles cruise three times, and one vehicle cruises once. Because of the limitation of the longest working hours of vehicles, most vehicles will not carry out the fourth patrol clearance after the maximum working time of seven hours after three patrols. The order of visits to the collection points follows the principle of minimum fuel consumption; vehicles preferentially choose unobstructed road sections with large speeds and short distances. The collection points with large amounts of solid waste are arranged close to the transfer station for collection and transportation to avoid heavy driving and excessive fuel consumption (Figure7).


#### 4.3.2. Shortest Path Scheme

Under the shortest distance target, the total fuel consumption of the optimized path is 200.49 liters, and the total distance is 537,813 meters. It can be seen from the solution results that each vehicle has completed the cleaning and transportation of 105 solid waste collection points within the prescribed seven-hour working time and finally returned to the parking lot. In the model with the smallest distance as the goal (shortest path scheme), a total of 12 vehicles participate in transportation activities, of which one vehicle cruises five times, three vehicles cruise four times, and eight vehicles cruise three times. In this scheme, the number of patrols of the vehicle is still determined by the maximum working time of the vehicle, and the visiting order of each collection point follows the principle of distance priority. The shortest route arrangement for the total distance of the vehicle is selected (Figure6).


#### 4.3.3. Comparative Analysis of the Two Optimization Schemes

In this paper, we propose two objective functions, one is to minimize fuel consumption, the other is to minimize cruise path. We use genetic algorithm to solve these two objective functions. It can be seen from Tables8 and 9 that under different optimization goals, both the number of vehicles participating in transportation and the route arrangement are different, and the total distance and total fuel consumption are also different. The analysis results in Table 10 show that the green transportation scheme uses one additional vehicle than the shortest path scheme.Table 10
Comparative analysis of the results of the two optimizations.
Schemes planTargetVehicle numbersTotal fuel consumption (L)Total distance (m)Fuel consumption deviation (%)Distance deviation (%)Fuel consumption deviation per hundred kilometers (%)Green transportation planMinimum fuel consumption13186.365612137.054.3611.48Shortest path planShortest distance12200.49537813Because genetic algorithm is a heuristic search algorithm, it cannot obtain the exact solution. Therefore, we solve these two objective functions and obtain 50 approximate solutions, respectively (see Table11).Table 11
Statistical analysis on two different objective functions (sum of fuel or distance).
IdObjective: Sum of fuel (L)Sum of distance (m)idSum of fuel (L)Objective: Sum of distance (m)1183.015537381187.625263102174.285305012201.655343763185.895879543193.445412414182.475478864198.155417645183.835586865187.325386396178.565376046200.625330447182.025579087201.385355538183.325740108196.825274209187.195532139192.7153342310184.0954698310199.6653224111189.6257326211197.0353505912185.4655435012203.3053441713188.5756953713200.5453090814176.5852625214197.0253749115181.6553826615201.5354176516187.3656765516201.2853041517188.6756146517188.9652609918173.5952384318193.4853412219182.3854131619199.7652851320182.2755418920191.4453484721178.1553848521201.9853229722180.3854113222201.8153175223184.2758298123192.0352425824186.9353579124204.5353582625178.8154038725197.7953938826183.7354298326193.6953807527183.0356258427195.2852407428182.3054296128196.4153658529181.7654170129196.4253805130177.1954177730191.8352761831182.9256249431205.3853868032183.3654608032195.0852546133172.7252678733200.6753106134181.3653685134195.6453413835185.6055289035202.1254303736184.9252909536198.4753243837174.9451399737196.3753989238188.1056889338198.7853410439180.0852304839197.6052676740182.4756828140195.3554161541179.1451224441188.6551702742177.6353145242192.8952259143181.2153805343196.5553179444189.7656116144197.9053437245176.2352076645201.6353537946173.3853237746198.4353362847183.5155234947198.5052944948183.4355826248196.7452905549182.0853838549203.1653487950187.8856445050206.57543894AV182.16547346.3AV197.44533296.64Saving of fuel consumptionIncreasing of distancePercentage−7.74%2.63%First of all, according to Table11, the original hypothesis H0 is established: there is no difference between the detection data of the total fuel consumption with total fuel consumption as the target value and the detection data of the total fuel consumption with total distance as the target value. The alternative hypothesis H1 is that there is a difference between the detection data of total fuel consumption with total fuel consumption as the target value and the detection data of total fuel consumption with total distance as the target value. The test method is the Mann–Whitney test, and the results are given in Table 12.Table 12
The detection data difference of the total fuel consumption test statistics.
StatisticStatistic valueMann–Whitney U4.000Wilcoxon W124.000Z−4.500Progressive significance0.000Form the test results, theZ value was −4.500, and the bilateral p value was 0.000. According to the significance level α = 0.05, rejecting the original hypothesis H0, it can be seen that there is a difference between the detection data of total fuel consumption with total fuel consumption as the target value and the detection data of total fuel consumption with total distance as the target value.Secondly, according to Table11, the original hypothesis H0 is established: there is no difference between the detection data of the total distance with total fuel consumption as the target value and the detection data of the total distance with total distance as the target value. The alternative hypothesis H1 is that there is a difference between the detection data of total distance with total fuel consumption as the target value and the detection data of total distance with total distance as the target value. The test method is the Mann–Whitney test, and the results are given in Table 13.Table 13
The detection data difference of the total distance test statistics.
StatisticStatistic valueMann–Whitney U577.000Wilcoxon W1852.000Z−4.640Progressive significance0.000From the test results, theZ value was −4.640, and the bilateral p value was 0.000. According to the significance level α = 0.05, rejecting the original hypothesis H0, it can be seen that there is a difference between the detection data of total distance with total fuel consumption as the target value and the detection data of total distance with total distance as the target value.Although the use of genetic algorithm to solve the optimization problems has certain uncertainty, but at the same time has a certain stability, it still can be used to repeat the calculation and then take the average method and improve the reliability of the calculation results [21]. Converting the objective function from the shortest distance to minimum fuel consumption saves 7.74% of fuel (from 182.16 to 197.44 liters) and increases the distance by 2.63% (from 533296 to 547346 meters). This shows that when the shortest distance is used as the objective function, the lowest fuel consumption cannot be obtained. The minimum fuel consumption objective function increases the transportation distance, but it can also reduce the fuel consumption to an extent. In general, the shortest route is not the most fuel-efficient route, and the green transportation plan has better fuel-saving potential than the shortest route.


## 4.1. Model Verification

CPLEX Studio can provide a method to quickly build efficient optimization models and to solve planning and scheduling problems from diverse perspectives. An example is given below and solved with CPLEX to verify the correctness of the model.Suppose there are one parking lot, three solid waste collection points, and one transfer station in a solid waste collection and transportation network. The node number, solid waste volume (tons), and distance information (km) are shown in Table4. The road gradient is set to 0, and the vehicle speed is set to 20 km/h. The transportation path obtained by CPLEX programming is shown in Table 5. Scenario 1 requires three vehicles to participate in transportation, and each vehicle only serves one node and ends the work owing to capacity constraints. In case 2, the number of cruises was increased, and the operation was completed with only two vehicles. Vehicle 1 went through two cruises. After the first cruise, it chose a closer collection point (3) for service. In Scenario 3, two vehicles are required to complete the service, but the route result and fuel consumption are different from Scenario 2 because of the different setting of the maximum load. According to formula (4), when the road gradient and vehicle speed are fixed, distance and load are the key factors affecting fuel consumption. Vehicle 1 should choose collection point 3 with a smaller gross tonnage-kilometer after serving collection point 1 rather than the nearest collection point 2 (1-3-4 ton-km 46, 1-2-4 ton-km 57). The calculation result is consistent with logical reasoning, and path 1-3-4 is a more fuel-efficient path than 1-2-4. From Scenario 1 to Scenario 3, the total transportation distance (km) decreased from 48 to 36, and the total fuel consumption (L) decreased from 9.6447 to 7.0525, indicating that the setting of the cruise link has a significant effect on the distance reduction and fuel consumption savings in the solid waste transportation process. This demonstrates that the model proposed in this article is valid and effective.Table 4
Example description.
Depot 0Collection node 1Collection node 2Collection node 3Transfer station 4Solid waste volumeDepot 0055670Collection node 1505675Collection node 2550243Collection node 3662023Transfer station 4774200Table 5
CPLEX optimized transportation route.
SituationTransportation routeDistance (km)Sum (km)Fuel consumption (L)Sum (L)Situation 1Q = 5, C = 1V1: 0-1-4-0;V2: 0-2-4-0; V3: 0-3-4-0.17;16; 15.483.8394;3.0183; 2.7870.9.6447Situation 2Q = 5, C = 2V1: 0-1-4-3-4-0;V2: 0-2-4-023;16.394.5410;3.0183.7.5593Situation 3Q = 10, C = 2V1: 0-1-3-4-0;V2: 0-2-4-020;16.364.03423;3.0183.7.0525


## 4.2. Example Solution

The Xicheng District of Beijing is located to the west of the central city of Beijing. It has a population of 1.259 million and a regional GDP of 327.035 billion yuan. There are 15 streets and 255 communities in the jurisdiction, with a total area of 50.70 square kilometers. Owing to its flat terrain of the North China Plain, the average slope is only 12–13 per ten thousandths (Figure4).Figure 4
Map of Xicheng District, Beijing.In order to verify the effectiveness of the optimization model proposed in this paper, which takes the minimum fuel consumption as the goal and considers the influence of distance, load, slope, and speed on fuel consumption, this paper uses the solid waste compression truck collection points in the Xicheng District of Beijing to transport domestic waste. We take the transportation situation as an example to optimize the transportation route. The MSW collection and transportation system of Xicheng District includes one depot, 105 waste collection points, and one transfer station. The location of each collection point is shown in Google Earth (Figure5).Figure 5
Location map of solid waste collection points in Xicheng District, Beijing.When calculating fuel consumption in this paper, in addition to the influence of vehicle and engine models and related parameters, the influence of factors such as slope, load, distance, and speed is considered. Based on Beijing’s geographical location and actual topography (see Table6), the road slopes are set to 0 in this example. The load is the cumulative load of the vehicle during a cruise, which is determined by the transportation route and the amount of solid waste at each collection point. Distance is calculated based on the position coordinates of each point, and Baidu Map is used to calculate the shortest distance in the feasible route. For the speed setting, the real time is calculated according to the real-time traffic flow. See Table 7 for specific parameter settings.Table 6
Information on location, quantity, and time of solid waste collection and transportation in Xicheng District.
Serial numberCommunity nameLongitudeLatitudeSolid waste removal volume (tons)0Depot116.39116939.90489701Yanshou street116.3951439.9035634.262Tieshu Xiejie116.39376439.8995684.693Da’an lanying116.39406439.9002355.034Mitsui116.39654339.9016696.235Dashilan west street116.39910939.9017174.916Stone116.39916639.8979157.287Baishun116.39576239.8969555.358Meishi street east116.40381739.8981186.329Tianqiao community116.40073339.8902249.610Hufang road116.39377839.8905249.7111Yongan road116.39422239.8931477.1512Xiangchang Lu116.39784139.8933179.0413Study abroad116.40162239.89353811.9614Luchang street116.39715939.8888339.4315Xiannongtan116.40272539.886266.6616Taiping street116.39743339.8795546.6517Xuanwumen Waidong street116.38431839.9055263.218Liulichang west street116.39025939.8992874.3619Liang Jiayuan116.38906439.8985963.9820Red line116.38766939.8977113.4221Sichuan camp116.38653939.896855.7422Chunshu garden116.38465339.9001025.5823Incense camp116.38754839.9045973.4224Longquan116.38595939.8839122.0825Black kiln factory116.38477339.8875773.3726Red clay shop116.38440439.8869892.7227Fenfang liuli street116.38775739.8918552.5628Fruit lane116.38225739.8915572.0829Rice city116.38175939.8915654.6430Fuzhou pavilion116.38934839.8920552.0831Xinxingli116.39096139.8864782.0832Changchunli116.36894439.8958463.2933Changchun street116.37033739.9030823.1834Changchun street west116.36883639.9044134.2635Kangle116.37330639.9010442.2136Shangxiejie116.37628139.9037584.6137Old wall root116.3745139.8997634.438Gwangan Dongli116.3761939.8956645.2439Xiaoliujo116.37844739.902356.7140Xibianmen Dongli116.36161739.9054740.6941Xibianmen Siri116.35847339.9043920.6942Xibianmen inner street116.35928339.902074.4943Huaibaishu street South116.36018839.9014433.6844North of Huaibaishu street116.36555239.903333.5945Xuanwumen west street116.37724839.905067346Guangnei avenue east116.37396839.8960691.4747Walnut garden116.36015839.895764.5848Sanmiao street116.37032239.9039193.3749Baoguo temple116.36712639.8983935.3450Fenghua116.37806239.8929454.4451Fayuan temple116.37726839.889875.8652Niujie Dongli116.37256539.893597.5453Baiguang road116.36294839.8911094.7154South line court116.35881539.8937454.3155Caiyuan Beili116.35768439.889422.7656Spring breeze116.37182439.8902636.257Niujie Xili first District116.36887539.894053.2658Niujie Xili second District116.36903339.8901983.3559Steel institute116.36648639.8917193.4660In the plain116.3782339.8887355.1961Shuanghuaili116.37711839.8879282.0262Youbei avenue116.3715739.8886241.3263Cherry orchard116.36833939.8859452.9164Caiyuan street116.36184439.8873842.4565Chongxiao temple116.36327739.8846323.7166Jiangong Beili116.35784839.8839333.0267Jiangong nanli116.35995739.8809312.4468Xin’an zhongli116.36323539.883372.3769Xin’an nanli116.3679239.880821270Right inner back116.36706639.8790391.8171Right inner west street116.36946539.8787262.8472Confident road116.37454739.8830182.5673In the light source116.37408239.8837912.0574Half-step bridge116.3745439.8775812.275Wanboyuan116.37475139.8775060.7776Liren street116.37638339.8814082.2277Qingzhiyuan116.37788939.8784554.0378Duck bridge116.35364139.8805913.8579Youth lake116.35486539.8851484.6280Chunshukan116.35170339.8877135.7781Cabbage bay116.35419539.8921156.8782Station east street116.35131539.8946925.0583Station west street116.34821639.8842983.9584Hongju South street116.34507139.8902487.1685Hongju street116.34609939.8920027.9186Handkerchief South street116.34902839.8842292.8487Handkerchief north street116.3467439.8967355.0188Honglian north lane116.34109439.8911273.9389Honglian zhongli116.34212239.88769614.8290Honglian nanli116.34123139.88468410.7191Sanyi Dongli116.3387639.8934956.1892Longqin garden116.34861639.8916977.893Sanyili116.33633339.894663.9994Tianning temple south116.35154139.8972285.8395Tianning temple north116.35152339.8987247.4896Rongfeng116.34363439.9009555.8697Yilianxuan116.33506939.8913955.1698Lecheng116.35142139.8885575.9399No. 15 station west street116.3451939.8832885.93100Wanzi street116.33050339.8906045.4101Lotus river116.33551539.898363.43102Pony factory116.34392539.90379214.16103Malian Daozhongli116.33868439.89353.95104Maliandao116.33198739.8941233.63105Butterfly garden116.33921939.8989482.96106Majialou transit station116.3572839.8402390Table 7
Parameters related to fuel consumption.
g—acceleration of gravity9.8V—engine capacity5Cd—coefficient of air resistance0.7ξ—mass ratio of fuel to air1Cr—rolling resistance coefficient0.01η—engine efficiency0.9ρ—air density1.2K—heat value of diesel44ηtf—vehicle transmission efficiency0.4Ψ—fuel conversion factor737Pacc—other energy requirements of vehicles0A—windward area of vehicles3.912kf—engine friction factor0.2W—empty vehicle mass (t)6N—engine speed33Q—maximum vehicle load (t)15a—vehicle acceleration0θij—road gradient0


## 4.3. Results

In this example, the population size is set to 100, the maximum evolutionary iteration is 700, crossover is performed with a probability of 0.8, and mutation is performed with a probability of 0.1. After the program runs, a green transportation scheme with minimum fuel consumption as the goal is obtained. The corresponding iterative curve, the fuel consumption of each vehicle, the driving distance, and the corresponding optimal route arrangement are shown in Figure6 and Table 8. For the shortest path scheme with the goal of minimizing the driving distance, the corresponding iterative curve, the fuel consumption of each vehicle, the driving distance, and the corresponding optimal route arrangement are shown in Figure 7 and Table 9.Figure 6
Iterative curve of the shortest distance scheme.Table 8
Vehicle route optimization arrangement of the green transportation plan.
VehicleNumber of cruisesRoute arrangementFuel consumption (L)Distance (m)140⟶50⟶45⟶93⟶106⟶39⟶74⟶28⟶106⟶85⟶81⟶106⟶70⟶106⟶014.6038754250⟶68⟶106⟶89⟶106⟶100⟶92⟶106⟶47⟶58⟶60⟶106⟶69⟶55⟶106⟶016.1541267330⟶20⟶27⟶82⟶44⟶106⟶91⟶40⟶35⟶36⟶106⟶56⟶106⟶012.6936904430⟶14⟶54⟶106⟶105⟶41⟶34⟶1⟶106⟶63⟶84⟶17⟶106⟶013.9642703540⟶9⟶23⟶106⟶59⟶48⟶106⟶10⟶18⟶106⟶71⟶33⟶106⟶020.3361432640⟶12⟶104⟶106⟶52⟶51⟶106⟶79⟶38⟶78⟶106⟶6⟶4⟶106⟶017.3948846730⟶5⟶7⟶106⟶80⟶83⟶72⟶106⟶103⟶61⟶87⟶106⟶010.9431343830⟶11⟶25⟶106⟶42⟶32⟶76⟶31⟶106⟶2⟶75⟶64⟶106⟶015.3349348930⟶21⟶97⟶88⟶106⟶99⟶86⟶73⟶106⟶29⟶37⟶96⟶106⟶014.92390231030⟶3⟶16⟶46⟶106⟶67⟶22⟶24⟶43⟶106⟶15⟶106⟶015.01484091140⟶53⟶65⟶106⟶95⟶106⟶90⟶106⟶102⟶106⟶19⟶26⟶62⟶8⟶106⟶016.88423291230⟶98⟶94⟶106⟶77⟶57⟶49⟶106⟶101⟶30⟶66⟶106⟶010.94345241310⟶13⟶106⟶07.2246331Sum186.36561213Figure 7
Iterative curve of the green transportation scheme.Table 9
The optimal arrangement of the vehicle route of the shortest route plan.
VehicleNumber of cruisesRoute arrangementFuel consumption (L)Distance (m)130⟶94⟶63⟶21⟶106⟶44⟶70⟶58⟶27⟶106⟶65⟶32⟶106⟶015.2944755230⟶79⟶35⟶29⟶106⟶54⟶50⟶49⟶106⟶97⟶19⟶30⟶55⟶106⟶017.4445570340⟶2⟶96⟶106⟶99⟶37⟶106⟶84⟶45⟶101⟶106⟶33⟶95⟶106⟶018.5647776450⟶81⟶106⟶90⟶103⟶106⟶12⟶106⟶102⟶106⟶15⟶8⟶41⟶106⟶019.3446324530⟶17⟶3⟶98⟶106⟶78⟶51⟶46⟶106⟶36⟶1⟶48⟶106⟶014.7437962630⟶5⟶52⟶106⟶100⟶93⟶105⟶106⟶14⟶64⟶106⟶011.6932815730⟶13⟶106⟶87⟶61⟶23⟶67⟶106⟶86⟶82⟶16⟶106⟶029.0979801830⟶25⟶20⟶28⟶80⟶106⟶38⟶59⟶66⟶106⟶91⟶62⟶18⟶106⟶014.1538646940⟶11⟶43⟶68⟶106⟶6⟶83⟶106⟶85⟶104⟶106⟶92⟶106⟶017.66418051040⟶10⟶72⟶106⟶56⟶57⟶74⟶26⟶106⟶9⟶7⟶106⟶77⟶106⟶016.70481261130⟶22⟶24⟶40⟶34⟶106⟶47⟶53⟶73⟶106⟶88⟶42⟶75⟶106⟶013.38396291230⟶89⟶106⟶71⟶39⟶60⟶106⟶69⟶76⟶31⟶4⟶106⟶012.4534604Sum200.49537813


### 4.3.1. Green Transportation Plan

Under the minimum fuel consumption target, the total fuel consumption of the optimized path is 186.36 liters, and the total distance is 561,213 meters. The solution results show that each vehicle has completed the cleaning and transportation of 105 solid waste collection points within the prescribed seven-hour working time and finally returned to the parking lot. In the model with the goal of minimum fuel consumption (green transportation scheme), a total of 13 vehicles participate in transportation activities, of which one vehicle cruises five times, four vehicles cruise four times, seven vehicles cruise three times, and one vehicle cruises once. Because of the limitation of the longest working hours of vehicles, most vehicles will not carry out the fourth patrol clearance after the maximum working time of seven hours after three patrols. The order of visits to the collection points follows the principle of minimum fuel consumption; vehicles preferentially choose unobstructed road sections with large speeds and short distances. The collection points with large amounts of solid waste are arranged close to the transfer station for collection and transportation to avoid heavy driving and excessive fuel consumption (Figure7).


### 4.3.2. Shortest Path Scheme

Under the shortest distance target, the total fuel consumption of the optimized path is 200.49 liters, and the total distance is 537,813 meters. It can be seen from the solution results that each vehicle has completed the cleaning and transportation of 105 solid waste collection points within the prescribed seven-hour working time and finally returned to the parking lot. In the model with the smallest distance as the goal (shortest path scheme), a total of 12 vehicles participate in transportation activities, of which one vehicle cruises five times, three vehicles cruise four times, and eight vehicles cruise three times. In this scheme, the number of patrols of the vehicle is still determined by the maximum working time of the vehicle, and the visiting order of each collection point follows the principle of distance priority. The shortest route arrangement for the total distance of the vehicle is selected (Figure6).


### 4.3.3. Comparative Analysis of the Two Optimization Schemes

In this paper, we propose two objective functions, one is to minimize fuel consumption, the other is to minimize cruise path. We use genetic algorithm to solve these two objective functions. It can be seen from Tables8 and 9 that under different optimization goals, both the number of vehicles participating in transportation and the route arrangement are different, and the total distance and total fuel consumption are also different. The analysis results in Table 10 show that the green transportation scheme uses one additional vehicle than the shortest path scheme.Table 10
Comparative analysis of the results of the two optimizations.
Schemes planTargetVehicle numbersTotal fuel consumption (L)Total distance (m)Fuel consumption deviation (%)Distance deviation (%)Fuel consumption deviation per hundred kilometers (%)Green transportation planMinimum fuel consumption13186.365612137.054.3611.48Shortest path planShortest distance12200.49537813Because genetic algorithm is a heuristic search algorithm, it cannot obtain the exact solution. Therefore, we solve these two objective functions and obtain 50 approximate solutions, respectively (see Table11).Table 11
Statistical analysis on two different objective functions (sum of fuel or distance).
IdObjective: Sum of fuel (L)Sum of distance (m)idSum of fuel (L)Objective: Sum of distance (m)1183.015537381187.625263102174.285305012201.655343763185.895879543193.445412414182.475478864198.155417645183.835586865187.325386396178.565376046200.625330447182.025579087201.385355538183.325740108196.825274209187.195532139192.7153342310184.0954698310199.6653224111189.6257326211197.0353505912185.4655435012203.3053441713188.5756953713200.5453090814176.5852625214197.0253749115181.6553826615201.5354176516187.3656765516201.2853041517188.6756146517188.9652609918173.5952384318193.4853412219182.3854131619199.7652851320182.2755418920191.4453484721178.1553848521201.9853229722180.3854113222201.8153175223184.2758298123192.0352425824186.9353579124204.5353582625178.8154038725197.7953938826183.7354298326193.6953807527183.0356258427195.2852407428182.3054296128196.4153658529181.7654170129196.4253805130177.1954177730191.8352761831182.9256249431205.3853868032183.3654608032195.0852546133172.7252678733200.6753106134181.3653685134195.6453413835185.6055289035202.1254303736184.9252909536198.4753243837174.9451399737196.3753989238188.1056889338198.7853410439180.0852304839197.6052676740182.4756828140195.3554161541179.1451224441188.6551702742177.6353145242192.8952259143181.2153805343196.5553179444189.7656116144197.9053437245176.2352076645201.6353537946173.3853237746198.4353362847183.5155234947198.5052944948183.4355826248196.7452905549182.0853838549203.1653487950187.8856445050206.57543894AV182.16547346.3AV197.44533296.64Saving of fuel consumptionIncreasing of distancePercentage−7.74%2.63%First of all, according to Table11, the original hypothesis H0 is established: there is no difference between the detection data of the total fuel consumption with total fuel consumption as the target value and the detection data of the total fuel consumption with total distance as the target value. The alternative hypothesis H1 is that there is a difference between the detection data of total fuel consumption with total fuel consumption as the target value and the detection data of total fuel consumption with total distance as the target value. The test method is the Mann–Whitney test, and the results are given in Table 12.Table 12
The detection data difference of the total fuel consumption test statistics.
StatisticStatistic valueMann–Whitney U4.000Wilcoxon W124.000Z−4.500Progressive significance0.000Form the test results, theZ value was −4.500, and the bilateral p value was 0.000. According to the significance level α = 0.05, rejecting the original hypothesis H0, it can be seen that there is a difference between the detection data of total fuel consumption with total fuel consumption as the target value and the detection data of total fuel consumption with total distance as the target value.Secondly, according to Table11, the original hypothesis H0 is established: there is no difference between the detection data of the total distance with total fuel consumption as the target value and the detection data of the total distance with total distance as the target value. The alternative hypothesis H1 is that there is a difference between the detection data of total distance with total fuel consumption as the target value and the detection data of total distance with total distance as the target value. The test method is the Mann–Whitney test, and the results are given in Table 13.Table 13
The detection data difference of the total distance test statistics.
StatisticStatistic valueMann–Whitney U577.000Wilcoxon W1852.000Z−4.640Progressive significance0.000From the test results, theZ value was −4.640, and the bilateral p value was 0.000. According to the significance level α = 0.05, rejecting the original hypothesis H0, it can be seen that there is a difference between the detection data of total distance with total fuel consumption as the target value and the detection data of total distance with total distance as the target value.Although the use of genetic algorithm to solve the optimization problems has certain uncertainty, but at the same time has a certain stability, it still can be used to repeat the calculation and then take the average method and improve the reliability of the calculation results [21]. Converting the objective function from the shortest distance to minimum fuel consumption saves 7.74% of fuel (from 182.16 to 197.44 liters) and increases the distance by 2.63% (from 533296 to 547346 meters). This shows that when the shortest distance is used as the objective function, the lowest fuel consumption cannot be obtained. The minimum fuel consumption objective function increases the transportation distance, but it can also reduce the fuel consumption to an extent. In general, the shortest route is not the most fuel-efficient route, and the green transportation plan has better fuel-saving potential than the shortest route.


## 4.3.1. Green Transportation Plan

Under the minimum fuel consumption target, the total fuel consumption of the optimized path is 186.36 liters, and the total distance is 561,213 meters. The solution results show that each vehicle has completed the cleaning and transportation of 105 solid waste collection points within the prescribed seven-hour working time and finally returned to the parking lot. In the model with the goal of minimum fuel consumption (green transportation scheme), a total of 13 vehicles participate in transportation activities, of which one vehicle cruises five times, four vehicles cruise four times, seven vehicles cruise three times, and one vehicle cruises once. Because of the limitation of the longest working hours of vehicles, most vehicles will not carry out the fourth patrol clearance after the maximum working time of seven hours after three patrols. The order of visits to the collection points follows the principle of minimum fuel consumption; vehicles preferentially choose unobstructed road sections with large speeds and short distances. The collection points with large amounts of solid waste are arranged close to the transfer station for collection and transportation to avoid heavy driving and excessive fuel consumption (Figure7).


## 4.3.2. Shortest Path Scheme

Under the shortest distance target, the total fuel consumption of the optimized path is 200.49 liters, and the total distance is 537,813 meters. It can be seen from the solution results that each vehicle has completed the cleaning and transportation of 105 solid waste collection points within the prescribed seven-hour working time and finally returned to the parking lot. In the model with the smallest distance as the goal (shortest path scheme), a total of 12 vehicles participate in transportation activities, of which one vehicle cruises five times, three vehicles cruise four times, and eight vehicles cruise three times. In this scheme, the number of patrols of the vehicle is still determined by the maximum working time of the vehicle, and the visiting order of each collection point follows the principle of distance priority. The shortest route arrangement for the total distance of the vehicle is selected (Figure6).


## 4.3.3. Comparative Analysis of the Two Optimization Schemes

In this paper, we propose two objective functions, one is to minimize fuel consumption, the other is to minimize cruise path. We use genetic algorithm to solve these two objective functions. It can be seen from Tables8 and 9 that under different optimization goals, both the number of vehicles participating in transportation and the route arrangement are different, and the total distance and total fuel consumption are also different. The analysis results in Table 10 show that the green transportation scheme uses one additional vehicle than the shortest path scheme.Table 10
Comparative analysis of the results of the two optimizations.
Schemes planTargetVehicle numbersTotal fuel consumption (L)Total distance (m)Fuel consumption deviation (%)Distance deviation (%)Fuel consumption deviation per hundred kilometers (%)Green transportation planMinimum fuel consumption13186.365612137.054.3611.48Shortest path planShortest distance12200.49537813Because genetic algorithm is a heuristic search algorithm, it cannot obtain the exact solution. Therefore, we solve these two objective functions and obtain 50 approximate solutions, respectively (see Table11).Table 11
Statistical analysis on two different objective functions (sum of fuel or distance).
IdObjective: Sum of fuel (L)Sum of distance (m)idSum of fuel (L)Objective: Sum of distance (m)1183.015537381187.625263102174.285305012201.655343763185.895879543193.445412414182.475478864198.155417645183.835586865187.325386396178.565376046200.625330447182.025579087201.385355538183.325740108196.825274209187.195532139192.7153342310184.0954698310199.6653224111189.6257326211197.0353505912185.4655435012203.3053441713188.5756953713200.5453090814176.5852625214197.0253749115181.6553826615201.5354176516187.3656765516201.2853041517188.6756146517188.9652609918173.5952384318193.4853412219182.3854131619199.7652851320182.2755418920191.4453484721178.1553848521201.9853229722180.3854113222201.8153175223184.2758298123192.0352425824186.9353579124204.5353582625178.8154038725197.7953938826183.7354298326193.6953807527183.0356258427195.2852407428182.3054296128196.4153658529181.7654170129196.4253805130177.1954177730191.8352761831182.9256249431205.3853868032183.3654608032195.0852546133172.7252678733200.6753106134181.3653685134195.6453413835185.6055289035202.1254303736184.9252909536198.4753243837174.9451399737196.3753989238188.1056889338198.7853410439180.0852304839197.6052676740182.4756828140195.3554161541179.1451224441188.6551702742177.6353145242192.8952259143181.2153805343196.5553179444189.7656116144197.9053437245176.2352076645201.6353537946173.3853237746198.4353362847183.5155234947198.5052944948183.4355826248196.7452905549182.0853838549203.1653487950187.8856445050206.57543894AV182.16547346.3AV197.44533296.64Saving of fuel consumptionIncreasing of distancePercentage−7.74%2.63%First of all, according to Table11, the original hypothesis H0 is established: there is no difference between the detection data of the total fuel consumption with total fuel consumption as the target value and the detection data of the total fuel consumption with total distance as the target value. The alternative hypothesis H1 is that there is a difference between the detection data of total fuel consumption with total fuel consumption as the target value and the detection data of total fuel consumption with total distance as the target value. The test method is the Mann–Whitney test, and the results are given in Table 12.Table 12
The detection data difference of the total fuel consumption test statistics.
StatisticStatistic valueMann–Whitney U4.000Wilcoxon W124.000Z−4.500Progressive significance0.000Form the test results, theZ value was −4.500, and the bilateral p value was 0.000. According to the significance level α = 0.05, rejecting the original hypothesis H0, it can be seen that there is a difference between the detection data of total fuel consumption with total fuel consumption as the target value and the detection data of total fuel consumption with total distance as the target value.Secondly, according to Table11, the original hypothesis H0 is established: there is no difference between the detection data of the total distance with total fuel consumption as the target value and the detection data of the total distance with total distance as the target value. The alternative hypothesis H1 is that there is a difference between the detection data of total distance with total fuel consumption as the target value and the detection data of total distance with total distance as the target value. The test method is the Mann–Whitney test, and the results are given in Table 13.Table 13
The detection data difference of the total distance test statistics.
StatisticStatistic valueMann–Whitney U577.000Wilcoxon W1852.000Z−4.640Progressive significance0.000From the test results, theZ value was −4.640, and the bilateral p value was 0.000. According to the significance level α = 0.05, rejecting the original hypothesis H0, it can be seen that there is a difference between the detection data of total distance with total fuel consumption as the target value and the detection data of total distance with total distance as the target value.Although the use of genetic algorithm to solve the optimization problems has certain uncertainty, but at the same time has a certain stability, it still can be used to repeat the calculation and then take the average method and improve the reliability of the calculation results [21]. Converting the objective function from the shortest distance to minimum fuel consumption saves 7.74% of fuel (from 182.16 to 197.44 liters) and increases the distance by 2.63% (from 533296 to 547346 meters). This shows that when the shortest distance is used as the objective function, the lowest fuel consumption cannot be obtained. The minimum fuel consumption objective function increases the transportation distance, but it can also reduce the fuel consumption to an extent. In general, the shortest route is not the most fuel-efficient route, and the green transportation plan has better fuel-saving potential than the shortest route.


## 5. Discussion

In social practice, for different roles of transportation undertakers, the preferred optimization goals will be different. When the garbage transportation task is undertaken by a third-party logistics company, the company will pay more attention to economic costs from the perspective of the company’s profitability. The optimal solution generally uses a smaller number of vehicles and a shorter driving distance, which can reduce the logistics company’s vehicle purchase cost and operating costs. If you make a decision as an environmental protection agency, you may pursue a solution with low energy consumption, less emissions, and lower environmental costs, and choose the solution with the least fuel consumption. The job responsibility of the environmental protection department is to create a good living environment, and vehicle exhaust emissions will cause a lot of air pollution, so this is its key optimization goal. In different situations, different decision-making bodies will form different target preferences due to the nature of work and the content of their focus, which will affect the choice of the plan. This article provides decision-making basis for different subjects and has certain guiding significance for the actual transportation of garbage collection and transportation.


## 6. Conclusion

How to solve the increasingly serious urban solid waste and air pollution is one of major problems in modern urban management. This paper considers green WSM transportation plan and aims at minimizing fuel consumption, which uses a big data platform to obtain real-time road condition information of urban roads.Firstly, compared with other relative literatures, this paper established a green WSM transportation VRP model with cruise constraints, which considers distance, load, speed, and slope. This paper adopts a genetic algorithm to solve this NP-completed problem.Secondly, the models with the shortest distance and the minimum fuel consumption as targets are analyzed. From above, it can be seen that the route with the shortest distance as the goal is generally not the most fuel-efficient route. In the route arrangement considering fuel consumption, the collection distance will be higher compared to the shortest route, but it can significantly reduce fuel consumption. Furthermore, it will not increase the operating cost of the enterprise and still deliver a better performance in energy saving, emission reduction, and environment protection.Finally, this paper uses a big data platform for energy consumption calculation and obtains real-time speed based on the actual urban road conditions by Baidu Maps. However, facing increasingly complex transportation networks and rapidly changing traffic conditions, congestion should be considered in speed prediction when calculating energy consumption, which makes our models more valuable for application.



---

*Source: 6614312-2021-04-08.xml*