# Research on Emergency Logistics Vehicle Route Scheduling and Optimization Method Based on Multi-Intelligent Decision System

Authors: Chenlu Ji; Shuyu Liang; Yating Yu
Journal: Journal of Sensors
 (2022)

---

## Abstract

Logistics distribution vehicle planning is an important issue in logistics transportation activities, and it is also a research hotspot in theoretical circles at home and abroad. At present, many studies have focused on establishing vehicle planning models and optimizing vehicle planning in different environments and have achieved rich results. As an important part of transportation production process, the efficiency of logistics distribution is very important to the whole production process. Especially for emergency logistics, every minute is very critical for emergency situations such as disaster relief. In order to improve the efficiency of emergency logistics, this paper applies multiagent technology to emergency logistics and puts forward an integrated modeling method of enterprise macromodeling, business process mesomodeling, and micromodel design. Using the agent-oriented system development method, an emergency logistics distribution vehicle planning model system is established. The development process of multiagent automatic trading system is described. The results show that it is feasible and effective to use multi-intelligent fuselage technology for emergency logistics distribution vehicle planning and decision-making. The algorithm proposed in this paper has advantages over the container order sequence processing scheme, and the total cost of order acceptance decreases sharply in the initial stage, which shows the practical convergence of the algorithm. The adjacency search method and Tabu search method deal with the calculation of total labor cost, and the Tabu neighborhood search algorithm obtains better results with lower labor cost.


---

## Body

## 1. Introduction

Logistics industry is developing rapidly in the direction of global integration and computerized operation. Logistics distribution is an important link connecting producers and consumers and plays an increasingly important role in the whole supply chain. With the development of social economy and the continuous improvement of people’s demand, logistics distribution gradually has the characteristics of multi-variety, less batch, real time, and customization. A system requires logistics distribution to accurately realize “7R.” Therefore, in addition to designing a reasonable and effective vehicle scheduling scheme according to the existing distribution orders, an important problem of logistics distribution is to dynamically form various real-time distribution schemes to meet people’s needs under the influence of customers’ real needs and random variables, and they need to meet the real and customized needs of real-time logistics distribution customers. As an important part of transportation and production process, logistics distribution is generally considered to include parts, assembly, distribution and other processes. With the rapid development of intensive and integrated logistics, it is necessary to comprehensively consider all aspects of logistics distribution in the research process. Starting with the optimization of logistics distribution system, this paper mainly optimizes the key specific links and technologies [1]. Many scholars believe that the decision of arranging vehicles from logistics distribution is the most important link to optimize logistics distribution system, and it is an indispensable part of the close combination of highly developed intelligent logistics distribution and e-commerce. I think it has attracted the attention of many scholars. The research on intelligent vehicle scheduling technology in foreign countries started earlier and has been widely used in production and life [2]. Relatively speaking, the systematic research on intelligent political decision-making in China’s academic circles is still at a critical stage of continuous exploration, which cannot meet the urgent needs of the rapid development of China’s transportation industry and logistics industry. Especially in China, the research on intelligent decision-making of real-time logistics distribution vehicle dynamic scheduling is still in its initial stage [3]. In recent years, multiagent technology has become a hot issue in the field of artificial intelligence, and it is an important tool in the process of intelligent decision-making [4]. The emergence of technology also provides a research opportunity for scholars in the field of transportation and logistics to study the decision-making of logistics distribution vehicle scheduling system. It has the characteristics of reactivity, preaction, and sociality. In the field of complex problem solving, pattern is a new method to study problems. At the same time, pine is a granular system composed of multiple computing units, and its characteristics of cooperation, parallelism, robustness, scalability, and distributed solution have natural advantages in describing complex dynamic systems [5]. Therefore, it is widely used as a theoretical reference model for constructing various complex dynamic systems and plays an increasingly important role in the field of intelligent decision support systems. On the other hand, for solving complex problems that are difficult to obtain results by traditional methods, we can try to model and coordinate with the latest research theories and decision-making methods. After refining and summarizing the research results obtained by technical means, the theories can be enriched and then extended to other complex systems [6]. Based on the existing research results of logistics distribution vehicle scheduling theory, this paper will use technical means to study logistics distribution vehicle scheduling decision-making methods and provide new technologies and methods for logistics distribution business decision-making management.


## 2. Basic Theory

### 2.1. Overview of Logistics Distribution Vehicle Scheduling

#### 2.1.1. Logistics Distribution and Its Mode

(1)
The concept of logistics distribution [7]: logistics distribution refers to the logistics in which goods are sorted, packaged, divided, and assembled according to the needs of customers in a certain economic and reasonable area and arrived at the designated place in time. It is a link connected with important direct consumers in logistics activities. Distribution is an economic activity based on goods collection and distribution, which uses vehicles to transport according to customers’ needs (such as goods type, quantity, and delivery time). Generally speaking, logistics distribution mainly includes the collection and distribution of goods, the assembly of vehicle-mounted goods, and the definition of distribution channels. The latter two parts are not only important contents of logistics distribution vehicle planning but also important technologies of logistics distribution [8], as shown in Figure 1.(2)
The model of logistics distribution: according to different enterprise entities, logistics distribution can be divided into five modes: individual distribution, outsourcing distribution, joint distribution, mixed distribution, and virtual logistics distribution [9]. Self-distribution means that enterprises establish their own distribution centers according to their own business strategies and scale and rely on their own network systems for distribution, such as the number of goods distributed and the configuration of commercial websites. Outsourcing distribution means that a company does not establish its own distribution center, entrusts other logistics companies to trade in the form of contracts, and establishes long-term strategic alliances with external logistics distribution companies to achieve win-win cooperation. Enterprises adopting outsourcing distribution mode do not need to invest in logistics distribution, which can save a lot of construction resources and management costs, do not have to worry about related processes, and can also enjoy perfect logistics distribution services [10]. More importantly, you can invest important manpower and material resources to improve the core competitiveness of the company. Due to the specialization and globalization of production in many enterprises and multinational companies, logistics distribution is carried out in the form of outsourcing. The specific mode of outsourcing logistics distribution is shown in Figure 2.Figure 1
Schematic diagram of general operation flow of logistics distribution.Figure 2
Outsourcing distribution mode.Joint distribution is also called cooperative distribution. In the past, goods loaded by different vehicles were transported according to the type of goods, which was changed to “intensive goods and distribution,” and all goods were loaded into distribution vehicles for unified distribution. Figure3 shows the effect of codistribution.Figure 3
Effect of codistribution.Mixed distribution means that enterprises establish their own distribution system, and large-scale distribution adopts outsourcing mode of small-scale distribution, which can be implemented by outsourcing distribution companies. Based on this situation, the mixed mode can give full play to the advantages of enterprises in short-distance and long-distance distribution, save costs, and improve enterprise efficiency [11]. In addition, the company can control the distribution of goods and adapt to changes and market demands in time. Virtual logistics distribution mode is a new distribution concept in recent years, which refers to the mode of establishing dynamic alliance and realizing logistics distribution with the concept of virtual enterprise [12]. The specific flow is shown in Figure 4.Figure 4
Virtual logistics distribution process.The key of virtual import mode is that the contact information of the whole distribution system is real-time and accurate, and the adjustment of all connections is synchronized correctly [13]. First of all, it needs the support of advanced computer and network technology.Virtual logistics distribution mode has the advantages of low cost, high efficiency, and good quality assurance. That can make full use of various logistics distribution functions and avoid redundant construction. The main characteristics of virtual logistics distribution are virtualization, economy, flexibility, and efficiency. Virtual logistics distribution is an important direction of logistics development in the future.


#### 2.1.2. Vehicle Scheduling Problem of Logistics Distribution

There are problems related to vehicle programming. Vehicle scheduling problem is the most important part of logistics distribution. For the actual situation of logistics distribution production process, the corresponding vehicle planning problems usually involve the assembly of goods, the level of configuration, and the arrangement of vehicle guidance. Cargo assembly problem is the application and extension of knapsack problem. The problem with the backpack is that the capacity of the backpack is fixed.N objects with different weights Wjj=1,2⋯N,thesamebelow, and P values are selected, and a combination is placed on the backpack to maximize the total value of the items. If an object is selected in the knapsack, the variable x is set to xj=1; otherwise, xj=0. This mathematical model is used to solve the object x=x0,x1⋯xN, resulting in
(1)maxfX=∑j=1Npjxi,s.t.∑j=1Nwjxj≤Wxj∈0,1,j=1,2,3,⋯,N,Among these variables, one and can judge that the search space is2n. Goods assembly is the continuation and development of knapsack problem in logistics distribution vehicle scheduling problem, and it also increases some practical restrictions. The logistics center must follow several principles when deciding the loading scheme of goods distribution. Reasonable abstraction of these principles at a certain theoretical height has become the limiting condition of mathematical model. For example, in order to make full use of the load capacity of the vehicle, the volume and load capacity of the vehicle may be considered. This can be used as a full load limit. Secondly, the total load weight cannot reach the total load capacity of all vehicles, which can be used as a weight limit. Then, the total load shall not exceed the sum of the volumes that can be carried by all vehicles that can be used as vehicle volume limits. In addition, loading cargo can also be combined with light weight, and time priority can be considered to determine the loading limit of cargo. The mathematical model considers multiple objective functions and all constraints simultaneously, which is a multiobjective programming problem [14].The scheduling problem has n people and n things. The cost for a person to do thej-th is Ciji,j=1,⋯,n. People and objects must decide the corresponding distribution scheme, and the total cost of N objects must be controlled within the minimum matrix. C=CijN×N is the assignment of coefficient matrices in the assignment problem. In practical problems, according to the specific meaning of Cij, the meaning of C matrix is also different. The elements in line i represent the cost of doing different things for I people, and the elements in column j represent the cost of doing j things for different people. In fact, the Cij element in matrix C and the cost for i to do J things are taken as grade indices. At this time, the C matrix is called the cost matrix. The essence of general assignment problem is to find the minimum objective function assignment scheme. In order to establish the mathematical model of general assignment problem, it is necessary to import the variable n2.
(2)xij=1,indicatesthattheipersonisassignedtodothejthing,0,otherwise,,Then the mathematical model of general assignment problem is as 2.(3)minf=∑i=1n∑j=1ncijxijs.t.∑i=1nxij=0,j=1,⋯,n5A,∑j=1nxij=1,i=1,⋯,n5B,xij=0or1,i,j=1,⋯,n5C,where min f is the objective function for minimizing the total cost of allocation. 5A,5B,5C are constraints, indicating that the person doing each thing is unique, one person must do only one thing, and the variable is 0 or 1. For any executable solution of the usual allocation problem, each column of the matrix does not have one element to satisfy the constraint 5A. Only one element in each row satisfies the constraint 5B. Usually, the allocation problem is n!, a viable solution. The scheduling of logistics distribution vehicle scheduling problem develops according to the allocation problem. It mainly includes two aspects: one is the cooperation between vehicles and drivers; the other is the matching of vehicle and shipping orders. Specific scheduling problems need to consider more elements than allocation problems, so they may be more complex.


### 2.2. Agent and Multiagent Theory

#### 2.2.1. Concept and Structure of Agent

The concept of agent first appeared in the field of distributed artificial intelligence in 1980s, and its prototype is Hewitt’s agent model. Academic research on agent-related topics is quite in-depth, and the most classic ones are the related “weak definition” and “strong definition” given by others [15].Definition 1 (weak definition).
Intelligent agent is usually a software system with the following characteristics.(1)
Autonomy: It is the ability of agents to operate and control their own behavior or internal state without direct intervention by individuals or other agents.(2)
Social ability: agents can exchange information with other agents through their communication language.(3)
Reaction ability: agents can perceive the environment, react for a certain time, and change the environment through actions.(4)
Activity: different from the instructions which are executed passively and mechanically by users in traditional applications, agent mainly detects and indicates the characteristics of the target automatically according to the changes of the environment.Definition 2 (strong definition).
According to researchers in the field of artificial intelligence intelligent fuselage, in addition to the above characteristics, it should also have the characteristics unique to ordinary people. For example, the abbreviations of belief, desire, intention, and BID, respectively, reflect the thinking state of cognition, emotion, and consciousness of agents. If the above definitions are weak or strong, they basically describe the characteristics of agents.R believes that the Soviet Union and Novig can deal with environmental problems by detecting the environment. Compared with object technology, it presents a higher degree of abstraction. Besides encapsulating attributes, events, and methods, it also provides the ability of thinking and decision-making. It has greater autonomy, stronger objectivity, flexible reactivity, objectivity, and sociality and can reflect the interaction with people.


#### 2.2.2. Concept and Structure of Multiagent

(1)
The concept of MAS: MAS is a system in which some semiautonomous or autonomous agents can communicate with other agents according to the language of a given protocol to solve complex problems. It has the characteristics of cooperation, parallelism, robustness, extensibility, distribution, and flexibility.(2)
The composition of MAS: this diagram shows the standard structure of the system, describes the connection of intelligent agents in the application system, reflects the information and control relationship between intelligent agents, and is used to reflect the distribution mode, information sharing, and storage mode of problem solving ability.The interactive structure of MAS not only affects the free play but also directly affects the performance of the whole application system. It is usually divided into three types: distributed, centralized, and federated [16], as shown in Figure 5.Figure 5
Standard MAS system structure.


#### 2.2.3. Multiagent Communication

The communication between each agent in MAS system is to coordinate their actions to achieve mutual communication and based on communication technology. In order to ensure the smooth communication between agents in the system, it is necessary to solve the communication mechanism, communication language, interaction management, and other related problems.(1)
Session management: realize the session management of both parties to ensure the correct communication content and cooperation process.(2)
Communication mechanism: the communication mechanism of MAS can be classified into low-level transport protocol and high-level dialog protocol. The transmission protocol refers to the low-level transmission mechanism used in communication. Interaction protocol can describe various response possibilities to messages and the basic process of interaction. And there are three kinds of communication institutions: direct communication, broadcast communication, public blackboard system, and federal system.(3)
Communication mechanism: the communication mechanism of MAS can be classified into low-level transport protocol and high-level dialog protocol. The transmission protocol refers to the low-level transmission mechanism used in communication. Interaction protocol can describe various response possibilities to messages and the basic process of interaction. And there are three kinds of communication institutions: direct communication, broadcast communication, public blackboard system, and federal system.Agent Communication Language (ACL) is a high-level language for multi-intelligence coordination negotiation and cooperation which is composed of communication instruction set and related structures. The communication command set and related structure include communication content, message parameters, and message body, and the content of the message body is the purpose of the sender’s communication content. Classical ACL66 includes KQML (Knowledge Queryand Manipulation Language), FIPA Agent Communication Language (FIPA-ALL), and KIF (Knowledge Interchange Format) [17].In the original operation, the target agent knowledge base and multiple license operations in the base are defined. In KQML, the meaning, associated attributes, and convention format of each basic behavior are maintained. There are mainly three types of behavior basic bodies: conversation basic bodies. The primitives of dialogue class are mainly ask everyone, ask if, exclude, ask one, deny and other primitives. Raw intervention and dialog mechanisms are used to intervene in the normal session process, terminate the session prematurely, and change the default session protocol. Original network and service words mainly include recording, broadcasting, and other original words. Through the interaction of messages, the negotiation and cooperation between agents are finally realized. In communication language KQML, the grammar, meaning, and pragmatic rules that both agents should follow in realizing communication between agents in MAS are the intermediates for agents to transmit information and exchange knowledge with each other.


## 2.1. Overview of Logistics Distribution Vehicle Scheduling

### 2.1.1. Logistics Distribution and Its Mode

(1)
The concept of logistics distribution [7]: logistics distribution refers to the logistics in which goods are sorted, packaged, divided, and assembled according to the needs of customers in a certain economic and reasonable area and arrived at the designated place in time. It is a link connected with important direct consumers in logistics activities. Distribution is an economic activity based on goods collection and distribution, which uses vehicles to transport according to customers’ needs (such as goods type, quantity, and delivery time). Generally speaking, logistics distribution mainly includes the collection and distribution of goods, the assembly of vehicle-mounted goods, and the definition of distribution channels. The latter two parts are not only important contents of logistics distribution vehicle planning but also important technologies of logistics distribution [8], as shown in Figure 1.(2)
The model of logistics distribution: according to different enterprise entities, logistics distribution can be divided into five modes: individual distribution, outsourcing distribution, joint distribution, mixed distribution, and virtual logistics distribution [9]. Self-distribution means that enterprises establish their own distribution centers according to their own business strategies and scale and rely on their own network systems for distribution, such as the number of goods distributed and the configuration of commercial websites. Outsourcing distribution means that a company does not establish its own distribution center, entrusts other logistics companies to trade in the form of contracts, and establishes long-term strategic alliances with external logistics distribution companies to achieve win-win cooperation. Enterprises adopting outsourcing distribution mode do not need to invest in logistics distribution, which can save a lot of construction resources and management costs, do not have to worry about related processes, and can also enjoy perfect logistics distribution services [10]. More importantly, you can invest important manpower and material resources to improve the core competitiveness of the company. Due to the specialization and globalization of production in many enterprises and multinational companies, logistics distribution is carried out in the form of outsourcing. The specific mode of outsourcing logistics distribution is shown in Figure 2.Figure 1
Schematic diagram of general operation flow of logistics distribution.Figure 2
Outsourcing distribution mode.Joint distribution is also called cooperative distribution. In the past, goods loaded by different vehicles were transported according to the type of goods, which was changed to “intensive goods and distribution,” and all goods were loaded into distribution vehicles for unified distribution. Figure3 shows the effect of codistribution.Figure 3
Effect of codistribution.Mixed distribution means that enterprises establish their own distribution system, and large-scale distribution adopts outsourcing mode of small-scale distribution, which can be implemented by outsourcing distribution companies. Based on this situation, the mixed mode can give full play to the advantages of enterprises in short-distance and long-distance distribution, save costs, and improve enterprise efficiency [11]. In addition, the company can control the distribution of goods and adapt to changes and market demands in time. Virtual logistics distribution mode is a new distribution concept in recent years, which refers to the mode of establishing dynamic alliance and realizing logistics distribution with the concept of virtual enterprise [12]. The specific flow is shown in Figure 4.Figure 4
Virtual logistics distribution process.The key of virtual import mode is that the contact information of the whole distribution system is real-time and accurate, and the adjustment of all connections is synchronized correctly [13]. First of all, it needs the support of advanced computer and network technology.Virtual logistics distribution mode has the advantages of low cost, high efficiency, and good quality assurance. That can make full use of various logistics distribution functions and avoid redundant construction. The main characteristics of virtual logistics distribution are virtualization, economy, flexibility, and efficiency. Virtual logistics distribution is an important direction of logistics development in the future.


### 2.1.2. Vehicle Scheduling Problem of Logistics Distribution

There are problems related to vehicle programming. Vehicle scheduling problem is the most important part of logistics distribution. For the actual situation of logistics distribution production process, the corresponding vehicle planning problems usually involve the assembly of goods, the level of configuration, and the arrangement of vehicle guidance. Cargo assembly problem is the application and extension of knapsack problem. The problem with the backpack is that the capacity of the backpack is fixed.N objects with different weights Wjj=1,2⋯N,thesamebelow, and P values are selected, and a combination is placed on the backpack to maximize the total value of the items. If an object is selected in the knapsack, the variable x is set to xj=1; otherwise, xj=0. This mathematical model is used to solve the object x=x0,x1⋯xN, resulting in
(1)maxfX=∑j=1Npjxi,s.t.∑j=1Nwjxj≤Wxj∈0,1,j=1,2,3,⋯,N,Among these variables, one and can judge that the search space is2n. Goods assembly is the continuation and development of knapsack problem in logistics distribution vehicle scheduling problem, and it also increases some practical restrictions. The logistics center must follow several principles when deciding the loading scheme of goods distribution. Reasonable abstraction of these principles at a certain theoretical height has become the limiting condition of mathematical model. For example, in order to make full use of the load capacity of the vehicle, the volume and load capacity of the vehicle may be considered. This can be used as a full load limit. Secondly, the total load weight cannot reach the total load capacity of all vehicles, which can be used as a weight limit. Then, the total load shall not exceed the sum of the volumes that can be carried by all vehicles that can be used as vehicle volume limits. In addition, loading cargo can also be combined with light weight, and time priority can be considered to determine the loading limit of cargo. The mathematical model considers multiple objective functions and all constraints simultaneously, which is a multiobjective programming problem [14].The scheduling problem has n people and n things. The cost for a person to do thej-th is Ciji,j=1,⋯,n. People and objects must decide the corresponding distribution scheme, and the total cost of N objects must be controlled within the minimum matrix. C=CijN×N is the assignment of coefficient matrices in the assignment problem. In practical problems, according to the specific meaning of Cij, the meaning of C matrix is also different. The elements in line i represent the cost of doing different things for I people, and the elements in column j represent the cost of doing j things for different people. In fact, the Cij element in matrix C and the cost for i to do J things are taken as grade indices. At this time, the C matrix is called the cost matrix. The essence of general assignment problem is to find the minimum objective function assignment scheme. In order to establish the mathematical model of general assignment problem, it is necessary to import the variable n2.
(2)xij=1,indicatesthattheipersonisassignedtodothejthing,0,otherwise,,Then the mathematical model of general assignment problem is as 2.(3)minf=∑i=1n∑j=1ncijxijs.t.∑i=1nxij=0,j=1,⋯,n5A,∑j=1nxij=1,i=1,⋯,n5B,xij=0or1,i,j=1,⋯,n5C,where min f is the objective function for minimizing the total cost of allocation. 5A,5B,5C are constraints, indicating that the person doing each thing is unique, one person must do only one thing, and the variable is 0 or 1. For any executable solution of the usual allocation problem, each column of the matrix does not have one element to satisfy the constraint 5A. Only one element in each row satisfies the constraint 5B. Usually, the allocation problem is n!, a viable solution. The scheduling of logistics distribution vehicle scheduling problem develops according to the allocation problem. It mainly includes two aspects: one is the cooperation between vehicles and drivers; the other is the matching of vehicle and shipping orders. Specific scheduling problems need to consider more elements than allocation problems, so they may be more complex.


## 2.1.1. Logistics Distribution and Its Mode

(1)
The concept of logistics distribution [7]: logistics distribution refers to the logistics in which goods are sorted, packaged, divided, and assembled according to the needs of customers in a certain economic and reasonable area and arrived at the designated place in time. It is a link connected with important direct consumers in logistics activities. Distribution is an economic activity based on goods collection and distribution, which uses vehicles to transport according to customers’ needs (such as goods type, quantity, and delivery time). Generally speaking, logistics distribution mainly includes the collection and distribution of goods, the assembly of vehicle-mounted goods, and the definition of distribution channels. The latter two parts are not only important contents of logistics distribution vehicle planning but also important technologies of logistics distribution [8], as shown in Figure 1.(2)
The model of logistics distribution: according to different enterprise entities, logistics distribution can be divided into five modes: individual distribution, outsourcing distribution, joint distribution, mixed distribution, and virtual logistics distribution [9]. Self-distribution means that enterprises establish their own distribution centers according to their own business strategies and scale and rely on their own network systems for distribution, such as the number of goods distributed and the configuration of commercial websites. Outsourcing distribution means that a company does not establish its own distribution center, entrusts other logistics companies to trade in the form of contracts, and establishes long-term strategic alliances with external logistics distribution companies to achieve win-win cooperation. Enterprises adopting outsourcing distribution mode do not need to invest in logistics distribution, which can save a lot of construction resources and management costs, do not have to worry about related processes, and can also enjoy perfect logistics distribution services [10]. More importantly, you can invest important manpower and material resources to improve the core competitiveness of the company. Due to the specialization and globalization of production in many enterprises and multinational companies, logistics distribution is carried out in the form of outsourcing. The specific mode of outsourcing logistics distribution is shown in Figure 2.Figure 1
Schematic diagram of general operation flow of logistics distribution.Figure 2
Outsourcing distribution mode.Joint distribution is also called cooperative distribution. In the past, goods loaded by different vehicles were transported according to the type of goods, which was changed to “intensive goods and distribution,” and all goods were loaded into distribution vehicles for unified distribution. Figure3 shows the effect of codistribution.Figure 3
Effect of codistribution.Mixed distribution means that enterprises establish their own distribution system, and large-scale distribution adopts outsourcing mode of small-scale distribution, which can be implemented by outsourcing distribution companies. Based on this situation, the mixed mode can give full play to the advantages of enterprises in short-distance and long-distance distribution, save costs, and improve enterprise efficiency [11]. In addition, the company can control the distribution of goods and adapt to changes and market demands in time. Virtual logistics distribution mode is a new distribution concept in recent years, which refers to the mode of establishing dynamic alliance and realizing logistics distribution with the concept of virtual enterprise [12]. The specific flow is shown in Figure 4.Figure 4
Virtual logistics distribution process.The key of virtual import mode is that the contact information of the whole distribution system is real-time and accurate, and the adjustment of all connections is synchronized correctly [13]. First of all, it needs the support of advanced computer and network technology.Virtual logistics distribution mode has the advantages of low cost, high efficiency, and good quality assurance. That can make full use of various logistics distribution functions and avoid redundant construction. The main characteristics of virtual logistics distribution are virtualization, economy, flexibility, and efficiency. Virtual logistics distribution is an important direction of logistics development in the future.


## 2.1.2. Vehicle Scheduling Problem of Logistics Distribution

There are problems related to vehicle programming. Vehicle scheduling problem is the most important part of logistics distribution. For the actual situation of logistics distribution production process, the corresponding vehicle planning problems usually involve the assembly of goods, the level of configuration, and the arrangement of vehicle guidance. Cargo assembly problem is the application and extension of knapsack problem. The problem with the backpack is that the capacity of the backpack is fixed.N objects with different weights Wjj=1,2⋯N,thesamebelow, and P values are selected, and a combination is placed on the backpack to maximize the total value of the items. If an object is selected in the knapsack, the variable x is set to xj=1; otherwise, xj=0. This mathematical model is used to solve the object x=x0,x1⋯xN, resulting in
(1)maxfX=∑j=1Npjxi,s.t.∑j=1Nwjxj≤Wxj∈0,1,j=1,2,3,⋯,N,Among these variables, one and can judge that the search space is2n. Goods assembly is the continuation and development of knapsack problem in logistics distribution vehicle scheduling problem, and it also increases some practical restrictions. The logistics center must follow several principles when deciding the loading scheme of goods distribution. Reasonable abstraction of these principles at a certain theoretical height has become the limiting condition of mathematical model. For example, in order to make full use of the load capacity of the vehicle, the volume and load capacity of the vehicle may be considered. This can be used as a full load limit. Secondly, the total load weight cannot reach the total load capacity of all vehicles, which can be used as a weight limit. Then, the total load shall not exceed the sum of the volumes that can be carried by all vehicles that can be used as vehicle volume limits. In addition, loading cargo can also be combined with light weight, and time priority can be considered to determine the loading limit of cargo. The mathematical model considers multiple objective functions and all constraints simultaneously, which is a multiobjective programming problem [14].The scheduling problem has n people and n things. The cost for a person to do thej-th is Ciji,j=1,⋯,n. People and objects must decide the corresponding distribution scheme, and the total cost of N objects must be controlled within the minimum matrix. C=CijN×N is the assignment of coefficient matrices in the assignment problem. In practical problems, according to the specific meaning of Cij, the meaning of C matrix is also different. The elements in line i represent the cost of doing different things for I people, and the elements in column j represent the cost of doing j things for different people. In fact, the Cij element in matrix C and the cost for i to do J things are taken as grade indices. At this time, the C matrix is called the cost matrix. The essence of general assignment problem is to find the minimum objective function assignment scheme. In order to establish the mathematical model of general assignment problem, it is necessary to import the variable n2.
(2)xij=1,indicatesthattheipersonisassignedtodothejthing,0,otherwise,,Then the mathematical model of general assignment problem is as 2.(3)minf=∑i=1n∑j=1ncijxijs.t.∑i=1nxij=0,j=1,⋯,n5A,∑j=1nxij=1,i=1,⋯,n5B,xij=0or1,i,j=1,⋯,n5C,where min f is the objective function for minimizing the total cost of allocation. 5A,5B,5C are constraints, indicating that the person doing each thing is unique, one person must do only one thing, and the variable is 0 or 1. For any executable solution of the usual allocation problem, each column of the matrix does not have one element to satisfy the constraint 5A. Only one element in each row satisfies the constraint 5B. Usually, the allocation problem is n!, a viable solution. The scheduling of logistics distribution vehicle scheduling problem develops according to the allocation problem. It mainly includes two aspects: one is the cooperation between vehicles and drivers; the other is the matching of vehicle and shipping orders. Specific scheduling problems need to consider more elements than allocation problems, so they may be more complex.


## 2.2. Agent and Multiagent Theory

### 2.2.1. Concept and Structure of Agent

The concept of agent first appeared in the field of distributed artificial intelligence in 1980s, and its prototype is Hewitt’s agent model. Academic research on agent-related topics is quite in-depth, and the most classic ones are the related “weak definition” and “strong definition” given by others [15].Definition 1 (weak definition).
Intelligent agent is usually a software system with the following characteristics.(1)
Autonomy: It is the ability of agents to operate and control their own behavior or internal state without direct intervention by individuals or other agents.(2)
Social ability: agents can exchange information with other agents through their communication language.(3)
Reaction ability: agents can perceive the environment, react for a certain time, and change the environment through actions.(4)
Activity: different from the instructions which are executed passively and mechanically by users in traditional applications, agent mainly detects and indicates the characteristics of the target automatically according to the changes of the environment.Definition 2 (strong definition).
According to researchers in the field of artificial intelligence intelligent fuselage, in addition to the above characteristics, it should also have the characteristics unique to ordinary people. For example, the abbreviations of belief, desire, intention, and BID, respectively, reflect the thinking state of cognition, emotion, and consciousness of agents. If the above definitions are weak or strong, they basically describe the characteristics of agents.R believes that the Soviet Union and Novig can deal with environmental problems by detecting the environment. Compared with object technology, it presents a higher degree of abstraction. Besides encapsulating attributes, events, and methods, it also provides the ability of thinking and decision-making. It has greater autonomy, stronger objectivity, flexible reactivity, objectivity, and sociality and can reflect the interaction with people.


### 2.2.2. Concept and Structure of Multiagent

(1)
The concept of MAS: MAS is a system in which some semiautonomous or autonomous agents can communicate with other agents according to the language of a given protocol to solve complex problems. It has the characteristics of cooperation, parallelism, robustness, extensibility, distribution, and flexibility.(2)
The composition of MAS: this diagram shows the standard structure of the system, describes the connection of intelligent agents in the application system, reflects the information and control relationship between intelligent agents, and is used to reflect the distribution mode, information sharing, and storage mode of problem solving ability.The interactive structure of MAS not only affects the free play but also directly affects the performance of the whole application system. It is usually divided into three types: distributed, centralized, and federated [16], as shown in Figure 5.Figure 5
Standard MAS system structure.


### 2.2.3. Multiagent Communication

The communication between each agent in MAS system is to coordinate their actions to achieve mutual communication and based on communication technology. In order to ensure the smooth communication between agents in the system, it is necessary to solve the communication mechanism, communication language, interaction management, and other related problems.(1)
Session management: realize the session management of both parties to ensure the correct communication content and cooperation process.(2)
Communication mechanism: the communication mechanism of MAS can be classified into low-level transport protocol and high-level dialog protocol. The transmission protocol refers to the low-level transmission mechanism used in communication. Interaction protocol can describe various response possibilities to messages and the basic process of interaction. And there are three kinds of communication institutions: direct communication, broadcast communication, public blackboard system, and federal system.(3)
Communication mechanism: the communication mechanism of MAS can be classified into low-level transport protocol and high-level dialog protocol. The transmission protocol refers to the low-level transmission mechanism used in communication. Interaction protocol can describe various response possibilities to messages and the basic process of interaction. And there are three kinds of communication institutions: direct communication, broadcast communication, public blackboard system, and federal system.Agent Communication Language (ACL) is a high-level language for multi-intelligence coordination negotiation and cooperation which is composed of communication instruction set and related structures. The communication command set and related structure include communication content, message parameters, and message body, and the content of the message body is the purpose of the sender’s communication content. Classical ACL66 includes KQML (Knowledge Queryand Manipulation Language), FIPA Agent Communication Language (FIPA-ALL), and KIF (Knowledge Interchange Format) [17].In the original operation, the target agent knowledge base and multiple license operations in the base are defined. In KQML, the meaning, associated attributes, and convention format of each basic behavior are maintained. There are mainly three types of behavior basic bodies: conversation basic bodies. The primitives of dialogue class are mainly ask everyone, ask if, exclude, ask one, deny and other primitives. Raw intervention and dialog mechanisms are used to intervene in the normal session process, terminate the session prematurely, and change the default session protocol. Original network and service words mainly include recording, broadcasting, and other original words. Through the interaction of messages, the negotiation and cooperation between agents are finally realized. In communication language KQML, the grammar, meaning, and pragmatic rules that both agents should follow in realizing communication between agents in MAS are the intermediates for agents to transmit information and exchange knowledge with each other.


## 2.2.1. Concept and Structure of Agent

The concept of agent first appeared in the field of distributed artificial intelligence in 1980s, and its prototype is Hewitt’s agent model. Academic research on agent-related topics is quite in-depth, and the most classic ones are the related “weak definition” and “strong definition” given by others [15].Definition 1 (weak definition).
Intelligent agent is usually a software system with the following characteristics.(1)
Autonomy: It is the ability of agents to operate and control their own behavior or internal state without direct intervention by individuals or other agents.(2)
Social ability: agents can exchange information with other agents through their communication language.(3)
Reaction ability: agents can perceive the environment, react for a certain time, and change the environment through actions.(4)
Activity: different from the instructions which are executed passively and mechanically by users in traditional applications, agent mainly detects and indicates the characteristics of the target automatically according to the changes of the environment.Definition 2 (strong definition).
According to researchers in the field of artificial intelligence intelligent fuselage, in addition to the above characteristics, it should also have the characteristics unique to ordinary people. For example, the abbreviations of belief, desire, intention, and BID, respectively, reflect the thinking state of cognition, emotion, and consciousness of agents. If the above definitions are weak or strong, they basically describe the characteristics of agents.R believes that the Soviet Union and Novig can deal with environmental problems by detecting the environment. Compared with object technology, it presents a higher degree of abstraction. Besides encapsulating attributes, events, and methods, it also provides the ability of thinking and decision-making. It has greater autonomy, stronger objectivity, flexible reactivity, objectivity, and sociality and can reflect the interaction with people.


## 2.2.2. Concept and Structure of Multiagent

(1)
The concept of MAS: MAS is a system in which some semiautonomous or autonomous agents can communicate with other agents according to the language of a given protocol to solve complex problems. It has the characteristics of cooperation, parallelism, robustness, extensibility, distribution, and flexibility.(2)
The composition of MAS: this diagram shows the standard structure of the system, describes the connection of intelligent agents in the application system, reflects the information and control relationship between intelligent agents, and is used to reflect the distribution mode, information sharing, and storage mode of problem solving ability.The interactive structure of MAS not only affects the free play but also directly affects the performance of the whole application system. It is usually divided into three types: distributed, centralized, and federated [16], as shown in Figure 5.Figure 5
Standard MAS system structure.


## 2.2.3. Multiagent Communication

The communication between each agent in MAS system is to coordinate their actions to achieve mutual communication and based on communication technology. In order to ensure the smooth communication between agents in the system, it is necessary to solve the communication mechanism, communication language, interaction management, and other related problems.(1)
Session management: realize the session management of both parties to ensure the correct communication content and cooperation process.(2)
Communication mechanism: the communication mechanism of MAS can be classified into low-level transport protocol and high-level dialog protocol. The transmission protocol refers to the low-level transmission mechanism used in communication. Interaction protocol can describe various response possibilities to messages and the basic process of interaction. And there are three kinds of communication institutions: direct communication, broadcast communication, public blackboard system, and federal system.(3)
Communication mechanism: the communication mechanism of MAS can be classified into low-level transport protocol and high-level dialog protocol. The transmission protocol refers to the low-level transmission mechanism used in communication. Interaction protocol can describe various response possibilities to messages and the basic process of interaction. And there are three kinds of communication institutions: direct communication, broadcast communication, public blackboard system, and federal system.Agent Communication Language (ACL) is a high-level language for multi-intelligence coordination negotiation and cooperation which is composed of communication instruction set and related structures. The communication command set and related structure include communication content, message parameters, and message body, and the content of the message body is the purpose of the sender’s communication content. Classical ACL66 includes KQML (Knowledge Queryand Manipulation Language), FIPA Agent Communication Language (FIPA-ALL), and KIF (Knowledge Interchange Format) [17].In the original operation, the target agent knowledge base and multiple license operations in the base are defined. In KQML, the meaning, associated attributes, and convention format of each basic behavior are maintained. There are mainly three types of behavior basic bodies: conversation basic bodies. The primitives of dialogue class are mainly ask everyone, ask if, exclude, ask one, deny and other primitives. Raw intervention and dialog mechanisms are used to intervene in the normal session process, terminate the session prematurely, and change the default session protocol. Original network and service words mainly include recording, broadcasting, and other original words. Through the interaction of messages, the negotiation and cooperation between agents are finally realized. In communication language KQML, the grammar, meaning, and pragmatic rules that both agents should follow in realizing communication between agents in MAS are the intermediates for agents to transmit information and exchange knowledge with each other.


## 3. Multiagent Modeling of Logistics Distribution Vehicle Scheduling

Agent is an idea and method to describe the world. In the research field of logistics vehicle planning and distribution, different levels of agents can be used to describe and express. This section simulates the scheduling of logistics transportation vehicles from macro-, meso-, and microaspects. On the macrolevel, using the theory of virtual logistics and business modeling, this paper constructs a business model of virtual logistics distribution and expounds it from four aspects: function, information, resources, and organizational vision. At the middle level, on the basis of analyzing the workflow of logistics distribution vehicle planning, the workflow model of logistics distribution vehicle planning is strengthened by using workflow theory and agent technology. At the microcosmic level, the classification of agents in MAS logistics transportation vehicle scheduling system and the general structure and expression method of agent model are defined in detail. All kinds of models constructed by the above methods lay a basic framework and implementation platform for future research.


### 3.1. Agent Model Framework

The MAS system for planning logistics distribution vehicles should clarify the hierarchical structure of each component according to the previous macro- and mesoagent modeling. At the same time, each system configuration agent should decompose the current logistics distribution vehicle planning system into several entities, encapsulate these entities into agents, and then establish an agent system model [18].Nowadays, individual agent modeling methods are mainly divided into function-based modeling methods and physics-based modeling methods. According to the present situation of logistics distribution vehicle planning system, this document adopts the method of combining functional modeling with physical modeling, which involves the management of physical entities such as vehicles, transportation orders and road network information, and the planning process of distribution centers and logistics distribution vehicles. Logical entities (such as planning) are uniformly decomposed into four different types of agents: management agents, task agents, resource agents, and computer agents.(1)
Management agent: manage agent monitors and processes global information, including order division, order cancellation, order modification, and planning. Let the management agent be responsible for the management, supervision, and control of the whole logistics distribution vehicle planning system. And in the case of emergency orders, the management agent will develop basic knowledge rules according to the plan, which will be used to improve the priority of emergency orders.(2)
Task-based agent: task-based agent maps the activities in the current logistics distribution vehicle planning system. The planning layer maps the distribution plan, and the operation layer maps the transportation order acceptance activities. The task agent will be dynamically generated here and then select the appropriate resources to complete its own processing and monitor the smooth execution of the task.(3)
Resource-based proxy: the asset type agent should be mapped to a unit or combination of units that can perform at least one function in the actual logistics distribution system. For example, a company’s transportation department may provide its vehicles (teams), road network information, capabilities, status, task requirements, and environmental information provided by third-party vehicle platforms (teams) and other companies, judge current activities, and monitor resource status and activity implementation.(4)
Computer agent: computing agent mapping is based on the Tabu search algorithm, neural network, genetic algorithm, and immune algorithm to determine whether it can solve the problem.Among the above four agents, agents can also be divided into entity agents and process agents in other ways. The first three belong to entity agents, and the last belongs to process agents. By using two agents, the functional flexibility of intelligent multilogistics distribution vehicle scheduling system can be improved.As shown in Figure6, in the process of logistics distribution vehicle scheduling, logistics distribution companies reasonably correspond to vehicles and transportation orders according to existing available vehicles and road network. Road transport information can be collected using the electronic map service of real-time Internet proxy. Here, the logistics distribution process of vehicle dispatching business is simplified as much as possible. The main objects of logistics distribution vehicle scheduling only include transportation order agent, vehicle agent, and road network information agent. Management objects and logical entities include coordination agent and vehicle scheduling agent, and the process of building agent structure model is described. In Figure 6, the coordination agent belongs to the management agent, the transportation receiving agent belongs to the task agent, the vehicle agent and the road network information agent belong to the resource agent, and the vehicle scheduling agent belongs to the calculation agent.Figure 6
Agent framework of vehicle scheduling business process.This graph only considers the negotiation between the vehicle scheduling agent and the vehicle agent, which simplifies the coordination process between the vehicle fleet agent and the vehicle agent. The vehicle agent directly negotiates the information of the transportation order with the agent dispatching the vehicle. The coordinating agent shall be regarded as the general agent provided in the system. Of course, agents will be generated dynamically in real time during the running of MAS system, but there is no specific analysis here.


## 3.1. Agent Model Framework

