CN115809752A - Low-carbon logistics path planning method, device, equipment and storage medium - Google Patents
Low-carbon logistics path planning method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN115809752A CN115809752A CN202310070908.9A CN202310070908A CN115809752A CN 115809752 A CN115809752 A CN 115809752A CN 202310070908 A CN202310070908 A CN 202310070908A CN 115809752 A CN115809752 A CN 115809752A
- Authority
- CN
- China
- Prior art keywords
- distribution
- distributed
- carbon
- carbon emission
- path planning
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/80—Management or planning
- Y02P90/84—Greenhouse gas [GHG] management systems
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to the technical field of intelligent logistics, and discloses a low-carbon logistics path planning method, device, equipment and storage medium. The low-carbon logistics path planning method comprises the following steps: the method comprises the steps of obtaining a distribution starting point and a distribution ending point of a current stage, generating a plurality of distribution routes, calculating carbon emission generated by running of a distribution vehicle on each distribution route according to an actual load value of the distribution vehicle at the current stage, and selecting the distribution route with the minimum carbon emission as an actually adopted route in a comparison mode. According to the method, the carbon emission is calculated and the path is planned based on the load of the distribution vehicle, so that the carbon emission of the whole distribution route is reduced, and the calculation accuracy of the carbon emission and the path planning accuracy are improved.
Description
Technical Field
The invention relates to the field of intelligent logistics, in particular to a low-carbon logistics path planning method, device, equipment and storage medium.
Background
Carbon emission refers to greenhouse gas emission, which causes greenhouse effect and increases global temperature, and carbon emission refers to average greenhouse gas emission generated during production, transportation, use and recovery of products. In order to protect the environment, low-carbon life is advocated in recent years, the carbon emission is reduced, green development is promoted, and for automobiles, particularly distribution vehicles, reasonable path planning can effectively reduce the carbon emission.
In the prior art, carbon emission formulas which are mainstream in the market at present are used for calculating the carbon emission of an automobile according to energy sources or for calculating the carbon emission according to complicating factors (such as vehicle speed, vehicle information, driving distance and the like), however, the carbon emission formulas do not consider the influence of the weight of a vehicle body. The approximate carbon emission is estimated through the driving distance and the vehicle information, because loading and unloading can be carried out when a delivery terminal is passed by each time, the weight of the vehicle is reduced, the relationship between the weight of the vehicle body and the energy consumption is considered, the subsequent carbon emission calculation is influenced, and the final simulated planning route is inaccurate.
Disclosure of Invention
The invention mainly aims to provide a low-carbon logistics path planning method, a low-carbon logistics path planning device, low-carbon logistics path planning equipment and a low-carbon logistics path planning storage medium, and aims to solve the technical problem that path planning based on carbon emission is inaccurate in the prior art.
The invention provides a low-carbon logistics path planning method in a first aspect, which comprises the following steps:
acquiring a distribution starting point and a distribution terminal point of the current stage;
generating a plurality of distribution routes based on the distribution starting point and the distribution end point;
acquiring an actual load value of a delivery vehicle at the current stage, and calculating the carbon emission amount of the delivery vehicle in running of each delivery route by applying a preset carbon emission formula based on the actual load value;
and comparing the carbon emission, and selecting the distribution route with the minimum carbon emission as the material flow path adopted in the current stage.
Optionally, in a first implementation manner of the first aspect of the present invention, before the obtaining the delivery start point and the delivery end point of the current stage, the method further includes:
acquiring a distribution center, all points to be distributed and the weight of goods to be distributed of all the points to be distributed;
and based on the distribution center, the to-be-distributed points and the weight of the goods to be distributed of the to-be-distributed points, path planning is carried out by applying a preset path planning algorithm, and the distribution sequence of the to-be-distributed points is obtained.
Optionally, in a second implementation manner of the first aspect of the present invention, the performing path planning by using a preset path planning algorithm based on the distribution center, the points to be distributed, and the weights of the goods to be distributed at the points to be distributed to obtain the distribution sequence of the points to be distributed includes:
taking the distribution end point of the distribution center or the previous stage as the distribution starting point of the current stage, and determining the distribution sequence of each point to be distributed by applying a preset algorithm;
and selecting the first point to be delivered as the delivery end point of the current stage.
Optionally, in a third implementation manner of the first aspect of the present invention, the determining, by using the distribution end point of the distribution center or the previous stage as the distribution starting point of the current stage, the distribution sequence of each point to be distributed by applying a preset algorithm includes:
s11, selecting a plurality of individuals as a first group according to carbon emission, wherein the individuals are the distribution sequence of the points to be distributed;
s12, sequentially performing cross operation and mutation operation on the basis of the first population to obtain a second population;
and S13, taking the second population as a new first population and repeatedly executing the step S12 until an iteration condition is met, and selecting the individuals with the highest probability as the distribution sequence of the points to be distributed.
Optionally, in a fourth implementation manner of the first aspect of the present invention, the selecting, as the first group, a plurality of individuals according to the amount of carbon emission includes:
generating a plurality of distribution sequences of the points to be distributed by a preset method and coding the generated distribution sequences, wherein one distribution sequence of each point to be distributed is an individual, and each code corresponds to one individual;
and calculating and obtaining the carbon emission amount generated by the delivery vehicle when each individual is used as a delivery sequence, and selecting a plurality of individuals with the smallest generated carbon emission amount as the first group.
Optionally, in a fifth implementation manner of the first aspect of the present invention, the obtaining a second population after sequentially performing a crossover operation and a mutation operation based on the first population includes:
randomly pairing the individuals in the first group, and performing cross operation on each pair of individuals by using a sequential cross operator to obtain a third group;
and carrying out mutation operation on individuals in the third population according to a preset probability to obtain the second population.
Optionally, in a sixth implementation manner of the first aspect of the present invention, the carbon emission formula is as follows:
wherein T represents the carbon emission amount, S represents the distance between two points, G represents the vehicle body weight, C represents the carbon emission factor, M 1 Representing the actual load value of the delivery vehicle, M 2 Representing the maximum load value of the delivery vehicle.
The second aspect of the present invention provides a low-carbon logistics path planning apparatus, including:
the first acquisition module is used for acquiring a distribution starting point and a distribution terminal point of the current stage;
a route generation module for generating a plurality of distribution routes based on the distribution starting point and the distribution end point;
the calculation module is used for acquiring the actual load value of the delivery vehicle at the current stage and calculating the carbon emission amount of the delivery vehicle in the running of each delivery route by applying a preset carbon emission formula based on the actual load value;
and the comparison module is used for comparing the carbon emission and selecting the distribution route with the minimum carbon emission as the material flow path adopted in the current stage.
Optionally, in a first implementation manner of the second aspect of the present invention, the low-carbon logistics path planning apparatus further includes:
the second acquisition module is used for acquiring the distribution center, each point to be distributed and the weight of goods to be distributed of each point to be distributed;
and the path planning module is used for planning a path by applying a preset path planning algorithm based on the distribution center, the to-be-distributed points and the weight of the goods to be distributed of the to-be-distributed points to obtain a distribution sequence of the to-be-distributed points.
Optionally, in a second implementation manner of the second aspect of the present invention, the path planning module includes:
the calculation unit is used for determining the distribution sequence of each point to be distributed by using a preset algorithm with the distribution end point of the distribution center or the previous stage as the distribution starting point of the current stage;
and the selection unit is used for selecting the first point to be distributed as the distribution end point of the current stage.
Optionally, in a third implementation manner of the second aspect of the present invention, the calculating unit is specifically configured to:
s11, selecting a plurality of individuals as a first group according to carbon emission, wherein the individuals are the distribution sequence of the points to be distributed;
s12, sequentially performing cross operation and mutation operation on the basis of the first population to obtain a second population;
and S13, taking the second population as a new first population and repeatedly executing the step S12 until an iteration condition is met, and selecting the individuals with the highest probability as the distribution sequence of the points to be distributed.
Optionally, in a fourth implementation manner of the second aspect of the present invention, the selecting, as the first group, a plurality of individuals according to the amount of carbon emission includes:
generating a plurality of distribution sequences of the points to be distributed by a preset method and coding the generated distribution sequences, wherein one distribution sequence of each point to be distributed is an individual, and each code corresponds to one individual;
and calculating the carbon emission generated by the delivery vehicle when each individual is used as a delivery sequence, and selecting a plurality of individuals with the smallest generated carbon emission as the first group.
Optionally, in a fifth implementation manner of the second aspect of the present invention, the obtaining a second population after sequentially performing intersection and mutation operations based on the first population includes:
randomly pairing the individuals in the first group, and performing cross operation on each pair of individuals by using a sequential cross operator to obtain a third group;
and carrying out mutation operation on individuals in the third population according to a preset probability to obtain the second population.
Optionally, in a sixth implementation manner of the second aspect of the present invention, the carbon emission formula is as follows:
wherein T represents the amount of carbon emission, S represents the distance between two points, G represents the weight of the vehicle body, C represents the carbon emission factor, M 1 Representing the actual load value of the delivery vehicle, M 2 Representing the maximum load value of the delivery vehicle.
A third aspect of the present invention provides an electronic device comprising: a memory and at least one processor, the memory having instructions stored therein; the at least one processor invokes the instructions in the memory to cause the electronic device to perform the low-carbon logistics path planning method described above.
A fourth aspect of the present invention provides a computer-readable storage medium having instructions stored therein, which when run on a computer, cause the computer to perform the above-mentioned low-carbon logistics path planning method.
According to the technical scheme provided by the invention, the distribution starting point and the distribution ending point of the current stage are obtained, a plurality of distribution routes are generated, the carbon emission generated by the running of a distribution vehicle on each distribution route is calculated according to the actual load value of the distribution vehicle at the current stage, and the distribution route with the minimum carbon emission is selected as the actually adopted route. According to the invention, the carbon emission is calculated and the path is planned based on the load of the distribution vehicle, so that the carbon emission of the whole distribution route is reduced, and the calculation accuracy of the carbon emission and the path planning accuracy are improved.
Drawings
Fig. 1 is a schematic diagram of an embodiment of a low-carbon logistics path planning method in the embodiment of the invention;
fig. 2 is a schematic diagram of another embodiment of the low-carbon logistics path planning method in the embodiment of the invention;
fig. 3 is a schematic diagram of an embodiment of a low-carbon logistics path planning apparatus in the embodiment of the invention;
fig. 4 is a schematic diagram of another embodiment of the low-carbon logistics path planning apparatus in the embodiment of the invention;
fig. 5 is a schematic diagram of an embodiment of an electronic device in an embodiment of the invention.
Detailed Description
The embodiment of the invention provides a low-carbon logistics path planning method, a low-carbon logistics path planning device, low-carbon logistics path planning equipment and a storage medium.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be implemented in other sequences than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," or "having," and any variations thereof, are intended to cover non-exclusive inclusions, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
For convenience of understanding, a specific flow of the embodiment of the present invention is described below, and referring to fig. 1, an embodiment of the low-carbon logistics path planning method in the embodiment of the present invention includes:
101. acquiring a distribution starting point and a distribution terminal point of the current stage;
it can be understood that the main execution body of the present invention may be a low-carbon logistics path planning device, and may also be a terminal or a server, which is not limited herein. The embodiment of the present invention is described by taking a server as an execution subject.
In this embodiment, the distribution system includes a plurality of distribution points to be distributed, the distribution vehicles in the whole distribution process start from the distribution center and sequentially pass through the distribution points according to a preset distribution sequence, unloading is performed when each distribution point passes through each distribution point until the last distribution point is reached, and the distribution vehicles return to the distribution center after all goods are delivered.
In this embodiment, the logistics distribution includes a plurality of stages, the logistics distribution sequentially passes through the distribution points according to a preset distribution sequence, the distribution end point of the previous stage is the distribution start point of the current stage, and when the logistics distribution end point of the current stage is reached and the unloading is completed, the logistics distribution of the current stage is completed.
In this embodiment, the weight of the cargo to be distributed at each distribution point is not limited, and the total weight of the cargo to be distributed at each distribution point does not exceed the maximum load value of the distribution vehicle.
102. Generating a plurality of distribution routes based on the distribution starting point and the distribution end point;
in this embodiment, the delivery route is a feasible route from the delivery start point to the delivery end point, and the generation method is not limited.
Optionally, in an embodiment, the feasible route is obtained through an existing map API, such as: and determining the feasible route through a high-grade map API, an Tencent map API or a Baidu map API.
103. Acquiring an actual load value of a delivery vehicle at the current stage, and calculating the carbon emission amount of the delivery vehicle in running of each delivery route by applying a preset carbon emission formula based on the actual load value;
in this embodiment, the actual load value of the distribution vehicle at the current stage is the total weight of the cargo carried by the distribution vehicle at the current stage.
Optionally, in an embodiment, the carbon emission formula is as follows:
wherein T represents the carbon emission amount, S represents the distance between two points, G represents the vehicle body weight, C represents the carbon emission factor, M 1 Representing the actual load value of the delivery vehicle, M 2 Representing the maximum load value of the delivery vehicle.
In the present embodiment, S represents the travel distance of the selected delivery route.
104. And comparing the carbon emission, and selecting the distribution route with the minimum carbon emission as the material flow path adopted in the current stage.
In this embodiment, the distribution route with the minimum carbon emission is selected as the actual driving route in the current stage, the route with the minimum carbon emission is selected in each stage, and when the preset distribution sequence of the distribution points is the distribution sequence with the minimum carbon emission, the carbon emission of the whole distribution process is the minimum.
In the embodiment of the invention, the distribution starting point and the distribution ending point of the current stage are obtained, a plurality of distribution routes are generated, the carbon emission generated when a distribution vehicle runs on each distribution route is calculated according to the actual load value of the distribution vehicle at the current stage, and the distribution route with the minimum carbon emission is selected as the actually adopted route. According to the invention, the carbon emission is calculated and the path is planned based on the load of the distribution vehicle, so that the carbon emission of the whole distribution route is reduced, and the calculation accuracy of the carbon emission and the path planning accuracy are improved.
Referring to fig. 2, another embodiment of the low-carbon logistics path planning method in the embodiment of the invention includes:
201. acquiring a distribution center, all points to be distributed and the weight of goods to be distributed of all the points to be distributed;
202. based on the distribution center, the to-be-distributed points and the weight of the goods to be distributed of the to-be-distributed points, path planning is carried out by applying a preset path planning algorithm, and the distribution sequence of the to-be-distributed points is obtained;
in this embodiment, the path planning algorithm is not limited, but the result is the optimal solution with the minimum carbon emission in all feasible paths.
Optionally, in an embodiment, the step 202 includes:
taking the distribution end point of the distribution center or the previous stage as the distribution starting point of the current stage, and determining the distribution sequence of each point to be distributed by applying a preset algorithm;
and selecting the first point to be delivered as the delivery end point of the current stage.
In this embodiment, a preset path planning algorithm needs to be applied to perform path planning in each stage, so as to obtain a distribution sequence of each to-be-distributed point calculated in the current stage, and select a first to-be-distributed point in the distribution sequence in the current stage as a distribution end point in the previous stage.
In this embodiment, the first stage takes the distribution center as the distribution starting point, and the distribution end point of the previous stage is the distribution starting point.
In this embodiment, a preset algorithm is used to obtain the distribution sequence of each point to be distributed, and the adopted algorithm is not limited, and includes, but is not limited to, a genetic algorithm, a simulated annealing algorithm, a neural network, and the like.
In this embodiment, after the distribution sequence of the points to be distributed is determined, the first point to be distributed is the distribution end point of the current stage, and since the weight of the distribution vehicle in each stage is different in the distribution process and the weight of the distribution vehicle in the current stage is calculated when the algorithm is applied, the preset algorithm needs to be applied again in each subsequent stage to determine the distribution sequence of the remaining points to be distributed.
Optionally, in an embodiment, the determining, by using the distribution end point of the distribution center or the previous stage as the distribution starting point of the current stage, the distribution sequence of each point to be distributed by applying a preset algorithm includes:
s11, selecting a plurality of individuals as a first group according to carbon emission, wherein the individuals are the distribution sequence of the points to be distributed;
s12, sequentially performing cross operation and mutation operation on the basis of the first population to obtain a second population;
and S13, taking the second group as a new first group and repeatedly executing the step S12 until an iteration condition is met, and selecting the individual with the maximum probability as a distribution sequence of the points to be distributed.
In this embodiment, each individual is a distribution sequence of points to be distributed, and the determination method of the population size (number of individuals) of the first population in step S11 is not limited, but too large population size increases the amount of calculation, too small population size easily falls into a locally optimal solution, and the population size needs to be considered comprehensively based on the amount of calculation and accuracy.
In this embodiment, the degree of fitness is used to evaluate the degree of goodness of each individual, and a plurality of optimal individuals are selected according to the degree of fitness, and the specific selection method is not limited.
Optionally, in an embodiment, a fourth population with a preset population size is randomly generated, where all individuals in the fourth population are different, fitness of all individuals in the fourth population is calculated and transformed, and the fourth population is transformed into a maximization problem, a percentage of a transformed value to a total transformation value of the fourth population is calculated, the converted value is used as a probability that each individual is selected, each probability value corresponds to one region, a sum of the probability values is 1, the regions jointly form a complete region, random numbers with a population size of 0 to 1 are randomly generated, the number of times that each individual is selected is determined according to the number of times that the random numbers appear in the probability regions, and a result is selected as the first population, where the number of individuals in the first population is the same as that in the fourth population.
Optionally, in an embodiment, a certain number of individuals are randomly selected from the population each time, and an optimal one of the individuals is selected to enter the offspring population according to the fitness value, and the operation is repeated until the size of the new offspring population reaches the size of the original population, and the new offspring population is the first population.
In this embodiment, the crossover operation and the mutation operation are used to change the individuals with a certain probability to generate new individuals so as to find out the individuals with the optimal solution.
In this embodiment, the iteration condition is not limited, for example: when the preset iteration times are reached, the probability of a certain body in the second group reaches a preset probability value.
In this embodiment, the probability of an individual, i.e., the fitness thereof, is a proportion of the total fitness of individuals in the currently generated population.
Optionally, in an embodiment, the selecting the plurality of individuals as the first group according to the amount of carbon emission includes:
generating a plurality of distribution sequences of the points to be distributed by a preset method and coding the generated distribution sequences, wherein one distribution sequence of each point to be distributed is an individual, and each code corresponds to one individual;
and calculating and obtaining the carbon emission amount generated by the delivery vehicle when each individual is used as a delivery sequence, and selecting a plurality of individuals with the smallest generated carbon emission amount as the first group.
In this embodiment, the method for generating several distribution orders of the points to be distributed by an individual is not limited to the distribution order of each point to be distributed.
Optionally, in an embodiment, conditions are set according to a priori knowledge, and a delivery sequence is generated based on the conditions, such as: all the points to be distributed need to appear and only appear once, and the distribution sequence of the points to be distributed is randomly generated based on the condition.
In this embodiment, the encoding method is not limited, for example: five to-be-dispatched points are represented by capital letters A, B, C, D, E, and randomly generating individual CDEAB represents the dispatching sequence of the individual C-D-E-A-B.
In the present embodiment, the individual adaptability is the carbon emission amount generated by the delivery vehicle when the individual is used as the delivery order.
Optionally, in an embodiment, the obtaining a second population after sequentially performing a crossover operation and a mutation operation based on the first population includes:
randomly pairing the individuals in the first group, and performing cross operation on each pair of individuals by using a sequential cross operator to obtain a third group;
and carrying out mutation operation on individuals in the third population according to a preset probability to obtain the second population.
In this embodiment, one individual represents the distribution sequence of all distribution points with no determined distribution sequence, and a group is composed of a plurality of individuals with the least carbon emission, the number of individuals in the group can be adjusted before the algorithm is applied, and the number of individuals in the first group is equal to that in the second group.
In this embodiment, individuals are encoded, and each individual is represented by a symbol string, such as: expressed as unsigned binary integers.
In this embodiment, the crossing operation is an operation of interchanging a certain part of symbols between two individuals with a certain lower probability, and the specific method adopted by the crossing operation is not limited, and includes but is not limited to single-point crossing, two-point crossing, multi-point crossing, uniform crossing, and sequential crossing.
Optionally, in an embodiment, a sequential crossing method is adopted, the individuals in the first population are paired in pairs, each pair includes a first individual and a second individual, a start position and an end position of the crossing in the symbol string are randomly selected, the selection region of the first individual is copied to the same position of a third individual, and symbols lacking in the third individual in the second individual are sequentially filled into the third individual, similarly, the selection region of the second individual is copied to the same position of a fourth individual, and symbols lacking in the fourth individual in the first individual are sequentially filled into the fourth individual, and each third individual and each fourth individual form a third population after a crossing operation.
In this embodiment, the mutation operation is to change one or some characters of an individual with a small probability, and the specific method adopted by the mutation operation is not limited.
Optionally, in an embodiment, two individual characters are randomly selected for exchange, that is, the distribution sequence of two points to be distributed is exchanged.
203. Acquiring a distribution starting point and a distribution terminal point of the current stage;
in this embodiment, the first point to be delivered in the delivery sequence of the current stage is selected as the delivery end point of the previous stage.
204. Generating a plurality of distribution routes based on the distribution starting point and the distribution end point;
205. acquiring an actual load value of a delivery vehicle at the current stage, and calculating the carbon emission amount of the delivery vehicle in running of each delivery route by applying a preset carbon emission formula based on the actual load value;
206. and comparing the carbon emission, and selecting the distribution route with the minimum carbon emission as the material flow path adopted in the current stage.
In the embodiment of the invention, based on the weight of goods to be distributed of a distribution center, each point to be distributed and each point to be distributed, a preset path planning algorithm is applied to carry out path planning to obtain the distribution sequence of each point to be distributed, the distribution starting point and the distribution ending point of the current stage are obtained, a plurality of distribution routes are generated, the carbon emission amount generated when a distribution vehicle runs on each distribution route is calculated according to the actual load value of the distribution vehicle at the current stage, and the distribution route with the minimum carbon emission amount is selected as the actually adopted route in a comparison manner. The method and the system calculate the carbon emission based on the load of the delivery vehicle and plan the path, and simultaneously consider the change of the load of the delivery vehicle after each delivery point, thereby reducing the carbon emission of the whole delivery route and improving the calculation accuracy of the carbon emission and the path planning accuracy.
In the above description of the low-carbon logistics path planning method in the embodiment of the present invention, referring to fig. 3, the low-carbon logistics path planning apparatus in the embodiment of the present invention is described below, and an embodiment of the low-carbon logistics path planning apparatus in the embodiment of the present invention includes:
a first obtaining module 301, configured to obtain a distribution starting point and a distribution ending point at a current stage;
a route generating module 302, configured to generate a plurality of distribution routes based on the distribution starting point and the distribution ending point;
the calculation module 303 is configured to obtain an actual load value of a delivery vehicle at a current stage, and based on the actual load value, calculate a carbon emission amount of the delivery vehicle traveling on each delivery route by applying a preset carbon emission formula;
and the comparison module 304 is configured to compare the carbon emissions, and select a distribution route with the minimum carbon emissions as the material flow path adopted in the current stage.
Optionally, the carbon emission formula is as follows:
wherein T represents the carbon emission amount, S represents the distance between two points, G represents the vehicle body weight, C represents the carbon emission factor, M 1 Representing the actual load value of the delivery vehicle, M 2 Representing the maximum load value of the delivery vehicle.
In the embodiment of the invention, the distribution starting point and the distribution ending point of the current stage are obtained, a plurality of distribution routes are generated, the carbon emission generated when a distribution vehicle runs on each distribution route is calculated according to the actual load value of the distribution vehicle at the current stage, and the distribution route with the minimum carbon emission is selected as the actually adopted route. According to the invention, the carbon emission is calculated and the path is planned based on the load of the distribution vehicle, so that the carbon emission of the whole distribution route is reduced, and the calculation accuracy of the carbon emission and the path planning accuracy are improved.
Referring to fig. 4, another embodiment of the low-carbon logistics path planning apparatus in the embodiment of the invention includes:
a first obtaining module 301, configured to obtain a distribution starting point and a distribution ending point at a current stage;
a route generating module 302, configured to generate a plurality of distribution routes based on the distribution starting point and the distribution ending point;
the calculating module 303 is configured to obtain an actual load value of a delivery vehicle at a current stage, and based on the actual load value, calculate a carbon emission amount of the delivery vehicle traveling on each delivery route by applying a preset carbon emission formula;
a comparison module 304, configured to compare the carbon emissions, and select a distribution route with the minimum carbon emissions as a material flow path adopted in the current stage;
a second obtaining module 305, configured to obtain a distribution center, each point to be distributed, and a weight of goods to be distributed at each point to be distributed;
and a path planning module 306, configured to perform path planning by applying a preset path planning algorithm based on the distribution center, the to-be-distributed points, and the weights of the goods to be distributed at the to-be-distributed points, so as to obtain a distribution sequence of the to-be-distributed points.
Optionally, the path planning module 306 includes:
a calculation unit 3061, configured to determine a distribution sequence of each point to be distributed by using a preset algorithm with a distribution end point of the distribution center or the previous stage as a distribution starting point of the current stage;
a selection unit 3062 for selecting a first point to be delivered as a delivery end point of the current stage
Optionally, the calculation unit 3062 is specifically configured to:
s11, selecting a plurality of individuals as a first group according to carbon emission, wherein the individuals are the distribution sequence of the points to be distributed;
s12, sequentially performing cross operation and mutation operation on the basis of the first population to obtain a second population;
and S13, taking the second population as a new first population and repeatedly executing the step S12 until an iteration condition is met, and selecting the individuals with the highest probability as the distribution sequence of the points to be distributed.
Optionally, the selecting the number of individuals as the first population according to the amount of carbon emissions comprises:
generating a plurality of distribution sequences of the points to be distributed by a preset method and coding the generated distribution sequences, wherein one distribution sequence of each point to be distributed is an individual, and each code corresponds to one individual;
and calculating and obtaining the carbon emission amount generated by the delivery vehicle when each individual is used as a delivery sequence, and selecting a plurality of individuals with the smallest generated carbon emission amount as the first group.
Optionally, the obtaining a second population after sequentially performing intersection and mutation operations based on the first population includes:
randomly pairing the individuals in the first group, and performing cross operation on each pair of individuals by using a sequential cross operator to obtain a third group;
and carrying out mutation operation on individuals in the third population according to a preset probability to obtain the second population.
In the embodiment of the invention, based on the weight of goods to be distributed of a distribution center, each point to be distributed and each point to be distributed, a preset path planning algorithm is applied to carry out path planning to obtain the distribution sequence of each point to be distributed, the distribution starting point and the distribution ending point of the current stage are obtained, a plurality of distribution routes are generated, the carbon emission amount generated when a distribution vehicle runs on each distribution route is calculated according to the actual load value of the distribution vehicle at the current stage, and the distribution route with the minimum carbon emission amount is selected as the actually adopted route in a comparison manner. The method and the system calculate the carbon emission based on the load of the delivery vehicle and plan the path, and simultaneously consider the change of the load of the delivery vehicle after each delivery point, thereby reducing the carbon emission of the whole delivery route and improving the calculation accuracy of the carbon emission and the path planning accuracy.
Fig. 3 and 4 describe the low-carbon logistics path planning apparatus in the embodiment of the invention in detail from the perspective of the modular functional entity, and the electronic device in the embodiment of the invention is described in detail from the perspective of hardware processing.
Fig. 5 is a schematic structural diagram of an electronic device 500 according to an embodiment of the present invention, where the electronic device 500 may have a relatively large difference due to different configurations or performances, and may include one or more processors (CPUs) 510 (e.g., one or more processors) and a memory 520, and one or more storage media 530 (e.g., one or more mass storage devices) for storing applications 533 or data 532. Memory 520 and storage media 530 may be, among other things, transient storage or persistent storage. The program stored on the storage medium 530 may include one or more modules (not shown), each of which may include a sequence of instructions for operating the electronic device 500. Further, the processor 510 may be configured to communicate with the storage medium 530 to execute a series of instruction operations in the storage medium 530 on the electronic device 500.
The electronic device 500 may also include one or more power supplies 540, one or more wired or wireless network interfaces 550, one or more input-output interfaces 560, and/or one or more operating systems 531, such as Windows Server, macOS X, unix, linux, freeBSD, and so forth. Those skilled in the art will appreciate that the electronic device configuration shown in fig. 5 does not constitute a limitation of the electronic device and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components.
The invention further provides an electronic device, which includes a memory and a processor, where the memory stores computer readable instructions, and when the computer readable instructions are executed by the processor, the processor executes the steps of the low-carbon logistics path planning method in the foregoing embodiments.
The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium, and may also be a volatile computer-readable storage medium, having stored therein instructions, which, when executed on a computer, cause the computer to perform the steps of the low-carbon logistics path planning method.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A low-carbon logistics path planning method is characterized by comprising the following steps:
acquiring a distribution starting point and a distribution terminal point of the current stage;
generating a plurality of distribution routes based on the distribution starting point and the distribution end point;
acquiring an actual load value of a delivery vehicle at the current stage, and based on the actual load value, calculating the carbon emission of the delivery vehicle in the running of each delivery route by applying a preset carbon emission formula;
and comparing the carbon emission, and selecting the distribution route with the minimum carbon emission as the material flow path adopted in the current stage.
2. The low-carbon logistics path planning method of claim 1, further comprising, before the obtaining of the delivery start point and the delivery end point of the current stage:
acquiring a distribution center, all points to be distributed and the weight of goods to be distributed of all the points to be distributed;
and based on the distribution center, the to-be-distributed points and the to-be-distributed cargo weight of the to-be-distributed points, performing path planning by applying a preset path planning algorithm to obtain a distribution sequence of the to-be-distributed points.
3. The low-carbon logistics path planning method of claim 2, wherein the applying a preset path planning algorithm to perform path planning based on the distribution center, the points to be distributed, and the weight of the goods to be distributed at the points to be distributed to obtain the distribution sequence of the points to be distributed comprises:
taking the distribution end point of the distribution center or the previous stage as the distribution starting point of the current stage, and determining the distribution sequence of each point to be distributed by applying a preset algorithm;
and selecting the first point to be delivered as the delivery end point of the current stage.
4. The low-carbon logistics path planning method of claim 3, wherein the determining the distribution sequence of the points to be distributed by applying a preset algorithm with the distribution end point of the distribution center or the previous stage as the distribution starting point of the current stage comprises:
s11, selecting a plurality of individuals as a first group according to carbon emission, wherein the individuals are the distribution sequence of the points to be distributed;
s12, sequentially performing cross operation and mutation operation on the basis of the first population to obtain a second population;
and S13, taking the second population as a new first population and repeatedly executing the step S12 until an iteration condition is met, and selecting the individuals with the highest probability as the distribution sequence of the points to be distributed.
5. The low-carbon logistics path planning method of claim 4, wherein the selecting the number of individuals as the first group according to the amount of carbon emissions comprises:
generating a plurality of distribution sequences of the points to be distributed by a preset method and coding the generated distribution sequences, wherein one distribution sequence of each point to be distributed is an individual, and each code corresponds to one individual;
and calculating and obtaining the carbon emission amount generated by the delivery vehicle when each individual is used as a delivery sequence, and selecting a plurality of individuals with the smallest generated carbon emission amount as the first group.
6. The low-carbon logistics path planning method of claim 4, wherein the obtaining of the second population after sequentially performing the intersection operation and the mutation operation based on the first population comprises:
randomly pairing the individuals in the first group, and performing cross operation on each pair of individuals by using a sequential cross operator to obtain a third group;
and carrying out mutation operation on individuals in the third population according to a preset probability to obtain the second population.
7. The low-carbon logistics path planning method of claim 1, wherein the carbon emission formula is as follows:
wherein T represents the carbon emission amount, S represents the distance between two points, G represents the vehicle body weight, C represents the carbon emission factor, M 1 Representing the actual load value of the delivery vehicle, M 2 Representing the maximum load value of the delivery vehicle.
8. A low-carbon logistics path planning device is characterized by comprising:
the first acquisition module is used for acquiring a distribution starting point and a distribution terminal point of the current stage;
the route generating module is used for generating a plurality of distribution routes based on the distribution starting points and the distribution end points;
the calculation module is used for acquiring the actual load value of the delivery vehicle at the current stage and calculating the carbon emission amount of the delivery vehicle in the running of each delivery route by applying a preset carbon emission formula based on the actual load value;
and the comparison module is used for comparing the carbon emission and selecting the distribution route with the minimum carbon emission as the material flow path adopted at the current stage.
9. An electronic device, characterized in that the electronic device comprises: a memory and at least one processor, the memory having instructions stored therein;
the at least one processor invokes the instructions in the memory to cause the electronic device to perform the low carbon logistics path planning method of any of claims 1-7.
10. A computer-readable storage medium having instructions stored thereon, wherein the instructions, when executed by a processor, implement the low-carbon logistics path planning method of any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310070908.9A CN115809752B (en) | 2023-02-07 | 2023-02-07 | Low-carbon logistics path planning method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310070908.9A CN115809752B (en) | 2023-02-07 | 2023-02-07 | Low-carbon logistics path planning method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115809752A true CN115809752A (en) | 2023-03-17 |
| CN115809752B CN115809752B (en) | 2023-07-21 |
Family
ID=85487544
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310070908.9A Active CN115809752B (en) | 2023-02-07 | 2023-02-07 | Low-carbon logistics path planning method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115809752B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118071233A (en) * | 2024-04-19 | 2024-05-24 | 港华能源创科(深圳)有限公司 | Method and tool for determining transportation scheme and electronic equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009026167A (en) * | 2007-07-23 | 2009-02-05 | Fujitsu Ltd | Emission distribution apparatus, emission distribution method, emission distribution program and emission distribution system |
| CN102077231A (en) * | 2008-06-27 | 2011-05-25 | 株式会社日本耐美得 | Route searching apparatus and route searching method |
| KR20120100601A (en) * | 2011-03-04 | 2012-09-12 | 주식회사 한국무역정보통신 | Optimization system of smart logistics network |
| CN106570583A (en) * | 2016-10-25 | 2017-04-19 | 北京航空航天大学 | Route low carbon optimization method for automobile set path under dynamic traffic environment |
| CN108492020A (en) * | 2018-03-16 | 2018-09-04 | 浙江工商大学 | Pollution vehicle dispatching method and system based on simulated annealing and branch's cutting optimization |
| CN113780961A (en) * | 2021-10-13 | 2021-12-10 | 南京信息工程大学 | Low-carbon vaccine cold-chain optimized distribution method of multi-target firework algorithm |
| CN115545608A (en) * | 2022-10-09 | 2022-12-30 | 合肥工业大学 | Green logistics vehicle path optimization method based on uncertain demand and application |
-
2023
- 2023-02-07 CN CN202310070908.9A patent/CN115809752B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009026167A (en) * | 2007-07-23 | 2009-02-05 | Fujitsu Ltd | Emission distribution apparatus, emission distribution method, emission distribution program and emission distribution system |
| CN102077231A (en) * | 2008-06-27 | 2011-05-25 | 株式会社日本耐美得 | Route searching apparatus and route searching method |
| KR20120100601A (en) * | 2011-03-04 | 2012-09-12 | 주식회사 한국무역정보통신 | Optimization system of smart logistics network |
| CN106570583A (en) * | 2016-10-25 | 2017-04-19 | 北京航空航天大学 | Route low carbon optimization method for automobile set path under dynamic traffic environment |
| CN108492020A (en) * | 2018-03-16 | 2018-09-04 | 浙江工商大学 | Pollution vehicle dispatching method and system based on simulated annealing and branch's cutting optimization |
| CN113780961A (en) * | 2021-10-13 | 2021-12-10 | 南京信息工程大学 | Low-carbon vaccine cold-chain optimized distribution method of multi-target firework algorithm |
| CN115545608A (en) * | 2022-10-09 | 2022-12-30 | 合肥工业大学 | Green logistics vehicle path optimization method based on uncertain demand and application |
Non-Patent Citations (1)
| Title |
|---|
| 白秦洋: "基于行程时间预测的冷链物流路径规划研究"" * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118071233A (en) * | 2024-04-19 | 2024-05-24 | 港华能源创科(深圳)有限公司 | Method and tool for determining transportation scheme and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115809752B (en) | 2023-07-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111178582B (en) | Logistics distribution optimization method based on improved genetic algorithm | |
| CN108053119A (en) | A kind of Modified particle swarm optimization algorithm for solving zero-waiting Flow Shop Scheduling | |
| CN113627642B (en) | Stacker path optimization method based on self-adaptive large-scale neighborhood search algorithm | |
| Jia et al. | Confidence-based ant colony optimization for capacitated electric vehicle routing problem with comparison of different encoding schemes | |
| CN110826819B (en) | Automatic container terminal vehicle path planning method | |
| CN115809752B (en) | Low-carbon logistics path planning method, device, equipment and storage medium | |
| CN113240215B (en) | Scheduling method and system for storage AGV, storage medium and electronic equipment | |
| CN111461402B (en) | Logistics scheduling optimization method and device, computer-readable storage medium and terminal | |
| CN110471274A (en) | Based on the machine components process line dispatching method for improving unified particle swarm algorithm | |
| CN113408988A (en) | Scheduling optimization method of warehousing system, electronic equipment and storage medium | |
| Mahmoudinazlou et al. | A hybrid genetic algorithm with type-aware chromosomes for traveling salesman problems with drone | |
| CN114444843A (en) | Agricultural product green logistics distribution vehicle scheduling method and system based on large-scale variable neighborhood search strategy | |
| Jiang et al. | An improved adaptive genetic algorithm for mobile robot path planning analogous to the ordered clustered TSP | |
| Vincent et al. | Simulated annealing with reinforcement learning for the set team orienteering problem with time windows | |
| CN116957177A (en) | Flexible workshop production line planning method, system, equipment and medium | |
| CN116167558A (en) | Multi-vehicle remote health monitoring offline service task scheduling method | |
| CN108108883A (en) | A kind of vehicle scheduling network resilience based on clustering algorithm simplifies method | |
| CN113029175B (en) | Fast path planning method considering two-way multi-path points | |
| CN108416482B (en) | Logistics distribution path planning method based on regional multiple strategies | |
| CN113793030A (en) | Material scheduling method and device and storage medium | |
| CN113435650A (en) | Planning method, device and equipment for vehicle driving path and storage medium | |
| CN109102123B (en) | Carpooling route optimization method and device, storage medium and computing device | |
| JP2003109170A (en) | Method and system for preparing schedule of transportation | |
| Morinaga et al. | A facility layout planning method considering routing and temporal efficiency | |
| CN104915820A (en) | A material dispatching method and system with transport tools being virtualized as supply points or demand points |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |