CN115983756A - Logistics combined supply method and system for grain base and storage medium - Google Patents
Logistics combined supply method and system for grain base and storage medium Download PDFInfo
- Publication number
- CN115983756A CN115983756A CN202310259091.XA CN202310259091A CN115983756A CN 115983756 A CN115983756 A CN 115983756A CN 202310259091 A CN202310259091 A CN 202310259091A CN 115983756 A CN115983756 A CN 115983756A
- Authority
- CN
- China
- Prior art keywords
- grain
- transportation
- truck
- base
- scheme
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a logistics joint supply method, a logistics joint supply system and a storage medium of a grain base, belongs to the technical field of logistics transportation, and comprises the following steps of S1: acquiring geographic information, grain warehousing quantity required by a grain storage base and plan completion time for completing the grain warehousing quantity; step S2: acquiring port freight shift information, and transporting the first supply amount of grains based on the port freight shift information to enable the grain warehousing quantity to remain the first residual amount of grains; and step S3: transporting the grain with the second supply quantity based on the information of the railway freight shift so that the grain warehousing quantity remains the grain with the second residual quantity; and step S4: and acquiring a scheme which completes the transportation task before the planned completion time and has the minimum transportation cost as a final transportation scheme based on the second residual quantity and the road transportation distance. The invention can determine the optimal transportation mode of the grain, thereby ensuring that the transportation of the grain is finished with the minimum cost before the planned completion time.
Description
Technical Field
The invention belongs to the technical field of logistics transportation, and particularly relates to a logistics combined supply method, a logistics combined supply system and a storage medium for a grain base.
Background
Currently, to ensure a balanced supply and demand, it is necessary to transport the grain from the production area to the consumption area. At present, the transportation modes of a large amount of grains generally include road transportation, railway transportation and waterway transportation, wherein the transportation modes of the railway and the waterway are low in transportation cost, but are influenced by geographical position factors and transportation energy, and the transportation cost is higher although the road transportation mode is less limited, so how to reasonably plan the grain transportation mode, the cost in the grain transportation process is controllable, which is a technical problem to be solved urgently in the field.
In order to reduce the transportation cost of grains, the following solutions are proposed in the prior art, for example, chinese patent application CN109146167B proposes a method, device, system and storage medium for seeking the shortest grain transportation path, the method obtains a plurality of grain transportation paths through an ant colony algorithm based on the position information of a grain distribution center and a plurality of transportation target cities, selects a plurality of target grain transportation paths satisfying the preset path similarity condition from the grain transportation paths, uses the target grain transportation paths as the initial grain transportation paths of a taboo search algorithm, and determines the shortest grain transportation path through the taboo search algorithm based on the position information, thereby reducing the grain transportation cost; for example, chinese patent application CN109740829A proposes a grain transportation method, device, storage medium and apparatus based on ant colony algorithm, which obtains a first-nth-level grain transportation coarsening map by performing multi-level coarsening on a grain transportation weighted map, takes an nth-level ant colony algorithm parameter corresponding to the nth-level grain transportation coarsening map as an nth-level ant colony algorithm parameter, selects an nth-1-level ant colony algorithm parameter from the nth-level ant algorithm parameter, optimizes the nth-level grain transportation coarsening map according to the nth-1-level ant algorithm parameter, obtains an nth-level optimal path, and performs a loop operation until an optimal transportation path is obtained. However, the two technical solutions are to plan and calculate the transportation path of the grain, and do not relate to the problem of how to allocate the grain transportation mode.
Disclosure of Invention
The invention provides a method, a system and a storage medium for combined logistics supply of a grain base, which are used for solving the problems in the background art.
In order to achieve the above object, the present invention provides a method for combined logistics of food bases, comprising:
step S1: acquiring geographic information and task information, wherein the geographic information comprises address information of a grain storage base and address information of a grain production base, and the task information comprises grain warehousing quantity required by the grain storage base and planned completion time for completing the grain warehousing quantity;
step S2: if the grain storage base and the grain production base are located in cities, a port freight shift information is obtained, the port freight shift information comprises transport shifts and the carrying capacity of each transport shift, a first supply quantity is calculated based on the port freight shift information, the first supply quantity is the grain transport quantity finished by the port before the planned finishing time, if the first supply quantity is larger than or equal to the grain warehousing quantity, the transport of all grains is finished by the port, if the first supply quantity is smaller than the grain warehousing quantity, a first difference value between the grain warehousing quantity and the first supply quantity is calculated, and the first difference value is defined as a first residual quantity;
and step S3: acquiring a road transportation distance between a grain storage base and a grain production base, acquiring railway freight shift information of a city where the grain storage base is located and a city where the grain production base is located if the road transportation distance is greater than or equal to a preset critical distance, calculating a second supply quantity based on the railway freight shift information, completing transportation of all the first surplus grains through a railway if the second supply quantity is greater than or equal to the first surplus, calculating a second difference value between the second supply quantity and the first surplus if the second supply quantity is less than the first surplus, and defining the second difference value as the second surplus;
and step S4: and obtaining a shortest road transportation path based on the address of the grain storage base and the address of the grain production base, generating a plurality of road transportation schemes based on the shortest road transportation path, and selecting a scheme which finishes the second surplus transportation before the planned completion time and has the minimum transportation cost as a final transportation scheme.
Further, the road transportation scheme for generating the grain storage base and the grain production base comprises the following steps:
acquiring a list of trucks participating in road transportation, and coding each truck based on the list of trucks, wherein the coding comprises a first area, a second area and a third area, the number of the first area represents the type of the truck, the number of the second area represents the rated cargo capacity of the truck, the third area comprises a plurality of sub-areas, and the number of each sub-area corresponds to the transportation mileage of the trucks of different types;
constructing a schema to generate a topology graph, the schema to generate the topology graph comprising a plurality of identical network layers
Each network layer comprises subunits with the same number as the trucks, each subunit is correspondingly associated with one code and is defined to be positioned in the network layer->
The sub-unit in (1) is a first sub-unit and is positioned at the network layer>
The sub-units in (1) are second sub-units, each first sub-unit and each second sub-unit are connected with each other, each second sub-unit comprises a plurality of first merging codes, the first merging codes are codes contained in the second sub-units and codes merging results contained in the first sub-units connected with the second sub-units, when merging, numbers in first areas of two codes are reserved in series, numbers in second areas are added, and numbers stored in corresponding sub-areas of a third area are added;
definition at the network layer
The sub-units in the system are third sub-units, each second sub-unit and each third sub-unit are connected with each other, each third sub-unit comprises a plurality of second merging codes, if the numerical value of a second region of the second merging codes is larger than or equal to the second residual quantity after merging, backward propagation of the second merging codes is stopped, and the second merging codes are used as scheme codes to be output.
Further, after the scheme codes are output, determining the types and the number of road transport trucks participating in the scheme based on the following steps:
obtaining the occurrence frequency of each digit in a first area of the scheme code, determining the type and the corresponding number of the road transport trucks based on the digits and the occurrence frequency of the digits, screening the digits which repeatedly appear at least twice in the scheme code after the determination is finished, positioning the minimum interval between the repeated digits, obtaining other digits in the minimum interval, and calculating the critical time based on a first formula, wherein the first formula is as follows:
in which>
For the number of other numbers in said minimum interval>
And if the critical time is larger than the preset working time, reducing the planned employment number of the truck to 1 for the preset truck loading time.
Further, calculating the cost of the road transportation scheme comprises the following steps:
obtaining the employment cost of each type of truck, and calculating the transportation cost of the road transportation scheme based on a second formula, wherein the second formula is as follows:
wherein is present>
As a type->
Fee hiring of truck,. Based on the fee, or on the fee>
For the number of hires of the corresponding type of truck, be>
Based on the freight train driving cost, the freight train driving cost->
Obtained by a third formula: />
In which>
Is type->
The cost per kilometer of the travel of the truck,
is type->
The distance traveled by the truck.
Further, before the step S4 of generating the road transportation plan, the method further includes the following steps:
setting an average running speed of a truck participating in road transportation, calculating total running time of the truck based on the average running speed and the shortest road transportation path, and setting first running limit time and second running limit time, wherein the first running limit time is the running limit time of the truck accumulated in 24 hours, the second running limit time is the continuous running time limit time of the truck, if the total running time of the truck is greater than the first running limit time, a transfer point is set between a grain storage base and a grain production base, and the number of the transfer points is based on a fourth common transfer pointDetermining the distance by the formula, wherein the fourth formula is as follows:
wherein is present>
For the total travel time of the truck, is>
For the second driving restriction time, based on the vehicle speed>
Is a rounded down function;
and setting the transit points at the positions of the second travel limit time distance of the trucks by taking a grain production base as a starting point, dividing the trucks participating in transportation into an initial truck and a transit truck, enabling the transit truck to go to the transit points for standby, transferring grains loaded by the initial truck into the transit points after the initial truck reaches the transit points, and transporting the grains to the next transit point by the transit truck.
The invention also provides a logistics combined supply system of the grain base, which is used for realizing the logistics combined supply method of the grain base, and the system mainly comprises the following components:
the input module is used for inputting geographic information and task information, wherein the geographic information comprises address information of a grain storage base and address information of a grain production base, and the task information comprises grain warehousing quantity required by the grain storage base and planned completion time for completing the grain warehousing quantity;
a first module, configured to obtain port freight shift information provided by a port, where the port freight shift information includes transport shifts and a carrying capacity of each transport shift, calculate a first supply amount based on the port freight shift information, where the first supply amount is grain transport amount completed by the port before the scheduled completion time, complete transport of all grains by the port if the first supply amount is greater than or equal to grain warehousing amount, and calculate a first difference between the grain warehousing amount and the first supply amount if the first supply amount is less than the grain warehousing amount, and define the first difference as a first remaining amount;
the second module is used for acquiring a road transportation distance between the grain storage base and the grain production base, acquiring railway freight shift information of a city where the grain storage base is located and a city where the grain production base is located if the road transportation distance is greater than or equal to a preset critical distance, calculating a second supply quantity based on the railway freight shift information, completing transportation of all the first surplus grains through a railway if the second supply quantity is greater than or equal to the first surplus, calculating a second difference value between the second supply quantity and the first surplus if the second supply quantity is smaller than the first surplus, and defining the second difference value as the second surplus;
and the road transportation scheme generation module is used for obtaining a shortest road transportation path based on the address of the grain storage base and the address of the grain production base, generating a plurality of road transportation schemes based on the shortest road transportation path, and selecting a scheme which finishes the second residual transportation before the planned completion time and has the lowest transportation cost as a final transportation scheme.
The invention also provides a computer storage medium, wherein the computer storage medium stores program instructions, and the logistics combined supply method of the grain base is controlled by the equipment where the computer storage medium is located when the program instructions run.
Compared with the prior art, the invention has the following beneficial effects:
according to the method, the transport volume of the grains and the time for completing the transport are determined by acquiring the task information, then the geographic information is acquired, which mode can be adopted for the transport between the grain storage base and the grain production base is determined, and the transport volume of the grains which can be completed through a water path and a railway is calculated in sequence according to the principle of minimum cost, so that the grains are preferentially transported through the water path and the railway; grains which cannot be transported by a waterway and a railway are transported by roads, and before the grains are transported by the roads, a plurality of road transportation schemes are generated according to transportation distances and vehicles participating in transportation, and the transportation scheme with the minimum cost is selected from the road transportation schemes; the invention can determine the optimal transportation mode of the grain, thereby ensuring that the transportation of the grain is finished with the minimum cost before the planned completion time.
Drawings
FIG. 1 is a flow chart illustrating the steps of a combined logistics method for a grain base according to the present invention;
fig. 2 is a schematic diagram of the present invention for creating a road transportation scheme.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
It will be understood that, as used herein, the terms "first," "second," and the like may be used herein to describe various elements, but these elements are not limited by these terms unless otherwise specified. These terms are only used to distinguish one element from another. For example, a first xx script may be referred to as a second xx script, and similarly, a second xx script may be referred to as a first xx script, without departing from the scope of the present application.
As shown in fig. 1, a method for combined logistics and supply of a food base comprises the following steps:
step S1: acquiring geographic information and task information, wherein the geographic information comprises address information of a grain storage base and address information of a grain production base, and the task information comprises grain warehousing quantity required by the grain storage base and planned completion time for completing the grain warehousing quantity;
the addresses of the grain storage base and the grain production base can be determined by acquiring the geographic information, then the grade city where the bases are located is determined according to the addresses of the two bases, and after the grade city information is acquired, whether the cities where the two bases are located have information such as ports and railway stations can be determined. In this embodiment, the grain warehousing quantity is the total amount of grains to be transported from the grain production base to the grain storage base, and the planned completion time is the date of completion of the grain transportation.
Step S2: if the grain storage base and the grain production base are located in cities at ports, port freight shift information is obtained, the port freight shift information comprises transport shifts and the carrying capacity of each transport shift, a first supply amount is calculated based on the port freight shift information, the first supply amount is grain transport amount completed by the ports before planned completion time, if the first supply amount is larger than or equal to grain warehousing amount, transportation of all grains is completed by the ports, if the first supply amount is smaller than the grain warehousing amount, a first difference value between the grain warehousing amount and the first supply amount is calculated, and the first difference value is defined as a first residual amount;
if the cities of the two bases have ports, grains can be transported through the waterway, the waterway transportation cost is low, and the carrying capacity is large, so that the grains are preferentially transported by using the waterway; if the first supply quantity is larger than or equal to the grain warehousing quantity, the transportation of all grains can be completed through a water channel before the planned completion time, at the moment, the transportation of the grains is not performed through a railway and a road, and if the first supply quantity is smaller than the grain warehousing quantity, the quantity of the grains which can not be transported through the water channel, namely the first residual quantity, is calculated; furthermore, if the cities of the two bases do not exist or only one city has a port, the transportation is not carried out in a water channel mode.
And step S3: acquiring a road transportation distance between a grain storage base and a grain production base, acquiring railway freight shift information of a city where the grain storage base is located and a city where the grain production base is located if the road transportation distance is greater than or equal to a preset critical distance, calculating a second supply quantity based on the railway freight shift information, completing transportation of all first surplus grains through a railway if the second supply quantity is greater than or equal to a first surplus, calculating a second difference value between the second supply quantity and the first surplus if the second supply quantity is less than the first surplus, and defining the second difference value as the second surplus;
in this embodiment, the critical distance is set to 1000 km, and when the road transportation distance between the grain storage base and the grain production base is greater than 1000 km, the transportation time is long and the transportation cost is high in the mode of road transportation at this time, and in contrast, the transportation cost is low and the transportation time is short in the mode of railway transportation, so that the transportation cost can be greatly reduced by preferentially transporting grains through a railway under the condition that the grains cannot be transported through a waterway. If the transport of the first remaining amount cannot be completed by rail until the planned completion time, the remaining portion, i.e., the second remaining amount, is transported by road.
And step S4: and obtaining a shortest road transportation path based on the address of the grain storage base and the address of the grain production base, generating a plurality of road transportation schemes based on the shortest road transportation path, and selecting a scheme which finishes the second surplus transportation before the planned completion time and has the lowest transportation cost as a final transportation scheme.
Specifically, in road transportation, the planned completion time is taken as a limit, the shortest path between two bases is taken as a calculation basis, the number of trucks participating in grain transportation and the types of the trucks are determined through simulation based on the number of vehicles which can be mobilized, so that a plurality of transportation schemes are obtained, the transportation scheme with the minimum transportation cost is selected as a final scheme, and a specific generation mode is described in the following paragraphs.
Particularly, through the four steps, the optimal grain transportation mode can be determined according to the grain production base address and the grain storage base address, so that the problems that the grain transportation mode cannot be reasonably planned according to actual conditions and the transportation cost is greatly increased in the prior art are solved.
According to the method, firstly, the transportation amount and the transportation completion time of the grain are determined by acquiring the task information, then the geographic information is acquired, which mode can be adopted for transportation between the grain storage base and the grain production base is determined, and the transportation amount of the grain which can be completed through a water path and a railway is calculated in sequence according to the principle of minimum cost, so that the grain is guaranteed to be transported in the mode of the water path and the railway preferentially; grains which cannot be transported by a waterway and a railway are transported by roads, and before the grains are transported by the roads, a plurality of road transportation schemes are generated according to transportation distances and vehicles participating in transportation, and the transportation scheme with the minimum cost is selected from the road transportation schemes; the invention can determine the optimal transportation mode of the grain, thereby ensuring that the transportation of the grain is finished with the minimum cost before the planned completion time.
In this embodiment, the method for generating the road transportation scheme of the grain storage base and the grain production base comprises the following steps:
acquiring a list of trucks participating in road transportation, and coding each truck based on the list of trucks, wherein the coding comprises a first area, a second area and a third area, the number of the first area represents the type of the truck, the number of the second area represents the rated cargo capacity of the truck, the third area comprises a plurality of sub-areas, and the number of each sub-area corresponds to the transportation mileage of the trucks of different types;
the list of trucks participating in road transportation includes the number of trucks that can be called, but when the plan is generated, all trucks on the list are not necessarily called, each truck is coded, for example, the truck type is 1, the loading capacity of the truck is 20 tons, the distance between two bases is 400km, if the truck returns from the grain storage base to the grain production base, the truck is used each time, the 400km transportation mileage occurs, and then the truck of the truck type 1 is coded as
In the code, each bracket represents a region, in the third region, the sub-regions are separated by commas, then the first sub-region of the third region corresponds to the travel mileage of the truck of type 1, and similarly, the truck of type 2 is coded as
Type 3 truck coded &>
。
Constructing a plan generating topological graph, wherein the plan generating topological graph comprises a plurality of same network layers
Each network layer comprises subunits with the same number as the trucks, each subunit is correspondingly associated with a code and is defined to be positioned in the network layer->
The sub-unit in (1) is a first sub-unit and is positioned at the network layer>
The sub-units in the system are second sub-units, each first sub-unit and each second sub-unit are connected with each other, each second sub-unit comprises a plurality of first combination codes, the first combination codes are codes contained in the second sub-units and code combination results contained in the first sub-units connected with the second sub-units, when the codes are combined, numbers in the first areas of the two codes are reserved in series, numbers in the second areas are added, and numbers stored in the sub-areas corresponding to the third areas are added;
as shown in FIG. 2, the scenario-generated topology includes three network layers
Each network layer comprises 3 first subunits, second subunits and third subunits respectively, wherein the first subunit 1, the second subunit 1 and the third subunit 1 store codes
The first subunit 2, the second subunit 2 and the third subunit 2 store a code/decision unit>
The first subunit 3, the second subunit 3 and the third subunit 3 store the code +>
If the network layer is on or off>
The first subunit 1 and the network layer->
In the second subunit 1, the network layer->
The second subunit 1 in turn is in conjunction with the network layer->
The third subunit 2 is connected, and represents that the transportation scheme is generated by firstly using the type 1 truck for transportation, then using the type 1 truck for transportation, and finally using the type 2 truck for transportation.
At the network layer
The first subunit 1 and the network layer->
After the second subunit 1 is connected, the network layer->
The coding of the sub-first unit 1 is combined into the network layer &>
In the second subunit 1, the merged network layer is then merged>
The second subunit 1 stores an encoding of ^ greater than>
The merged codes show that two trucks of type 1 are required to continuously transport, the scheme can transport 40 tons of grains at present, and the total transport mileage of the truck using type 1 is 800km; it should be noted that in fig. 2 the network layer @>
The second subunit 1 is in each case connected to a network layer->
The first subunit 1, 2, 3 is connected, so that the network layer->
Three merged codes are stored in the second subunit 1.
The definition is located at the network layer
The sub-units in the system are third sub-units, each second sub-unit and each third sub-unit are connected with each other, each third sub-unit comprises a plurality of second merging codes, if the numerical value of a second merging code second area is larger than or equal to a second residual quantity after merging, backward propagation of the second merging codes is stopped, and the second merging codes are output as scheme codes.
With continued reference to FIG. 2, if a total of 40 tons of grain need to be transported, the network layer
First subunit 1 and network layer
The scheme generated by the second subunit 1 after coding and merging completes the transportation of all the grains, so that the second merged code is output and is not transmitted backwards. The transportation scheme is generated in a mode of generating the topological graph through the scheme, not only can the transportation combination schemes of all trucks be traversed, but also the codes are set and stored in the subunits to be combined, so that the transportation scheme can be quickly determined according to the codes output by the topological graph, finally, in each output transportation scheme, the scheme which can finish grain transportation before the planned completion time is screened, and then the scheme with the minimum transportation cost is selected as the final scheme.
For example, the output scheme is encoded as
If the loading time of each truck is 60 minutes, the next truck can be loaded after the current truck is loaded and sent out, then 8 trucks can be loaded and transported in the grain production base every day according to the working time of 8 hours every day, the trucks of types 1, 2, 3 and 2 are sent on the first day, and the trucks of types 3, 2 and 1 are sent on the second day.
In this embodiment, after the scheme code is output, the type and the number of the road transport vehicles participating in the scheme are determined based on the following steps, the number of occurrences of each number in the first region of the scheme code is obtained, the type and the corresponding number of the road transport vehicles participating in the scheme code are determined based on the number and the number of occurrences, after the determination is completed, the number which repeatedly occurs at least twice in the scheme code is screened, the minimum interval between the repeated numbers is located, other numbers located in the minimum interval are obtained, and the critical time is calculated based on a first formula:
wherein is present>
Is the number of other numbers in the minimum interval>
For a preset truck loading time, if the threshold time is greater than the preset work time, the planned number of hires for that truck is reduced to 1.
If the output scheme is coded as
It can be seen from the output codes that the minimum interval between two trucks of type 1 is 9 numbers, and then the critical time calculated by substituting the second formula is 9 hours, which is greater than or equal to the preset 8-hour working time, which indicates that in the scheme, a truck of the second type 1 cannot be delivered on the same day, that is, only one truck of type 1 is needed to meet the requirement of the scheme in the actual transportation; and e.g. the output scheme is coded as
The two trucks of the type 1 are separated by 3 numbers at minimum, the trucks are dispatched within 3 hours, 4 hours are needed for the trucks to return to the grain production base from the departure position to the destination position, when the second truck of the type 1 needs to be loaded and dispatched, the first truck of the type 1 does not return, and at the moment, the two trucks of the type 1 are needed to participate in transportation to meet the requirement of the scheme.
In this embodiment, calculating the cost of the road transportation scheme includes the steps of obtaining the employment cost of each type of truck, and calculating the transportation cost of the road transportation scheme based on a second formula:
wherein is present>
As a type->
Fee hiring of truck,. Based on the fee, or on the fee>
For the number of hires of the corresponding type of truck, be>
Based on the running cost of the truck and the running cost of the truck>
Obtained by a third formula:
wherein is present>
Is type->
Cost per kilometer trip for a truck->
Is type->
The distance traveled by the truck.
E.g. the output scheme is coded as
Then using two trucks of type 1, two trucks of type 2, and 1 truck of type 3, the total hiring cost of the trucks can be obtained after the hiring cost of each truck is obtained; taking the above coding as an example again, 3 types of trucks respectively run for 800km, 800km and 400km, then the total running cost can be obtained after the travel cost per kilometer of each type of truck is obtained, and the hiring cost and the total running cost are added to obtain the final cost.
Before the road transportation scheme is established, the road transportation also has a driving time limit for a driver, for example, when a truck needs at least 9 hours to arrive at a grain storage base from a grain production base, the driver needs to travel for 4 hours, rest for 20 minutes, then travel for 4 hours, rest for 20 minutes, and travel for 1 hour to arrive, however, the accumulated driving within 24 hours exceeds 8 hours, so that the driver cannot deliver grains on the same day, which greatly delays the grain transportation efficiency. In order to solve the problem, the invention provides the following method:
setting an average traveling speed of trucks participating in road transportation, calculating total traveling time of the trucks based on the average traveling speed and the shortest road transportation path, setting first traveling limit time and second traveling limit time, wherein the first traveling limit time is the accumulated traveling limit time of the trucks within 24 hours, the second traveling limit time is the continuous traveling time limit time of the trucks, and if the total traveling time of the trucks is greater than the first traveling limit time, a transfer point is set between a grain storage base and a grain production base, the number of the transfer points determines the distance based on a fourth formula, and the fourth formula is as follows:
wherein is present>
For the total travel time of the truck>
For a second travel limit time, ->
Is a floor function;
in this embodiment, based on the average traveling speed of the truck and the distance between the two bases, it can be obtained how long the truck travels continuously before reaching the grain storage base from the grain production base, for example, the distance between the two bases is 900 km, the average traveling speed of the truck is 90km/h, and the truck needs to travel continuously for 9 hours before completing the grain transportation; further, in this embodiment, the first travel limit time is set to 8 hours, the second travel limit time is set to 4 hours, and then the truck cannot finish transporting the grains between two places within 24 hours, in this case, the number of the transit points required to be set is calculated based on the first formula, and the above data is substituted into the data of the first formula
Two transit points are set between the two bases.
And taking the grain production base as a starting point, setting transfer points at the positions of the second travel limit time distance traveled by the trucks every other, dividing the trucks participating in transportation into an initial truck and a transfer truck, enabling the transfer truck to go to the transfer points for standby, transferring the grains loaded by the initial truck into the transfer truck after the initial truck reaches the transfer points, and transporting the grains to the next transfer point by the transfer truck from the transfer points.
In the embodiment, a grain production base is taken as a starting point, a transit point is arranged at the position of a 4-hour distance traveled by a truck, meanwhile, a loading and unloading device is arranged in the transit point, the loading and unloading device needs 20 minutes for transferring grains loaded by an initial truck into a transit truck, then after the initial truck reaches the transit point, the grains loaded by the initial truck are transferred into the transit truck, and the transit truck has no travel limit, so that the grain can be transported from the transit point to the next transit point in the same day by the transit; in addition, the transfer process needs 20 minutes, so that a driver of the starting truck can rest for 20 minutes, and after the transfer is finished, the starting truck can return to the grain production base for next loading, so that the driver can directly start from the grain production base after resting to a state that the first driving limiting condition is not met. If the transit point is set every 8 hours, the truck cannot turn back after reaching the transit point, and cannot be transported after turning back the truck the next day, so that the transportation efficiency is influenced, and the transportation time can be greatly shortened by setting the transit point every 4 hours.
Furthermore, if a transit point exists between the grain production base and the grain storage base, when a transportation scheme is generated, the transportation scheme is not generated on the basis of the overall path, but divided into a plurality of subintervals, wherein the subintervals comprise the grain production base and the transit point interval, the transit point and the transit point interval, and the transit point and the grain storage base interval; generating a transportation sub-scheme of each interval through a scheme generation topological graph, then, during screening, firstly, calculating transportation time allocated to each interval according to plan completion time and the number of intervals, screening schemes meeting conditions from the sub-schemes based on the transportation time of the intervals, finally, adding the transportation costs of the screened sub-schemes, and selecting a sub-scheme combination with the minimum cost as a final transportation scheme.
The invention also provides a logistics combined supply system of the grain base, which is used for realizing the logistics combined supply method of the grain base, and mainly comprises the following steps:
the input module is used for inputting geographic information and task information, the geographic information comprises address information of a grain storage base and address information of a grain production base, and the task information comprises grain warehousing quantity required by the grain storage base and planned completion time for completing the grain warehousing quantity;
the system comprises a first module, a second module and a third module, wherein the first module is used for acquiring port freight shift information provided by a port, the port freight shift information comprises transport shifts and the carrying capacity of each transport shift, a first supply quantity is calculated based on the port freight shift information, the first supply quantity is grain transport quantity finished by the port before planned finishing time, if the first supply quantity is larger than or equal to grain warehousing quantity, the transport of all grains is finished by the port, and if the first supply quantity is smaller than the grain warehousing quantity, a first difference value between the grain warehousing quantity and the first supply quantity is calculated, and the first difference value is defined as a first residual quantity;
the second module is used for acquiring a road transportation distance between the grain storage base and the grain production base, acquiring railway freight shift information of a city where the grain storage base is located and a city where the grain production base is located if the road transportation distance is greater than or equal to a preset critical distance, calculating a second supply quantity based on the railway freight shift information, completing transportation of all first surplus grains through a railway if the second supply quantity is greater than or equal to a first surplus, calculating a second difference value between the second supply quantity and the first surplus if the second supply quantity is smaller than the first surplus, and defining the second difference value as the second surplus;
and the road transportation scheme generation module is used for obtaining the shortest road transportation path based on the grain storage base address and the grain production base address, generating a plurality of road transportation schemes based on the shortest road transportation path, and selecting a scheme which finishes the second residual transportation before the planned completion time and has the lowest transportation cost as a final transportation scheme.
The invention also provides a computer storage medium, wherein the computer storage medium stores program instructions, and the logistics combined supply method of the grain base is characterized in that when the program instructions run, the equipment where the computer storage medium is located is controlled.
It should be understood that, although the steps in the flowcharts of the embodiments of the present invention are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in various embodiments may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the program is executed. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), rambus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent should be subject to the appended claims.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included therein.
Claims (7)
1. A combined logistics supply method for a grain base is characterized by comprising the following steps:
step S1: acquiring geographic information and task information, wherein the geographic information comprises address information of a grain storage base and address information of a grain production base, and the task information comprises grain warehousing quantity required by the grain storage base and planned completion time for completing the grain warehousing quantity;
step S2: if the grain storage base and the grain production base are located in cities, a port freight shift information is obtained, the port freight shift information comprises transport shifts and the carrying capacity of each transport shift, a first supply quantity is calculated based on the port freight shift information, the first supply quantity is the grain transport quantity finished by the port before the planned finishing time, if the first supply quantity is larger than or equal to the grain warehousing quantity, the transport of all grains is finished by the port, if the first supply quantity is smaller than the grain warehousing quantity, a first difference value between the grain warehousing quantity and the first supply quantity is calculated, and the first difference value is defined as a first residual quantity;
and step S3: acquiring a road transportation distance between a grain storage base and a grain production base, if the road transportation distance is greater than or equal to a preset critical distance, acquiring railway freight shift information of a city where the grain storage base is located and a city where the grain production base is located, calculating a second supply quantity based on the railway freight shift information, if the second supply quantity is greater than or equal to the first residual quantity, completing transportation of all the first residual quantity of grains through a railway, and if the second supply quantity is less than the first residual quantity, calculating a second difference value between the second supply quantity and the first residual quantity, and defining the second difference value as a second residual quantity;
and step S4: and obtaining a shortest road transportation path based on the address of the grain storage base and the address of the grain production base, generating a plurality of road transportation schemes based on the shortest road transportation path, and selecting a scheme which finishes the second residual transportation before the planned completion time and has the minimum transportation cost as a final transportation scheme.
2. The method as claimed in claim 1, wherein the step of generating a road transportation plan for the grain storage site and the grain production site comprises the steps of:
acquiring a list of trucks participating in road transportation, and coding each truck based on the list of trucks, wherein the coding comprises a first area, a second area and a third area, the number of the first area represents the type of the truck, the number of the second area represents the rated cargo capacity of the truck, the third area comprises a plurality of sub-areas, and the number of each sub-area corresponds to the transportation mileage of the trucks of different types;
constructing a schema to generate a topology graph, the schema to generate the topology graph comprising a plurality of identical network layers
Each network layer comprises subunits with the same number as the trucks, each subunit is correspondingly associated with one code and is defined to be positioned in the network layer->
The sub-unit in (1) is a first sub-unit and is positioned at the network layer>
Each of the first subunits and each of the second subunits are connected to each other, each of the second subunits includes a plurality of first merging codes, and the first merging codes are codes included in the second subunits and codes included in the first subunits connected to the second subunitsWhen the codes are combined, the numbers in the first area of the two codes are reserved in series, the numbers in the second area are added, and the numbers stored in the sub-area corresponding to the third area are added;
definition at the network layer
The sub-units in the system are third sub-units, each second sub-unit and each third sub-unit are connected with each other, each third sub-unit comprises a plurality of second merging codes, if the numerical value of a second region of the second merging codes is larger than or equal to the second residual quantity after merging, backward propagation of the second merging codes is stopped, and the second merging codes are used as scheme codes to be output.
3. The method as claimed in claim 2, wherein after the plan code is output, the type and number of road transport trucks involved in the plan are determined based on the following steps:
obtaining the occurrence frequency of each digit in a first area of the scheme code, determining the type and the corresponding number of the road transport trucks based on the digits and the occurrence frequency of the digits, screening the digits which repeatedly appear at least twice in the scheme code after the determination is finished, positioning the minimum interval between the repeated digits, obtaining other digits in the minimum interval, and calculating the critical time based on a first formula, wherein the first formula is as follows:
in which>
For the number of other numbers in the minimum interval>
And if the critical time is larger than the preset working time, reducing the planned employment number of the truck to 1 for the preset truck loading time.
4. The method as claimed in claim 3, wherein the calculating the cost of the road transportation scheme comprises the steps of:
obtaining the employment cost of each type of truck, and calculating the transportation cost of the road transportation scheme based on a second formula, wherein the second formula is as follows:
wherein is present>
Is type->
The fee for the hiring of the truck,
for the number of hires of the corresponding type of truck, be>
Based on the freight train driving cost, the freight train driving cost->
Obtained by a third formula: />
Wherein is present>
As a type->
Cost per kilometer travel of a truck->
Is type->
The distance traveled by the truck.
5. The method as claimed in claim 1, further comprising the following steps before the step S4 of generating the road transportation scheme:
setting an average traveling speed of a truck participating in road transportation, calculating a total traveling time of the truck based on the average traveling speed and the shortest road transportation path, and setting a first traveling limit time and a second traveling limit time, wherein the first traveling limit time is an accumulated traveling limit time of the truck within 24 hours, the second traveling limit time is a continuous traveling time limit time of the truck, if the total traveling time of the truck is greater than the first traveling limit time, a transit point is set between a grain storage base and a grain production base, the number of the transit points determines a distance based on a fourth formula, and the fourth formula is as follows:
wherein is present>
For the total travel time of the truck, is>
For the second travel limit time->
Is a rounded down function;
and setting the transit points at the positions of the second travel limit time distance of the trucks by taking a grain production base as a starting point, dividing the trucks participating in transportation into an initial truck and a transit truck, enabling the transit truck to go to the transit points for standby, transferring grains loaded by the initial truck into the transit points after the initial truck reaches the transit points, and transporting the grains to the next transit point by the transit truck.
6. A combined logistics supply system of a grain base for realizing the combined logistics supply method of the grain base according to any one of claims 1-5, characterized by comprising:
the input module is used for inputting geographic information and task information, the geographic information comprises address information of a grain storage base and address information of a grain production base, and the task information comprises grain warehousing quantity required by the grain storage base and planning completion time for completing the grain warehousing quantity;
a first module, configured to obtain port freight shift information provided by a port, where the port freight shift information includes transport shifts and a carrying capacity of each transport shift, calculate a first supply amount based on the port freight shift information, where the first supply amount is a grain transport amount completed by the port before the planned completion time, complete transport of all grains by the port if the first supply amount is greater than or equal to a grain warehousing amount, and calculate a first difference between the grain warehousing amount and the first supply amount if the first supply amount is less than the grain warehousing amount, and define the first difference as a first remaining amount;
the second module is used for acquiring a road transportation distance between the grain storage base and the grain production base, acquiring railway freight shift information of a city where the grain storage base is located and a city where the grain production base is located if the road transportation distance is greater than or equal to a preset critical distance, calculating a second supply quantity based on the railway freight shift information, completing transportation of all the first surplus grains through a railway if the second supply quantity is greater than or equal to the first surplus, calculating a second difference value between the second supply quantity and the first surplus if the second supply quantity is smaller than the first surplus, and defining the second difference value as the second surplus;
and the road transportation scheme generation module is used for obtaining a shortest road transportation path based on the address of the grain storage base and the address of the grain production base, generating a plurality of road transportation schemes based on the shortest road transportation path, and selecting a scheme which finishes the second residual transportation before the planned completion time and has the lowest transportation cost as a final transportation scheme.
7. A computer storage medium storing program instructions, wherein the program instructions, when executed, control a device in the computer storage medium to perform the method of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310259091.XA CN115983756B (en) | 2023-03-17 | 2023-03-17 | Logistics combined supply method, system and storage medium for grain base |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310259091.XA CN115983756B (en) | 2023-03-17 | 2023-03-17 | Logistics combined supply method, system and storage medium for grain base |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115983756A true CN115983756A (en) | 2023-04-18 |
| CN115983756B CN115983756B (en) | 2023-06-23 |
Family
ID=85972496
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310259091.XA Active CN115983756B (en) | 2023-03-17 | 2023-03-17 | Logistics combined supply method, system and storage medium for grain base |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115983756B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116542476A (en) * | 2023-05-09 | 2023-08-04 | 重庆赛迪奇智人工智能科技有限公司 | Scheduling method, device, equipment and storage medium of molten iron transport vehicle |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109740829A (en) * | 2019-03-08 | 2019-05-10 | 武汉轻工大学 | Foodstuff transportation method, equipment, storage medium and device based on ant group algorithm |
| US20210256646A1 (en) * | 2020-02-14 | 2021-08-19 | Cj Logistics Corporation | Diversified and connected freight allocation system and method |
| CN114894210A (en) * | 2022-05-13 | 2022-08-12 | 卡奥斯工业智能研究院(青岛)有限公司 | Logistics vehicle path planning method, device, equipment and storage medium |
| CN115049111A (en) * | 2022-05-26 | 2022-09-13 | 四川省交通运输发展战略和规划科学研究院 | Multi-type intermodal transport path planning method, device, equipment and storage medium |
-
2023
- 2023-03-17 CN CN202310259091.XA patent/CN115983756B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109740829A (en) * | 2019-03-08 | 2019-05-10 | 武汉轻工大学 | Foodstuff transportation method, equipment, storage medium and device based on ant group algorithm |
| US20210256646A1 (en) * | 2020-02-14 | 2021-08-19 | Cj Logistics Corporation | Diversified and connected freight allocation system and method |
| CN114894210A (en) * | 2022-05-13 | 2022-08-12 | 卡奥斯工业智能研究院(青岛)有限公司 | Logistics vehicle path planning method, device, equipment and storage medium |
| CN115049111A (en) * | 2022-05-26 | 2022-09-13 | 四川省交通运输发展战略和规划科学研究院 | Multi-type intermodal transport path planning method, device, equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116542476A (en) * | 2023-05-09 | 2023-08-04 | 重庆赛迪奇智人工智能科技有限公司 | Scheduling method, device, equipment and storage medium of molten iron transport vehicle |
| CN116542476B (en) * | 2023-05-09 | 2023-11-28 | 重庆赛迪奇智人工智能科技有限公司 | Scheduling method, device, equipment and storage medium of molten iron transport vehicle |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115983756B (en) | 2023-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109034481B (en) | Constraint programming-based vehicle path problem modeling and optimizing method with time window | |
| Tellez et al. | The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity | |
| CN111626577B (en) | Vehicle scheduling method and device | |
| Normasari et al. | A simulated annealing heuristic for the capacitated green vehicle routing problem | |
| Fan et al. | Carsharing: Dynamic decision-making problem for vehicle allocation | |
| CN111191847B (en) | Distribution path planning method and system considering order polymerization degree | |
| Liu et al. | Integrated scheduling of ready-mixed concrete production and delivery | |
| CN115983756A (en) | Logistics combined supply method and system for grain base and storage medium | |
| CN105095985A (en) | Shared vehicle systems and methods | |
| CN109165787B (en) | Bus route customizing method, device and equipment | |
| Zhu et al. | Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands | |
| CN108764804B (en) | Warehouse-free parcel transportation method and device by using taxi | |
| CN113085895B (en) | Vehicle lane change track planning method, device, equipment, storage medium and vehicle | |
| JP2016170594A (en) | Demand prediction device, demand prediction method, demand prediction program and demand management system | |
| CN116307306B (en) | Intelligent scheduling method, device, equipment and storage medium based on big data | |
| Royo et al. | Solving a longdistance routing problem using ant colony optimization | |
| Rabe et al. | Evaluating the consolidation of distribution flows using a discrete event supply chain simulation tool: Application to a case study in Greece | |
| Terelius et al. | An efficiency measure for road transportation networks with application to two case studies | |
| Boysen et al. | Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person | |
| CN109376954B (en) | Concrete tank truck quantity optimization model calculation method and computer readable medium | |
| CN116579564A (en) | Regional reconnaissance task planning method, device, computer equipment and medium | |
| Zhao | Optimal Fixed Route for Multimodal Transportation of Vehicle Logistics in Context of Soft Time Windows | |
| CN108921353A (en) | A kind of optimization method, device and the electronic equipment of parking lot dispatching | |
| CN114537478B (en) | Train docking control method and device and computer readable storage medium | |
| CN115081666A (en) | Method, device, computer equipment and storage medium for determining transportation path |
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 |