CN111340431B - Method, device and equipment for planning transportation route and storage medium - Google Patents

Method, device and equipment for planning transportation route and storage medium Download PDF

Info

Publication number
CN111340431B
CN111340431B CN202010227454.8A CN202010227454A CN111340431B CN 111340431 B CN111340431 B CN 111340431B CN 202010227454 A CN202010227454 A CN 202010227454A CN 111340431 B CN111340431 B CN 111340431B
Authority
CN
China
Prior art keywords
strategies
target
vehicle
strategy
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.)
Active
Application number
CN202010227454.8A
Other languages
Chinese (zh)
Other versions
CN111340431A (en
Inventor
衡鹤瑞
李培吉
李斯
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dongpu Software Co Ltd
Original Assignee
Dongpu Software Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Dongpu Software Co Ltd filed Critical Dongpu Software Co Ltd
Priority to CN202010227454.8A priority Critical patent/CN111340431B/en
Publication of CN111340431A publication Critical patent/CN111340431A/en
Application granted granted Critical
Publication of CN111340431B publication Critical patent/CN111340431B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to the technical field of logistics transportation, and discloses a transportation route planning method, a device, equipment and a storage medium, which are used for calculating and determining a target route planning strategy through a lane algorithm formula, a vehicle cost algorithm formula and an aging algorithm formula, and can reasonably plan a transportation route so as to improve the accuracy of transportation route planning. The planning method of the transportation route comprises the following steps: acquiring logistics transportation task information from a transportation allocation center; calculating according to the logistics transportation task information to obtain a plurality of initial routing planning strategies, wherein different initial routing planning strategies comprise different lane strategies, different vehicle strategies and different departure time strategies; screening a plurality of initial route planning strategies to obtain a plurality of candidate route planning strategies; and calculating to obtain a route target value according to the candidate route planning strategies, determining a target route planning strategy according to the route target value, and transmitting the target route planning strategy to the transportation distribution center.

Description

Method, device and equipment for planning transportation route and storage medium
Technical Field
The invention relates to the technical field of logistics transportation, in particular to a method, a device, equipment and a storage medium for planning a transportation route.
Background
With the development of economy and electronic commerce, the logistics industry becomes an essential part of life, and as the logistics industry develops rapidly, manual route planning becomes difficult, and route planning needs to be performed by means of a computer. The method is characterized in that the method starts from an initial distribution point, transports goods to a target distribution point, and also needs to reach different transfer distribution points to load different goods in the distance, and also relates to the problems of departure time and vehicle type selection, how to carry out maximum reasonable planning on the route becomes the problem to be solved in the logistics transportation industry.
In the prior art, when a transportation route is planned according to logistics information, due to incomplete informatization data of a logistics company, required basic data cannot be obtained when a route transportation model is established, so that a complete logistics route transportation model cannot be established, and the transportation route cannot be reasonably planned, so that the transportation route cannot be accurately planned.
Disclosure of Invention
The invention mainly aims to solve the problem of inaccurate transport route planning caused by unreasonable transport route planning.
The invention provides a planning method of a transportation route in a first aspect, which comprises the following steps: acquiring logistics transportation task information from a transportation allocation center, wherein the logistics transportation task information comprises an initial allocation point, a target allocation point and an initial cargo amount; calculating according to the logistics transportation task information to obtain a plurality of initial routing planning strategies, wherein the initial routing planning strategies comprise a lane strategy, a vehicle strategy and a departure time strategy, and each initial routing planning strategy is not identical; screening the plurality of initial routing planning strategies to obtain a plurality of candidate routing planning strategies; and calculating to obtain a route target value according to the candidate route planning strategies, determining a target route planning strategy according to the route target value, and transmitting the target route planning strategy to the transportation distribution center.
Optionally, in a first implementation manner of the first aspect of the present invention, the screening the multiple initial routing plan policies to obtain multiple candidate routing plan policies includes: reading a plurality of lane strategies from the plurality of initial route planning strategies, and primarily screening the plurality of initial route planning strategies according to the plurality of lane strategies to obtain a plurality of first pre-selection route planning strategies; reading a plurality of vehicle strategies from the plurality of first pre-selection route planning strategies, and carrying out secondary screening on the plurality of first pre-selection route planning strategies according to the plurality of vehicle strategies to obtain a plurality of second pre-selection route planning strategies; and reading a plurality of departure time strategies from the plurality of second pre-selected route planning strategies, and carrying out third screening on the plurality of second pre-selected route planning strategies according to the plurality of departure time strategies to obtain a plurality of candidate route planning strategies.
Optionally, in a second implementation manner of the first aspect of the present invention, the reading multiple lane strategies from the multiple initial route planning strategies, and performing primary screening on the multiple initial route planning strategies according to the multiple lane strategies to obtain multiple first pre-selected route planning strategies includes: reading a plurality of lane strategies, judging whether each lane strategy in the plurality of lane strategies comprises a corresponding transfer strategy, if the target lane strategy does not comprise the corresponding transfer strategy, filtering the plurality of target lane strategies to obtain a plurality of first-filtered lane strategies, wherein the transfer strategy at least corresponds to one transfer allocation point; judging whether a transfer distribution point corresponding to each first-filtered lane strategy comprises a transportation demand, if the transfer distribution point corresponding to the target first-filtered lane strategy does not comprise the transportation demand, filtering a plurality of target first-filtered lane strategies which do not comprise the transportation demand to obtain a plurality of second-filtered lane strategies; judging whether the goods amount corresponding to each second-filtered lane strategy exceeds a goods processing threshold value, if so, filtering a plurality of target second-filtered lane strategies to obtain a plurality of third-filtered lane strategies; and judging whether the route strategy distance corresponding to each route strategy filtered for the third time is greater than the route distance threshold, if the route strategy distance corresponding to the route strategy filtered for the third time by the target is greater than the route distance threshold, filtering a plurality of route strategies filtered for the third time by the target to obtain a plurality of candidate route strategies, and determining the initial route planning strategy corresponding to each candidate route strategy as a first pre-selection route planning strategy to obtain a plurality of first pre-selection route planning strategies.
Optionally, in a third implementation manner of the first aspect of the present invention, the reading a plurality of vehicle policies from the plurality of first pre-selected route planning policies, and performing a second screening on the plurality of first pre-selected route planning policies according to the plurality of vehicle policies to obtain a plurality of second pre-selected route planning policies includes: reading a plurality of vehicle strategies from the plurality of first pre-selected route planning strategies, judging whether the number of vehicles corresponding to each vehicle strategy is greater than the vehicle available threshold, and filtering out a plurality of target vehicle strategies to obtain a plurality of vehicle strategies after primary filtering if the number of vehicles corresponding to the target vehicle strategies is greater than the vehicle available threshold; judging whether the number of idle running vehicles corresponding to each first-filtered vehicle strategy is greater than the number of corresponding vehicles, and if the number of idle running vehicles corresponding to the target first-filtered vehicle strategy is greater than the number of corresponding vehicles, filtering a plurality of target first-filtered vehicle strategies to obtain a plurality of second-filtered vehicle strategies; and judging whether the vehicle load corresponding to each vehicle strategy after the second filtering is larger than or equal to the initial cargo quantity, if the vehicle load corresponding to the vehicle strategy after the target second filtering is smaller than the initial cargo quantity, filtering a plurality of vehicle strategies after the target second filtering to obtain a plurality of candidate vehicle strategies, and determining the initial route planning strategy corresponding to each candidate vehicle strategy as a second pre-selection route planning strategy to obtain a plurality of second pre-selection route planning strategies.
Optionally, in a fourth implementation manner of the first aspect of the present invention, the reading a plurality of departure time policies from the plurality of second pre-selected route planning policies, and performing a third screening on the plurality of second pre-selected route planning policies according to the plurality of departure time policies to obtain a plurality of candidate route planning policies includes: reading a plurality of departure time strategies from the plurality of second pre-selected route planning strategies, judging whether the goods of the transfer distribution point corresponding to each departure time strategy are stacked in the same vehicle with the goods of the initial distribution point, and filtering out a plurality of target departure time strategies to obtain a plurality of filtered departure time strategies if the goods of the transfer distribution point corresponding to the target departure time strategy are not stacked in the same vehicle with the goods of the initial distribution point; and if the vehicle loading capacity corresponding to the departure time strategy after the target filtration is smaller than the loading capacity threshold of the vehicle, filtering the departure time strategies after the plurality of targets are filtered to obtain a plurality of candidate departure time strategies, and determining the initial route planning strategy corresponding to each candidate departure time strategy as a candidate route planning strategy to obtain a plurality of candidate route planning strategies.
Optionally, in a fifth implementation manner of the first aspect of the present invention, the calculating a route target value according to the multiple candidate route planning strategies, determining a target route planning strategy according to the route target value, and transmitting the target route planning strategy to the transportation allocation center includes: reading a plurality of planning parameters from the plurality of candidate route planning strategies, wherein the planning parameters comprise a lane distance parameter, a vehicle parameter and an aging parameter; and calculating to obtain a route target value according to the planning parameters and preset formulas, determining a target route planning strategy based on the route target value, and transmitting the target route planning strategy to the transportation allocation center.
Optionally, in a sixth implementation manner of the first aspect of the present invention, the calculating a route target value according to the multiple planning parameters and multiple preset formulas, determining a target route planning policy based on the route target value, and transmitting the target route planning policy to the transportation allocation center includes: aiming at any one candidate route planning strategy in the candidate route planning strategies, inputting the corresponding lane distance parameter, the corresponding vehicle parameter and the corresponding aging parameter into a preset lane formula to obtain a target lane value; inputting the corresponding lane distance parameter, vehicle parameter and aging parameter into a preset vehicle cost formula to obtain a target vehicle cost value; inputting the corresponding lane distance parameter, vehicle parameter and aging parameter into a preset aging formula to obtain an effective value at the time of target; obtaining a plurality of target vehicle line values, a plurality of target vehicle cost values and a plurality of target effective values aiming at other candidate route planning strategies in the plurality of candidate route planning strategies; and calculating based on a preset routing target value formula, the target vehicle line values, the target vehicle cost values and the target effective values to obtain a routing target value, determining a target routing planning strategy according to the routing target value, and transmitting the target routing planning strategy to the transportation allocation center.
The second aspect of the present invention provides a transportation route planning apparatus, including: the system comprises a transportation task acquisition module, a transportation distribution center and a management module, wherein the transportation task acquisition module is used for acquiring logistics transportation task information from the transportation distribution center, and the logistics transportation task information comprises an initial distribution point, a target distribution point and an initial cargo amount; the initial strategy calculation module is used for calculating according to the logistics transportation task information to obtain a plurality of initial route planning strategies, wherein the initial route planning strategies comprise a lane strategy, a vehicle strategy and a departure time strategy, and each initial route planning strategy is not identical; the candidate strategy screening module is used for screening the plurality of initial route planning strategies to obtain a plurality of candidate route planning strategies; and the target strategy calculation module is used for calculating a route target value according to the candidate route planning strategies, determining a target route planning strategy according to the route target value and transmitting the target route planning strategy to the transportation allocation center.
Optionally, in a first implementation manner of the second aspect of the present invention, the initial policy calculation module includes: the primary screening unit is used for reading a plurality of lane strategies from the plurality of initial route planning strategies and primarily screening the plurality of initial route planning strategies according to the plurality of lane strategies to obtain a plurality of first pre-selected route planning strategies; the second screening unit is used for reading a plurality of vehicle strategies from the plurality of first pre-selected route planning strategies, and performing second screening on the plurality of first pre-selected route planning strategies according to the plurality of vehicle strategies to obtain a plurality of second pre-selected route planning strategies; and the third screening unit is used for reading a plurality of departure time strategies from the plurality of second pre-selected route planning strategies, and performing third screening on the plurality of second pre-selected route planning strategies according to the plurality of departure time strategies to obtain a plurality of candidate route planning strategies.
Optionally, in a second implementation manner of the second aspect of the present invention, the primary screening unit is specifically configured to: reading a plurality of lane strategies, judging whether each lane strategy in the plurality of lane strategies comprises a corresponding transfer strategy, if the target lane strategy does not comprise the corresponding transfer strategy, filtering the plurality of target lane strategies to obtain a plurality of first-filtered lane strategies, wherein the transfer strategy at least corresponds to one transfer allocation point; judging whether a transfer distribution point corresponding to each first-filtered lane strategy comprises a transportation demand, if the transfer distribution point corresponding to the target first-filtered lane strategy does not comprise the transportation demand, filtering a plurality of target first-filtered lane strategies which do not comprise the transportation demand to obtain a plurality of second-filtered lane strategies; judging whether the goods amount corresponding to each second-filtered lane strategy exceeds a goods processing threshold value, if so, filtering a plurality of target second-filtered lane strategies to obtain a plurality of third-filtered lane strategies; and judging whether the route strategy distance corresponding to each route strategy filtered for the third time is greater than the route distance threshold, if the route strategy distance corresponding to the route strategy filtered for the third time by the target is greater than the route distance threshold, filtering a plurality of route strategies filtered for the third time by the target to obtain a plurality of candidate route strategies, and determining the initial route planning strategy corresponding to each candidate route strategy as a first pre-selection route planning strategy to obtain a plurality of first pre-selection route planning strategies.
Optionally, in a third implementation manner of the second aspect of the present invention, the second screening unit is specifically configured to: reading a plurality of vehicle strategies from the plurality of first pre-selected route planning strategies, judging whether the number of vehicles corresponding to each vehicle strategy is greater than the vehicle available threshold, and filtering out a plurality of target vehicle strategies to obtain a plurality of vehicle strategies after primary filtering if the number of vehicles corresponding to the target vehicle strategies is greater than the vehicle available threshold; judging whether the number of idle running vehicles corresponding to each first-filtered vehicle strategy is greater than the number of corresponding vehicles, and if the number of idle running vehicles corresponding to the target first-filtered vehicle strategy is greater than the number of corresponding vehicles, filtering a plurality of target first-filtered vehicle strategies to obtain a plurality of second-filtered vehicle strategies; and judging whether the vehicle load corresponding to each vehicle strategy after the second filtering is larger than or equal to the initial cargo quantity, if the vehicle load corresponding to the vehicle strategy after the target second filtering is smaller than the initial cargo quantity, filtering a plurality of vehicle strategies after the target second filtering to obtain a plurality of candidate vehicle strategies, and determining the initial route planning strategy corresponding to each candidate vehicle strategy as a second pre-selection route planning strategy to obtain a plurality of second pre-selection route planning strategies.
Optionally, in a fourth implementation manner of the second aspect of the present invention, the third screening unit is specifically configured to: reading a plurality of departure time strategies from the plurality of second pre-selected route planning strategies, judging whether the goods of the transfer distribution point corresponding to each departure time strategy are stacked in the same vehicle with the goods of the initial distribution point, and filtering out a plurality of target departure time strategies to obtain a plurality of filtered departure time strategies if the goods of the transfer distribution point corresponding to the target departure time strategy are not stacked in the same vehicle with the goods of the initial distribution point; and if the vehicle loading capacity corresponding to the departure time strategy after the target filtration is smaller than the loading capacity threshold of the vehicle, filtering the departure time strategies after the plurality of targets are filtered to obtain a plurality of candidate departure time strategies, and determining the initial route planning strategy corresponding to each candidate departure time strategy as a candidate route planning strategy to obtain a plurality of candidate route planning strategies.
Optionally, in a fifth implementation manner of the second aspect of the present invention, the target policy calculation module specifically includes: a planning parameter reading unit, configured to read a plurality of planning parameters from the plurality of candidate route planning strategies, where the planning parameters include a lane distance parameter, a vehicle parameter, and an aging parameter; and the route target value calculation unit is used for calculating to obtain a route target value according to the planning parameters and the preset formulas, determining a target route planning strategy based on the route target value, and transmitting the target route planning strategy to the transportation distribution center.
Optionally, in a sixth implementation manner of the second aspect of the present invention, the route target value calculation unit is specifically configured to: aiming at any one candidate route planning strategy in the candidate route planning strategies, inputting the corresponding lane distance parameter, the corresponding vehicle parameter and the corresponding aging parameter into a preset lane formula to obtain a target lane value; inputting the corresponding lane distance parameter, vehicle parameter and aging parameter into a preset vehicle cost formula to obtain a target vehicle cost value; inputting the corresponding lane distance parameter, vehicle parameter and aging parameter into a preset aging formula to obtain an effective value at the time of target; obtaining a plurality of target vehicle line values, a plurality of target vehicle cost values and a plurality of target effective values aiming at other candidate route planning strategies in the plurality of candidate route planning strategies; and calculating based on a preset routing target value formula, the target vehicle line values, the target vehicle cost values and the target effective values to obtain a routing target value, determining a target routing planning strategy according to the routing target value, and transmitting the target routing planning strategy to the transportation allocation center.
A third aspect of the present invention provides a transportation route planning apparatus, including: a memory having instructions stored therein and at least one processor, the memory and the at least one processor interconnected by a line; the at least one processor invokes the instructions in the memory to cause the transportation route planning device to execute the transportation route planning method.
A fourth aspect of the present invention provides a computer-readable storage medium having stored therein instructions, which, when run on a computer, cause the computer to execute the above-mentioned method for planning a transportation route.
In the technical scheme provided by the invention, logistics transportation task information is acquired from a transportation allocation center, wherein the logistics transportation task information comprises an initial allocation point, a target allocation point and an initial cargo amount; calculating according to the logistics transportation task information to obtain a plurality of initial routing planning strategies, wherein different initial routing planning strategies comprise different lane strategies, different vehicle strategies or different departure time strategies; screening the plurality of initial routing planning strategies to obtain a plurality of candidate routing planning strategies; and calculating to obtain a route target value according to the candidate route planning strategies, determining a target route planning strategy according to the route target value, and transmitting the target route planning strategy to the transportation distribution center. In the embodiment of the invention, the route target value is obtained by calculating the genetic algorithm through the lane algorithm formula, the vehicle cost algorithm formula and the aging algorithm formula in a plurality of route planning strategies, and then the transportation route can be planned reasonably according to the determined target route planning strategy, so that the accuracy of transportation route planning is improved.
Drawings
Fig. 1 is a schematic diagram of an embodiment of a transportation route planning method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of another embodiment of a transportation route planning method according to an embodiment of the present invention;
fig. 3 is a schematic diagram of an embodiment of a transportation route planning device in the embodiment of the invention;
fig. 4 is a schematic diagram of another embodiment of the transportation route planning device in the embodiment of the invention;
fig. 5 is a schematic diagram of an embodiment of a transportation route planning device in an embodiment of the present invention.
Detailed Description
The embodiment of the invention provides a method, a device, equipment and a storage medium for planning a transportation route, which are used for calculating a route target value through a lane algorithm formula, a vehicle cost algorithm formula and an aging algorithm formula in a plurality of route planning strategies through a genetic algorithm, determining a target route planning strategy based on the route target value, and reasonably planning the transportation route so as to improve the accuracy of transportation route planning.
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 practiced otherwise than as specifically 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 method for planning a transportation route in the embodiment of the present invention includes:
101. acquiring logistics transportation task information from a transportation allocation center, wherein the logistics transportation task information comprises an initial allocation point, a target allocation point and an initial cargo amount;
the server acquires logistics transportation task information including an initial distribution point, a target distribution point and an initial cargo amount from the transportation distribution center.
The server acquires logistics transportation task information from the transportation allocation center, wherein the logistics transportation task information comprises an initial allocation point and a target allocation point of a city or an administrative district, and the initial cargo quantity of the pregnant animals required from the initial allocation point. For example, the logistics transportation task information sent by the transportation allocation center comprises that the starting allocation point is the Shanghai city quiet zone, the destination allocation point is the Shenzhen city Nanshan zone and the initial cargo amount is 0.8 ton. And the server carries out transportation route planning according to the logistics transportation task information of the quiet region of the Shanghai city of the starting distribution point, the Nanshan region of the Shenzhen city of the destination distribution point and the initial cargo quantity of 0.8 ton.
It is to be understood that the execution subject of the present invention may be a planning apparatus for transportation route, 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.
102. Calculating according to the logistics transportation task information to obtain a plurality of initial routing planning strategies, wherein the initial routing planning strategies comprise a lane strategy, a vehicle strategy and a departure time strategy, and each initial routing planning strategy is not identical;
the server calculates logistics transportation task information including an initial distribution point, a target distribution point and an initial cargo amount to obtain a plurality of incompletely identical initial route planning strategies including a plurality of lane strategies, vehicle strategies and departure time strategies.
The server firstly carries out primary route planning based on the initial distribution point, the target distribution point and the initial cargo quantity to obtain a plurality of initial route planning strategies, and each initial route planning strategy corresponds to a group of lane strategies, vehicle strategies and departure time strategies.
For example, the starting allocation point is a Shanghai Shenzhen nan mountain area, the target allocation point is a Shenzhen nan mountain area, and the initial cargo amount is 0.8 ton, the server can plan to obtain thousands of transportation routes according to two allocation points from the Shanghai Shenzhen area to the Shenzhen nan mountain area and the cargo amount of 0.8 ton, for example, the initial route planning strategy 1 is to invoke one A-type vehicle to start from the Shenzhen nan mountain area when the Shanghai is the Shenzhen area and the cargo amount of 0.8 ton is loaded; the initial route planning strategy 2 is to call a vehicle A to load 0.8 tons of cargos in a quiet safety area of Shanghai city and start to a Pudong area of Shanghai city, and then load 0.2 tons of cargos in the Pudong area of Shanghai city and start to a Nanshan area of Shenzhen city; the initial route planning strategy 3 is to call two B-type vehicles to load 0.8 tons of cargos in the Shenzhen district of Shanghai city and start to the Xiaoshan district of Hangzhou city, and then start to the Shenzhen district of Nanshan after loading 0.5 tons of cargos in the Xiaoshan district of Hangzhou city; the initial route planning strategy 4 is to call three B-type vehicles to load 0.8 tons of cargos in the quiet and safe area of Shanghai city and then load 1.2 tons of cargos in the Wuchen area of Jinhua city, and then start to the Nanshan area of Shenzhen city. It is assumed that 3000 initial route planning strategies can be calculated by the quiet region of Shanghai city, the south mountain region of Shenzhen city and the cargo quantity of 0.8 ton.
103. Screening a plurality of initial route planning strategies to obtain a plurality of candidate route planning strategies;
the server screens a plurality of initial routing planning strategies, and therefore a plurality of candidate routing planning strategies are obtained.
The server compares a lane planning strategy, a vehicle planning strategy and a departure time planning strategy in the initial routing planning strategies with the constraint conditions, so that the initial routing planning strategies are screened, and a plurality of candidate routing planning strategies are obtained.
For example, assuming that the number of initial routing planning strategies is 3000, and the constraint condition of the route planning strategy is to filter the initial routing planning strategy that does not include the transit transfer point, then 50 initial routing planning strategies are filtered out, and 2950 initial routing strategies after first filtering are obtained; if the constraint condition of the vehicle strategy is to filter the initial route planning strategy of which the number of the vehicles is greater than the available threshold value of the vehicles, filtering out 500 initial planning strategies after the first filtering to obtain 2450 initial planning strategies after the second filtering; and the constraint condition of the planning strategy at the departure moment is to filter out an initial planning strategy that the goods at the transfer distribution point and the goods at the initial distribution point are not stacked in the same vehicle, and then 1000 initial planning strategies after secondary filtration are filtered out, and finally 1450 candidate route planning strategies are obtained.
104. And calculating to obtain a route target value according to the candidate route planning strategies, determining a target route planning strategy according to the route target value, and transmitting the target route planning strategy to the transportation distribution center.
And the server calculates the target values of the candidate route planning strategies to obtain the route target values and determines the target route planning strategies to be transmitted to the transportation allocation center based on the route target values.
For example, the server reads a plurality of parameters from the plurality of candidate route planning strategies, then performs target value calculation on the plurality of candidate route planning strategies according to the plurality of read parameters, assumes that the obtained route target value is 1.5, and finally determines a corresponding target route planning strategy from the plurality of candidate route planning strategies based on the route target value 1.5.
It should be noted that, in this embodiment, calculating the route target value is actually calculating a route minimum value in the plurality of candidate route planning policies.
In the embodiment of the invention, the route target value is obtained by calculating the genetic algorithm through the lane algorithm formula, the vehicle cost algorithm formula and the aging algorithm formula in a plurality of route planning strategies, and then the transportation route can be planned reasonably according to the determined target route planning strategy, so that the accuracy of transportation route planning is improved.
Referring to fig. 2, another embodiment of the transportation route planning method according to the embodiment of the present invention includes:
201. acquiring logistics transportation task information from a transportation allocation center, wherein the logistics transportation task information comprises an initial allocation point, a target allocation point and an initial cargo amount;
the server acquires logistics transportation task information including an initial distribution point, a target distribution point and an initial cargo amount from the transportation distribution center.
The server acquires logistics transportation task information from the transportation allocation center, wherein the logistics transportation task information comprises an initial allocation point and a target allocation point of a city or an administrative district, and the initial cargo quantity of the pregnant animals required from the initial allocation point. For example, the logistics transportation task information sent by the transportation allocation center comprises that the starting allocation point is the Shanghai city quiet zone, the destination allocation point is the Shenzhen city Nanshan zone and the initial cargo amount is 0.8 ton. And the server carries out transportation route planning according to the logistics transportation task information of the quiet region of the Shanghai city of the starting distribution point, the Nanshan region of the Shenzhen city of the destination distribution point and the initial cargo quantity of 0.8 ton.
202. Calculating according to the logistics transportation task information to obtain a plurality of initial routing planning strategies, wherein the initial routing planning strategies comprise a lane strategy, a vehicle strategy and a departure time strategy, and each initial routing planning strategy is not identical;
the server calculates logistics transportation task information including an initial distribution point, a target distribution point and an initial cargo amount to obtain a plurality of incompletely identical initial route planning strategies including a plurality of lane strategies, vehicle strategies and departure time strategies.
For example, the starting allocation point is a Shanghai Shenzhen nan mountain area, the target allocation point is a Shenzhen nan mountain area, and the initial cargo amount is 0.8 ton, the server can plan to obtain thousands of transportation routes according to two allocation points from the Shanghai Shenzhen area to the Shenzhen nan mountain area and the cargo amount of 0.8 ton, for example, the initial route planning strategy 1 is to invoke one A-type vehicle to start from the Shenzhen nan mountain area when the Shanghai is the Shenzhen area and the cargo amount of 0.8 ton is loaded; the initial route planning strategy 2 is to call a vehicle A to load 0.8 tons of cargos in a quiet safety area of Shanghai city and start to a Pudong area of Shanghai city, and then load 0.2 tons of cargos in the Pudong area of Shanghai city and start to a Nanshan area of Shenzhen city; the initial route planning strategy 3 is to call two B-type vehicles to load 0.8 tons of cargos in the Shenzhen district of Shanghai city and start to the Xiaoshan district of Hangzhou city, and then start to the Shenzhen district of Nanshan after loading 0.5 tons of cargos in the Xiaoshan district of Hangzhou city; the initial route planning strategy 4 is to call three B-type vehicles to load 0.8 tons of cargos in the quiet and safe area of Shanghai city and then load 1.2 tons of cargos in the Wuchen area of Jinhua city, and then start to the Nanshan area of Shenzhen city. It is assumed that 3000 initial route planning strategies can be calculated by the quiet region of Shanghai city, the south mountain region of Shenzhen city and the cargo quantity of 0.8 ton.
203. Screening a plurality of initial route planning strategies to obtain a plurality of candidate route planning strategies;
the server screens a plurality of initial routing planning strategies, and therefore a plurality of candidate routing planning strategies are obtained.
Specifically, the server reads a plurality of lane strategies for primarily screening a plurality of initial route planning strategies from the plurality of initial route planning strategies, and further obtains a plurality of first pre-selected route planning strategies; then the server reads a plurality of vehicle strategies for carrying out secondary screening on the plurality of first route planning strategies from the plurality of initial route planning strategies to further obtain a plurality of second pre-selected route planning strategies; and finally, the server reads a plurality of departure time strategies for carrying out third screening on the plurality of second routing planning strategies from the plurality of initial routing planning strategies, and further obtains a plurality of candidate routing planning strategies.
The specific process of primary screening is as follows:
the server judges whether the read plurality of lane strategies include a transfer strategy corresponding to at least one transfer allocation point, if the target lane strategy does not include the transfer strategy, for example, the lane strategy from the initial allocation point in the Shanghai Silent area to the Shenzhen Jean area does not include transfer allocation points for transferring other areas in the Shanghai or other areas in the Hangzhou state, the plurality of target lane strategies are filtered out, and a plurality of first-filtered lane strategies are obtained; the server filters a plurality of first-filtered lane strategies which do not include transportation requirements in the transfer distribution point to obtain a plurality of second-filtered lane strategies; the server filters a plurality of second filtered lane strategies when the cargo quantity exceeds a cargo processing threshold value to obtain a plurality of third filtered lane strategies; and finally, the server filters a plurality of third filtered lane strategies of which the lane strategy distances are greater than the lane distance threshold value to obtain a plurality of candidate lane strategies, and determines a plurality of first pre-selection route planning strategies based on the plurality of candidate lane strategies.
In addition, the primary screening includes the following constraints:
in the first pre-selection route planning strategy, the quantity of the goods of the route from the initial distribution point to the target distribution point must be the sum of the quantities of the goods of all the distribution points of the route; the route distance from the initial distribution point to the destination distribution point must be the sum of the routes of the route passing through all the distribution points; the quantity of goods from the initial distribution point to the target distribution point must be the sum of the quantity of goods of all the distribution points of the line.
The specific process of the second screening is as follows:
the server reads a plurality of vehicle strategies from the plurality of first pre-selected route planning strategies, filters out a plurality of vehicle strategy strategies with the vehicle number larger than a vehicle available threshold value, and obtains a plurality of vehicle strategies after first filtering; the server filters a plurality of first filtered vehicle strategies with the vehicle empty running quantity larger than the corresponding vehicle quantity to obtain a plurality of second filtered vehicle strategies, filters a plurality of second filtered vehicle strategies with the vehicle loading quantity smaller than the initial cargo quantity to obtain a plurality of candidate vehicle strategies, and determines a plurality of second preselected route planning strategies based on the plurality of candidate vehicle strategies.
The specific process of the third screening is as follows:
the server reads a plurality of departure time strategies from a plurality of second pre-selected route planning strategies, filters out a plurality of departure time strategies that the goods at the transfer distribution point are not piled with the goods at the initial distribution point, and obtains a plurality of filtered departure time strategies; the server filters a plurality of filtered departure time strategies with the target vehicle loading capacity smaller than the target vehicle loading capacity threshold value to obtain a plurality of candidate departure time strategies, and obtains a plurality of candidate route planning strategies according to the candidate departure time strategies.
For example, the number of the initial route planning route strategies is 3000, the server obtains 100 candidate route planning strategies after the primary screening, the secondary screening and the tertiary screening, and finally the server selects the target route planning strategy according to the 100 candidate route planning strategies.
204. Reading a plurality of planning parameters from a plurality of candidate route planning strategies, wherein the planning parameters comprise a lane distance parameter, a vehicle parameter and an aging parameter;
the server reads a plurality of planning parameters including a route distance parameter, a vehicle parameter and an aging parameter from a plurality of candidate route planning strategies.
The server reads a plurality of planning parameters from a plurality of candidate route planning strategies, and different candidate route planning strategies correspond to different lane distance parameters, vehicle parameters or aging parameters.
For example, in the candidate route planning strategy 1, the route distance parameter is 1321km, the vehicle parameter is 10 vehicles of type a, and the aging parameter includes the vehicle arrival time 13:00, the clear time 13:40, and the clear time period is 1 hour, in the candidate route planning strategy 1, the route distance parameter is 1433km, the vehicle parameter is 10 vehicles of type a, and the aging parameter includes the vehicle arrival time 13: 30. the off-site time 13:40, the off-site period 40 minutes, based on which the server can determine the target planning parameters in the candidate route planning strategy 1 and the candidate route planning strategy 2.
It should be noted that the present embodiment relates to a plurality of planning parameters, and the detailed planning parameters are described in detail in step 205.
205. And calculating to obtain a route target value according to the planning parameters and the preset formulas, determining a target route planning strategy based on the route target value, and transmitting the target route planning strategy to the transportation distribution center.
And the server calculates the minimum value based on the plurality of planning parameters and the plurality of preset formulas to obtain a route target value, and then the server obtains a target route planning strategy which needs to be transmitted to the transportation distribution center according to the route target value.
Specifically, the server inputs a lane distance parameter, a vehicle parameter and an aging parameter corresponding to each candidate route planning strategy into a preset lane formula, a preset vehicle cost formula and a preset aging formula respectively for calculation, so as to obtain a plurality of target lane values, a plurality of target vehicle cost values and a plurality of target effective values, and the server calculates a route target value according to the preset route target value formula, the plurality of target lane values, the plurality of target vehicle cost values and the plurality of target aging values; and the server determines a target route planning strategy according to the route target value and finally transmits the target route planning strategy to the transportation allocation center.
The preset lane formula is as follows:
Figure GDA0003212665760000131
wherein, ckijFor the kilometer cost of traveling from the starting point i to the destination point j for the vehicle category k,
Figure GDA0003212665760000132
for the empty kilometer cost of the vehicle class k from the initial distribution point i to the destination distribution point j,
Figure GDA0003212665760000133
the number of vehicle categories k used for the starting to destination waypoints i through j,
Figure GDA0003212665760000134
number of vehicle classes k that run empty from the origin point i to the destination point j, dijIs the distance from the distribution point i to the destination distribution point j.
The preset vehicle cost formula is as follows:
Figure GDA0003212665760000135
wherein, ckijFor the kilometer cost of traveling from the starting point i to the destination point j for the vehicle category k,
Figure GDA0003212665760000136
for the empty kilometer cost of the vehicle class k from the initial distribution point i to the destination distribution point j,
Figure GDA0003212665760000137
the number of vehicle categories k used for the starting to destination waypoints i through j,
Figure GDA0003212665760000138
number of vehicle classes k that run empty from the origin point i to the destination point j, dijIs the distance from the distribution point i to the destination distribution point j.
The preset aging formula is as follows:
Figure GDA0003212665760000139
wherein v istodThe initial quantity of goods from the initial point o to the destination point d at time T, TtodAt the time t from the starting point o to the destination point d,
Figure GDA00032126657600001310
is v istodVariation of time period s when vtodWhen the frequency of (a) is a preset time period,
Figure GDA0003212665760000141
is variable 1, otherwise
Figure GDA0003212665760000142
Is variable 0, WCtodFor the duration of waiting for the cargo to clear during the delivery from time t,
Figure GDA0003212665760000143
to obtainProbability of being able to sign in on day a after being issued from time period s.
Further, WC is obtainedtodThe specific process comprises the following steps:
Figure GDA0003212665760000144
wherein, CTSThe field-clearing time length of the field-clearing period is D, which is a time unit of one day, and in this embodiment, the time is controlled to be 24 hours.
Further, T is obtainedtodThe specific process comprises the following steps:
Figure GDA0003212665760000145
wherein, TbtodThe time when the initial cargo quantity reaches the b-th transfer point, TbtodThe estimation process of (2) is as follows:
Figure GDA0003212665760000146
Figure GDA0003212665760000147
wherein, { Tb-1tod≤Dep(Rod(b-1),Rod(b))klThe routes Rod (b-1) to Rod (b) are the departure time of the 1 st vehicle in the vehicle type k,
Figure GDA0003212665760000148
the routes Rod (b-1) to Rod (b) are the arrival times of the 1 st vehicle in the vehicle category k, and Rod (b) is the b-th transfer point from the starting point o to the destination point d.
The preset routing target value formula is as follows:
Figure GDA0003212665760000149
it should be noted that, in this embodiment, the route target value is a minimum solution based on a genetic algorithm.
For example, suppose that the server calculates three candidate route planning strategies according to the above formula to obtain three sets of target lane values, target vehicle cost values, and target aging values, and the target value corresponding to candidate route planning strategy 1 is: the target route value 3, the target vehicle cost value 5 and the target aging value 6, and the target values corresponding to the candidate route planning strategy 2 are as follows: a target vehicle line value of 3.5, a target vehicle cost value of 5.2 and a target aging value of 7; the target values corresponding to the candidate route planning policy 3 are: a target vehicle line value of 2, a target vehicle cost value of 3.9 and a target aging value of 4.2; the server presets a route target value formula for the three groups of target value input values to obtain a route target value of 10.1, and the server determines the corresponding candidate route planning strategy 3 as a target route planning strategy.
In the embodiment of the invention, the route target value is obtained by calculating the genetic algorithm through the lane algorithm formula, the vehicle cost algorithm formula and the aging algorithm formula in a plurality of route planning strategies, and then the transportation route can be planned reasonably according to the determined target route planning strategy, so that the accuracy of transportation route planning is improved.
With reference to fig. 3, the method for planning a transportation route in the embodiment of the present invention is described above, and a device for planning a transportation route in the embodiment of the present invention is described below, where an embodiment of the device for planning a transportation route in the embodiment of the present invention includes:
the transportation task obtaining module 301 is configured to obtain logistics transportation task information from a transportation allocation center, where the logistics transportation task information includes an initial allocation point, a destination allocation point, and an initial cargo amount;
an initial policy calculation module 302, configured to perform calculation according to the logistics transportation task information to obtain multiple initial routing planning policies, where the initial routing planning policies include a lane policy, a vehicle policy, and a departure time policy, and each of the initial routing planning policies are not identical;
a candidate policy screening module 303, configured to screen multiple initial routing planning policies to obtain multiple candidate routing planning policies;
and the target strategy calculation module 304 is configured to calculate a route target value according to the multiple candidate route planning strategies, determine a target route planning strategy according to the route target value, and transmit the target route planning strategy to the transportation allocation center.
In the embodiment of the invention, the route target value is obtained by calculating the genetic algorithm through the lane algorithm formula, the vehicle cost algorithm formula and the aging algorithm formula in a plurality of route planning strategies, and then the transportation route can be planned reasonably according to the determined target route planning strategy, so that the accuracy of transportation route planning is improved.
Referring to fig. 4, another embodiment of the transportation route planning apparatus according to the embodiment of the present invention includes:
the transportation task obtaining module 301 is configured to obtain logistics transportation task information from a transportation allocation center, where the logistics transportation task information includes an initial allocation point, a destination allocation point, and an initial cargo amount;
an initial policy calculation module 302, configured to perform calculation according to the logistics transportation task information to obtain multiple initial routing planning policies, where the initial routing planning policies include a lane policy, a vehicle policy, and a departure time policy, and each of the initial routing planning policies are not identical;
a candidate policy screening module 303, configured to screen multiple initial routing planning policies to obtain multiple candidate routing planning policies;
and the target strategy calculation module 304 is configured to calculate a route target value according to the multiple candidate route planning strategies, determine a target route planning strategy according to the route target value, and transmit the target route planning strategy to the transportation allocation center.
Optionally, the initial policy calculation module 302 includes:
a primary screening unit 3021, configured to read a plurality of route strategies from the plurality of initial route planning strategies, and perform primary screening on the plurality of initial route planning strategies according to the plurality of route strategies to obtain a plurality of first pre-selected route planning strategies;
the second screening unit 3022 is configured to read a plurality of vehicle policies from the plurality of first pre-selected route planning policies, and perform second screening on the plurality of first pre-selected route planning policies according to the plurality of vehicle policies to obtain a plurality of second pre-selected route planning policies;
a third screening unit 3023, configured to read a plurality of departure time policies from the plurality of second pre-selected route planning policies, and perform third screening on the plurality of second pre-selected route planning policies according to the plurality of departure time policies to obtain a plurality of candidate route planning policies.
Optionally, the primary screening unit 3021 may be further specifically configured to:
reading a plurality of lane strategies, judging whether each lane strategy in the plurality of lane strategies comprises a corresponding transfer strategy, if the target lane strategy does not comprise the corresponding transfer strategy, filtering the plurality of target lane strategies to obtain a plurality of first-filtered lane strategies, wherein the transfer strategy at least corresponds to one transfer allocation point;
judging whether a transfer distribution point corresponding to each first-filtered lane strategy comprises a transportation demand, if the transfer distribution point corresponding to the target first-filtered lane strategy does not comprise the transportation demand, filtering a plurality of target first-filtered lane strategies which do not comprise the transportation demand to obtain a plurality of second-filtered lane strategies;
judging whether the goods amount corresponding to each second-filtered lane strategy exceeds a goods processing threshold value, if so, filtering a plurality of target second-filtered lane strategies to obtain a plurality of third-filtered lane strategies;
and judging whether the route strategy distance corresponding to each route strategy filtered for the third time is greater than the route distance threshold, if the route strategy distance corresponding to the route strategy filtered for the third time by the target is greater than the route distance threshold, filtering a plurality of route strategies filtered for the third time by the target to obtain a plurality of candidate route strategies, and determining the initial route planning strategy corresponding to each candidate route strategy as a first pre-selection route planning strategy to obtain a plurality of first pre-selection route planning strategies.
Optionally, the second screening unit 3022 may be further specifically configured to:
reading a plurality of vehicle strategies from the plurality of first pre-selected route planning strategies, judging whether the number of vehicles corresponding to each vehicle strategy is greater than the vehicle available threshold, and filtering out a plurality of target vehicle strategies to obtain a plurality of vehicle strategies after primary filtering if the number of vehicles corresponding to the target vehicle strategies is greater than the vehicle available threshold;
judging whether the number of idle running vehicles corresponding to each first-filtered vehicle strategy is greater than the number of corresponding vehicles, and if the number of idle running vehicles corresponding to the target first-filtered vehicle strategy is greater than the number of corresponding vehicles, filtering a plurality of target first-filtered vehicle strategies to obtain a plurality of second-filtered vehicle strategies;
and judging whether the vehicle load corresponding to each vehicle strategy after the second filtering is larger than or equal to the initial cargo quantity, if the vehicle load corresponding to the vehicle strategy after the target second filtering is smaller than the initial cargo quantity, filtering a plurality of vehicle strategies after the target second filtering to obtain a plurality of candidate vehicle strategies, and determining the initial route planning strategy corresponding to each candidate vehicle strategy as a second pre-selection route planning strategy to obtain a plurality of second pre-selection route planning strategies.
Optionally, the third screening unit 3023 may be further specifically configured to:
reading a plurality of departure time strategies from the plurality of second pre-selected route planning strategies, judging whether the goods of the transfer distribution point corresponding to each departure time strategy are stacked in the same vehicle with the goods of the initial distribution point, and filtering out a plurality of target departure time strategies to obtain a plurality of filtered departure time strategies if the goods of the transfer distribution point corresponding to the target departure time strategy are not stacked in the same vehicle with the goods of the initial distribution point;
and if the vehicle loading capacity corresponding to the departure time strategy after the target filtration is smaller than the loading capacity threshold of the vehicle, filtering the departure time strategies after the plurality of targets are filtered to obtain a plurality of candidate departure time strategies, and determining the initial route planning strategy corresponding to each candidate departure time strategy as a candidate route planning strategy to obtain a plurality of candidate route planning strategies.
Optionally, the target policy calculation module 304 includes:
a planning parameter reading unit 3041, configured to read a plurality of planning parameters from a plurality of candidate route planning strategies, where the planning parameters include a lane distance parameter, a vehicle parameter, and an aging parameter;
the route target value calculation unit 3042 is configured to calculate a route target value according to the multiple planning parameters and the multiple preset formulas, determine a target route planning policy based on the route target value, and transmit the target route planning policy to the transportation allocation center.
Optionally, the routing target value calculating unit 3042 may be further specifically configured to:
aiming at any one candidate route planning strategy in the candidate route planning strategies, inputting the corresponding lane distance parameter, the corresponding vehicle parameter and the corresponding aging parameter into a preset lane formula to obtain a target lane value;
inputting the corresponding lane distance parameter, vehicle parameter and aging parameter into a preset vehicle cost formula to obtain a target vehicle cost value;
inputting the corresponding lane distance parameter, vehicle parameter and aging parameter into a preset aging formula to obtain an effective value at the time of target;
obtaining a plurality of target vehicle line values, a plurality of target vehicle cost values and a plurality of target effective values aiming at other candidate route planning strategies in the plurality of candidate route planning strategies;
and calculating based on a preset routing target value formula, the target vehicle line values, the target vehicle cost values and the target effective values to obtain a routing target value, determining a target routing planning strategy according to the routing target value, and transmitting the target routing planning strategy to the transportation allocation center.
In the embodiment of the invention, the route target value is obtained by calculating the genetic algorithm through the lane algorithm formula, the vehicle cost algorithm formula and the aging algorithm formula in a plurality of route planning strategies, and then the transportation route can be planned reasonably according to the determined target route planning strategy, so that the accuracy of transportation route planning is improved.
Fig. 3 and 4 describe the transportation route planning apparatus in the embodiment of the present invention in detail from the perspective of the modular functional entity, and the transportation route planning apparatus in the embodiment of the present invention is described in detail from the perspective of hardware processing.
Fig. 5 is a schematic structural diagram of a transportation route planning apparatus 500 according to an embodiment of the present invention, which 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 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 series of instruction operations in the apparatus 500 for planning a transportation route. Still 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 transportation route planning apparatus 500.
The planning facility 500 for a transportation route 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, Mac OS X, Unix, Linux, FreeBSD, and the like. Those skilled in the art will appreciate that the configuration of the planning device for a transportation route shown in fig. 5 does not constitute a limitation of the planning device for a transportation route, and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components.
The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium, which 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 method for planning a transportation route.
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 embodiments are only used to illustrate the technical solution of the present invention, and not to limit 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 (9)

1. A method for planning a transportation route is characterized in that the method for planning the transportation route comprises the following steps:
acquiring logistics transportation task information from a transportation allocation center, wherein the logistics transportation task information comprises an initial allocation point, a target allocation point and an initial cargo amount;
calculating according to the logistics transportation task information to obtain a plurality of initial routing planning strategies, wherein the initial routing planning strategies comprise a lane strategy, a vehicle strategy and a departure time strategy, and each initial routing planning strategy is not identical;
screening the plurality of initial routing planning strategies to obtain a plurality of candidate routing planning strategies;
reading a plurality of planning parameters from the plurality of candidate route planning strategies, wherein the planning parameters comprise a lane distance parameter, a vehicle parameter and an aging parameter, the lane distance parameter at least comprises a running kilometer cost between distribution points, an empty running kilometer cost between distribution points and a distance between distribution points, the vehicle parameter at least comprises a vehicle category number used between distribution points and a vehicle category number running empty between distribution points, and the aging parameter at least comprises an initial cargo amount corresponding to a target time and a time of reaching the target distribution point;
calculating to obtain a routing target value according to the planning parameters and preset formulas, determining a target routing planning strategy based on the routing target value, and transmitting the target routing planning strategy to the transportation distribution center, wherein the routing target value is a minimum value calculated based on the planning parameters and the preset formulas;
the preset aging formula in the preset formulas is as follows:
Figure FDA0003264933540000011
wherein v istodThe initial quantity of goods from the initial point o to the destination point d at time T, TtodAt the time t from the starting point o to the destination point d,
Figure FDA0003264933540000012
is v istodVariation of time period s when vtodWhen the frequency of (a) is a preset time period,
Figure FDA0003264933540000013
is variable 1, otherwise
Figure FDA0003264933540000014
Is variable 0, WCtodFor the duration of waiting for the cargo to clear during the delivery from time t,
Figure FDA0003264933540000015
to obtain the probability of being able to sign in on day a after being sent out from time period s;
further, WC is obtainedtodThe specific process comprises the following steps:
Figure FDA0003264933540000016
wherein, CTSThe field cleaning duration is the field cleaning duration of the field cleaning period, D is a time unit of one day, and the time is controlled according to 24 hours;
further, T is obtainedtodThe specific process comprises the following steps:
Figure FDA0003264933540000021
wherein, TbtodThe time when the initial cargo quantity reaches the b-th transfer point, TbtodThe estimation process of (2) is as follows:
Figure FDA0003264933540000022
Figure FDA0003264933540000023
wherein, { Tb-1tod≤Dep(Rod(b-1),Rod(b))klThe routes Rod (b-1) to Rod (b) are the departure time of the 1 st vehicle in the vehicle type k,
Figure FDA0003264933540000024
the routes Rod (b-1) to Rod (b) are the arrival times of the 1 st vehicle in the vehicle category k, and Rod (b) is the b-th transfer point from the starting point o to the destination point d.
2. The transportation route planning method according to claim 1, wherein the screening the plurality of initial route planning strategies to obtain a plurality of candidate route planning strategies comprises:
reading a plurality of lane strategies from the plurality of initial route planning strategies, and primarily screening the plurality of initial route planning strategies according to the plurality of lane strategies to obtain a plurality of first pre-selection route planning strategies;
reading a plurality of vehicle strategies from the plurality of first pre-selection route planning strategies, and carrying out secondary screening on the plurality of first pre-selection route planning strategies according to the plurality of vehicle strategies to obtain a plurality of second pre-selection route planning strategies;
and reading a plurality of departure time strategies from the plurality of second pre-selected route planning strategies, and carrying out third screening on the plurality of second pre-selected route planning strategies according to the plurality of departure time strategies to obtain a plurality of candidate route planning strategies.
3. The transportation route planning method according to claim 2, wherein the reading a plurality of lane strategies from the plurality of initial route planning strategies, and performing a primary screening on the plurality of initial route planning strategies according to the plurality of lane strategies to obtain a plurality of first pre-selected route planning strategies includes:
reading a plurality of lane strategies, judging whether each lane strategy in the plurality of lane strategies comprises a corresponding transfer strategy, if the target lane strategy does not comprise the corresponding transfer strategy, filtering the plurality of target lane strategies to obtain a plurality of first-filtered lane strategies, wherein the transfer strategy at least corresponds to one transfer allocation point;
judging whether a transfer distribution point corresponding to each first-filtered lane strategy comprises a transportation demand, if the transfer distribution point corresponding to the target first-filtered lane strategy does not comprise the transportation demand, filtering a plurality of target first-filtered lane strategies which do not comprise the transportation demand to obtain a plurality of second-filtered lane strategies;
judging whether the goods amount corresponding to each second-filtered lane strategy exceeds a goods processing threshold value, if so, filtering a plurality of target second-filtered lane strategies to obtain a plurality of third-filtered lane strategies;
and judging whether the route strategy distance corresponding to each route strategy filtered for the third time is greater than the route distance threshold, if the route strategy distance corresponding to the route strategy filtered for the third time by the target is greater than the route distance threshold, filtering a plurality of route strategies filtered for the third time by the target to obtain a plurality of candidate route strategies, and determining the initial route planning strategy corresponding to each candidate route strategy as a first pre-selection route planning strategy to obtain a plurality of first pre-selection route planning strategies.
4. The transportation route planning method according to claim 2, wherein the reading a plurality of vehicle policies from the plurality of first pre-selected route planning policies and performing a second screening on the plurality of first pre-selected route planning policies according to the plurality of vehicle policies to obtain a plurality of second pre-selected route planning policies comprises:
reading a plurality of vehicle strategies from the plurality of first pre-selected route planning strategies, judging whether the number of vehicles corresponding to each vehicle strategy is greater than the vehicle available threshold, and filtering out a plurality of target vehicle strategies to obtain a plurality of vehicle strategies after primary filtering if the number of vehicles corresponding to the target vehicle strategies is greater than the vehicle available threshold;
judging whether the number of idle running vehicles corresponding to each first-filtered vehicle strategy is greater than the number of corresponding vehicles, and if the number of idle running vehicles corresponding to the target first-filtered vehicle strategy is greater than the number of corresponding vehicles, filtering a plurality of target first-filtered vehicle strategies to obtain a plurality of second-filtered vehicle strategies;
and judging whether the vehicle load corresponding to each vehicle strategy after the second filtering is larger than or equal to the initial cargo quantity, if the vehicle load corresponding to the vehicle strategy after the target second filtering is smaller than the initial cargo quantity, filtering a plurality of vehicle strategies after the target second filtering to obtain a plurality of candidate vehicle strategies, and determining the initial route planning strategy corresponding to each candidate vehicle strategy as a second pre-selection route planning strategy to obtain a plurality of second pre-selection route planning strategies.
5. The transportation route planning method according to claim 3, wherein the reading a plurality of departure time policies from the plurality of second pre-selected routing strategies, and performing a third screening on the plurality of second pre-selected routing strategies according to the plurality of departure time policies to obtain a plurality of candidate routing strategies includes:
reading a plurality of departure time strategies from the plurality of second pre-selected route planning strategies, judging whether the goods of the transfer distribution point corresponding to each departure time strategy are stacked in the same vehicle with the goods of the initial distribution point, and filtering out a plurality of target departure time strategies to obtain a plurality of filtered departure time strategies if the goods of the transfer distribution point corresponding to the target departure time strategy are not stacked in the same vehicle with the goods of the initial distribution point;
and if the vehicle loading capacity corresponding to the departure time strategy after the target filtration is smaller than the loading capacity threshold of the vehicle, filtering the departure time strategies after the plurality of targets are filtered to obtain a plurality of candidate departure time strategies, and determining the initial route planning strategy corresponding to each candidate departure time strategy as a candidate route planning strategy to obtain a plurality of candidate route planning strategies.
6. The transportation route planning method according to claim 1, wherein the calculating a route target value according to the planning parameters and preset formulas, determining a target route planning policy based on the route target value, and transmitting the target route planning policy to the transportation allocation center includes:
aiming at any one candidate route planning strategy in the candidate route planning strategies, inputting the corresponding lane distance parameter, the corresponding vehicle parameter and the corresponding aging parameter into a preset lane formula to obtain a target lane value;
inputting the corresponding lane distance parameter, vehicle parameter and aging parameter into a preset vehicle cost formula to obtain a target vehicle cost value;
inputting the corresponding lane distance parameter, vehicle parameter and aging parameter into a preset aging formula to obtain an effective value at the time of target;
obtaining a plurality of target vehicle line values, a plurality of target vehicle cost values and a plurality of target effective values aiming at other candidate route planning strategies in the plurality of candidate route planning strategies;
and calculating based on a preset routing target value formula, the target vehicle line values, the target vehicle cost values and the target effective values to obtain a routing target value, determining a target routing planning strategy according to the routing target value, and transmitting the target routing planning strategy to the transportation allocation center.
7. A planning apparatus for a transportation route, comprising:
the system comprises a transportation task acquisition module, a transportation distribution center and a management module, wherein the transportation task acquisition module is used for acquiring logistics transportation task information from the transportation distribution center, and the logistics transportation task information comprises an initial distribution point, a target distribution point and an initial cargo amount;
the initial strategy calculation module is used for calculating according to the logistics transportation task information to obtain a plurality of initial route planning strategies, wherein the initial route planning strategies comprise a lane strategy, a vehicle strategy and a departure time strategy, and each initial route planning strategy is not identical;
the candidate strategy screening module is used for screening the plurality of initial route planning strategies to obtain a plurality of candidate route planning strategies;
a planning parameter reading unit, configured to read a plurality of planning parameters from the plurality of candidate route planning strategies, where the planning parameters include lane distance parameters, vehicle parameters, and aging parameters, the lane distance parameters at least include a distance between points to be allocated, and an empty kilometer cost between points to be allocated, the vehicle parameters at least include a number of categories of vehicles used between points to be allocated and a number of categories of vehicles running empty between points to be allocated, and the aging parameters at least include an initial cargo amount corresponding to a target time and a time to reach the target points to be allocated;
a route target value calculation unit, configured to calculate a route target value according to the multiple planning parameters and multiple preset formulas, determine a target route planning policy based on the route target value, and transmit the target route planning policy to the transportation allocation center, where the route target value is a minimum value calculated based on the multiple planning parameters and the multiple preset formulas;
the preset aging formula in the preset formulas is as follows:
Figure FDA0003264933540000051
wherein v istodThe initial quantity of goods from the initial point o to the destination point d at time T, TtodAt the time t from the starting point o to the destination point d,
Figure FDA0003264933540000052
is v istodVariation of time period s when vtodWhen the frequency of (a) is a preset time period,
Figure FDA0003264933540000061
is variable 1, otherwise
Figure FDA0003264933540000062
Is variable 0, WCtodFor the duration of waiting for the cargo to clear during the delivery from time t,
Figure FDA0003264933540000063
to obtain the probability of being able to sign in on day a after being sent out from time period s;
further, WC is obtainedtodThe specific process comprises the following steps:
Figure FDA0003264933540000064
wherein, CTSThe field cleaning duration is the field cleaning duration of the field cleaning period, D is a time unit of one day, and the time is controlled according to 24 hours;
further, T is obtainedtodThe specific process comprises the following steps:
Figure FDA0003264933540000065
wherein, TbtodThe time when the initial cargo quantity reaches the b-th transfer point, TbtodThe estimation process of (2) is as follows:
Figure FDA0003264933540000066
Figure FDA0003264933540000067
wherein, { Tb-1tod≤Dep(Rod(b-1),Rod(b))klThe routes Rod (b-1) to Rod (b) are the departure time of the 1 st vehicle in the vehicle type k,
Figure FDA0003264933540000068
the routes Rod (b-1) to Rod (b) are the arrival times of the 1 st vehicle in the vehicle category k, and Rod (b) is the b-th transfer point from the starting point o to the destination point d.
8. A planning apparatus for a transportation route, characterized by comprising: a memory having instructions stored therein and at least one processor, the memory and the at least one processor interconnected by a line;
the at least one processor invokes the instructions in the memory to cause the transportation route planning device to perform the transportation route planning method of any of claims 1-6.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out a method for planning a transportation route according to any one of claims 1 to 6.
CN202010227454.8A 2020-03-27 2020-03-27 Method, device and equipment for planning transportation route and storage medium Active CN111340431B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010227454.8A CN111340431B (en) 2020-03-27 2020-03-27 Method, device and equipment for planning transportation route and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010227454.8A CN111340431B (en) 2020-03-27 2020-03-27 Method, device and equipment for planning transportation route and storage medium

Publications (2)

Publication Number Publication Date
CN111340431A CN111340431A (en) 2020-06-26
CN111340431B true CN111340431B (en) 2021-11-09

Family

ID=71182758

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010227454.8A Active CN111340431B (en) 2020-03-27 2020-03-27 Method, device and equipment for planning transportation route and storage medium

Country Status (1)

Country Link
CN (1) CN111340431B (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113902359A (en) * 2020-07-06 2022-01-07 上海顺如丰来技术有限公司 Logistics distribution path planning method and device, computer equipment and storage medium
CN114066345A (en) * 2020-08-10 2022-02-18 上海顺如丰来技术有限公司 Method, device, server and storage medium for planning transit transportation
CN113743852A (en) * 2020-10-30 2021-12-03 北京京东振世信息技术有限公司 Routing method, device, equipment and storage medium
CN113762573B (en) * 2020-11-17 2023-11-03 北京京东振世信息技术有限公司 Logistics network optimization method and device
CN112966997A (en) * 2021-03-04 2021-06-15 上海东普信息科技有限公司 Express delivery cargo transportation method, device, equipment and storage medium
CN113225259B (en) * 2021-04-13 2022-11-29 国家电网公司华北分部 Communication network route planning method
CN113222515A (en) * 2021-05-27 2021-08-06 咪咕文化科技有限公司 Waybill distribution method and device, electronic equipment and storage medium
CN114611341B (en) * 2022-05-11 2022-08-02 中移铁通有限公司广东分公司 Automatic planning method, device and equipment for optical cable route and storage medium
CN118037167A (en) * 2022-11-02 2024-05-14 顺丰科技有限公司 Transportation route integration method, transportation route integration device, electronic equipment and readable storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106980912A (en) * 2017-04-07 2017-07-25 广东电网有限责任公司佛山供电局 A kind of multiple spot distribution routing planning method and system
CN109242211A (en) * 2018-10-16 2019-01-18 顺丰科技有限公司 A kind of transportation network planing method, system, equipment and storage medium
CN110097231A (en) * 2019-05-09 2019-08-06 上汽安吉物流股份有限公司 Multiple target objects stream scheduling method and device, logistics system and computer-readable medium
CN110555640A (en) * 2018-05-31 2019-12-10 北京京东振世信息技术有限公司 Method and device for route planning

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108921483A (en) * 2018-07-16 2018-11-30 深圳北斗应用技术研究院有限公司 A kind of logistics route planing method, device and driver arrange an order according to class and grade dispatching method, device
CN109658037B (en) * 2019-01-10 2021-08-17 跨越速运集团有限公司 Intelligent planning method and system for logistics path

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106980912A (en) * 2017-04-07 2017-07-25 广东电网有限责任公司佛山供电局 A kind of multiple spot distribution routing planning method and system
CN110555640A (en) * 2018-05-31 2019-12-10 北京京东振世信息技术有限公司 Method and device for route planning
CN109242211A (en) * 2018-10-16 2019-01-18 顺丰科技有限公司 A kind of transportation network planing method, system, equipment and storage medium
CN110097231A (en) * 2019-05-09 2019-08-06 上汽安吉物流股份有限公司 Multiple target objects stream scheduling method and device, logistics system and computer-readable medium

Also Published As

Publication number Publication date
CN111340431A (en) 2020-06-26

Similar Documents

Publication Publication Date Title
CN111340431B (en) Method, device and equipment for planning transportation route and storage medium
CN109308540B (en) Distribution plan generation method, device and system for distribution vehicle
Zhong et al. Territory planning and vehicle dispatching with driver learning
CN111415104A (en) Vehicle scheduling method, device, equipment and storage medium
CN113420928A (en) Order scheduling method, device, equipment and storage medium
CN114386720B (en) Logistics system scheduling management method, system, terminal equipment and storage medium
CN112348428A (en) Container monitoring method and device, server and storage medium
CN110765615A (en) Logistics simulation method, device and equipment
CN109740910A (en) Haulage vehicle determines method and apparatus
CN114926118A (en) Method, device and equipment for processing vehicle and cargo loading information and storage medium
CN111598324A (en) Loading vehicle line optimization method, device, equipment and storage medium
CN113379102B (en) Multi-network trunk transport optimization method, computer equipment and storage medium
CN111353722A (en) Freight scheduling information management method and device
CN111780776B (en) Multi-frequency vehicle path planning method, device, equipment and storage medium
CN112418550B (en) Vehicle-cargo matching method under various driver working states in logistics industry
CN108959782A (en) A kind of layout optimization method, device and the equipment in intelligence workshop
CN116187585B (en) Method, device and application for predicting BRT bus route of passenger
CN115081819A (en) Scheduling method, scheduling device, electronic equipment and storage medium
CN111598511A (en) Method, device and equipment for planning vehicle line for transporting goods and storage medium
CN111199321B (en) Method, device, medium and computer equipment for optimizing transport network
CN114511165A (en) Task capacity matching method and device, computer equipment and storage medium
CN112465280A (en) Task adjusting method and device, server and computer readable storage medium
CN113822629A (en) Logistics abnormal weight adjusting method, device, equipment and storage medium
CN111598519B (en) Transport capacity adjusting method and device
JP7417212B2 (en) Operation optimization system

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