The MAS system for planning logistics distribution vehicles should clarify the hierarchical structure of each component according to the previous macro- and mesoagent modeling. At the same time, each system configuration agent should decompose the current logistics distribution vehicle planning system into several entities, encapsulate these entities into agents, and then establish an agent system model [18].Nowadays, individual agent modeling methods are mainly divided into function-based modeling methods and physics-based modeling methods. According to the present situation of logistics distribution vehicle planning system, this document adopts the method of combining functional modeling with physical modeling, which involves the management of physical entities such as vehicles, transportation orders and road network information, and the planning process of distribution centers and logistics distribution vehicles. Logical entities (such as planning) are uniformly decomposed into four different types of agents: management agents, task agents, resource agents, and computer agents.(1)
Management agent: manage agent monitors and processes global information, including order division, order cancellation, order modification, and planning. Let the management agent be responsible for the management, supervision, and control of the whole logistics distribution vehicle planning system. And in the case of emergency orders, the management agent will develop basic knowledge rules according to the plan, which will be used to improve the priority of emergency orders.(2)
Task-based agent: task-based agent maps the activities in the current logistics distribution vehicle planning system. The planning layer maps the distribution plan, and the operation layer maps the transportation order acceptance activities. The task agent will be dynamically generated here and then select the appropriate resources to complete its own processing and monitor the smooth execution of the task.(3)
Resource-based proxy: the asset type agent should be mapped to a unit or combination of units that can perform at least one function in the actual logistics distribution system. For example, a company’s transportation department may provide its vehicles (teams), road network information, capabilities, status, task requirements, and environmental information provided by third-party vehicle platforms (teams) and other companies, judge current activities, and monitor resource status and activity implementation.(4)
Computer agent: computing agent mapping is based on the Tabu search algorithm, neural network, genetic algorithm, and immune algorithm to determine whether it can solve the problem.Among the above four agents, agents can also be divided into entity agents and process agents in other ways. The first three belong to entity agents, and the last belongs to process agents. By using two agents, the functional flexibility of intelligent multilogistics distribution vehicle scheduling system can be improved.As shown in Figure6, in the process of logistics distribution vehicle scheduling, logistics distribution companies reasonably correspond to vehicles and transportation orders according to existing available vehicles and road network. Road transport information can be collected using the electronic map service of real-time Internet proxy. Here, the logistics distribution process of vehicle dispatching business is simplified as much as possible. The main objects of logistics distribution vehicle scheduling only include transportation order agent, vehicle agent, and road network information agent. Management objects and logical entities include coordination agent and vehicle scheduling agent, and the process of building agent structure model is described. In Figure 6, the coordination agent belongs to the management agent, the transportation receiving agent belongs to the task agent, the vehicle agent and the road network information agent belong to the resource agent, and the vehicle scheduling agent belongs to the calculation agent.Figure 6
Agent framework of vehicle scheduling business process.This graph only considers the negotiation between the vehicle scheduling agent and the vehicle agent, which simplifies the coordination process between the vehicle fleet agent and the vehicle agent. The vehicle agent directly negotiates the information of the transportation order with the agent dispatching the vehicle. The coordinating agent shall be regarded as the general agent provided in the system. Of course, agents will be generated dynamically in real time during the running of MAS system, but there is no specific analysis here.


## 4. Task Matching and Method of Multiagent Logistics Distribution Vehicle Scheduling

This section mainly studies the decomposition and matching methods of logistics distribution vehicle scheduling tasks. This paper focuses on how to combine the (personnel) vehicles needed to complete the distribution tasks with the distribution tasks on the basis of task decomposition. This section first introduces the task of planning logistics distribution vehicles and then decomposes the task of planning logistics distribution vehicles with reference to the method and thought of Labor Distribution Structure (WBS) in project management and puts forward the decomposition strategy of vehicle logistics distribution tasks and the planning ideas of corresponding tasks. Finally, the selection and evaluation method of vehicle (personnel) transportation request and corresponding relationship is proposed under the condition of incomplete actual information, and it is integrated into the logistics distribution vehicle scheduling system. An example is given to verify the effectiveness of this method, and the effectiveness of this method in transportation sequence and vehicle or personnel communication is illustrated.


### 4.1. Logistics Distribution Vehicle Scheduling Task Analysis

Logistics distribution center has irreplaceable special significance in logistics network system, so it must have the following basic logistics functions:(i)
Storage function: this mainly stores and maintains items that can be received in real time when needed.(ii)
Commodity adjustment function: the cyclical and seasonal changes of commodity demand can receive related commodities in different periods according to the adjustment of commodities.(iii)
Distribution and sale function: marketing methods related to commodity flow can be used to promote the flow of goods in the market.(iv)
Information management function: logistics distribution center is usually the central node of information processing and processing. It can play the role of central nervous system in the whole logistics process.(v)
Commodity distribution function: this is also the core and basic function of logistics distribution center. I guarantee that the goods will be delivered to the designated customers as required.Generally speaking, the workflow of logistics distribution center can be summarized as shown in Figure7.Figure 7
Schematic diagram of operation flow of logistics distribution center.Especially as a part of logistics distribution, the further decomposition of logistics distribution business shows that logistics distribution vehicle planning is a very important part of logistics distribution. In logistics distribution center, upstream manufacturing companies and parts wholesalers can collect, store, and spare parts through goods. Logistics distribution is a part of vehicle scheduling, which usually considers three tasks, including vehicle scheduling, scheduling, and obtaining road information. In the process of transporting vehicles and personnel, it is necessary to investigate the corresponding relationship between orders and vehicles or drivers and vehicle tasks. Ultimately, the problem lies in the choice of partners, whose selection methods and ideas are basically the same. The vehicle planning scheme of logistics distribution obtains the vehicle driving scheme through certain decision-making methods on the basis of obtaining relevant road information. The schematic diagram of logistics distribution vehicle planning in logistics distribution center is shown in Figure8.Figure 8
Schematic diagram of logistics distribution vehicle scheduling task.According to the above analysis ideas, we introduce the Labor Distribution Structure (WBS) method into the project management and further analyze the planning activities of logistics distribution vehicles.


### 4.2. Task Decomposition

#### 4.2.1. Work Breakdown Structure

Work sharing structure (WBS) decomposes upper functional entities into upper subitems in the tree structure and then gradually decomposes them into independent work units. This is a project management tool that determines the tasks and tasks that each unit can perform and makes the project organization more effective. WBS theory is based on cybernetics, informatics, systems engineering, and so on. WBS can also be defined as a process to achieve a specific goal. The project will go from big activities to small activities, and all activities to be completed will be organized in a certain order. WBS’s idea was originally proposed by the US Office of Defense Finance for the procurement and management of large-scale equipment procurement projects. The original WBS is limited to the product itself. Now, it has been renovated throughout the project life cycle. It is the main tool frequently used in project management [19].As a core tool in the project management process, WBS is scientific and requires you to follow certain rules. In a word, the principles to be followed include the following aspects.(1)
The content should be consistent with the project (task), and the necessary components should not be disclosed. For each unitX, if it is decomposed into lower-level units X1,X2,⋯,Xn, the following conditions should be met:(4)X=X1⋃X2⋃⋯⋃Xi⋃⋯⋃Xn,(5)Xi⋃Xj=∅i≠j.The sum of the costs ofX1,X2,⋯,Xn of equations (4) and (5) is equal to the total cost of X, that is,
(6)CX=∑CXi,The duration ofX is the combined duration of X1,X2,⋯,Xn(2)
The decomposition of the working structure needs to ensure that it is linear. The Unit of Work X may belong to one of the Upper UnitX and two or more Upper Units X and Y that are not allowed to intersect.(7)Xi⊂X,Xi⊄Y(3)
Cells at the same level should have the same attributes. For example,X1,X2,⋯,Xn are all represented as functions, or all as elements, or all implementation procedures(4)
Ensure that the interface is clear and the responsibilities are clear. For each work unit, we need to be able to distinguish different work contents and different principles. Each project unit needs relatively strong independence and integrity. Control the interface and operation responsibility between each operation unit to a minimum and make it clear. Only in this way can we promote the concrete decomposition and implementation of the objectives and responsibilities of each project and promote the assessment of results and the analysis of responsibilities(5)
Flexibility should be ensured. The breakdown of work structure should promote the expansion of project scope and content and change the project structure in real time


#### 4.2.2. Project Task Decomposition Process

Because of the characteristics of project management under the environment of logistics distribution vehicle planning and the actual needs in the process of logistics distribution operation, this paper proposes a top-down and bottom-up project activity decomposition method. The decomposition process is shown in Figure9.Figure 9
Project decomposition process of logistics distribution enterprises.According to the above design task decomposition method and the logistics distribution process analyzed before, Figure9 shows the work breakdown structure of logistics Distribution Company after project decomposition (we only decompose into subprojects, which can be subdivided into atomic projects). In addition, the decomposition of projects is different from the value analysis activities here. The latter involves extracting only a part of the target process, finding the main value-added activities in the target process, and eliminating the activities without value-added. The first method decomposes all project processes into independent and measurable activities and organizes the implementation of the project. The finer the granularity of the final decomposition of the project, the easier it is to create a plan. The divided activities are used for value analysis, which can control decision-making and project funds.


### 4.3. Mathematical Modeling of Vehicle Scheduling

In order to process the work order, the tractor must first run to the departure place for loading and unloading and meet the operation time window limit of the departure place. The tractor should wait for the operation time window to allow the container to be loaded into the tractor; after the operation is completed, the vehicle can drive to the destination. At the destination, loading and unloading operations must also be carried out within the allowed time.From Figure10, we can see that each marked node represents a task order, and each dotted line sequence guided by the trailer represents a sequence of orders completed by the trailer in sequence. Each arc does not represent the actual geographical connection, but represents the order for processing the order.Figure 10
Conceptual model of vehicle scheduling in container port without central node.In order to establish a mathematical model, we assume that only two types of 20-foot and 40-foot boxes suitable for the United Nations are considered. Assuming that 20 feet and 40 feet are treated equally, each trailer can only carry one container. Different cash types will not affect the plan before and after the plan, but they are different in cost calculation. Each trailer has a predefined maximum working time or maximum number of orders processed. Each work instruction must meet all relevant working time limits. Only one tractor can be accessed at each node. All work orders for other lead-free vehicles are stored in Series 0.The following are the decision variables:Xikm∈0,1,i∈1,⋯,N;k∈1,⋯,k;m∈1,⋯,m. Set Xikm−1 when the work order i of the k trailer is scheduled for the m processing operation; otherwise, take 0.Xio∈0,1,i∈1,⋯,N. Set Xio=1 when work order i is outsourced to a leased vehicle (where 0 represents another shipping company); otherwise, take O.Wkm1m∈1,⋯,m;k∈1,⋯,k represents the waiting time of the k trailer for the m-th run at the departure point.Wkm2m∈1,⋯,m;k∈1,⋯,k represents the waiting time of the k-th trailer for the m-th run at the destination.The following are the parameters:N denotes the number of jobs; k represents the number of tractors; M represents the maximum number of work orders that a car can handle in one day; Pi represents the cost of completing work order I with one’s own vehicle, i≠1,⋯,n; Si represents the cost required for the leased vehicle to complete the operating instruction i, i≠1,⋯,n; Tmk0 indicates the start time of the m-th operation of the k-th trailer; Tmk1 represents the start time of the k-th trailer and the m-th operation to reach the destination; Tmk2 represents the last time of the m-th operation of the k-th trailer; Dij represents the running time of the trailer from the destination of job i to the departure place of job j; Di represents the running time of the trailer from the beginning to the end of the i-th operation; Hi1 represents the processing time of the first job at the starting site; Hi2 denotes the processing time of the i-th operation at the destination; Ri0 represents the start time of the i-th operation and the start time of the operation time window; Ri1 represents the start and end times of the i-th operation; Ri2 refers to the start time of the operation time window at the end of operation i; Ri3 represents the final arrival time of the operation time window at the end of operation i; Ak0 indicates the start time of the available time of the tractor; AK1 denotes the available time and end time of the tractor.The time sequence of them-th operation of the k-th trailer is shown in the figure. Establish the following mathematical model:
(8)Minimize∑i=1NPi∑k=1K∑m=1MXikm+∑i=1NSiXi0(9)s.t.∑k=1K∑m=1MXikm+Xi0=1,fori∈1,⋯,N,(10)∑i=1NXikm+1≤∑m=1MXikm≤1,fork∈1,⋯,kandm∈1,⋯,M-1,(11)Tm+1k0=Tmk2,fork∈1,⋯,kandm∈1,⋯,M-1,(12)Tmk1=Tmk0+∑i=1,j=1i≠jMXikmXjkm−1Dji+Hi1+Wmk1,fork∈1,⋯,kandm∈1,⋯,M,(13)Tmk2=Tmk1+∑i=1NXikmDi+Hi2+Wmk2,fork∈1,⋯,kandm∈1,⋯,M,(14)Ak0≤Tmk0≤Ak1-Tmk2-Tmk0,fork∈1,⋯,kandm∈1,⋯,M,(15)Ri0=∑k=1K∑m=1MXikmTmk1-Hi1+Xi0Ri0≤Ri1,fori∈1,⋯,N,(16)Ri2=∑k=1K∑m=1MXikmTmk2-Hi2+Xi0Ri2≤Ri3,fori∈1,⋯,N.Here, Formula (8) is the objective function, which means that the total cost is the lowest, which is p for the same job. It is usually smaller than the S, which means it is more costly to complete on your own vehicle than to outsource a rental vehicle. Formula (9) indicates that each operation can only be assigned once. Formula (10) indicates that all operations must be arranged in an orderly manner on a specific tractor. Formulas (11) to (12) represent time series limits for each operation, Formula (13) indicates that all operations must be completed within the working time available to the tractor, and Formulas (14) and (15) represent time window limits at start and end, respectively.


