CN117494922A - Logistics path planning method - Google Patents
Logistics path planning method Download PDFInfo
- Publication number
- CN117494922A CN117494922A CN202410001794.7A CN202410001794A CN117494922A CN 117494922 A CN117494922 A CN 117494922A CN 202410001794 A CN202410001794 A CN 202410001794A CN 117494922 A CN117494922 A CN 117494922A
- Authority
- CN
- China
- Prior art keywords
- logistics
- logistics transportation
- path
- transportation
- unidirectional
- 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.)
- Pending
Links
- 238000013439 planning Methods 0.000 title claims abstract description 36
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000004364 calculation method Methods 0.000 claims abstract description 5
- 238000012384 transportation and delivery Methods 0.000 claims description 13
- 230000000977 initiatory effect Effects 0.000 claims description 6
- 230000009286 beneficial effect Effects 0.000 description 8
- 230000008901 benefit Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a logistics path planning method, which belongs to the technical field of path planning and comprises the following steps: acquiring a current unidirectional logistics transportation task set; constructing a logistics transportation path network; selecting a starting point, a finishing point and a necessary passing node of unidirectional logistics transportation based on a logistics transportation path network according to the current unidirectional logistics transportation task set; planning to obtain a current optimal logistics path; and executing the logistics transportation task along the current optimal logistics path, updating the current unidirectional logistics transportation task set and the current optimal logistics path according to the controllable time cost and the logistics transportation task to be added at the next arriving necessary routing node, and continuing to execute the logistics transportation task until the logistics transportation task cannot be updated, so as to complete planning of the logistics path. The invention provides a calculation method of necessary transportation cost based on time and cost required by the nodes of a logistics distribution center, and solves the problem of lack of consideration of adding new logistics tasks at each distribution center to update logistics paths.
Description
Technical Field
The invention belongs to the technical field of path planning, and particularly relates to a logistics path planning method.
Background
The logistics path planning refers to determining an optimal distribution route and a vehicle scheduling scheme according to logistics distribution requirements and resources so as to achieve the aims of minimizing total logistics cost or maximizing customer satisfaction and the like. Logistics distribution path planning is a typical combinatorial optimization problem, has high complexity and dynamics, and is difficult to obtain optimal solutions or near optimal solutions. Intelligent traffic refers to the effective monitoring, management, control and service of traffic systems by using modern scientific technologies such as information technology, communication technology, control technology, computer technology and the like, so as to improve the safety, efficiency and sustainability of traffic.
The current logistics distribution path planning mainly considers the planned path length and the expected transportation time on the planned path, but lacks consideration for the conditions of transfer distribution in the logistics transportation process, renewability of logistics tasks in the transfer distribution process and the like, ignores the time occupied by each distribution center in the logistics process and the process of adding new logistics tasks, the new logistics tasks can generally increase the logistics transportation benefit, and the actual occupied time of the logistics transportation is generally smaller than the expected time under the condition of no traffic faults, so that the logistics transportation still needs to be planned adjustably from the whole path and transportation time.
Disclosure of Invention
Aiming at the defects in the prior art, the logistics path planning method provided by the invention determines the starting point, the finishing point and possibly necessary route nodes of unidirectional logistics transportation by constructing the current unidirectional logistics transportation task set and the logistics transportation path network, constructs the current optimal logistics path by minimizing necessary transportation cost, considers the fact that a new logistics transportation task is received at a logistics distribution center node so as to increase the necessary route nodes, updates the current optimal logistics path, improves the overall benefit of logistics transportation, and solves the problem of lacking the updating of the current optimal logistics path to improve the overall benefit of long-distance transportation.
In order to achieve the aim of the invention, the invention adopts the following technical scheme:
the invention provides a logistics path planning method, which comprises the following steps:
s1, acquiring a current unidirectional logistics transportation task set;
s2, constructing a logistics transportation path network;
s3, selecting a starting point, a finishing point and a necessary passing node of unidirectional logistics transportation based on a logistics transportation path network according to the current unidirectional logistics transportation task set;
s4, planning to obtain a current optimal logistics path according to the starting point, the ending point and the necessary passing nodes of unidirectional logistics transportation;
s5, executing logistics transportation tasks along the current optimal logistics path, and updating the current unidirectional logistics transportation task set according to the controllable time cost and the logistics transportation tasks to be added at the nodes of the next arrival necessary path;
s6, judging whether the updated unidirectional logistics transportation task set is added with a new logistics transportation task with the same path, if so, taking the updated unidirectional logistics transportation task set as the current unidirectional logistics transportation task set, returning to S3, otherwise, entering S7;
s7, judging whether necessary passing nodes exist in the current optimal logistics path, if so, returning to S5, otherwise, entering S8;
and S8, executing logistics transportation tasks along the current optimal logistics path to complete planning of the logistics path.
The beneficial effects of the invention are as follows: the invention provides a logistics path planning method, which is characterized in that the position of a logistics distribution center through which logistics transportation must pass can be obtained by acquiring a current unidirectional logistics transportation task set, a logistics transportation path network is constructed to cover the logistics distribution center and a logistics transportation path in logistics transportation so as to carry out logistics path planning based on the current unidirectional logistics transportation task set.
Further, the current unidirectional logistics transportation task set in S1 at least includes a first logistics transportation task.
The beneficial effects of adopting the further scheme are as follows: the current unidirectional logistics transportation task set at least comprises a first logistics transportation task, so that the planning of a logistics path is guaranteed.
Further, the current unidirectional logistics transportation task set in the step S1 further comprises a plurality of logistics transportation tasks in the same path;
all logistics transportation paths and/or part of the logistics transportation paths of the same-path logistics transportation task are the same as part of the logistics transportation paths of the first logistics transportation task.
The beneficial effects of adopting the further scheme are as follows: the logistics transportation tasks with the same paths enable the situation of logistics transportation capacity change in the logistics transportation process, and a basis for receiving new logistics transportation tasks is provided for improving the utilization rate of the logistics transportation capacity as much as possible so as to improve the logistics transportation benefits.
Further, the logistics transportation path network in the step S2 is provided with a plurality of logistics distribution center nodes, and a plurality of logistics transportation lines exist between every two adjacent logistics distribution center nodes; a plurality of logistics throwing destinations are arranged in a preset logistics service range of each logistics distribution center node.
The beneficial effects of adopting the further scheme are as follows: through the setting of commodity circulation collection and distribution center node, commodity circulation transportation route and commodity circulation delivery destination, provided commodity circulation transportation route network, provide the basis for planning and adjusting the most excellent commodity circulation transportation route.
Further, the step S3 includes the following steps:
s31, acquiring a logistics distribution initiating position and a logistics distribution signing position of a first logistics transportation task in a current unidirectional logistics transportation task set;
s32, positioning a logistics delivery destination which is the shortest in time in a logistics transportation path network according to a logistics distribution initiating position of a first logistics transportation task, and taking the logistics delivery destination as a logistics transportation service starting point;
s33, searching a logistics distribution center node corresponding to a preset logistics service range where a logistics transport service starting point is located based on a logistics transport path network, and selecting the logistics distribution center node as a starting point of unidirectional logistics transport;
s34, positioning a logistics delivery destination which is the shortest in time in a logistics transportation path network according to a logistics distribution signing position of a first logistics transportation task, and taking the logistics delivery destination as a logistics transportation service terminal;
s35, searching a logistics distribution center node corresponding to a preset logistics service range where a logistics transportation service terminal is located based on a logistics transportation path network, and selecting the logistics distribution center node as a terminal of unidirectional logistics transportation;
s36, judging whether other logistics transportation tasks except the first logistics transportation task exist in the current unidirectional logistics transportation task set, if so, entering S37, otherwise, taking the end point of unidirectional logistics transportation as a necessary passing node, and entering S4;
s37, taking other logistics transportation tasks except the first logistics transportation task in the current unidirectional logistics transportation task set as the mandatory logistics transportation tasks, and respectively obtaining logistics distribution signing positions of the mandatory logistics transportation tasks as the mandatory signing positions;
s38, taking the logistics distribution center node corresponding to the preset logistics service range where the sign-in position is located as a necessary routing node.
The beneficial effects of adopting the further scheme are as follows: according to the method, the first logistics transportation task is used as a main logistics transportation task, all logistics transportation paths or/and part of logistics transportation paths which are necessary to pass through the class logistics transportation task are identical to part of logistics transportation paths of the first logistics transportation task, and the starting point, the necessary passing point and the end point of the current unidirectional logistics transportation task set can be determined by determining the logistics distribution starting position and the logistics distribution signing position of the first logistics transportation task and determining the necessary reaching signing position which is necessary to pass through the class logistics transportation task, so that a foundation is provided for planning the logistics path.
Further, the step S4 includes the following steps:
s41, taking a starting point of unidirectional logistics transportation as a current logistics transportation starting point;
s42, respectively acquiring necessary transportation costs from a current logistics transportation starting point to each necessary passing node;
s43, taking a necessary passing node corresponding to the lowest necessary transportation cost as a next necessary passing node to obtain a planned part of optimal logistics path;
s44, judging whether necessary route nodes which are not planned to enter the planned part of the optimal logistics path exist, if yes, entering S45, otherwise, entering S46;
s45, taking the next necessary route node as a current logistics transportation starting point, and returning to S42;
s46, judging whether the end point of the unidirectional logistics transportation is planned to enter a planned part of the optimal path, if so, entering S48, otherwise, entering S47;
s47, taking the end point of unidirectional logistics transportation as a necessary passing node, and returning to S44;
s48, the end point of one-way logistics transportation is not used as a necessary passing node, and the planned partial optimal path is used as the current optimal logistics path.
The beneficial effects of adopting the further scheme are as follows: the invention provides a method for planning and obtaining a current optimal logistics path according to a starting point, a finishing point and a necessary passing node of unidirectional logistics transportation, wherein the necessary passing node is brought into a planned part of the optimal logistics path one by one from the starting point of unidirectional logistics transportation according to a rule of minimizing necessary transportation cost until the finishing point of unidirectional logistics transportation is also brought into the planned part of the optimal logistics path, and then the current optimal logistics path is obtained.
Further, the calculation expression of the necessary transportation cost in S42 is as follows:，/>，，/>，，
wherein M is n Representing the necessary transportation costs f p Representing the labor cost coefficient of logistics transportation, M p Representing the labor cost of logistics transportation, f fc Representing cost coefficients of logistics transportation vehicles, M fc Representing the cost of the logistics transportation vehicle, f t Representing the cost coefficient of logistics transportation time, M t Representing the cost of logistics transportation time, f ch Representing the cost coefficient of distributed loading and unloading of logistics, M ch Representing the logistics distributed unloading cost, t s Represents the total time of logistics tasks, M pav Represents the labor cost of logistics transportation in unit time, O ils Represents the full-load average oil consumption of the non-congested road section, L s Representing the length of the non-congested road segment, O ilc Represents the full-load average oil consumption of the congested road section, L c Representing the length of a congested road segment, load on Load representing the Load of a vehicle s Representing the full load of the vehicle, M load Representing road tolls of vehicles, V s Representing the travel speed of the non-congested road section, V c Indicating the running speed of the congested road section, I indicating the ith traffic light, I indicating the total number of the traffic lights, N li Indicating the waiting time length proportion of the ith traffic light, t li Represents the maximum waiting time length, T, of the ith traffic light ch Indicating the unloading time of logistics transportation cargoes, T in Indicating the time of entering the logistics distribution center, T out Indicating the time of departure from the distribution center, M chav The method is characterized in that the unloading cost of the logistics transportation cargo in unit time is represented, L represents the cargo quantity to be loaded in the logistics distribution center, alpha represents the cargo quantity reaching the logistics distribution center in unit time, and beta represents the cargo quantity reaching the logistics distribution centerThe total load/unload quantity of all load ports per unit time, L unload Indicating the quantity to be unloaded on the vehicle, L q Indicating the number of goods to be loaded on the load port,/-or%>Representing the utilization rate of the cargo loading port, P k Indicating the probability that the amount of cargo to be logistics transported is equal to the lot logistics vehicle capacity.
The beneficial effects of adopting the further scheme are as follows: the invention provides a calculation method of necessary transportation cost, which considers the necessary transportation cost of logistics transportation from the aspects of logistics transportation labor cost, logistics transportation vehicle cost, logistics transportation time cost and logistics collection and distribution unloading cost, and the condition that unloading exists at a necessary passing node and a new logistics transportation task can be received, and the reception of the new logistics transportation task can effectively promote logistics transportation income.
Further, the step S5 includes the following steps:
the step S5 comprises the following steps:
s51, acquiring the logistics transportation time cost and the maximum logistics transportation time threshold value between adjacent necessary routing nodes on the current optimal logistics transportation path, and the logistics transportation time cost and the maximum logistics transportation time threshold value between the unidirectional logistics transportation terminal and the adjacent necessary routing nodes;
s52, executing a logistics transportation task along the current optimal logistics transportation path, judging whether the next arrived logistics distribution center node is the end point of unidirectional logistics transportation, if so, entering S6, otherwise, entering S53;
s53, judging whether the next arriving logistics distribution center node is a necessary passing node, if so, entering S54, otherwise, continuing to execute logistics transportation tasks along the current optimal logistics path after passing through the next arriving logistics distribution center node, and returning to S52;
s54, executing a logistics transportation task along a current optimal logistics transportation path, and acquiring a first to-be-added same-path logistics transportation task and a second to-be-added same-path logistics transportation task at a next arriving necessary passing node, wherein the logistics transportation center node corresponding to the end point of the first to-be-added same-path logistics transportation task is a necessary passing node, the logistics transportation center node corresponding to the end point of the second to-be-added same-path logistics transportation task is a unnecessary passing node, and the to-be-loaded cargo amounts of the first to-be-added same-path logistics transportation task and the second to-be-added same-path logistics transportation task are not more than the to-be-unloaded cargo amount at the next arriving necessary passing node;
s55, judging whether the makeup removal time of the logistics transportation cargoes of the first logistics transportation task to be added with the same path is smaller than the difference value between the maximum logistics transportation time threshold value corresponding to the next arrival necessary passing node and the next adjacent necessary passing node and the logistics transportation time cost, if yes, entering S56, otherwise entering S57;
s56, adding a first logistics transportation task to be added with the same path to the current unidirectional logistics transportation task set, and entering S59;
s57, judging whether the sum of the time of entering the logistics distribution center, the time of leaving the logistics distribution center and the logistics transportation cargo makeup removal time of a second logistics transportation task to be added with the same path is smaller than the difference value between the maximum logistics transportation time threshold value corresponding to the next arrival necessary routing node and the next adjacent necessary routing node and the logistics transportation time cost, if yes, entering S58, otherwise entering S59;
s58, adding a second logistics transportation task to be added with the same route to the current unidirectional logistics transportation task set, taking the second logistics transportation task as a class logistics transportation task, and entering S59;
s59, executing a logistics transportation task to a next arriving necessary routing node along the current optimal logistics path, taking the arriving necessary routing node as a starting point of unidirectional logistics transportation while arriving, and taking the arriving necessary routing node not as the necessary routing node any more.
The beneficial effects of adopting the further scheme are as follows: the invention provides a method for adding new logistics transportation tasks at the nodes of the next necessary path, which is used for prioritizing the acceptable cargo carrying capacity and the condition of whether the logistics path needs to be adjusted, preferentially ensuring that the first logistics transportation task to be added with the same path is received under the condition of not modifying the current optimal logistics path, and secondly, receiving the first logistics transportation task to be added with the same path, which needs to be adjusted, under the condition of not exceeding the maximum logistics transportation time threshold value, thereby fully increasing logistics transportation income and fully ensuring the effective utilization rate of logistics resources.
Other advantages that are also present with respect to the present invention will be more detailed in the following examples.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart illustrating steps of a method for planning a physical distribution route according to embodiment 1 of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. The components of the embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the invention, as presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be made by a person skilled in the art without making any inventive effort, are intended to be within the scope of the present invention.
Example 1: as shown in fig. 1, in one embodiment of the present invention, the present invention provides a method for planning a physical distribution path, including the following steps:
s1, acquiring a current unidirectional logistics transportation task set;
the current unidirectional logistics transportation task set in the S1 comprises a first logistics transportation task and a plurality of logistics transportation tasks with the same path;
all logistics transportation paths and/or part of the logistics transportation paths of the same-path logistics transportation task are the same as part of the logistics transportation paths of the first logistics transportation task.
S2, constructing a logistics transportation path network;
the logistics transportation path network in the S2 is provided with a plurality of logistics distribution center nodes, and a plurality of logistics transportation lines exist between every two adjacent logistics distribution center nodes; a plurality of logistics throwing destinations are arranged in a preset logistics service range of each logistics distribution center node.
S3, selecting a starting point, a finishing point and a necessary passing node of unidirectional logistics transportation based on a logistics transportation path network according to the current unidirectional logistics transportation task set;
the step S3 comprises the following steps:
s31, acquiring a logistics distribution initiating position and a logistics distribution signing position of a first logistics transportation task in a current unidirectional logistics transportation task set;
s32, positioning a logistics delivery destination which is the shortest in time in a logistics transportation path network according to a logistics distribution initiating position of a first logistics transportation task, and taking the logistics delivery destination as a logistics transportation service starting point;
s33, searching a logistics distribution center node corresponding to a preset logistics service range where a logistics transport service starting point is located based on a logistics transport path network, and selecting the logistics distribution center node as a starting point of unidirectional logistics transport;
s34, positioning a logistics delivery destination which is the shortest in time in a logistics transportation path network according to a logistics distribution signing position of a first logistics transportation task, and taking the logistics delivery destination as a logistics transportation service terminal;
s35, searching a logistics distribution center node corresponding to a preset logistics service range where a logistics transportation service terminal is located based on a logistics transportation path network, and selecting the logistics distribution center node as a terminal of unidirectional logistics transportation;
s36, judging whether other logistics transportation tasks except the first logistics transportation task exist in the current unidirectional logistics transportation task set, if so, entering S37, otherwise, taking the end point of unidirectional logistics transportation as a necessary passing node, and entering S4;
s37, taking other logistics transportation tasks except the first logistics transportation task in the current unidirectional logistics transportation task set as the mandatory logistics transportation tasks, and respectively obtaining logistics distribution signing positions of the mandatory logistics transportation tasks as the mandatory signing positions;
s38, taking the logistics distribution center node corresponding to the preset logistics service range where the sign-in position is located as a necessary routing node.
S4, planning to obtain a current optimal logistics path according to the starting point, the ending point and the necessary passing nodes of unidirectional logistics transportation;
the step S4 comprises the following steps:
s41, taking a starting point of unidirectional logistics transportation as a current logistics transportation starting point;
s42, respectively acquiring necessary transportation costs from a current logistics transportation starting point to each necessary passing node;
the calculation expression of the necessary transportation cost in S42 is as follows:，/>，
，/>，
，/>wherein M is n Representing the necessary transportation costs f p Representing the labor cost coefficient of logistics transportation, M p Representing the labor cost of logistics transportation, f fc Representing cost coefficients of logistics transportation vehicles, M fc Representing the cost of the logistics transportation vehicle, f t Representing the cost coefficient of logistics transportation time, M t Representing the cost of logistics transportation time, f ch Representing the cost coefficient of distributed loading and unloading of logistics, M ch Representing the logistics distributed unloading cost, t s Represents the total time of logistics tasks, M pav Represents the labor cost of logistics transportation in unit time, O ils Represents the full-load average oil consumption of the non-congested road section, L s Representing the length of the non-congested road segment, O ilc Represents the full-load average oil consumption of the congested road section, L c Representing the length of a congested road segment, load on Load representing the Load of a vehicle s Representing the full load of the vehicle, M load Representing road tolls of vehicles, V s Representing the travel speed of the non-congested road section, V c Indicating the running speed of the congested road section, I indicating the ith traffic light, I indicating the total number of the traffic lights, N li Indicating the waiting time length proportion of the ith traffic light, t li Represents the maximum waiting time length, T, of the ith traffic light ch Indicating the unloading time of logistics transportation cargoes, T in Indicating the time of entering the logistics distribution center, T out Indicating the time of departure from the distribution center, M chav The method is characterized in that the method comprises the steps of representing the unloading cost of logistics transportation cargo in unit unloading time, L representing the cargo quantity to be loaded in a logistics distribution center, alpha representing the quantity of the cargo reaching the logistics distribution center in unit time, beta representing the quantity of the total cargo loaded and unloaded in unit time of all cargo loading ports of the logistics distribution center, and L unload Indicating the quantity to be unloaded on the vehicle, L q Indicating the number of goods to be loaded on the load port,/-or%>Representing the utilization rate of the cargo loading port, P k Indicating the probability that the amount of cargo to be logistics transported is equal to the lot logistics vehicle capacity.
In this embodiment, the cost of labor coefficient f for logistics transportation p The value of (2) is 0.79, and the cost coefficient f of the logistics transportation vehicle fc The value of (2) is 1.03, and the cost coefficient f of logistics transportation time is f t The value of (2) is 1.24, and the cost coefficient f of logistics distributed unloading and loading is f ch The value of the loading and unloading cost per unit time of the logistics transportation cargo loading and unloading comprises the cost of manual loading and unloading per unit time, the cost of occupying a loading port per unit time and the like. In the embodiment, the conditions of cargo concentration, port occupation to be loaded and loading of the logistics distribution center, time for entering and exiting the logistics distribution center and the like are fully considered, so that a new logistics transportation task is effectively received, and the prediction accuracy of a logistics path is optimized and adjusted.
S43, taking a necessary passing node corresponding to the lowest necessary transportation cost as a next necessary passing node to obtain a planned part of optimal logistics path;
s44, judging whether necessary route nodes which are not planned to enter the planned part of the optimal logistics path exist, if yes, entering S45, otherwise, entering S46;
s45, taking the next necessary route node as a current logistics transportation starting point, and returning to S42;
s46, judging whether the end point of the unidirectional logistics transportation is planned to enter a planned part of the optimal path, if so, entering S48, otherwise, entering S47;
s47, taking the end point of unidirectional logistics transportation as a necessary passing node, and returning to S44;
s48, the end point of one-way logistics transportation is not used as a necessary passing node, and the planned partial optimal path is used as the current optimal logistics path.
S5, executing logistics transportation tasks along the current optimal logistics path, and updating the current unidirectional logistics transportation task set according to the controllable time cost and the logistics transportation tasks to be added at the nodes of the next arrival necessary path;
the step S5 comprises the following steps:
s51, acquiring the logistics transportation time cost and the maximum logistics transportation time threshold value between adjacent necessary routing nodes on the current optimal logistics transportation path, and the logistics transportation time cost and the maximum logistics transportation time threshold value between the unidirectional logistics transportation terminal and the adjacent necessary routing nodes;
s52, executing a logistics transportation task along the current optimal logistics transportation path, judging whether the next arrived logistics distribution center node is the end point of unidirectional logistics transportation, if so, entering S6, otherwise, entering S53;
s53, judging whether the next arriving logistics distribution center node is a necessary passing node, if so, entering S54, otherwise, continuing to execute logistics transportation tasks along the current optimal logistics path after passing through the next arriving logistics distribution center node, and returning to S52;
s54, executing a logistics transportation task along a current optimal logistics transportation path, and acquiring a first to-be-added same-path logistics transportation task and a second to-be-added same-path logistics transportation task at a next arriving necessary passing node, wherein the logistics transportation center node corresponding to the end point of the first to-be-added same-path logistics transportation task is a necessary passing node, the logistics transportation center node corresponding to the end point of the second to-be-added same-path logistics transportation task is a unnecessary passing node, and the to-be-loaded cargo amounts of the first to-be-added same-path logistics transportation task and the second to-be-added same-path logistics transportation task are not more than the to-be-unloaded cargo amount at the next arriving necessary passing node;
s55, judging whether the makeup removal time of the logistics transportation cargoes of the first logistics transportation task to be added with the same path is smaller than the difference value between the maximum logistics transportation time threshold value corresponding to the next arrival necessary passing node and the next adjacent necessary passing node and the logistics transportation time cost, if yes, entering S56, otherwise entering S57;
s56, adding a first logistics transportation task to be added with the same path to the current unidirectional logistics transportation task set, and entering S59;
s57, judging whether the sum of the time of entering the logistics distribution center, the time of leaving the logistics distribution center and the logistics transportation cargo makeup removal time of a second logistics transportation task to be added with the same path is smaller than the difference value between the maximum logistics transportation time threshold value corresponding to the next arrival necessary routing node and the next adjacent necessary routing node and the logistics transportation time cost, if yes, entering S58, otherwise entering S59;
s58, adding a second logistics transportation task to be added with the same route to the current unidirectional logistics transportation task set, taking the second logistics transportation task as a class logistics transportation task, and entering S59;
s59, executing a logistics transportation task to a next arriving necessary routing node along the current optimal logistics path, taking the arriving necessary routing node as a starting point of unidirectional logistics transportation while arriving, and taking the arriving necessary routing node not as the necessary routing node any more.
S6, judging whether the updated unidirectional logistics transportation task set is added with a new logistics transportation task with the same path, if so, taking the updated unidirectional logistics transportation task set as the current unidirectional logistics transportation task set, returning to S3, otherwise, entering S7;
s7, judging whether necessary passing nodes exist in the current optimal logistics path, if so, returning to S5, otherwise, entering S8;
and S8, executing logistics transportation tasks along the current optimal logistics path to complete planning of the logistics path.
Example 2: in this embodiment, the difference from embodiment 1 is that the current unidirectional logistics transportation task set has only the first logistics transportation task, and then the current optimal logistics path is obtained directly and sequentially according to the methods of S1, S2, S3 and S4 in embodiment 1, so that the planning of the logistics path can be completed. In this embodiment, since only the first logistics transportation task is provided, there is no condition that the cargo is unloaded, a new logistics task can be received or a logistics path needs to be adjusted, and the logistics transportation is always a preset full-load condition by default, then the current optimal logistics path can be planned under the condition that the necessary transportation cost is the lowest.
The foregoing is merely illustrative of the present invention, and the present invention is not limited thereto, and any person skilled in the art will readily recognize that variations or substitutions are within the scope of the present invention.
Claims (8)
1. The logistics path planning method is characterized by comprising the following steps of:
s1, acquiring a current unidirectional logistics transportation task set;
s2, constructing a logistics transportation path network;
s3, selecting a starting point, a finishing point and a necessary passing node of unidirectional logistics transportation based on a logistics transportation path network according to the current unidirectional logistics transportation task set;
s4, planning to obtain a current optimal logistics path according to the starting point, the ending point and the necessary passing nodes of unidirectional logistics transportation;
s5, executing logistics transportation tasks along the current optimal logistics path, and updating the current unidirectional logistics transportation task set according to the controllable time cost and the logistics transportation tasks to be added at the nodes of the next arrival necessary path;
s6, judging whether the updated unidirectional logistics transportation task set is added with a new logistics transportation task with the same path, if so, taking the updated unidirectional logistics transportation task set as the current unidirectional logistics transportation task set, returning to S3, otherwise, entering S7;
s7, judging whether necessary passing nodes exist in the current optimal logistics path, if so, returning to S5, otherwise, entering S8;
and S8, executing logistics transportation tasks along the current optimal logistics path to complete planning of the logistics path.
2. The logistics path planning method of claim 1, wherein the current set of unidirectional logistics transportation tasks in S1 comprises at least a first logistics transportation task.
3. The logistics path planning method according to claim 2, wherein the current unidirectional logistics transportation task set in S1 further comprises a plurality of same-path logistics transportation tasks;
all logistics transportation paths and/or part of the logistics transportation paths of the same-path logistics transportation task are the same as part of the logistics transportation paths of the first logistics transportation task.
4. The logistics path planning method according to any one of claims 1-3, wherein the logistics transportation path network in S2 is provided with a plurality of logistics distribution center nodes, and a plurality of logistics transportation lines exist between each adjacent logistics distribution center nodes; a plurality of logistics throwing destinations are arranged in a preset logistics service range of each logistics distribution center node.
5. The logistic path planning method according to claim 4, wherein the S3 comprises the steps of:
s31, acquiring a logistics distribution initiating position and a logistics distribution signing position of a first logistics transportation task in a current unidirectional logistics transportation task set;
s32, positioning a logistics delivery destination which is the shortest in time in a logistics transportation path network according to a logistics distribution initiating position of a first logistics transportation task, and taking the logistics delivery destination as a logistics transportation service starting point;
s33, searching a logistics distribution center node corresponding to a preset logistics service range where a logistics transport service starting point is located based on a logistics transport path network, and selecting the logistics distribution center node as a starting point of unidirectional logistics transport;
s34, positioning a logistics delivery destination which is the shortest in time in a logistics transportation path network according to a logistics distribution signing position of a first logistics transportation task, and taking the logistics delivery destination as a logistics transportation service terminal;
s35, searching a logistics distribution center node corresponding to a preset logistics service range where a logistics transportation service terminal is located based on a logistics transportation path network, and selecting the logistics distribution center node as a terminal of unidirectional logistics transportation;
s36, judging whether other logistics transportation tasks except the first logistics transportation task exist in the current unidirectional logistics transportation task set, if so, entering S37, otherwise, taking the end point of unidirectional logistics transportation as a necessary passing node, and entering S4;
s37, taking other logistics transportation tasks except the first logistics transportation task in the current unidirectional logistics transportation task set as the mandatory logistics transportation tasks, and respectively obtaining logistics distribution signing positions of the mandatory logistics transportation tasks as the mandatory signing positions;
s38, taking the logistics distribution center node corresponding to the preset logistics service range where the sign-in position is located as a necessary routing node.
6. The logistic path planning method according to claim 5, characterized in that the S4 comprises the steps of:
s41, taking a starting point of unidirectional logistics transportation as a current logistics transportation starting point;
s42, respectively acquiring necessary transportation costs from a current logistics transportation starting point to each necessary passing node;
s43, taking a necessary passing node corresponding to the lowest necessary transportation cost as a next necessary passing node to obtain a planned part of optimal logistics path;
s44, judging whether necessary route nodes which are not planned to enter the planned part of the optimal logistics path exist, if yes, entering S45, otherwise, entering S46;
s45, taking the next necessary route node as a current logistics transportation starting point, and returning to S42;
s46, judging whether the end point of the unidirectional logistics transportation is planned to enter a planned part of the optimal path, if so, entering S48, otherwise, entering S47;
s47, taking the end point of unidirectional logistics transportation as a necessary passing node, and returning to S44;
s48, the end point of one-way logistics transportation is not used as a necessary passing node, and the planned partial optimal path is used as the current optimal logistics path.
7. The logistic path planning method according to claim 6, characterized in that the calculation expression of the necessary transportation cost in S42 is as follows:
，/>，
，/>，
，/>wherein M is n Representing the necessary transportation costs f p Representing the labor cost coefficient of logistics transportation, M p Representing the labor cost of logistics transportation, f fc Representing cost coefficients of logistics transportation vehicles, M fc Representing the cost of the logistics transportation vehicle, f t Representing the cost coefficient of logistics transportation time, M t Representing the cost of logistics transportation time, f ch Representing the cost coefficient of distributed loading and unloading of logistics, M ch Representing the logistics distributed unloading cost, t s Represents the total time of logistics tasks, M pav Represents the labor cost of logistics transportation in unit time, O ils Represents the full-load average oil consumption of the non-congested road section, L s Representing the length of the non-congested road segment, O ilc Represents the full-load average oil consumption of the congested road section, L c Representing the length of a congested road segment, load on Load representing the Load of a vehicle s Representing the full load of the vehicle, M load Representing road tolls of vehicles, V s Representing the travel speed of the non-congested road section, V c Indicating the running speed of the congested road section, I indicating the ith traffic light, I indicating the total number of the traffic lights, N li Indicating the waiting time length proportion of the ith traffic light, t li Represents the maximum waiting time length, T, of the ith traffic light ch Indicating the unloading time of logistics transportation cargoes, T in Indicating the time of entering the logistics distribution center, T out Indicating the time of departure from the distribution center, M chav The method is characterized in that the method comprises the steps of representing the unloading cost of logistics transportation cargo in unit unloading time, L representing the cargo quantity to be loaded in a logistics distribution center, alpha representing the quantity of the cargo reaching the logistics distribution center in unit time, beta representing the quantity of the total cargo loaded and unloaded in unit time of all cargo loading ports of the logistics distribution center, and L unload Indicating the quantity to be unloaded on the vehicle, L q Indicating the number of goods to be loaded on the load port,/-or%>Representing the utilization rate of the cargo loading port, P k Indicating the probability that the amount of cargo to be logistics transported is equal to the lot logistics vehicle capacity.
8. The logistic path planning method according to claim 7, characterized in that the S5 comprises the steps of:
the step S5 comprises the following steps:
s51, acquiring the logistics transportation time cost and the maximum logistics transportation time threshold value between adjacent necessary routing nodes on the current optimal logistics transportation path, and the logistics transportation time cost and the maximum logistics transportation time threshold value between the unidirectional logistics transportation terminal and the adjacent necessary routing nodes;
s52, executing a logistics transportation task along the current optimal logistics transportation path, judging whether the next arrived logistics distribution center node is the end point of unidirectional logistics transportation, if so, entering S6, otherwise, entering S53;
s53, judging whether the next arriving logistics distribution center node is a necessary passing node, if so, entering S54, otherwise, continuing to execute logistics transportation tasks along the current optimal logistics path after passing through the next arriving logistics distribution center node, and returning to S52;
s54, executing a logistics transportation task along a current optimal logistics transportation path, and acquiring a first to-be-added same-path logistics transportation task and a second to-be-added same-path logistics transportation task at a next arriving necessary passing node, wherein the logistics transportation center node corresponding to the end point of the first to-be-added same-path logistics transportation task is a necessary passing node, the logistics transportation center node corresponding to the end point of the second to-be-added same-path logistics transportation task is a unnecessary passing node, and the to-be-loaded cargo amounts of the first to-be-added same-path logistics transportation task and the second to-be-added same-path logistics transportation task are not more than the to-be-unloaded cargo amount at the next arriving necessary passing node;
s55, judging whether the makeup removal time of the logistics transportation cargoes of the first logistics transportation task to be added with the same path is smaller than the difference value between the maximum logistics transportation time threshold value corresponding to the next arrival necessary passing node and the next adjacent necessary passing node and the logistics transportation time cost, if yes, entering S56, otherwise entering S57;
s56, adding a first logistics transportation task to be added with the same path to the current unidirectional logistics transportation task set, and entering S59;
s57, judging whether the sum of the time of entering the logistics distribution center, the time of leaving the logistics distribution center and the logistics transportation cargo makeup removal time of a second logistics transportation task to be added with the same path is smaller than the difference value between the maximum logistics transportation time threshold value corresponding to the next arrival necessary routing node and the next adjacent necessary routing node and the logistics transportation time cost, if yes, entering S58, otherwise entering S59;
s58, adding a second logistics transportation task to be added with the same route to the current unidirectional logistics transportation task set, taking the second logistics transportation task as a class logistics transportation task, and entering S59;
s59, executing a logistics transportation task to a next arriving necessary routing node along the current optimal logistics path, taking the arriving necessary routing node as a starting point of unidirectional logistics transportation while arriving, and taking the arriving necessary routing node not as the necessary routing node any more.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410001794.7A CN117494922A (en) | 2024-01-02 | 2024-01-02 | Logistics path planning method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410001794.7A CN117494922A (en) | 2024-01-02 | 2024-01-02 | Logistics path planning method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117494922A true CN117494922A (en) | 2024-02-02 |
Family
ID=89683333
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410001794.7A Pending CN117494922A (en) | 2024-01-02 | 2024-01-02 | Logistics path planning method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117494922A (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103745329A (en) * | 2013-12-19 | 2014-04-23 | 柳州职业技术学院 | Internet-of-things-oriented economical type logistics transportation delivery method |
| US20200082323A1 (en) * | 2018-09-12 | 2020-03-12 | Graphmasters SA | Shipment distribution system and method for distribution of goods shipments |
| KR102101814B1 (en) * | 2020-01-03 | 2020-04-17 | 정만호 | A system of mediation for freight capable of amending of allocation information |
| CN112766555A (en) * | 2021-01-13 | 2021-05-07 | 贵州易荣德尚网络科技服务有限责任公司 | Same-city logistics capacity scheduling system and method |
| KR102284951B1 (en) * | 2020-10-12 | 2021-08-03 | 정선종 | Cargo relay and dispatch system |
| CN113673932A (en) * | 2021-08-24 | 2021-11-19 | 北京京东振世信息技术有限公司 | Logistics network planning method and device |
| CN114612046A (en) * | 2022-03-30 | 2022-06-10 | 国网河北省电力有限公司营销服务中心 | Intelligent distribution path optimization method |
| JP2023039700A (en) * | 2021-09-09 | 2023-03-22 | 三菱重工業株式会社 | Route planning method, route planning device and program |
| CN116468340A (en) * | 2023-03-16 | 2023-07-21 | 上海润廷电子科技有限公司 | Pre-reaction scheduling method, medium and terminal for half-warehouse cargo in special line transport vehicle |
| KR102582897B1 (en) * | 2023-02-14 | 2023-09-26 | 오준환 | A system of mediation for freight capable of amending of allocation information |
| CN117196457A (en) * | 2023-09-04 | 2023-12-08 | 苏州信泰中运物流有限公司 | Logistics transportation path planning method based on Internet |
| CN117217396A (en) * | 2023-09-12 | 2023-12-12 | 广西交科集团有限公司 | Multi-target dispatch path existence judging method and system based on road network |
-
2024
- 2024-01-02 CN CN202410001794.7A patent/CN117494922A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103745329A (en) * | 2013-12-19 | 2014-04-23 | 柳州职业技术学院 | Internet-of-things-oriented economical type logistics transportation delivery method |
| US20200082323A1 (en) * | 2018-09-12 | 2020-03-12 | Graphmasters SA | Shipment distribution system and method for distribution of goods shipments |
| KR102101814B1 (en) * | 2020-01-03 | 2020-04-17 | 정만호 | A system of mediation for freight capable of amending of allocation information |
| KR102284951B1 (en) * | 2020-10-12 | 2021-08-03 | 정선종 | Cargo relay and dispatch system |
| CN112766555A (en) * | 2021-01-13 | 2021-05-07 | 贵州易荣德尚网络科技服务有限责任公司 | Same-city logistics capacity scheduling system and method |
| CN113673932A (en) * | 2021-08-24 | 2021-11-19 | 北京京东振世信息技术有限公司 | Logistics network planning method and device |
| JP2023039700A (en) * | 2021-09-09 | 2023-03-22 | 三菱重工業株式会社 | Route planning method, route planning device and program |
| CN114612046A (en) * | 2022-03-30 | 2022-06-10 | 国网河北省电力有限公司营销服务中心 | Intelligent distribution path optimization method |
| KR102582897B1 (en) * | 2023-02-14 | 2023-09-26 | 오준환 | A system of mediation for freight capable of amending of allocation information |
| CN116468340A (en) * | 2023-03-16 | 2023-07-21 | 上海润廷电子科技有限公司 | Pre-reaction scheduling method, medium and terminal for half-warehouse cargo in special line transport vehicle |
| CN117196457A (en) * | 2023-09-04 | 2023-12-08 | 苏州信泰中运物流有限公司 | Logistics transportation path planning method based on Internet |
| CN117217396A (en) * | 2023-09-12 | 2023-12-12 | 广西交科集团有限公司 | Multi-target dispatch path existence judging method and system based on road network |
Non-Patent Citations (2)
| Title |
|---|
| 曾斌等: "战场运输在线路径规划算法研究", 《火力与指挥控制》, 31 January 2020 (2020-01-31) * |
| 李二超等: "改进遗传算法搜索动态订单下车辆路径最优问题", 《计算机工程与应用》, 15 August 2023 (2023-08-15) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2022021119A1 (en) | Method and system for fully autonomous waterborne transport scheduling between container terminals | |
| CN109034481B (en) | Constraint programming-based vehicle path problem modeling and optimizing method with time window | |
| CN112001064B (en) | Full-autonomous water transport scheduling method and system between container terminals | |
| CN108985597B (en) | Dynamic logistics scheduling method | |
| BARTHOLDI III et al. | Decentralized control of automated guided vehicles on a simple loop | |
| US6577601B1 (en) | Masked proportional routing | |
| CN111653098B (en) | Intersection passing sequence optimization method for automatic guided vehicle with multiple loading capacity | |
| CN113848970B (en) | Multi-target cooperative path planning method for vehicle-unmanned aerial vehicle | |
| CN114971043B (en) | Postal carrier problem path optimization method based on non-Euler loop | |
| CN111445084B (en) | Logistics distribution path optimization method considering traffic conditions and double time windows | |
| CN114331220A (en) | Passenger vehicle transport vehicle scheduling method and device based on order dynamic priority | |
| CN115829183B (en) | Cold chain logistics path planning method, device, equipment and readable storage medium | |
| CN109165883B (en) | Intelligent vehicle waybill distribution method and system based on elastic integration | |
| CN111325371A (en) | Transportation route planning method and system | |
| CN114612046A (en) | Intelligent distribution path optimization method | |
| CN114663011A (en) | Dispatching method for AGV (automatic guided vehicle) of automatic dock | |
| CN115062868A (en) | Pre-polymerization type vehicle distribution path planning method and device | |
| CN118083804A (en) | Path selection method and device based on reduction of track busyness | |
| CN117494922A (en) | Logistics path planning method | |
| US20040158396A1 (en) | Material control system | |
| CN110084555A (en) | A kind of central dispatch system and dispatching method | |
| CN114846492A (en) | Method of operating one or more vehicles and/or equipment in a terminal, and related apparatus and system | |
| CN115617049B (en) | AGV dolly control system based on concrete transportation platform | |
| CN112613701A (en) | Finished cigarette logistics scheduling method | |
| CN115018211B (en) | Method and device for setting transportation scheduling line |
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 |