Figure 1.
Fresh food e-commerce network with front warehouses.
Gene expression data is highly dimensional. As disease-related genes account for only a tiny fraction, a deep learning model, namely GSEnet, is proposed to extract instructive features from gene expression data. This model consists of three modules, namely the pre-conv module, the SE-Resnet module, and the SE-conv module. Effectiveness of the proposed model on the performance improvement of 9 representative classifiers is evaluated. Seven evaluation metrics are used for this assessment on the GSE99095 dataset. Robustness and advantages of the proposed model compared with representative feature selection methods are also discussed. Results show superiority of the proposed model on the improvement of the classification precision and accuracy.
Citation: Kun Yu, Mingxu Huang, Shuaizheng Chen, Chaolu Feng, Wei Li. GSEnet: feature extraction of gene expression data and its application to Leukemia classification[J]. Mathematical Biosciences and Engineering, 2022, 19(5): 4881-4891. doi: 10.3934/mbe.2022228
| [1] | Maurizio Verri, Giovanna Guidoboni, Lorena Bociu, Riccardo Sacco . The role of structural viscoelasticity in deformable porous media with incompressible constituents: Applications in biomechanics. Mathematical Biosciences and Engineering, 2018, 15(4): 933-959. doi: 10.3934/mbe.2018042 |
| [2] | Sumant Kumar, Anuj Kumar Dwivedi, Chandra Shekhar Prasad Ojha, Vinod Kumar, Apourv Pant, P. K. Mishra, Nitesh Patidar, Surjeet Singh, Archana Sarkar, Sreekanth Janardhanan, C. P. Kumar, Mohammed Mainuddin . Numerical groundwater modelling for studying surface water-groundwater interaction and impact of reduced draft on groundwater resources in central Ganga basin. Mathematical Biosciences and Engineering, 2022, 19(11): 11114-11136. doi: 10.3934/mbe.2022518 |
| [3] | Kawkab Al Amri, Qamar J. A Khan, David Greenhalgh . Combined impact of fear and Allee effect in predator-prey interaction models on their growth. Mathematical Biosciences and Engineering, 2024, 21(10): 7211-7252. doi: 10.3934/mbe.2024319 |
| [4] | Ugur G. Abdulla, Vladislav Bukshtynov, Saleheh Seif . Cancer detection through Electrical Impedance Tomography and optimal control theory: theoretical and computational analysis. Mathematical Biosciences and Engineering, 2021, 18(4): 4834-4859. doi: 10.3934/mbe.2021246 |
| [5] | Fulian Yin, Jiahui Lv, Xiaojian Zhang, Xinyu Xia, Jianhong Wu . COVID-19 information propagation dynamics in the Chinese Sina-microblog. Mathematical Biosciences and Engineering, 2020, 17(3): 2676-2692. doi: 10.3934/mbe.2020146 |
| [6] | Jiyuan Ren, Yunhou Zhang, Zhe Wang, Yang Song . Artificial intelligence-based network traffic analysis and automatic optimization technology. Mathematical Biosciences and Engineering, 2022, 19(2): 1775-1785. doi: 10.3934/mbe.2022083 |
| [7] | Yalong Yang, Zhen Niu, Liangliang Su, Wenjing Xu, Yuanhang Wang . Multi-scale feature fusion for pavement crack detection based on Transformer. Mathematical Biosciences and Engineering, 2023, 20(8): 14920-14937. doi: 10.3934/mbe.2023668 |
| [8] | Hany Bauomy . Safety action over oscillations of a beam excited by moving load via a new active vibration controller. Mathematical Biosciences and Engineering, 2023, 20(3): 5135-5158. doi: 10.3934/mbe.2023238 |
| [9] | Ying Shi, Keqi Mei . Adaptive nonsingular terminal sliding mode controller for PMSM drive system using modified extended state observer. Mathematical Biosciences and Engineering, 2023, 20(10): 18774-18791. doi: 10.3934/mbe.2023832 |
| [10] | Pingping Sun, Yongbing Chen, Bo Liu, Yanxin Gao, Ye Han, Fei He, Jinchao Ji . DeepMRMP: A new predictor for multiple types of RNA modification sites using deep learning. Mathematical Biosciences and Engineering, 2019, 16(6): 6231-6241. doi: 10.3934/mbe.2019310 |
Gene expression data is highly dimensional. As disease-related genes account for only a tiny fraction, a deep learning model, namely GSEnet, is proposed to extract instructive features from gene expression data. This model consists of three modules, namely the pre-conv module, the SE-Resnet module, and the SE-conv module. Effectiveness of the proposed model on the performance improvement of 9 representative classifiers is evaluated. Seven evaluation metrics are used for this assessment on the GSE99095 dataset. Robustness and advantages of the proposed model compared with representative feature selection methods are also discussed. Results show superiority of the proposed model on the improvement of the classification precision and accuracy.
Online sourcing of fresh food for daily needs has grown in popularity as a way to avoid human contact in public places and reduce the risk of infection during epidemics. Farmers' markets have moved to e-commerce platforms, and fresh food retail e-commerce has emerged as a popular new retail type [1]. The impact of the epidemic will continue to accelerate the development of fresh food e-commerce in the future, with the fresh food e-commerce industry expected to exceed a trillion yuan in 2023, with a high growth trend [2]. There are three major forms of logistics network and operational models in the retail form of fresh food e-commerce: (1) Front warehouse mode. Fresh e-commerce platforms set up multiple small warehouses (front warehouses) near communities where consumers are concentrated, and couriers provide customers with instant delivery service from these front warehouses [3]. (2) Warehouse and store integration mode. The store serves as a small fresh food supermarket and fulfills online orders. Consumers can purchase from the store or place orders online, with express delivery [4]. (3) Community group buying mode. Fresh e-commerce initiates group purchases, summarizes orders and distributes products to customers in the community through group buying leaders, while the fresh platform is responsible for the procurement, transportation and after-sales service of fresh food [5].
Front warehouse mode can solve the last mile problem and ensure freshness and timely delivery [6], and it is distinguished from the other two e-commerce modes by its small scale, proximity to the consumer, high layout density and efficient distribution [7]. However, compared to the other two operating modes, front warehouse mode increases the length of the supply chain and incurs higher fulfillment costs (including warehouse rent, inventory costs and order delivery costs), which have become one of the main bottlenecks restricting the development of fresh e-commerce corporations operating in front warehouse mode [8]. Consequently, research on the location optimization of fresh food e-commerce front warehouses is of great application value. This paper presents a case study of an e-commerce company locating new locations for front warehouses using a location optimization model with the goal of minimizing total distribution system cost. The location and allocation decision of front warehouses can be described as follows: In the given set of alternative front warehouse and customer locations, select a certain number to open according to the distribution of customer locations and the quantity of demand, and allocate the customer orders to the open front warehouses nearby, to ensure optimal cost of the distribution network.
The remainder of the paper is structured as follows. Section 2 is a review of the literature. Section 3 discusses the problem description, assumptions and mathematical model. Section 4 presents the solution approach, Section 5 gives a real case study, and Section 6 concludes the paper with limitations and recommendations for future research.
The concepts of sustainable development and circular economy have received extensive attention. Scholars delve into sustainable closed-loop supply chain networks, and have adopted sustainability factors, such as carbon emission, energy consumption and environmental pollution, into their research to respond to real challenges [9]. Goodarzian et al. investigated a citrus fruit supply chain network in Iran to minimize the total cost and CO2 emission simultaneously [10]. Momenitabar et al. designed a sustainable bioethanol supply chain network to cope with the demand increase of bioethanol [11]. Fresh food requires low-temperature preservation during transportation, which greatly meets the quality requirements of consumers but also creates huge energy consumption and carbon emissions [12]. Therefore, research on the sustainability of cold chain transportation is particularly important. Govindan et al. [13] and Wang et al. [14] both studied the cold chain location and routing problem (VRP) from the perspective of low carbon and environmental protection to minimize the impact of carbon emissions on the environment. Wang et al. constructed a bi-objective model to realize carbon emission reduction in fresh agricultural cold chain logistics [15]. Liu designed a dynamic model to reflect the carbon emission cost affected by time-varying vehicle speed [16].
Specifically, scholars have basically matured their research methods on the e-commerce warehouse location problem, mainly based on quantitative analysis, which quantifies costs, service level, demand, time window and other elements to formulate a location model, with designs of specific algorithms to solve it. For example, Nuno et al. presented a solution for selecting a location for the installation of an e-commerce warehouse with the goals of lowering logistics costs and ensuring service improvements, and the problem was solved using multiple criteria decision-making [17]. Wang used the effective covering model to conduct an empirical analysis on the location selection problem of marine product e-commerce distribution centers, taking into account factors such as the surrounding environment, public facilities and population [18]. Ahmadi et al. established a mixed integer programming location model with the goal of maximizing the total profit of serving customers, considering the price elasticity of demand [19]. Macedo et al. proposed a heuristic algorithm based on skewed universal variable neighborhood search to solve the VRP for perishable goods with time constraints [20].
Both precise and heuristic algorithms can solve location problems. The former is suitable for situations where the problem size is not large and can obtain the optimal solution. When the scale of the problem is large, heuristic algorithms can efficiently obtain the Pareto optimization. The location problem is a classic NP-hard problem, and the Pareto optimal solution of an instance can be obtained using heuristic algorithms [21]. Torabi et al. proposed a new fuzzy-stochastic hybrid programming model based on two-stage scenarios and designed an effective multi-step solution to solve practical problems [22]. Erdin and Akbas took the location of storage facilities as a multi-criteria problem, and applied multi-criteria decision-making and TOPSIS (technique for order preference by similarity to an ideal solution) method to plan the location of storage facilities [23]. Silva et al. used three linear relaxation heuristic algorithms and genetic algorithm combined with variable neighborhood hybrid algorithm to solve the problem. The research showed that the performance of the hybrid algorithm was better than the linear relaxation heuristic algorithm [24]. Considering random demand, Silva et al. designed location models for internal distribution and outsourcing operation strategies of e-commerce enterprises, and carried out accurate solutions and heuristic solutions for the models, respectively [25].
Most of the literature only considers the process from front warehouses to customers, neglecting the process from urban distribution center to front warehouses. The improvement of distribution efficiency of a logistics system involves every circulation of the supply chain. This paper takes the front warehouse location problem as a three-tier two-stage logistics network. Although there is extensive research on fresh food e-commerce, the research in specific fields is limited, especially the quantitative research on front warehouse location. The main difference is that the front warehouse of fresh food e-commerce studied in this paper is the end node in the logistics process, providing last-mile service, with a small service scope and scattered service objects. Therefore, it is necessary to finely depict practical problems and systematically consider factors such as cost and environment.
This work presents two major contributions. First, a model of front warehouse location with the objective of total minimum cost is established, and the model and case study make a detailed description of the location of the front warehouse and comprehensive consideration of the location cost. Second, the improved immune algorithm is applied to solve the model, and the comparison with GA proves the validity of the proposed algorithm. Also, a real case study shows that the proposed algorithm is better in performance than the traditional genetic algorithm, and the real case study gives a reference for optimizing the layout of a front warehouse for fresh food e-commerce enterprises. In a word, the research of this study is of practical and academical significance.
Figure 1 depicts the operating mode of a fresh produce e-commerce business with forward warehouses, which includes a point of origin, regional warehouses, front warehouses and customer points. Regional warehouses are large warehouses that are set up for each province or city, with good cold chain storage and processing facilities, and they are typically located far from urban centers. Front warehouses are typically located within the city or in densely populated areas of the city, making it easier to deliver fresh goods to customers in a shorter period of time. First, the e-commerce company buys fresh produce directly from the source and transports it to a regional warehouse where it is processed and packaged. The fresh goods are then transported to front warehouses, where they are temporarily stored to fulfill customer orders. When a customer order is received, the front warehouse with available stock will fulfill the order quickly. To meet the needs of consumers, two specific issues should be addressed. To begin with, in order to make profit, the goal is to reduce total delivery cost. Furthermore, all demand points should be covered. This model divides logistics distribution into two phases: First, products are supplied from urban distribution centers to front warehouses, and then, products are delivered from front warehouses to consumers.
Before developing a model, the following assumptions are made in order to solve the problems listed above:
(1) Only choose the front warehouse from the list of alternative addresses.
(2) Distribution vehicles have the same model and limited capacity.
(3) The operating costs of front warehouses and vehicles are not taken into account.
(4) Customer service time, and loading and unloading time are not taken into account.
(5) Only one supply point can serve a front warehouse, and two or more front warehouses cannot serve a demand point at the same time.
(6) Maintain a constant temperature throughout the delivery process.
(7) Vehicles travel at a fixed value.
The following are the definitions of the model's parameters.
I{i|i=1,2,⋯,I}: set of candidate front warehouses;
J{j|j=1,2,⋯,J}: set of demand points;
L{l|l=1,2,⋯,L}: set of vehicles;
K{k|k=1,2,⋯,K}: set of supply vendors;
Ci: fixed costs for establishing a front warehouse in area i;
C: total cost for establishing a front warehouse;
V: capacity of vehicle;
To: outdoor ambient temperature;
Tr: refrigeration temperature;
λ: energy consumption factor;
α1: unit transportation cost from supplier to front warehouse;
α2: unit transportation cost from front warehouse to demand point;
dki: distance from supply vendor k to front warehouse i;
dij: distance from front warehouse i to demand point j;
qk: supply quantity of vendor k;
qki: cargo volume from supply vendor k to front warehouse i;
qij: demand from front warehouse i to demand point j;
Pj: demand of point j;
s: speed of vehicle;
tki: time of vehicle traveling from supply vendor k to front warehouse i;
tij: time of vehicle traveling from front warehouse i to demand point j;
Xi:Xi=1 means i(i∈I) is selected as front warehouse: for others, Xi=0;
xkil:xkil=1 means vehicle l transporting from supply vendor k to front warehouse i;
for others, xijl=0;
xijl:xijl=1 means vehicle l transporting from front warehouse i to demand point j;
for others, xijl=0;
yij:yij=1 means demand point j is served by front warehouse i;
for others, yij=0.
The front warehouse location allocation problem (FWLAP) model for fresh food logistics constructed in this paper takes the minimum total cost as the objective function. First, the components of the objective function are analyzed, and then the specific composition of the FWLAP model is determined.
(1) Infrastructure and operating costs of fresh logistics distribution system
The infrastructure cost of the fresh food logistics distribution system mainly includes the purchase cost of land, the construction cost of the front warehouse distribution center, the salary and management expenses of workers employed by the distribution center and the expenses incurred by water and electricity consumption. The facility cost is
| C1=∑Ii=1XiCi | (1) |
(2) Fresh logistics distribution and transportation cost
The transportation cost of fresh food logistics and distribution includes the transportation cost from the supply point to the distribution point and cost from the distribution point to the demand point. The total transportation and distribution cost of the two stages is
| C2=∑Ii=1∑Kk=1dkiqkixkilα1+∑Ii=1∑Jj=1dijqijxijlα2 | (2) |
(3) Energy consumption cost
It is well known that vehicles loaded with fresh products need to keep the fresh products in a low-temperature environment during the distribution process. Compared to ordinary vehicles, fresh vehicles consume much more energy. The low-temperature environment of fresh vehicles requires fuel and power consumption to maintain, and the temperature of fresh vehicles is determined by the product type. The fuel and power consumption of different types of products are also different. If the outdoor ambient temperature is below zero, there is no need to refrigerate fresh foods such as vegetables and fruits, and the energy consumption cost will be very low.
| C3=λ(∑Ii=1∑Kk=1dkiqkixkil+∑Ii=1∑Jj=1dijqijxijl) | (3) |
where λ={0,To≤Trconstants,To<Tr, To is outdoor ambient temperature, and Tr is reefertemperature required.
Through detailed analysis of the targets, the FWLAP model is formulated as follows:
| min C=C1+C2+C3 | (4) |
s.t.
| ∑i∈IXiCi≤C | (5) |
| ∑i∈Iqki≤qk | (6) |
| ∑k∈Kqki=∑j∈Jqij i∈I | (7) |
| ∑i∈Iqij≥∑i∈Irj i∈I | (8) |
| ∑i∈IXi≥1 | (9) |
| qki=∑i′∈{i}∪J∑j∈J∑k∈KPjxi′jk i∈I | (10) |
| xijl=0 i∈I,j∈J,l∈L | (11) |
| ∑i∈Ixijl≤1 j∈J,l∈L | (12) |
| ∑j∈I∪Jxijl−∑j∈I∪Jxjil=0 i∈I∪J,l∈L | (13) |
| ∑j∈J,i∈I∪Jxijl⋅Pj≤Vl l∈L | (14) |
| ∑i,j∈I∪J∑l∈Lxijl≥1 | (15) |
| ∑j∈J∑l∈Lxijl≥Xi i∈I | (16) |
| ∑j∈Jxijl≤Xi i∈I,l∈L | (17) |
| ∑i∈Iyij=1 j∈J | (18) |
| Xi=0,1 i∈Ixkil=0,1,xijl=0,1 i,j∈I∪J,l∈L,k∈Kyij=0,1 i∈I,j∈J | (19) |
The goal of Eq (4) is to minimize total cost. Formula (5) indicates that the cost of the selected front warehouse cannot exceed the total cost of the front warehouse. Formula (6) means that the quantity of goods provided by a supplier to a front warehouse cannot exceed its supply capacity. Formula (7) displays that the goods in the front warehouse cannot be retained and are all used for distribution. Formula (8) indicates that the requirements of the demand point must be satisfied. Formula (9) indicates that there is at least one front warehouse. Equation (10) requires that the total front warehouse supply is equal to the total demand of the customer points. According to Eq (11), there is no lateral transportation of goods between front warehouses. Equation (12) represents that a vehicle is assigned to one of the front warehouses. Equation (13) ensures that the vehicle transportation path remains continuous. The capacity limit of vehicles is represented by Eq (14). Equation (15) indicates that a demand point can be served by multiple delivery vehicles. Equations (16) and (17) show that vehicles are only assigned to open front warehouses. Equation (18) represents that only one front warehouse serves a demand point. The constraints of decision variables are represented by Eq (19).
There are numerous methods for resolving location issues, including analytical methods, optimal planning methods, comprehensive factor evaluation methods and so on. These methods, however, have limitations. The analytical method is limited to one distribution center location model. Although there is no limit on the number of distribution centers, the optimal planning method is not appropriate for complex models. The result of the comprehensive factor evaluation method is subjective. As a result, the proposed model is solved using a heuristic algorithm in this study. The genetic algorithm, immune algorithm and neural network are examples of intelligent optimization algorithms that are refined through repeated experimental simulations under various conditions or variants. Among them, immune algorithm research began in the 1980s, and research results show that it outperforms the classical genetic algorithm in solving location problems [26]. In this study, the immune algorithm is used to solve the proposed model.
The immune algorithm is an intelligent optimization algorithm that is generated by simulating the body's powerful immune system [27]. The biological immune system has powerful learning ability, recognition and memory ability to identify harmful information from the outside world, analyze the information and activate defense mechanisms to minimize system damage and ensure robustness and safety. The immune optimization algorithm uses the immune system's diversity generation and retention mechanism to maintain population diversity, overcoming the problem of "premature maturity" that is difficult to solve in the process of finding the optimal solution and successfully obtaining the global optimal solution.
The flow chart of the immune algorithm is shown in Figure 2.
Step 1: Problem analysis. The goal of the research is to select several suitable locations from multiple alternatives in order to establish front warehouses with the shortest total distribution time.
Step 2: Antigen identification. The magnitude of the affinity between the antibody and the antigen is used to identify it.
Step 3: Generation of initial antibody population.
Step 4: Determine the expected probability of reproduction for each individual and evaluate each one in the population.
Step 5: Rank all individuals based on their expected reproduction probability, then choose the top N to form the parent population, and select the top m to store in the memory.
Step 6: Check to see if the loop termination condition is met. To complete the iterative loop, the maximum number of iterations is used as the termination condition.
Step 7: Generation of new population. Generation is made up of two parts, one obtained through antibody selection, crossover and mutation operations, and the other is obtained from the memory bank. After the new generation is generated, the cyclic operation continues.
The specific calculations used in the implementation of the immunization algorithm are as follows.
(1) Generation of the initial antibody population
If the memory bank is empty, the first antibody population is chosen at random from the feasible solution space. If the memory bank is not empty, then the initial antibody population is chosen from it. The initial antibody population in this paper is generated at random using simple coding, and different antibodies indicate different location schemes. The number of front warehouses determines the antibody length in this study, and the antibodies represent the set of selected front warehouses. For example, if there are 5 alternatives, 2 of them should be chosen to establish front warehouses, and antibodies [2,3] indicate that locations 2 and 3 are to open as front warehouses.
(2) Affinity calculation
The degree of recognition of an antigen by an antibody is expressed by the affinity between the antibody and the antigen. The expression of affinity function is as follows.
| Av=1Fv | (20) |
where Fv is the objective function of front warehouse location.
The affinity between antibodies and antibodies is used to measure their similarity, and the algorithm employs Forrest's R-site contiguity method. The principle of the R-site contiguity method is based on the partial matching rule, and the key is determining the R-value. If two individuals are coded with consecutive R-positions or more than R-positions, the antibodies are similar, and vice versa. In this paper, the following formula is used to calculate the antibody affinity.
| Sv,s=kv,sL | (21) |
kv,s denotes the same number of digits between antibodies v and s. L means the length of the antibody, and the value of L is determined by the number of the front warehouse selected. For example, two antibodies are [237854] and [438961], and the comparison shows that three same values exist for the two antibodies. Then the affinity is 0.5.
(3) Calculation of antibody concentration
Antibody concentration denotes the proportion of similar antibodies to the total number of antibodies in the population and characterizes antibody strength. When an external antigen or a new antibody attacks the immune system, the body's immune response becomes intense, and the number of antibodies changes. Most antibodies' affinity will increase as more antibodies are produced. When it exceeds a certain threshold, their concentration suffers. The formula for calculating antibody concentration is as follows.
| Cv=1N∑j∈NSv,s | (22) |
where N denotes the total number of antibodies, and Sv,s is a binary variable. Sv,s = 1 when Sv,s > T, and otherwise, Sv,s = 0. T is a predetermined threshold value.
(4) Expected probability of reproduction
The expected reproduction probability P for each individual is determined by the antibody concentration and the affinity between the antibody and the antigen. The expression for calculating the expected reproduction probability is as follows.
| P=αAv∑Av+(1−α)Cv∑Cv | (23) |
The above equation shows that an individual's fitness is proportional to the expected reproductive probability, whereas individual concentration is inversely proportional to the desired reproduction probability. This suppresses the production of individuals with high concentration while promoting the production of individuals with high fitness, ensuring the population's diversity. α is a constant value.
(5) Immunization operation
Selection operation. The selection operation is carried out using a roulette selection mechanism. The probability of an individual being selected is determined by the ratio of an individual's expected reproductive probability to the overall.
Crossover operation. A crossover operation is one in which genes or gene segments from two chromosomes are exchanged in a specific manner to create a new individual. This paper chooses the crossover operation by multi-point crossover to make the good genes of the parents be inherited in order to produce new good individuals.
Mutation operation. The antibodies are drawn at random from the antibody population generated by the crossover operation, and one of the antibodies is mutated to create a new individual. The most commonly used mutation operations in practice are basic position mutation, flip mutation, adaptive crossover mutation, and so on. In this paper, the flip mutation operation is used to ensure population diversity. The new antibody population produced by the mutation operation is combined with the previously memorized one from memory.
Because the traditional immune optimization algorithm conservatively retains the excellent individuals within the memory bank, the population quality improves as the number of iterations increases, but it is unable to retain more excellent individuals, resulting in a slower convergence rate, which affects computational accuracy. This paper proposes an improved immune algorithm to retain dynamically excellent individuals by establishing the dynamic retention mechanism. The number of excellent individual m in the memory bank is set to change dynamically, and the number of excellent individuals is preserved to increase as the population's overall quality improves. The m population quality function is presented as
| m=(∑pi=1di−p)p×q×k | (24) |
where p is the number of demand points, q is the number of distribution centers, k is the size of the memory bank, and di is the descending position of the distance between nodes in the set of distances between demand points and temporary distribution stations.
Traditional immunization relies on a certain probability to retain the best individual, which increases the number of iterations and computational effort while also affecting computational accuracy. As a result, the population in this paper is chosen using the Metropolis criterion. The i-th individual in a population is compared to the (i+1)-th, and the rule of accepting the (i+1)-th individual is chosen as in Eq (18); otherwise, the i-th individual is accepted.
| {gi+1(x)≤gi(x)R≤exp(−gi+1(x)−gi+1(x)W) | (25) |
where g(x) denotes the fitness value, w is the temperature constant and R represents a random number uniformly distributed on [0, 1].
Alternative front warehouses make use of open areas near residential areas, such as city squares, stadiums, and open spaces. There are 15 open areas in Handan with available floor space of about 2000 m2 that were chosen through field research and big data from e-map. Table 1 shows the data for each candidate front warehouse, including capacity, coordinates and available area. The amount of fresh produce that could be accommodated in the alternative temporary front warehouses was calculated assuming that the height of the temporary front warehouses ranged from 4 to 6 meters, and the storage capacity was 1000 kg per 7 cubic meters. The distribution mode is multi-vehicle distribution, in which vehicles begin at the distribution point proceed directly to the demand point, and return to the distribution point once the task is completed.
| No. | Capacity/kg | Coordinates | Available area/m2 | Infrastructure and operating costs |
| 1 | 2714285 | 114.509175, 36.662958 | 6800 | 95520 |
| 2 | 5089285 | 114.500767, 36.654475 | 10,180 | 185,450 |
| 3 | 4571428 | 114.528543, 36.644384 | 8305 | 109,520 |
| 4 | 4007142 | 114.568266, 36.661235 | 8000 | 98,560 |
| 5 | 1600000 | 114.520637, 36.631519 | 2800 | 52,860 |
| 6 | 1714285 | 114.550461, 36.63023 | 2400 | 49,250 |
| 7 | 2857142 | 114.528071, 36.616084 | 4200 | 68,590 |
| 8 | 5714285 | 114.495117, 36.60505 | 8200 | 108,690 |
| 9 | 7000000 | 114.48475, 36.58346 | 9800 | 178,520 |
| 10 | 8571428 | 114.513137, 36.576953 | 12,000 | 205,130 |
| 11 | 8214285 | 114.47194, 36.655803 | 8200 | 90,250 |
| 12 | 3428571 | 114.475102, 36.634031 | 4800 | 75,520 |
| 13 | 1714285 | 114.45936, 36.619397 | 2400 | 60,250 |
| 14 | 3000000 | 114.451845, 36.615599 | 6300 | 85,020 |
| 15 | 6571428 | 114.438034, 36.572769 | 11,500 | 199,650 |
DownLoad:
CSV
Location of the urban distribution center is set on the west side of the city with a capacity of 40,000 tons, which is currently the largest integrated cold storage in Handan city. Its geographical coordinates are (114.455441, 36.636189).
The layout of alternative front warehouses that meet the floor area of above 2000 m2 is shown in Figure 3.
The main urban area of the city Handan is subdivided into 86 demand points based on its geographical characteristics and population distribution, and the population number of each demand point is obtained from city statistics. Assuming a daily demand for fresh food of 2 kg per person, the daily demand is then calculated using the population number, and the specific data are shown in Table 2.
| No. | Coordinate of demand point | Qty of demand/kg | No. | Coordinate of demand point | Qty of demand/kg |
| 1 | 114.548251, 36.646802 | 28,534 | 44 | 114.532801, 36.596083 | 21,816 |
| 2 | 114.534741, 36.651898 | 8076 | 45 | 114.52048, 36.597068 | 37,516 |
| 3 | 114.526908, 36.65572 | 9422 | 46 | 114.510451, 36.600835 | 13,986 |
| 4 | 114.517996, 36.656762 | 10,436 | 47 | 114.502761, 36.601994 | 29,848 |
| 5 | 114.508223, 36.656936 | 12,010 | 48 | 114.494569, 36.602863 | 30,114 |
| 6 | 114.495718, 36.658036 | 16,078 | 49 | 114.487526, 36.603558 | 28,366 |
| 7 | 114.495647, 36.647902 | 32,584 | 50 | 114.486448, 36.596663 | 24,314 |
| 8 | 114.509013, 36.643095 | 33,982 | 51 | 114.494137, 36.596489 | 14,476 |
| 9 | 114.52662, 36.645644 | 14,694 | 52 | 114.502689, 36.595561 | 20,388 |
| 10 | 114.493634, 36.63962 | 32,598 | 53 | 114.510019, 36.594808 | 15,890 |
| 11 | 114.524752, 36.636029 | 28,848 | 54 | 114.516703, 36.58484 | 20,212 |
| 12 | 114.536537, 36.635045 | 18,492 | 55 | 114.509085, 36.587216 | 30,808 |
| 13 | 114.548251, 36.634813 | 15,112 | 56 | 114.501539, 36.587796 | 38,202 |
| 14 | 114.563918, 36.625661 | 1108 | 57 | 114.488029, 36.591737 | 24,830 |
| 15 | 114.550407, 36.625545 | 28,416 | 58 | 114.503049, 36.578464 | 34,030 |
| 16 | 114.53431, 36.626704 | 42,264 | 59 | 114.492988, 36.583912 | 27,780 |
| 17 | 114.522596, 36.627804 | 27,464 | 60 | 114.482927, 36.587042 | 36,682 |
| 18 | 114.513182, 36.628036 | 21,540 | 61 | 114.482424, 36.579739 | 21,438 |
| 19 | 114.505923, 36.629137 | 33,770 | 62 | 114.477645, 36.65653 | 5954 |
| 20 | 114.496437, 36.629542 | 31,000 | 63 | 114.4821, 36.642574 | 12,912 |
| 21 | 114.488316, 36.62989 | 26,458 | 64 | 114.469847, 36.649089 | 10,232 |
| 22 | 114.481417, 36.62178 | 5156 | 65 | 114.471213, 36.63991 | 6588 |
| 23 | 114.487813, 36.621896 | 22,032 | 66 | 114.46629, 36.640518 | 24,222 |
| 24 | 114.496078, 36.620795 | 8762 | 67 | 114.458061, 36.641676 | 13,556 |
| 25 | 114.504989, 36.620621 | 33,376 | 68 | 114.451953, 36.639794 | 9786 |
| 26 | 114.512894, 36.620216 | 10,062 | 69 | 114.43661, 36.62989 | 3488 |
| 27 | 114.518787, 36.61952 | 15,458 | 70 | 114.447965, 36.632728 | 29,360 |
| 28 | 114.536753, 36.618246 | 24,286 | 71 | 114.446024, 36.626182 | 47,838 |
| 29 | 114.55206, 36.616971 | 22,704 | 72 | 114.457235, 36.631164 | 15,974 |
| 30 | 114.569595, 36.617319 | 4358 | 73 | 114.463164, 36.63212 | 24,478 |
| 31 | 114.543365, 36.609034 | 21,734 | 74 | 114.460649, 36.623662 | 61,456 |
| 32 | 114.532226, 36.609787 | 26,502 | 75 | 114.471572, 36.631946 | 32,230 |
| 33 | 114.521733, 36.612047 | 27,584 | 76 | 114.46956, 36.624705 | 19,376 |
| 34 | 114.51085, 36.611757 | 21,840 | 77 | 114.475992, 36.623054 | 29,976 |
| 35 | 114.503767, 36.612858 | 32,378 | 78 | 114.465895, 36.616479 | 46,922 |
| 36 | 114.495647, 36.614944 | 38,706 | 79 | 114.441964, 36.618796 | 10,566 |
| 37 | 114.487454, 36.613785 | 28,884 | 80 | 114.478327, 36.60689 | 20,046 |
| 38 | 114.480124, 36.615813 | 10,004 | 81 | 114.471936, 36.611062 | 22,270 |
| 39 | 114.490904, 36.608165 | 32,140 | 82 | 114.466254, 36.595619 | 26,864 |
| 40 | 114.507217, 36.606455 | 50,670 | 83 | 114.432945, 36.613032 | 4106 |
| 41 | 114.520224, 36.604601 | 20,950 | 84 | 114.428202, 36.591722 | 15,940 |
| 42 | 114.531368, 36.603298 | 30,814 | 85 | 114.462625, 36.579667 | 10,226 |
| 43 | 114.541496, 36.602631 | 21,036 | 86 | 114.435963, 36.602153 | 14,572 |
DownLoad:
CSV
Handan's urban area is divided into 86 demand areas with varying sizes and areas based on population density. High population density areas are small in order to balance the demand of each demand point, and vice versa. This can avoid the problem of overcrowded vehicles and late deliveries caused by high demand in the area, as well as reduce the number of idle and empty vehicles in low-demand areas. The layout of specific demand point numbers is depicted in Figure 4.
According to the case description, there are 86 demand points and 15 locations where front warehouses can be opened. In this paper, traffic congestion is ignored, and distance between nodes is calculated using the Euclidean distance formula when vehicles travel at a constant speed. Each vehicle is of the same type, has an on-board capacity of 2000 kg and travels at a speed of 30 km/h. Table 3 shows the parameters of the immune optimization algorithm.
| Parameter | Value | Parameter | Value |
| Population size | 80 | Crossover probability | 0.9 |
| Memory capacity | 10 | Mutation probability | 0.4 |
| Iteration number | 500 | Diversity evaluation factor | 0.95 |
DownLoad:
CSV
The model formulated in Section 3 is solved using MATLAB R2020a software by the traditional genetic algorithm and the improved immune optimization algorithm proposed in this paper. The optimal result is obtained by running in MATLAB hundreds of times. Figures 5 and 6 depict a comparison of the convergence graph results of the improved immune algorithm and the genetic algorithm.
The comparison between Figures 5 and 6 shows that the genetic algorithm obtains an optimal fitness value of 19.03 after a larger number of evolutions. The improved immune optimization algorithm in this paper, by establishing a dynamic retention mechanism to retain the best individuals and using the Metropolis criterion to select the best individuals, accelerates the convergence speed of the algorithm and can first search for the local optimum quickly and then search for the global optimum with fewer iterations. The global optimal fitness value is 13.8278, which shows the feasibility and efficiency of the algorithm in this paper.
Figures 7 and 8 show the optimal front warehouse location scheme obtained by running the genetic algorithm and the improved immune optimization algorithm, in which the blue dots indicate the front warehouses, and the green dots indicate the demand points. The blue dot with red pentagon is the selected front warehouse, and if there is a line between them, it means that the required goods of the demand point are provided by the front warehouse. The sequence of location numbers of the best front warehouses selected by the genetic algorithm is [7 12 8 3 1 2 10 11 4]. The sequence of location numbers of the best front warehouses selected by the improved immune optimization algorithm is [12 8 7 3 2 4 10].
The convergence curves and layout of location schemes show that the genetic algorithm falls into the local optimum after a dozen iterations and produces site selection results for 9 front warehouses, whereas the improved immune optimization algorithm successfully jumps out of the local optimum and achieves the global optimum solution, producing location results for 7 front warehouses. Moreover, the location cost of the immune algorithm is 851,460 yuan, and that of the genetic algorithm is 1,037,230 yuan. Consequently, the solution results show that the immune algorithm outperforms the genetic algorithm in efficiently solving location problem proposed in this paper. Table 4 shows the front warehouse selected, demand point, and total cost generated by the two algorithms.
| No. of selected front warehouses | No. of demand points it serves | Total costs/NYC | |
| Results obtained by immune algorithm | 12 | 20 21 22 23 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 82 85 |
851,460 |
| 8 | 24 25 34 35 36 37 38 39 40 46 47 48 49 50 51 52 53 57 59 60 61 80 83 84 86 |
||
| 7 | 15 16 17 18 19 26 27 28 29 30 31 32 33 41 42 43 44 45 |
||
| 3 | 1 2 3 4 9 11 12 13 | ||
| 2 | 5 6 7 8 10 | ||
| 4 | 14 | ||
| 10 | 54 55 56 58 | ||
| Results obtained by genetic algorithm | 7 | 15 16 17 18 19 26 27 28 29 30 31 32 33 41 42 43 44 45 |
1,037,230 |
| 12 | 20 21 22 23 63 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 83 84 86 |
||
| 8 | 24 25 34 35 36 37 38 39 40 46 47 48 49 50 51 52 53 57 59 60 61 80 82 85 |
||
| 3 | 1 2 3 9 11 12 13 | ||
| 1 | 4 5 | ||
| 2 | 6 7 8 10 | ||
| 10 | 54 55 56 58 | ||
| 11 | 62 64 | ||
| 4 | 14 |
DownLoad:
CSV
According to the location results, front warehouses 7, 8 and 12 handle the majority of the distribution tasks. These three front warehouses are located in the center urban area, which is the most densely populated area, according to maps of 86 demand points and 15 alternative front warehouses (Figures 3 and 4). Because there is less available space in the central urban area to open a front warehouse, these front warehouses are overcrowded. According to field research, traffic in Handan city's urban area is in good condition, and small and medium-sized vehicle can pass freely with less congestion; however, with more demand to meet, same-day or next-day delivery of fresh food can be satisfied; thus, the solution solves the delivery problem of fresh food to communities.
To summarize, the model can be used to aid decision-making for fresh produce e-commerce front warehouses or distribution nodes in logistics networks, particularly when the decision objective is to minimize the cost of delivery system.
This paper investigated the location of new front warehouses opened by fresh produce e-commerce platforms to meet increased demand in the epidemic and post-epidemic era, considering infrastructure and operating costs, fresh logistics distribution and transportation cost and energy consumption cost. To solve the actual case, the improved immune algorithm and the genetic algorithm were used, and it was proved that the improved immune algorithm outperforms the genetic algorithm in terms of solution accuracy and results. The managerial implications are as follows.
The results of the case study show that since the front warehouse serves the last-mile delivery, it radiates more communities in the main urban areas with large population and is more efficient to utilize. In contrast, the number of front warehouses in remote communities with less population is small, but the coverage is wider, and the utilization rate and unit distribution cost of front warehouses in remote communities are higher. Therefore, e-commerce enterprises should take into account the population distribution of the community, total demand quantity, the radiation distance of the service and the comprehensive cost to locate front warehouses. If the front warehouse unit distribution cost is too high in communities with small populations, it should consider the combination of front warehouse mode and community group purchase and customer pick-up mode to reduce distribution costs and achieve profitability.
In summary, the model has broad applicability in the decision-making process for location selection in the pursuit of managing a sustainable operation distribution system.
The following are the main limitations of this paper. For starters, the delivery time factors of fresh produce e-commerce operations are not taken into account, and the time window requirement of customer demand is not specified. As a result, future research directions include taking into account the cost of operation as well as the environmental impact of carbon emissions in model formulation, as well as meeting the customer time window to provide better customer service.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This paper was supported by a Research Project of Philosophy and Social Science in Handan (2021113). The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation.
The authors declare no conflicts of interest.
The research data used to support the findings of this study are included within the article, and the data used are shown in Tables 1–3.
| [1] |
A. K. Shukla, P. Singh, M. Vardhan, A two-stage gene selection method for biomarker discovery from microarray data for cancer classification, Chemometr. Intell. Lab. Syst., 183 (2018), 47-58. https://doi.org/10.1016/j.chemolab.2018.10.009 doi: 10.1016/j.chemolab.2018.10.009
|
| [2] |
S. Hautaniemi, O. Yli-Harja, J. Astola, P. Kauraniemi, A. Kallioniemi, M. Wolf, et al., Analysis and visualization of gene expression microarray data in human cancer using self-organizing maps, Mach. Learn., 52 (2003), 45-66. https://doi.org/10.1023/A:1023941307670 doi: 10.1023/A:1023941307670
|
| [3] |
J. H. Hong, S. B. Cho, The classification of cancer based on dna microarray data that uses diverse ensemble genetic programming, Artif. Intell. Med., 36 (2006), 43-58. https://doi.org/10.1016/j.artmed.2005.06.002 doi: 10.1016/j.artmed.2005.06.002
|
| [4] |
M. Hollstein, D. Sidransky, B. Vogelstein, C. C. Harris, p53 mutations in human cancers, Science, 253 (1991), 49-53. https://doi:10.1126/science.1905840 doi: 10.1126/science.1905840
|
| [5] |
T. Latkowski, S. Osowski, Data mining for feature selection in gene expression autism data, Expert Syst. Appl., 42 (2015), 864-872. https://doi.org/10.1016/j.eswa.2014.08.043 doi: 10.1016/j.eswa.2014.08.043
|
| [6] |
Y. Wang, F. S. Makedon, J. C. Ford, J. Pearlman, Hykgene: a hybrid approach for selecting marker genes for phenotype classification using microarray gene expression data, Bioinformatics, 21 (2005), 1530-1537. https://doi.org/10.1093/bioinformatics/bti192 doi: 10.1093/bioinformatics/bti192
|
| [7] |
W. Hu, W. Hu, S. Maybank, Adaboost-based algorithm for network intrusion detection, IEEE Trans. Syst. Man Cybern. B Cybern., 38 (2008), 577-583. https://doi.org/10.1109/TSMCB.2007.914695 doi: 10.1109/TSMCB.2007.914695
|
| [8] |
C. L. Huang, C. J. Wang, A ga-based feature selection and parameters optimizationfor support vector machines, Expert Syst. Appl., 31 (2006), 231-240. https://doi.org/10.1016/j.eswa.2005.09.024 doi: 10.1016/j.eswa.2005.09.024
|
| [9] |
A. K. Jain, R. P. W. Duin, J. Mao, Statistical pattern recognition: A review, IEEE Trans. Pattern Anal. Mach. Intell., 22 (2000), 4-37. https://doi.org/10.1109/34.824819 doi: 10.1109/34.824819
|
| [10] |
L. Li, T. A. Darden, C. Weingberg, A. Levine, L. G. Pedersen, Gene assessment and sample classification for gene expression data using a genetic algorithm/k-nearest neighbor method, Comb. Chem. High Throughput Screening, 4 (2001), 727-739. https://doi.org/10.2174/1386207013330733 doi: 10.2174/1386207013330733
|
| [11] |
X. Huang, L. Zhang, B. Wang, F. Li, Z. Zhang, Feature clustering based support vector machine recursive feature elimination for gene selection, Appl. Intell., 48 (2018), 594-607. https://doi.org/10.1007/s10489-017-0992-2 doi: 10.1007/s10489-017-0992-2
|
| [12] |
R. Díaz-Uriarte, S. A. De Andres, Gene selection and classification of microarray data using random forest, BMC bioinformatics, 7 (2006), 1-13. https://doi:10.1186/1471-2105-7-3 doi: 10.1186/1471-2105-7-3
|
| [13] |
I. Guyon, J. Weston, S. Barnhill, V. Vapnik, Gene selection for cancer classification using support vector machines, Mach. Learn., 46 (2002), 389-422. https://doi.org/10.1023/A:1012487302797 doi: 10.1023/A:1012487302797
|
| [14] |
L. Vinh, S. Lee, Y. T. Park, B. J. dAuriol, A novel feature selection method based on normalized mutual information, Appl. Intell., 37 (2012), 100-120. https://doi.org/10.1007/s10489-011-0315-y doi: 10.1007/s10489-011-0315-y
|
| [15] |
R. Ruiz, J. C. Riquelme, J. S. Aguilar-Ruiz, Incremental wrapper-based gene selection from microarray data for cancer classification, Pattern Recognit., 39 (2006), 2383-2392. https://doi.org/10.1016/j.patcog.2005.11.001 doi: 10.1016/j.patcog.2005.11.001
|
| [16] | S. Szedmak, J. Shawe-Taylor, C. J. Saunders, D. R. Hardoon, Multiclass classification by l1 norm support vector machine, in Pattern recognition and machine learning in computer vision workshop, 5 (2004). |
| [17] |
E. Lotfi, A. Keshavarz, Gene expression microarray classification using PCA-BEL, Comput. Biol. Med., 54 (2014), 180-187. https://doi.org/10.1016/j.compbiomed.2014.09.008 doi: 10.1016/j.compbiomed.2014.09.008
|
| [18] |
K. Y. Yeung, W. L. Ruzzo, Principal component analysis for clustering gene expression data, Bioinformatics, 17 (2001), 763-774. https://doi.org/10.1093/bioinformatics/17.9.763 doi: 10.1093/bioinformatics/17.9.763
|
| [19] |
L. Sun, W. Wang, J. Xu, S. Zhang, Improved lle and neighborhood rough sets-based gene selection using lebesgue measure for cancer classification on gene expression data, J. Intell. Fuzzy Syst., 37 (2019), 5731-5742. https://doi.org/10.3233/JIFS-181904 doi: 10.3233/JIFS-181904
|
| [20] |
L. Sun, J. Xu, W. Wang, Y. Yin, Locally linear embedding and neighborhood rough set-based gene selection for gene expression data classification, Genet. Mol. Res., 15 (2016), 15038990. http://dx.doi.org/10.4238/gmr.15038990 doi: 10.4238/gmr.15038990
|
| [21] | K. He, X. Zhang, S. Ren, J. Sun, Deep residual learning for image recognition, in Proceedings of the IEEE conference on computer vision and pattern recognition, (2016), 770-778. http://doi.org/10.1109/CVPR.2016.90 |
| [22] | J. Hu, L. Shen, G. Sun, Squeeze-and-excitation networks, in Proceedings of the IEEE conference on computer vision and pattern recognition, (2018), 7132-7141. http://doi.org/10.1109/CVPR.2018.00745 |
| [23] |
X. Zhao, S. Gao, Z. Wu, S. Kajigaya, X. Feng, Q. Liu, et al., Single-cell rna-seq reveals a distinct transcriptome signature of aneuploid hematopoietic cells, Blood, 130 (2017), 2762-2773. http://doi.org/10.1182/blood-2017-08-803353 doi: 10.1182/blood-2017-08-803353
|
| 1. | Thiago Rodrigues Carbos, Jorge Carlos Ferreira Jorge, Luís Felipe Guimarães de Souza, Ivani de Souza Bott, Matheus Campolina Mendes, Investigation into the Impact Toughness of API 5L X80 Steel Weldments and its Relationship with Safe Welding Procedures, 2020, 23, 1980-5373, 10.1590/1980-5373-mr-2020-0363 | |
| 2. | J.C.F. Jorge, L.F.G.de Souza, M.C. Mendes, I.S. Bott, L.S. Araújo, V.R.dos Santos, J.M.A. Rebello, G.M. Evans, Microstructure characterization and its relationship with impact toughness of C–Mn and high strength low alloy steel weld metals – a review, 2021, 10, 22387854, 471, 10.1016/j.jmrt.2020.12.006 | |
| 3. | Xiaoqian Pan, Jianjun Zhi, Zhengjie Fan, Yinhui Zhang, Jian Yang, Relationship between the Microstructure and Impact Toughness of the Coarse‐Grained Heat‐Affected Zone for Offshore Engineering Steels with Different Mg Contents, 2021, 1611-3683, 2100099, 10.1002/srin.202100099 | |
| 4. | Kai Chen, Wei Zhao, Guangchun Xiao, Ning Guo, Hui Zhang, Study on Corrosion Resistance and Hydrogen Permeation Behavior in Inter-Critically Reheated Coarse-Grained Heat-Affected Zone of X80 Pipeline Steel, 2022, 12, 2075-4701, 1203, 10.3390/met12071203 | |
| 5. | P. P. Stepanov, Study of Impact Toughness of Pipe Steel after Simulation of Thermal Cycles of Welding and Welded Joints of Large Diameter Pipes, 2022, 52, 0967-0912, 987, 10.3103/S0967091222100126 | |
| 6. | L. I. Efron, P. P. Stepanov, S. V. Zharkov, A. V. Chastukhin, Investigation of Low-Carbon Pipeline Steel Weldability by Welding Thermal Cycle Simulation, 2022, 66, 0026-0894, 909, 10.1007/s11015-022-01403-1 | |
| 7. | Mustafa Tümer, Rudolf Vallant, Fernando Gustavo Warchomicka, Norbert Enzinger, Undermatched Welding of Ultra-High-Strength Steel S1100 with Metal-Cored Wire: Influence of Welding Positions on Mechanical Properties, 2022, 31, 1059-9495, 7068, 10.1007/s11665-022-06876-4 | |
| 8. | Xiaoqian Pan, Jianjun Zhi, Zhengjie Fan, Yinhui Zhang, Rongbin Li, Jian Yang, Morphology and crystallography of microstructures in Mg-deoxidized offshore engineering steels after simulated welding thermal cycles, 2022, 49, 0301-9233, 541, 10.1080/03019233.2021.2023850 | |
| 9. | Quanxin Jiang, Virgínia M. Bertolo, Sakari Pallaspuro, Vera Popovich, Jilt Sietsma, Carey L. Walters, Microstructure-based cleavage parameters in bainitic, martensitic, and ferritic steels, 2023, 281, 00137944, 109146, 10.1016/j.engfracmech.2023.109146 | |
| 10. | Xiaoqian Pan, Jian Yang, Yinhui Zhang, Rongbin Li, Effect of Si Content on the Microstructures and Toughness in Heat‐Affected Zone of Offshore Engineering Steels with Mg Deoxidation, 2023, 94, 1611-3683, 2200534, 10.1002/srin.202200534 | |
| 11. | V. Bertolo, Q. Jiang, M. Terol Sanchez, T. Riemslag, C.L. Walters, J. Sietsma, V. Popovich, Cleavage fracture micromechanisms in simulated heat affected zones of S690 high strength steels, 2023, 868, 09215093, 144762, 10.1016/j.msea.2023.144762 | |
| 12. | Virgínia Bertolo, Quanxin Jiang, Urša Tiringer, Carey L. Walters, Jilt Sietsma, Vera Popovich, Cleavage fracture micromechanisms in thick-section quenched and tempered S690 high-strength steels, 2022, 57, 0022-2461, 20033, 10.1007/s10853-022-07841-1 | |
| 13. | L. I. Efron, P. P. Stepanov, K. G. Vorkachev, M. M. Kantor, V. A. Bozhenov, K. S. Smetanin, Questioning the Effect of Bainite Morphology on the Impact Viscosity of Low-Carbon Steels, 2021, 51, 0967-0912, 670, 10.3103/S0967091221090035 | |
| 14. | Savyasachi Nellikode, Sunusi Marwana Manladan, Ilguk Jo, Seung-Jin Jung, In-Chan Kim, Hyungkwon Park, Dae-Geun Nam, Yeong-Do Park, Effect of microstructural heterogeneities on variability in low-temperature impact toughness in multi-pass weld metal of 420 MPa offshore engineering steel, 2023, 0043-2288, 10.1007/s40194-023-01521-7 | |
| 15. | Savyasachi Nellikode, Siva Prasad Murugan, Jun-Ho Chung, Chang-Hoon Lee, Hyungkwon Park, Sung-Dae Kim, Namkug Ku, Yeong-Do Park, Role of M-A constituents in bainitic microstructure on crack propagation behavior in the ICCGHAZ of HSLA steels for offshore applications, 2024, 32, 22387854, 250, 10.1016/j.jmrt.2024.07.158 | |
| 16. | Fangmin Li, Jinjian Li, Bing Hu, Yuzhu Yi, Qiuming Wang, Qingfeng Wang, Effect of heat input on the microstructure and impact toughness of submerged arc weld metal for high-performance weathering steel, 2023, 10, 2053-1591, 096510, 10.1088/2053-1591/acf7af | |
| 17. | Shu-jun Jia, Qi-lin Ma, Yu Hou, Ba Li, He-song Zhang, Qing-you Liu, Changes in microstructure and properties of weld heat-affected zone of high-strength low-alloy steel, 2024, 31, 1006-706X, 2041, 10.1007/s42243-023-01133-x | |
| 18. | Devang Gandhi, Suman Patra, Pampa Ghosh, Effect of microstructure on impact toughness, texture, and nano-indentation on heat-affected zones (HAZ) in a ferrite-bainite steel, 2023, 67, 0043-2288, 2589, 10.1007/s40194-023-01576-6 | |
| 19. | Yan Ma, Lihong Su, Chen Shen, Leigh Fletcher, Huijun Li, Leilei Sun, Lei Zheng, Chuanguo Zhang, Improving the Weld Heat-Affected-Zone (HAZ) Toughness of High-Strength Thick-Walled Line Pipes, 2023, 13, 2075-4701, 2018, 10.3390/met13122018 | |
| 20. | Zi-fan Ma, Xin Wang, Guang-quan Li, Guo-dong Liu, Nan-nan Zhang, Chao Wang, Xiao-jiao Zuo, Effect of Tempering Temperature on Microstructure and Mechanical Properties of Ti-Zr Deoxidized Ship Plate Steel, 2025, 1059-9495, 10.1007/s11665-025-11053-4 |
Figures(3) / Tables(4)
Kun Yu, Mingxu Huang, Shuaizheng Chen, Chaolu Feng, Wei Li. GSEnet: feature extraction of gene expression data and its application to Leukemia classification[J]. Mathematical Biosciences and Engineering, 2022, 19(5): 4881-4891. doi: 10.3934/mbe.2022228
| No. | Capacity/kg | Coordinates | Available area/m2 | Infrastructure and operating costs |
| 1 | 2714285 | 114.509175, 36.662958 | 6800 | 95520 |
| 2 | 5089285 | 114.500767, 36.654475 | 10,180 | 185,450 |
| 3 | 4571428 | 114.528543, 36.644384 | 8305 | 109,520 |
| 4 | 4007142 | 114.568266, 36.661235 | 8000 | 98,560 |
| 5 | 1600000 | 114.520637, 36.631519 | 2800 | 52,860 |
| 6 | 1714285 | 114.550461, 36.63023 | 2400 | 49,250 |
| 7 | 2857142 | 114.528071, 36.616084 | 4200 | 68,590 |
| 8 | 5714285 | 114.495117, 36.60505 | 8200 | 108,690 |
| 9 | 7000000 | 114.48475, 36.58346 | 9800 | 178,520 |
| 10 | 8571428 | 114.513137, 36.576953 | 12,000 | 205,130 |
| 11 | 8214285 | 114.47194, 36.655803 | 8200 | 90,250 |
| 12 | 3428571 | 114.475102, 36.634031 | 4800 | 75,520 |
| 13 | 1714285 | 114.45936, 36.619397 | 2400 | 60,250 |
| 14 | 3000000 | 114.451845, 36.615599 | 6300 | 85,020 |
| 15 | 6571428 | 114.438034, 36.572769 | 11,500 | 199,650 |
DownLoad:
CSV
| No. | Coordinate of demand point | Qty of demand/kg | No. | Coordinate of demand point | Qty of demand/kg |
| 1 | 114.548251, 36.646802 | 28,534 | 44 | 114.532801, 36.596083 | 21,816 |
| 2 | 114.534741, 36.651898 | 8076 | 45 | 114.52048, 36.597068 | 37,516 |
| 3 | 114.526908, 36.65572 | 9422 | 46 | 114.510451, 36.600835 | 13,986 |
| 4 | 114.517996, 36.656762 | 10,436 | 47 | 114.502761, 36.601994 | 29,848 |
| 5 | 114.508223, 36.656936 | 12,010 | 48 | 114.494569, 36.602863 | 30,114 |
| 6 | 114.495718, 36.658036 | 16,078 | 49 | 114.487526, 36.603558 | 28,366 |
| 7 | 114.495647, 36.647902 | 32,584 | 50 | 114.486448, 36.596663 | 24,314 |
| 8 | 114.509013, 36.643095 | 33,982 | 51 | 114.494137, 36.596489 | 14,476 |
| 9 | 114.52662, 36.645644 | 14,694 | 52 | 114.502689, 36.595561 | 20,388 |
| 10 | 114.493634, 36.63962 | 32,598 | 53 | 114.510019, 36.594808 | 15,890 |
| 11 | 114.524752, 36.636029 | 28,848 | 54 | 114.516703, 36.58484 | 20,212 |
| 12 | 114.536537, 36.635045 | 18,492 | 55 | 114.509085, 36.587216 | 30,808 |
| 13 | 114.548251, 36.634813 | 15,112 | 56 | 114.501539, 36.587796 | 38,202 |
| 14 | 114.563918, 36.625661 | 1108 | 57 | 114.488029, 36.591737 | 24,830 |
| 15 | 114.550407, 36.625545 | 28,416 | 58 | 114.503049, 36.578464 | 34,030 |
| 16 | 114.53431, 36.626704 | 42,264 | 59 | 114.492988, 36.583912 | 27,780 |
| 17 | 114.522596, 36.627804 | 27,464 | 60 | 114.482927, 36.587042 | 36,682 |
| 18 | 114.513182, 36.628036 | 21,540 | 61 | 114.482424, 36.579739 | 21,438 |
| 19 | 114.505923, 36.629137 | 33,770 | 62 | 114.477645, 36.65653 | 5954 |
| 20 | 114.496437, 36.629542 | 31,000 | 63 | 114.4821, 36.642574 | 12,912 |
| 21 | 114.488316, 36.62989 | 26,458 | 64 | 114.469847, 36.649089 | 10,232 |
| 22 | 114.481417, 36.62178 | 5156 | 65 | 114.471213, 36.63991 | 6588 |
| 23 | 114.487813, 36.621896 | 22,032 | 66 | 114.46629, 36.640518 | 24,222 |
| 24 | 114.496078, 36.620795 | 8762 | 67 | 114.458061, 36.641676 | 13,556 |
| 25 | 114.504989, 36.620621 | 33,376 | 68 | 114.451953, 36.639794 | 9786 |
| 26 | 114.512894, 36.620216 | 10,062 | 69 | 114.43661, 36.62989 | 3488 |
| 27 | 114.518787, 36.61952 | 15,458 | 70 | 114.447965, 36.632728 | 29,360 |
| 28 | 114.536753, 36.618246 | 24,286 | 71 | 114.446024, 36.626182 | 47,838 |
| 29 | 114.55206, 36.616971 | 22,704 | 72 | 114.457235, 36.631164 | 15,974 |
| 30 | 114.569595, 36.617319 | 4358 | 73 | 114.463164, 36.63212 | 24,478 |
| 31 | 114.543365, 36.609034 | 21,734 | 74 | 114.460649, 36.623662 | 61,456 |
| 32 | 114.532226, 36.609787 | 26,502 | 75 | 114.471572, 36.631946 | 32,230 |
| 33 | 114.521733, 36.612047 | 27,584 | 76 | 114.46956, 36.624705 | 19,376 |
| 34 | 114.51085, 36.611757 | 21,840 | 77 | 114.475992, 36.623054 | 29,976 |
| 35 | 114.503767, 36.612858 | 32,378 | 78 | 114.465895, 36.616479 | 46,922 |
| 36 | 114.495647, 36.614944 | 38,706 | 79 | 114.441964, 36.618796 | 10,566 |
| 37 | 114.487454, 36.613785 | 28,884 | 80 | 114.478327, 36.60689 | 20,046 |
| 38 | 114.480124, 36.615813 | 10,004 | 81 | 114.471936, 36.611062 | 22,270 |
| 39 | 114.490904, 36.608165 | 32,140 | 82 | 114.466254, 36.595619 | 26,864 |
| 40 | 114.507217, 36.606455 | 50,670 | 83 | 114.432945, 36.613032 | 4106 |
| 41 | 114.520224, 36.604601 | 20,950 | 84 | 114.428202, 36.591722 | 15,940 |
| 42 | 114.531368, 36.603298 | 30,814 | 85 | 114.462625, 36.579667 | 10,226 |
| 43 | 114.541496, 36.602631 | 21,036 | 86 | 114.435963, 36.602153 | 14,572 |
DownLoad:
CSV
| Parameter | Value | Parameter | Value |
| Population size | 80 | Crossover probability | 0.9 |
| Memory capacity | 10 | Mutation probability | 0.4 |
| Iteration number | 500 | Diversity evaluation factor | 0.95 |
DownLoad:
CSV
| No. of selected front warehouses | No. of demand points it serves | Total costs/NYC | |
| Results obtained by immune algorithm | 12 | 20 21 22 23 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 82 85 |
851,460 |
| 8 | 24 25 34 35 36 37 38 39 40 46 47 48 49 50 51 52 53 57 59 60 61 80 83 84 86 |
||
| 7 | 15 16 17 18 19 26 27 28 29 30 31 32 33 41 42 43 44 45 |
||
| 3 | 1 2 3 4 9 11 12 13 | ||
| 2 | 5 6 7 8 10 | ||
| 4 | 14 | ||
| 10 | 54 55 56 58 | ||
| Results obtained by genetic algorithm | 7 | 15 16 17 18 19 26 27 28 29 30 31 32 33 41 42 43 44 45 |
1,037,230 |
| 12 | 20 21 22 23 63 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 83 84 86 |
||
| 8 | 24 25 34 35 36 37 38 39 40 46 47 48 49 50 51 52 53 57 59 60 61 80 82 85 |
||
| 3 | 1 2 3 9 11 12 13 | ||
| 1 | 4 5 | ||
| 2 | 6 7 8 10 | ||
| 10 | 54 55 56 58 | ||
| 11 | 62 64 | ||
| 4 | 14 |
DownLoad:
CSV
| No. | Capacity/kg | Coordinates | Available area/m2 | Infrastructure and operating costs |
| 1 | 2714285 | 114.509175, 36.662958 | 6800 | 95520 |
| 2 | 5089285 | 114.500767, 36.654475 | 10,180 | 185,450 |
| 3 | 4571428 | 114.528543, 36.644384 | 8305 | 109,520 |
| 4 | 4007142 | 114.568266, 36.661235 | 8000 | 98,560 |
| 5 | 1600000 | 114.520637, 36.631519 | 2800 | 52,860 |
| 6 | 1714285 | 114.550461, 36.63023 | 2400 | 49,250 |
| 7 | 2857142 | 114.528071, 36.616084 | 4200 | 68,590 |
| 8 | 5714285 | 114.495117, 36.60505 | 8200 | 108,690 |
| 9 | 7000000 | 114.48475, 36.58346 | 9800 | 178,520 |
| 10 | 8571428 | 114.513137, 36.576953 | 12,000 | 205,130 |
| 11 | 8214285 | 114.47194, 36.655803 | 8200 | 90,250 |
| 12 | 3428571 | 114.475102, 36.634031 | 4800 | 75,520 |
| 13 | 1714285 | 114.45936, 36.619397 | 2400 | 60,250 |
| 14 | 3000000 | 114.451845, 36.615599 | 6300 | 85,020 |
| 15 | 6571428 | 114.438034, 36.572769 | 11,500 | 199,650 |
| No. | Coordinate of demand point | Qty of demand/kg | No. | Coordinate of demand point | Qty of demand/kg |
| 1 | 114.548251, 36.646802 | 28,534 | 44 | 114.532801, 36.596083 | 21,816 |
| 2 | 114.534741, 36.651898 | 8076 | 45 | 114.52048, 36.597068 | 37,516 |
| 3 | 114.526908, 36.65572 | 9422 | 46 | 114.510451, 36.600835 | 13,986 |
| 4 | 114.517996, 36.656762 | 10,436 | 47 | 114.502761, 36.601994 | 29,848 |
| 5 | 114.508223, 36.656936 | 12,010 | 48 | 114.494569, 36.602863 | 30,114 |
| 6 | 114.495718, 36.658036 | 16,078 | 49 | 114.487526, 36.603558 | 28,366 |
| 7 | 114.495647, 36.647902 | 32,584 | 50 | 114.486448, 36.596663 | 24,314 |
| 8 | 114.509013, 36.643095 | 33,982 | 51 | 114.494137, 36.596489 | 14,476 |
| 9 | 114.52662, 36.645644 | 14,694 | 52 | 114.502689, 36.595561 | 20,388 |
| 10 | 114.493634, 36.63962 | 32,598 | 53 | 114.510019, 36.594808 | 15,890 |
| 11 | 114.524752, 36.636029 | 28,848 | 54 | 114.516703, 36.58484 | 20,212 |
| 12 | 114.536537, 36.635045 | 18,492 | 55 | 114.509085, 36.587216 | 30,808 |
| 13 | 114.548251, 36.634813 | 15,112 | 56 | 114.501539, 36.587796 | 38,202 |
| 14 | 114.563918, 36.625661 | 1108 | 57 | 114.488029, 36.591737 | 24,830 |
| 15 | 114.550407, 36.625545 | 28,416 | 58 | 114.503049, 36.578464 | 34,030 |
| 16 | 114.53431, 36.626704 | 42,264 | 59 | 114.492988, 36.583912 | 27,780 |
| 17 | 114.522596, 36.627804 | 27,464 | 60 | 114.482927, 36.587042 | 36,682 |
| 18 | 114.513182, 36.628036 | 21,540 | 61 | 114.482424, 36.579739 | 21,438 |
| 19 | 114.505923, 36.629137 | 33,770 | 62 | 114.477645, 36.65653 | 5954 |
| 20 | 114.496437, 36.629542 | 31,000 | 63 | 114.4821, 36.642574 | 12,912 |
| 21 | 114.488316, 36.62989 | 26,458 | 64 | 114.469847, 36.649089 | 10,232 |
| 22 | 114.481417, 36.62178 | 5156 | 65 | 114.471213, 36.63991 | 6588 |
| 23 | 114.487813, 36.621896 | 22,032 | 66 | 114.46629, 36.640518 | 24,222 |
| 24 | 114.496078, 36.620795 | 8762 | 67 | 114.458061, 36.641676 | 13,556 |
| 25 | 114.504989, 36.620621 | 33,376 | 68 | 114.451953, 36.639794 | 9786 |
| 26 | 114.512894, 36.620216 | 10,062 | 69 | 114.43661, 36.62989 | 3488 |
| 27 | 114.518787, 36.61952 | 15,458 | 70 | 114.447965, 36.632728 | 29,360 |
| 28 | 114.536753, 36.618246 | 24,286 | 71 | 114.446024, 36.626182 | 47,838 |
| 29 | 114.55206, 36.616971 | 22,704 | 72 | 114.457235, 36.631164 | 15,974 |
| 30 | 114.569595, 36.617319 | 4358 | 73 | 114.463164, 36.63212 | 24,478 |
| 31 | 114.543365, 36.609034 | 21,734 | 74 | 114.460649, 36.623662 | 61,456 |
| 32 | 114.532226, 36.609787 | 26,502 | 75 | 114.471572, 36.631946 | 32,230 |
| 33 | 114.521733, 36.612047 | 27,584 | 76 | 114.46956, 36.624705 | 19,376 |
| 34 | 114.51085, 36.611757 | 21,840 | 77 | 114.475992, 36.623054 | 29,976 |
| 35 | 114.503767, 36.612858 | 32,378 | 78 | 114.465895, 36.616479 | 46,922 |
| 36 | 114.495647, 36.614944 | 38,706 | 79 | 114.441964, 36.618796 | 10,566 |
| 37 | 114.487454, 36.613785 | 28,884 | 80 | 114.478327, 36.60689 | 20,046 |
| 38 | 114.480124, 36.615813 | 10,004 | 81 | 114.471936, 36.611062 | 22,270 |
| 39 | 114.490904, 36.608165 | 32,140 | 82 | 114.466254, 36.595619 | 26,864 |
| 40 | 114.507217, 36.606455 | 50,670 | 83 | 114.432945, 36.613032 | 4106 |
| 41 | 114.520224, 36.604601 | 20,950 | 84 | 114.428202, 36.591722 | 15,940 |
| 42 | 114.531368, 36.603298 | 30,814 | 85 | 114.462625, 36.579667 | 10,226 |
| 43 | 114.541496, 36.602631 | 21,036 | 86 | 114.435963, 36.602153 | 14,572 |
| Parameter | Value | Parameter | Value |
| Population size | 80 | Crossover probability | 0.9 |
| Memory capacity | 10 | Mutation probability | 0.4 |
| Iteration number | 500 | Diversity evaluation factor | 0.95 |
| No. of selected front warehouses | No. of demand points it serves | Total costs/NYC | |
| Results obtained by immune algorithm | 12 | 20 21 22 23 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 82 85 |
851,460 |
| 8 | 24 25 34 35 36 37 38 39 40 46 47 48 49 50 51 52 53 57 59 60 61 80 83 84 86 |
||
| 7 | 15 16 17 18 19 26 27 28 29 30 31 32 33 41 42 43 44 45 |
||
| 3 | 1 2 3 4 9 11 12 13 | ||
| 2 | 5 6 7 8 10 | ||
| 4 | 14 | ||
| 10 | 54 55 56 58 | ||
| Results obtained by genetic algorithm | 7 | 15 16 17 18 19 26 27 28 29 30 31 32 33 41 42 43 44 45 |
1,037,230 |
| 12 | 20 21 22 23 63 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 83 84 86 |
||
| 8 | 24 25 34 35 36 37 38 39 40 46 47 48 49 50 51 52 53 57 59 60 61 80 82 85 |
||
| 3 | 1 2 3 9 11 12 13 | ||
| 1 | 4 5 | ||
| 2 | 6 7 8 10 | ||
| 10 | 54 55 56 58 | ||
| 11 | 62 64 | ||
| 4 | 14 |