### 4.4. Tabu Search Algorithm and Exchange Neighborhood Search Algorithm

Tabu search (TS) was first proposed by Glover, which is an extension of local neighborhood search. It is not only a global sequence optimization algorithm but also a simulation of human intelligent process. TS adopts the idea of local neighborhood search. In addition, the Tabu policy corresponding to flexible storage structure is introduced, Tabu and Tabu objects are defined, and some objects corresponding to the optimal local solution of recovery are marked instead of absolutely prohibiting loops. Avoid these objects as much as possible in additional iterative searches. The algorithm combines the characteristics of avoiding search deviation. Make sure there are different valid search paths. At the same time, set standards to despise, reward, and forgive various states. Tabu search is mainly used to solve various vehicle planning problems. Tabu search is very fast, but it depends on the initial solution to a great extent, so it is impossible to perform parallel search defined as GS.


#### 4.4.1. Initial Solution Generation and Exchange Neighborhood Search Strategy

Suppose there areK Trailers and all workflows 1, 2, 3. Firstly, K task sequences are generated by random insertion as the initial solution, and the remaining task sequences are all the second ones. O in this work sequence, it is used as an object for ordering outsourced work. During the build of the initial solution, if a new work order cannot be entered for the current work sequence, the work order will be regenerated until all K trailers are assigned. Therefore, a K+1 task sequence is generated.When the initial solution is generated, the adjacent switching structure is generated by using the switching neighborhood search method. This method uses two work sequences to exchange work orders and generates two new work sequences as new solutions: referred to herein as (0, 1), (1, 0), (1, 1), (0, 2), (2, 0), (2, 1), (1, 2), and (2, 2).Here, (2, 1) means that two tasks in the first task sequence accept the request and are replaced by the second task sequence and one task in the second task sequence accepts the request and is replaced by the first task sequence. In addition, it is assumed that each work sequence can be exchanged with the 0th work sequence to generate a new solution.


#### 4.4.2. Tabu Structure Table and Tabu Capacity Setting

During parsing, the Tabu table can hold the most recently changed workflow, and the capacity of the Tabu table can be preset. The Tabu table structure has two ways: One is to record the changed work tasks in each work sequence, and the other is to record the whole changed work sequence completely. In subsequent swap operations, operations that return preexisting work sequences are marked in a Tabu table and are therefore prohibited to improve recovery efficiency. If a new and better solution is generated by changing the workflow, it will be saved to the Tabu table and updated in real time, but the Tabu table capacity limits the number of Tabu templates that can save the workflow. Here, the Tabu table adopts “first-out, first-out” update source, and the Tabu table capacity is set to 10.


#### 4.4.3. Termination Criteria

When the total number of iterations reaches a given value or the current optimal solution does not change within a given number of consecutive iteration steps, the algorithm ends.


#### 4.4.4. Algorithm

After generating the initialK solution through 3.1, according to the neighborhood exploration method described in this paper, first, the second O task sequence and the task sequence are exchanged. After completion, two random task exchanges are performed on a task sequence to obtain a better global executable task sequence. All replacement work acceptance orders are arranged in an ascending order of total cost.Then, check the executability of the first candidate task sequence. First, make sure it exists in the Tabu table. If it does not exist in the Tabu table, it is saved as a better work sequence in the Tabu table and updated in real time. If you are already in the Tabu table, check the order of the second candidate task. The specific description is as follows.(Step 1)
Randomly generate the initial solutionS, S=SB (S is the best scheme at present).(Step 2)
Initialize the Tabu list and candidate task sequence (empty).(Step 3)
m=0 (loop control).(Step 4)
Explore the neighborhood ofS using the exchange neighborhood exploration method, update the list of candidate work sequences, and organize them in ascending order.(Step 5)
Assign the first update scheme toSS.(Step 6)
IfcostSS<costSB, go to step 8.(Step 7)
IfSSistaboo selects the candidate’s next work sequence, assign it to the SS and go to Step 6.(Step 8)
IfS=SS, update the tabu table. If costS<costSB is defined as S=SB, m=m+1.(Step 9)
If the default value is exceeded (assumingm is the maximum number of jobs that the trailer can handle in a day), complete the program; otherwise, return to Step 4.


### 4.5. Example Analysis

Guangzhou Zhuozhi Logistics (Group) Co., Ltd. is a professional large-scale integrated logistics company providing full supply chain services. Zhuozhi Group Guangzhou Zhuozhi Logistics Service Co., Ltd. has more than 300 trucks and has rich experience in dangerous goods transportation and container transportation. Company vehicles are equipped with GPS satellite positioning system, which is used in vehicle fixed-point control, safety incident control, load distribution and inventory management, electronic information feedback, customer service, and so on. Zhuozhi Group has 6 terminal transit warehouses and 8 logistics distribution center warehouses with a total warehouse area of 50,000 square meters, mainly engaged in port container transportation and related activities.(1)
Algorithm effectiveness analysis: the algorithm is programmed in Delphi language and implemented in PIV1.66GHz microcomputer. The experimental data are collected from the data processing of commercial container orders by a company in Guangzhou from January to June, 2008, including the distribution of container orders, operating costs, and working hour constraints. In order to simplify the calculation of the problem, there is only one third-party alternative transportation company.α=1,Qi1=100,andl=0.The method in this paper is used to process the data of any two days, and the optimized processing results shown in Figures11 and 12 are obtained.Figure 11
Trend of relative total cost on the first day with iteration times.Figure 12
Trend of relative total cost on the second day with iteration times.Through analysis, it is found that in the initial stage of the iterative process, the algorithm proposed in this paper has advantages over the container order sequence processing scheme, and the total cost of order acceptance decreases sharply in the initial stage, which shows the actual convergence of the algorithm. However, with the increase of iteration cycle, the optimization effect decreases and is not significant, especially in the ninth and tenth cycles, so it is best not to fall into local optimization in the subsequent cycles. The main reason to avoid prematurity of search algorithm is to avoid prematurity of exchange algorithm. Therefore, we prove that the algorithm proposed in this paper is effective and avoids local optimization to a certain extent.(2)
Algorithm optimization analysis: for comparison with other methods, all monthly data are divided into six groups. First, the insertion method is used to obtain the initial work plan and calculate the total labor cost. Next, the adjacency exploration method and Tabu exploration method proposed in this paper are used to process the data. According to the results in Figure13 and Table 1, the Tabu neighborhood search algorithm obtains better results with lower labor cost.Figure 13
Comparison of relative total costs of different algorithms from January to June.Table 1
Comparison of relative total cost between neighborhood search algorithm and Tabu search algorithm.
MonthInsertion methodNeighborhood searchTabu neighborhood search11.20641.15991.000021.21321.13151.000031.23751.16331.000041.20721.13101.000051.22261.12011.000061.23251.19051.0000


## 4.1. Logistics Distribution Vehicle Scheduling Task Analysis

Logistics distribution center has irreplaceable special significance in logistics network system, so it must have the following basic logistics functions:(i)
Storage function: this mainly stores and maintains items that can be received in real time when needed.(ii)
Commodity adjustment function: the cyclical and seasonal changes of commodity demand can receive related commodities in different periods according to the adjustment of commodities.(iii)
Distribution and sale function: marketing methods related to commodity flow can be used to promote the flow of goods in the market.(iv)
Information management function: logistics distribution center is usually the central node of information processing and processing. It can play the role of central nervous system in the whole logistics process.(v)
Commodity distribution function: this is also the core and basic function of logistics distribution center. I guarantee that the goods will be delivered to the designated customers as required.Generally speaking, the workflow of logistics distribution center can be summarized as shown in Figure7.Figure 7
Schematic diagram of operation flow of logistics distribution center.Especially as a part of logistics distribution, the further decomposition of logistics distribution business shows that logistics distribution vehicle planning is a very important part of logistics distribution. In logistics distribution center, upstream manufacturing companies and parts wholesalers can collect, store, and spare parts through goods. Logistics distribution is a part of vehicle scheduling, which usually considers three tasks, including vehicle scheduling, scheduling, and obtaining road information. In the process of transporting vehicles and personnel, it is necessary to investigate the corresponding relationship between orders and vehicles or drivers and vehicle tasks. Ultimately, the problem lies in the choice of partners, whose selection methods and ideas are basically the same. The vehicle planning scheme of logistics distribution obtains the vehicle driving scheme through certain decision-making methods on the basis of obtaining relevant road information. The schematic diagram of logistics distribution vehicle planning in logistics distribution center is shown in Figure8.Figure 8
Schematic diagram of logistics distribution vehicle scheduling task.According to the above analysis ideas, we introduce the Labor Distribution Structure (WBS) method into the project management and further analyze the planning activities of logistics distribution vehicles.


## 4.2. Task Decomposition

### 4.2.1. Work Breakdown Structure

Work sharing structure (WBS) decomposes upper functional entities into upper subitems in the tree structure and then gradually decomposes them into independent work units. This is a project management tool that determines the tasks and tasks that each unit can perform and makes the project organization more effective. WBS theory is based on cybernetics, informatics, systems engineering, and so on. WBS can also be defined as a process to achieve a specific goal. The project will go from big activities to small activities, and all activities to be completed will be organized in a certain order. WBS’s idea was originally proposed by the US Office of Defense Finance for the procurement and management of large-scale equipment procurement projects. The original WBS is limited to the product itself. Now, it has been renovated throughout the project life cycle. It is the main tool frequently used in project management [19].As a core tool in the project management process, WBS is scientific and requires you to follow certain rules. In a word, the principles to be followed include the following aspects.(1)
The content should be consistent with the project (task), and the necessary components should not be disclosed. For each unitX, if it is decomposed into lower-level units X1,X2,⋯,Xn, the following conditions should be met:(4)X=X1⋃X2⋃⋯⋃Xi⋃⋯⋃Xn,(5)Xi⋃Xj=∅i≠j.The sum of the costs ofX1,X2,⋯,Xn of equations (4) and (5) is equal to the total cost of X, that is,
(6)CX=∑CXi,The duration ofX is the combined duration of X1,X2,⋯,Xn(2)
The decomposition of the working structure needs to ensure that it is linear. The Unit of Work X may belong to one of the Upper UnitX and two or more Upper Units X and Y that are not allowed to intersect.(7)Xi⊂X,Xi⊄Y(3)
Cells at the same level should have the same attributes. For example,X1,X2,⋯,Xn are all represented as functions, or all as elements, or all implementation procedures(4)
Ensure that the interface is clear and the responsibilities are clear. For each work unit, we need to be able to distinguish different work contents and different principles. Each project unit needs relatively strong independence and integrity. Control the interface and operation responsibility between each operation unit to a minimum and make it clear. Only in this way can we promote the concrete decomposition and implementation of the objectives and responsibilities of each project and promote the assessment of results and the analysis of responsibilities(5)
Flexibility should be ensured. The breakdown of work structure should promote the expansion of project scope and content and change the project structure in real time


### 4.2.2. Project Task Decomposition Process

Because of the characteristics of project management under the environment of logistics distribution vehicle planning and the actual needs in the process of logistics distribution operation, this paper proposes a top-down and bottom-up project activity decomposition method. The decomposition process is shown in Figure9.Figure 9
Project decomposition process of logistics distribution enterprises.According to the above design task decomposition method and the logistics distribution process analyzed before, Figure9 shows the work breakdown structure of logistics Distribution Company after project decomposition (we only decompose into subprojects, which can be subdivided into atomic projects). In addition, the decomposition of projects is different from the value analysis activities here. The latter involves extracting only a part of the target process, finding the main value-added activities in the target process, and eliminating the activities without value-added. The first method decomposes all project processes into independent and measurable activities and organizes the implementation of the project. The finer the granularity of the final decomposition of the project, the easier it is to create a plan. The divided activities are used for value analysis, which can control decision-making and project funds.


## 4.2.1. Work Breakdown Structure

Work sharing structure (WBS) decomposes upper functional entities into upper subitems in the tree structure and then gradually decomposes them into independent work units. This is a project management tool that determines the tasks and tasks that each unit can perform and makes the project organization more effective. WBS theory is based on cybernetics, informatics, systems engineering, and so on. WBS can also be defined as a process to achieve a specific goal. The project will go from big activities to small activities, and all activities to be completed will be organized in a certain order. WBS’s idea was originally proposed by the US Office of Defense Finance for the procurement and management of large-scale equipment procurement projects. The original WBS is limited to the product itself. Now, it has been renovated throughout the project life cycle. It is the main tool frequently used in project management [19].As a core tool in the project management process, WBS is scientific and requires you to follow certain rules. In a word, the principles to be followed include the following aspects.(1)
The content should be consistent with the project (task), and the necessary components should not be disclosed. For each unitX, if it is decomposed into lower-level units X1,X2,⋯,Xn, the following conditions should be met:(4)X=X1⋃X2⋃⋯⋃Xi⋃⋯⋃Xn,(5)Xi⋃Xj=∅i≠j.The sum of the costs ofX1,X2,⋯,Xn of equations (4) and (5) is equal to the total cost of X, that is,
(6)CX=∑CXi,The duration ofX is the combined duration of X1,X2,⋯,Xn(2)
The decomposition of the working structure needs to ensure that it is linear. The Unit of Work X may belong to one of the Upper UnitX and two or more Upper Units X and Y that are not allowed to intersect.(7)Xi⊂X,Xi⊄Y(3)
Cells at the same level should have the same attributes. For example,X1,X2,⋯,Xn are all represented as functions, or all as elements, or all implementation procedures(4)
Ensure that the interface is clear and the responsibilities are clear. For each work unit, we need to be able to distinguish different work contents and different principles. Each project unit needs relatively strong independence and integrity. Control the interface and operation responsibility between each operation unit to a minimum and make it clear. Only in this way can we promote the concrete decomposition and implementation of the objectives and responsibilities of each project and promote the assessment of results and the analysis of responsibilities(5)
Flexibility should be ensured. The breakdown of work structure should promote the expansion of project scope and content and change the project structure in real time


## 4.2.2. Project Task Decomposition Process

Because of the characteristics of project management under the environment of logistics distribution vehicle planning and the actual needs in the process of logistics distribution operation, this paper proposes a top-down and bottom-up project activity decomposition method. The decomposition process is shown in Figure9.Figure 9
Project decomposition process of logistics distribution enterprises.According to the above design task decomposition method and the logistics distribution process analyzed before, Figure9 shows the work breakdown structure of logistics Distribution Company after project decomposition (we only decompose into subprojects, which can be subdivided into atomic projects). In addition, the decomposition of projects is different from the value analysis activities here. The latter involves extracting only a part of the target process, finding the main value-added activities in the target process, and eliminating the activities without value-added. The first method decomposes all project processes into independent and measurable activities and organizes the implementation of the project. The finer the granularity of the final decomposition of the project, the easier it is to create a plan. The divided activities are used for value analysis, which can control decision-making and project funds.


## 4.3. Mathematical Modeling of Vehicle Scheduling

In order to process the work order, the tractor must first run to the departure place for loading and unloading and meet the operation time window limit of the departure place. The tractor should wait for the operation time window to allow the container to be loaded into the tractor; after the operation is completed, the vehicle can drive to the destination. At the destination, loading and unloading operations must also be carried out within the allowed time.From Figure10, we can see that each marked node represents a task order, and each dotted line sequence guided by the trailer represents a sequence of orders completed by the trailer in sequence. Each arc does not represent the actual geographical connection, but represents the order for processing the order.Figure 10
Conceptual model of vehicle scheduling in container port without central node.In order to establish a mathematical model, we assume that only two types of 20-foot and 40-foot boxes suitable for the United Nations are considered. Assuming that 20 feet and 40 feet are treated equally, each trailer can only carry one container. Different cash types will not affect the plan before and after the plan, but they are different in cost calculation. Each trailer has a predefined maximum working time or maximum number of orders processed. Each work instruction must meet all relevant working time limits. Only one tractor can be accessed at each node. All work orders for other lead-free vehicles are stored in Series 0.The following are the decision variables:Xikm∈0,1,i∈1,⋯,N;k∈1,⋯,k;m∈1,⋯,m. Set Xikm−1 when the work order i of the k trailer is scheduled for the m processing operation; otherwise, take 0.Xio∈0,1,i∈1,⋯,N. Set Xio=1 when work order i is outsourced to a leased vehicle (where 0 represents another shipping company); otherwise, take O.Wkm1m∈1,⋯,m;k∈1,⋯,k represents the waiting time of the k trailer for the m-th run at the departure point.Wkm2m∈1,⋯,m;k∈1,⋯,k represents the waiting time of the k-th trailer for the m-th run at the destination.The following are the parameters:N denotes the number of jobs; k represents the number of tractors; M represents the maximum number of work orders that a car can handle in one day; Pi represents the cost of completing work order I with one’s own vehicle, i≠1,⋯,n; Si represents the cost required for the leased vehicle to complete the operating instruction i, i≠1,⋯,n; Tmk0 indicates the start time of the m-th operation of the k-th trailer; Tmk1 represents the start time of the k-th trailer and the m-th operation to reach the destination; Tmk2 represents the last time of the m-th operation of the k-th trailer; Dij represents the running time of the trailer from the destination of job i to the departure place of job j; Di represents the running time of the trailer from the beginning to the end of the i-th operation; Hi1 represents the processing time of the first job at the starting site; Hi2 denotes the processing time of the i-th operation at the destination; Ri0 represents the start time of the i-th operation and the start time of the operation time window; Ri1 represents the start and end times of the i-th operation; Ri2 refers to the start time of the operation time window at the end of operation i; Ri3 represents the final arrival time of the operation time window at the end of operation i; Ak0 indicates the start time of the available time of the tractor; AK1 denotes the available time and end time of the tractor.The time sequence of them-th operation of the k-th trailer is shown in the figure. Establish the following mathematical model:
(8)Minimize∑i=1NPi∑k=1K∑m=1MXikm+∑i=1NSiXi0(9)s.t.∑k=1K∑m=1MXikm+Xi0=1,fori∈1,⋯,N,(10)∑i=1NXikm+1≤∑m=1MXikm≤1,fork∈1,⋯,kandm∈1,⋯,M-1,(11)Tm+1k0=Tmk2,fork∈1,⋯,kandm∈1,⋯,M-1,(12)Tmk1=Tmk0+∑i=1,j=1i≠jMXikmXjkm−1Dji+Hi1+Wmk1,fork∈1,⋯,kandm∈1,⋯,M,(13)Tmk2=Tmk1+∑i=1NXikmDi+Hi2+Wmk2,fork∈1,⋯,kandm∈1,⋯,M,(14)Ak0≤Tmk0≤Ak1-Tmk2-Tmk0,fork∈1,⋯,kandm∈1,⋯,M,(15)Ri0=∑k=1K∑m=1MXikmTmk1-Hi1+Xi0Ri0≤Ri1,fori∈1,⋯,N,(16)Ri2=∑k=1K∑m=1MXikmTmk2-Hi2+Xi0Ri2≤Ri3,fori∈1,⋯,N.Here, Formula (8) is the objective function, which means that the total cost is the lowest, which is p for the same job. It is usually smaller than the S, which means it is more costly to complete on your own vehicle than to outsource a rental vehicle. Formula (9) indicates that each operation can only be assigned once. Formula (10) indicates that all operations must be arranged in an orderly manner on a specific tractor. Formulas (11) to (12) represent time series limits for each operation, Formula (13) indicates that all operations must be completed within the working time available to the tractor, and Formulas (14) and (15) represent time window limits at start and end, respectively.


## 4.4. Tabu Search Algorithm and Exchange Neighborhood Search Algorithm

Tabu search (TS) was first proposed by Glover, which is an extension of local neighborhood search. It is not only a global sequence optimization algorithm but also a simulation of human intelligent process. TS adopts the idea of local neighborhood search. In addition, the Tabu policy corresponding to flexible storage structure is introduced, Tabu and Tabu objects are defined, and some objects corresponding to the optimal local solution of recovery are marked instead of absolutely prohibiting loops. Avoid these objects as much as possible in additional iterative searches. The algorithm combines the characteristics of avoiding search deviation. Make sure there are different valid search paths. At the same time, set standards to despise, reward, and forgive various states. Tabu search is mainly used to solve various vehicle planning problems. Tabu search is very fast, but it depends on the initial solution to a great extent, so it is impossible to perform parallel search defined as GS.


### 4.4.1. Initial Solution Generation and Exchange Neighborhood Search Strategy

Suppose there areK Trailers and all workflows 1, 2, 3. Firstly, K task sequences are generated by random insertion as the initial solution, and the remaining task sequences are all the second ones. O in this work sequence, it is used as an object for ordering outsourced work. During the build of the initial solution, if a new work order cannot be entered for the current work sequence, the work order will be regenerated until all K trailers are assigned. Therefore, a K+1 task sequence is generated.When the initial solution is generated, the adjacent switching structure is generated by using the switching neighborhood search method. This method uses two work sequences to exchange work orders and generates two new work sequences as new solutions: referred to herein as (0, 1), (1, 0), (1, 1), (0, 2), (2, 0), (2, 1), (1, 2), and (2, 2).Here, (2, 1) means that two tasks in the first task sequence accept the request and are replaced by the second task sequence and one task in the second task sequence accepts the request and is replaced by the first task sequence. In addition, it is assumed that each work sequence can be exchanged with the 0th work sequence to generate a new solution.


### 4.4.2. Tabu Structure Table and Tabu Capacity Setting

During parsing, the Tabu table can hold the most recently changed workflow, and the capacity of the Tabu table can be preset. The Tabu table structure has two ways: One is to record the changed work tasks in each work sequence, and the other is to record the whole changed work sequence completely. In subsequent swap operations, operations that return preexisting work sequences are marked in a Tabu table and are therefore prohibited to improve recovery efficiency. If a new and better solution is generated by changing the workflow, it will be saved to the Tabu table and updated in real time, but the Tabu table capacity limits the number of Tabu templates that can save the workflow. Here, the Tabu table adopts “first-out, first-out” update source, and the Tabu table capacity is set to 10.


### 4.4.3. Termination Criteria

When the total number of iterations reaches a given value or the current optimal solution does not change within a given number of consecutive iteration steps, the algorithm ends.


### 4.4.4. Algorithm

After generating the initialK solution through 3.1, according to the neighborhood exploration method described in this paper, first, the second O task sequence and the task sequence are exchanged. After completion, two random task exchanges are performed on a task sequence to obtain a better global executable task sequence. All replacement work acceptance orders are arranged in an ascending order of total cost.Then, check the executability of the first candidate task sequence. First, make sure it exists in the Tabu table. If it does not exist in the Tabu table, it is saved as a better work sequence in the Tabu table and updated in real time. If you are already in the Tabu table, check the order of the second candidate task. The specific description is as follows.(Step 1)
Randomly generate the initial solutionS, S=SB (S is the best scheme at present).(Step 2)
Initialize the Tabu list and candidate task sequence (empty).(Step 3)
m=0 (loop control).(Step 4)
Explore the neighborhood ofS using the exchange neighborhood exploration method, update the list of candidate work sequences, and organize them in ascending order.(Step 5)
Assign the first update scheme toSS.(Step 6)
IfcostSS<costSB, go to step 8.(Step 7)
IfSSistaboo selects the candidate’s next work sequence, assign it to the SS and go to Step 6.(Step 8)
IfS=SS, update the tabu table. If costS<costSB is defined as S=SB, m=m+1.(Step 9)
If the default value is exceeded (assumingm is the maximum number of jobs that the trailer can handle in a day), complete the program; otherwise, return to Step 4.


## 4.4.1. Initial Solution Generation and Exchange Neighborhood Search Strategy

Suppose there areK Trailers and all workflows 1, 2, 3. Firstly, K task sequences are generated by random insertion as the initial solution, and the remaining task sequences are all the second ones. O in this work sequence, it is used as an object for ordering outsourced work. During the build of the initial solution, if a new work order cannot be entered for the current work sequence, the work order will be regenerated until all K trailers are assigned. Therefore, a K+1 task sequence is generated.When the initial solution is generated, the adjacent switching structure is generated by using the switching neighborhood search method. This method uses two work sequences to exchange work orders and generates two new work sequences as new solutions: referred to herein as (0, 1), (1, 0), (1, 1), (0, 2), (2, 0), (2, 1), (1, 2), and (2, 2).Here, (2, 1) means that two tasks in the first task sequence accept the request and are replaced by the second task sequence and one task in the second task sequence accepts the request and is replaced by the first task sequence. In addition, it is assumed that each work sequence can be exchanged with the 0th work sequence to generate a new solution.


## 4.4.2. Tabu Structure Table and Tabu Capacity Setting

During parsing, the Tabu table can hold the most recently changed workflow, and the capacity of the Tabu table can be preset. The Tabu table structure has two ways: One is to record the changed work tasks in each work sequence, and the other is to record the whole changed work sequence completely. In subsequent swap operations, operations that return preexisting work sequences are marked in a Tabu table and are therefore prohibited to improve recovery efficiency. If a new and better solution is generated by changing the workflow, it will be saved to the Tabu table and updated in real time, but the Tabu table capacity limits the number of Tabu templates that can save the workflow. Here, the Tabu table adopts “first-out, first-out” update source, and the Tabu table capacity is set to 10.


## 4.4.3. Termination Criteria

When the total number of iterations reaches a given value or the current optimal solution does not change within a given number of consecutive iteration steps, the algorithm ends.


## 4.4.4. Algorithm

After generating the initialK solution through 3.1, according to the neighborhood exploration method described in this paper, first, the second O task sequence and the task sequence are exchanged. After completion, two random task exchanges are performed on a task sequence to obtain a better global executable task sequence. All replacement work acceptance orders are arranged in an ascending order of total cost.Then, check the executability of the first candidate task sequence. First, make sure it exists in the Tabu table. If it does not exist in the Tabu table, it is saved as a better work sequence in the Tabu table and updated in real time. If you are already in the Tabu table, check the order of the second candidate task. The specific description is as follows.(Step 1)
Randomly generate the initial solutionS, S=SB (S is the best scheme at present).(Step 2)
Initialize the Tabu list and candidate task sequence (empty).(Step 3)
m=0 (loop control).(Step 4)
Explore the neighborhood ofS using the exchange neighborhood exploration method, update the list of candidate work sequences, and organize them in ascending order.(Step 5)
Assign the first update scheme toSS.(Step 6)
IfcostSS<costSB, go to step 8.(Step 7)
IfSSistaboo selects the candidate’s next work sequence, assign it to the SS and go to Step 6.(Step 8)
IfS=SS, update the tabu table. If costS<costSB is defined as S=SB, m=m+1.(Step 9)
If the default value is exceeded (assumingm is the maximum number of jobs that the trailer can handle in a day), complete the program; otherwise, return to Step 4.


## 4.5. Example Analysis

Guangzhou Zhuozhi Logistics (Group) Co., Ltd. is a professional large-scale integrated logistics company providing full supply chain services. Zhuozhi Group Guangzhou Zhuozhi Logistics Service Co., Ltd. has more than 300 trucks and has rich experience in dangerous goods transportation and container transportation. Company vehicles are equipped with GPS satellite positioning system, which is used in vehicle fixed-point control, safety incident control, load distribution and inventory management, electronic information feedback, customer service, and so on. Zhuozhi Group has 6 terminal transit warehouses and 8 logistics distribution center warehouses with a total warehouse area of 50,000 square meters, mainly engaged in port container transportation and related activities.(1)
Algorithm effectiveness analysis: the algorithm is programmed in Delphi language and implemented in PIV1.66GHz microcomputer. The experimental data are collected from the data processing of commercial container orders by a company in Guangzhou from January to June, 2008, including the distribution of container orders, operating costs, and working hour constraints. In order to simplify the calculation of the problem, there is only one third-party alternative transportation company.α=1,Qi1=100,andl=0.The method in this paper is used to process the data of any two days, and the optimized processing results shown in Figures11 and 12 are obtained.Figure 11
Trend of relative total cost on the first day with iteration times.Figure 12
Trend of relative total cost on the second day with iteration times.Through analysis, it is found that in the initial stage of the iterative process, the algorithm proposed in this paper has advantages over the container order sequence processing scheme, and the total cost of order acceptance decreases sharply in the initial stage, which shows the actual convergence of the algorithm. However, with the increase of iteration cycle, the optimization effect decreases and is not significant, especially in the ninth and tenth cycles, so it is best not to fall into local optimization in the subsequent cycles. The main reason to avoid prematurity of search algorithm is to avoid prematurity of exchange algorithm. Therefore, we prove that the algorithm proposed in this paper is effective and avoids local optimization to a certain extent.(2)
Algorithm optimization analysis: for comparison with other methods, all monthly data are divided into six groups. First, the insertion method is used to obtain the initial work plan and calculate the total labor cost. Next, the adjacency exploration method and Tabu exploration method proposed in this paper are used to process the data. According to the results in Figure13 and Table 1, the Tabu neighborhood search algorithm obtains better results with lower labor cost.Figure 13
Comparison of relative total costs of different algorithms from January to June.Table 1
Comparison of relative total cost between neighborhood search algorithm and Tabu search algorithm.
MonthInsertion methodNeighborhood searchTabu neighborhood search11.20641.15991.000021.21321.13151.000031.23751.16331.000041.20721.13101.000051.22261.12011.000061.23251.19051.0000


## 5. Conclusion

This paper discusses the emergency logistics vehicle scheduling problem, which is an abstract vehicle planning problem with more complex time window and no central node. Firstly, the ordering work of container ports is analyzed in detail. On this basis, the vehicle planning model of container port is established. We try to establish a mathematical model according to the current situation and establish a new Tabu search method to solve the model. Through the detailed investigation of port data and using the algorithm proposed in this paper to simulate and analyze the actual data, the practice proves that this method is effective. At the same time, the target results are compared with an insertion method and neighborhood search method, which shows that this method can obtain better overall optimization solution and better economic effect in practical application.



---

*Source: 2148785-2022-06-08.xml*