CN110472874B

CN110472874B - Block chain-based drop-hang scheduling method and system and scheduling center node

Info

Publication number: CN110472874B
Application number: CN201910760912.1A
Authority: CN
Inventors: 王敏慧; 赵婷; 王瑞; 程健; 何一博
Original assignee: Shanghai Tiandihui Supply Chain Technology Co ltd
Current assignee: Shanghai Tiandihui Supply Chain Technology Co ltd
Priority date: 2019-08-16
Filing date: 2019-08-16
Publication date: 2021-11-02
Anticipated expiration: 2039-08-16
Also published as: CN110472874A

Abstract

The invention discloses a block chain-based swing and hang scheduling method and system and a scheduling center node, and relates to the field of swing and hang scheduling. The block chain-based drop-hang scheduling method comprises the following steps: the sequencing node receives the collected service data and the Internet of things data; the sequencing node writes the received service data and the received Internet of things data into a block after sequencing according to time, and stores the data into a block chain network; and the dispatching center node dispatches the hanging heads to transport the corresponding hanging boxes according to the business data and the Internet of things data on the corresponding block chain account book. The dispatching center node of the invention obtains real-time and accurate various information according to the characteristics of sharing and non-tampering of the block chain network information, ensures the accuracy of intelligent dispatching, saves a large amount of labor cost and improves the logistics transportation efficiency.

Description

Block chain-based drop-hang scheduling method and system and scheduling center node

Technical Field

The invention relates to the field of drop and hang scheduling, in particular to a drop and hang scheduling method and system based on a block chain and a scheduling center node.

Background

At present, the domestic logistics transportation industry is developed vigorously, the main logistics transportation is very much, and the participation of freight transportation is very much, including: shippers, carriers, shipping platforms, vehicles for shipment, and the like.

The existing vehicle scheduling of the trunk logistics transportation is generally implemented according to the operation information of each participant, and the operation information includes: goods related information, vehicle related information and the like, but based on long transportation chains, the accuracy of information is not high, the participants can not communicate with each other in time, and the problem of tampering historical operation information often exists, manual intervention processing is often needed, and intelligent dispatching of the whole flow of trunk transportation can not be realized.

Disclosure of Invention

The invention aims to provide a block chain-based swing and hang scheduling method, a block chain-based swing and hang scheduling system and a scheduling center node, which solve the problems that the scheduling needs manual intervention and full intellectualization cannot be realized due to the fact that the number of participants is too large, the accuracy of information cannot be guaranteed, the information can not be communicated in time and the like in the trunk logistics transportation industry.

The technical scheme provided by the invention is as follows:

a throwing and hanging scheduling method based on a block chain is applied to a block chain network comprising a scheduling center node and a sequencing node; the drop and hang scheduling method comprises the following steps: the sequencing node receives the collected service data and the Internet of things data; the sequencing node writes the received service data and the received Internet of things data into a block after sequencing according to time, and stores the data into a block chain network; and the dispatching center node dispatches the hanging heads to transport the corresponding hanging boxes according to the business data and the Internet of things data on the corresponding block chain account book.

In the technical scheme, the scheduling center node obtains various real-time and accurate information according to the characteristics of sharing and non-tampering of the block chain network information, the accuracy of intelligent scheduling is guaranteed, a large amount of labor cost is saved, and the logistics transportation efficiency is improved.

Further, the dispatching center node dispatches the hanging head to transport the corresponding hanging box according to the business data and the internet of things data on the corresponding block chain account book, and the dispatching center node comprises: the scheduling center node obtains the information of the hanging boxes to be transported in the service data, wherein the information of the hanging boxes comprises: initial position information of the hanging box and destination information of the hanging box; the dispatching center node determines an idle hanging head carried between the initial hanging box position information and the hanging box destination information according to the hanging head information and the waybill information in the service data; and the dispatching center node dispatches an idle hanging head closest to the initial hanging box position information to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information in the Internet of things data.

In the technical scheme, the idle hanging head closest to the initial position information of the hanging box is scheduled, and due to the close distance, the time spent on the road is theoretically shortest, so that the logistics transportation efficiency can be improved.

Further, the step that the scheduling center node schedules the idle hanging head closest to the initial hanging box position information to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information in the data of the internet of things further comprises the following steps: and the dispatching center node dispatches an idle hanging head which is closest to the initial hanging box position information and has a residence time longer than a preset residence time to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information in the Internet of things data.

In the technical scheme, the arrangement of the preset stay time can ensure that the hanging head has enough rest time and a driver has corresponding rest, thereby avoiding the harm caused by fatigue driving.

Further, the dispatching center node dispatches the hanging head to transport the corresponding hanging box according to the business data and the internet of things data on the corresponding block chain account book, and the dispatching center node comprises: the scheduling center node obtains the information of the hanging boxes to be transported in the service data, wherein the information of the hanging boxes comprises: initial position information of the hung box, destination information of the hung box and minimum staying time of the hung box; the dispatching center node calculates reference time for each hanging head carried between the initial hanging box position information and the hanging box destination information to reach the initial hanging box position information according to the hanging head position information in the Internet of things data and the hanging head information and the freight note information in the service data; and the dispatching center node dispatches the hanging head with the minimum time difference to transport the hanging box corresponding to the hanging box information to be transported according to the minimum staying time of the hanging boxes and the calculated reference time of each hanging head.

In the technical scheme, the dispatching center node considers the transportation and idle conditions when dispatching the hanging heads, and also considers the minimum residence time of the hanging boxes when estimating the time difference, so that the hanging heads with the minimum dispatching waiting time can transport the corresponding hanging boxes from multiple aspects, and the transportation efficiency is improved.

Further, the step of calculating, by the dispatch center node, reference time for each hanger carried between the initial position information of the container hanging and the destination information of the container hanging to reach the initial position information of the container hanging according to the hanger position information in the internet of things data and the hanger information and the waybill information in the service data includes: the scheduling center node calculates the time lead of each hanging head carried between the initial position information of the hanging box and the destination information of the hanging box according to the hanging head position information in the data of the Internet of things, the hanging head information in the service data and the freight note information; and calculating the reference time of each hanging head reaching the initial position information of the hanging box according to the time lead of each hanging head.

In the technical scheme, the time lead is considered when calculating the participation time, so that the participation time has more reference value, and the scheduling precision is improved.

Further, still include: when the hanging head conveys the hanging box according to the hanging box destination information, the dispatching center node calculates at least one unilateral conveying line and the corresponding unilateral operation time effect thereof according to the business data, the Internet of things data and the map data on the corresponding block chain book; and the dispatching center node recommends the unilateral transportation line with the highest unilateral running timeliness to the driver corresponding to the hanging head.

In the technical scheme, the driver corresponding to the dispatched hanging head is recommended to the unilateral transportation line with the highest unilateral running timeliness, so that the unilateral transportation line can be transported according to the line, and the logistics transportation efficiency is improved.

Further, still include: and the dispatching center node monitors the states of each hanging head and each hanging box according to the Internet of things data on the corresponding block chain account book, and sends out warning information when abnormality occurs.

In the technical scheme, the data of the Internet of things comprises various data of the hanging head and the hanging box, and the data can be monitored, and if the data is abnormal, a warning is timely sent out, so that a driver or related personnel can handle the data, and accidents or inconvenience are prevented.

The invention also provides a dispatching center node, which is applied to the block chain network comprising the dispatching center node and the sequencing node; the block chain account book corresponding to each node stores collected service data and Internet of things data which are sorted according to time; and the adjusting center node is used for scheduling hanging heads to transport corresponding hanging boxes according to the business data and the Internet of things data on the corresponding block chain account book.

Further, the scheduling center node includes: an information obtaining module, configured to obtain information of a to-be-transported hanging box in the service data, where the information of the hanging box includes: initial position information of the hanging box and destination information of the hanging box; the hanging head confirming module is used for determining an idle hanging head carried between the initial hanging box position information and the hanging box destination information according to the hanging head information and the waybill information in the service data; and the hanging head scheduling module is used for scheduling an idle hanging head closest to the initial hanging box position information to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information in the Internet of things data.

The invention also provides a block chain-based swing-hang scheduling system, which comprises a block chain network of any one of the scheduling center nodes and the sequencing nodes; the sequencing node is used for receiving the collected service data and the data of the Internet of things; and after the received service data and the received data of the Internet of things are sorted according to time, writing the data into a block, and storing the data into a block chain network.

Compared with the prior art, the block chain-based swing-hang scheduling method and system and the scheduling center node have the beneficial effects that:

according to the invention, the dispatching center node obtains real-time and accurate various information according to the characteristics of sharing and non-tampering of the block chain network information of the Internet of things collection uplink, so that the accuracy of intelligent dispatching is ensured, a large amount of labor cost is saved, and the logistics transportation efficiency is improved.

Drawings

The foregoing features, technical features, advantages and implementations of a block chain based drop and drop scheduling method and system, a scheduling center node will be described in detail below with reference to the accompanying drawings.

Fig. 1 is a flowchart of an embodiment of a block chain-based drop-and-hang scheduling method according to the present invention;

FIG. 2 is a flow diagram for one embodiment of S103 of FIG. 1;

FIG. 3 is a flow diagram of a variation of the embodiment of FIG. 1;

fig. 4 is a flowchart of another embodiment of a block chain-based drop scheduling method according to the present invention;

FIG. 5 is a schematic structural diagram of an embodiment of a scheduling center node of the present invention;

FIG. 6 is a schematic structural diagram of another embodiment of a scheduling center node of the present invention;

fig. 7 is a schematic structural diagram of an embodiment of a block chain-based drop-off scheduling system according to the present invention.

Detailed Description

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following description will be made with reference to the accompanying drawings. It is obvious that the drawings in the following description are only some examples of the invention, and that for a person skilled in the art, other drawings and embodiments can be derived from them without inventive effort.

For the sake of simplicity, the drawings only schematically show the parts relevant to the present invention, and they do not represent the actual structure as a product. In addition, in order to make the drawings concise and understandable, components having the same structure or function in some of the drawings are only schematically illustrated or only labeled. In this document, "one" means not only "only one" but also a case of "more than one".

First, to better understand the present solution, terms that may be involved in the following embodiments are explained as follows:

the logistics transportation node refers to the node that each logistics participant corresponds, and the logistics participant includes: shippers, carriers, shipping platforms, and the like.

The cargo owner refers to an enterprise or an individual who issues a cargo source demand by using a network platform of a freight enterprise, and can set a corresponding number of logistics transportation nodes according to the traffic volume, for example: a (enterprise) cargo owner-a logistics transportation node; a special logistics transportation node corresponds to all the individual owners of goods and the like.

The carrier, a carrier enterprise or an independent carrier driver, is responsible for the transportation and carrying of the actual business. A corresponding number of logistics transportation nodes can be set according to the traffic volume, for example: one (enterprise) carrier and one logistics transportation node, wherein one logistics transportation node is specially deployed to manage all independent carrier drivers.

The freight platform, also called network freight operator (policy agreement), develops the platform-type enterprise for carrying, has independent network platform (TMS, web end, app, small program, etc.) to develop the on-line business, and is responsible for docking the upstream and downstream of the transportation. Optionally, one freight platform corresponds to one logistics transportation node.

According to the block chain-based throwing and hanging scheduling method and system, the block chain technology is utilized to store the related information among all logistics participants to the block chain network, so that the stored information cannot be randomly tampered and can be shared in real time, the scheduling center node can carry out throwing and hanging scheduling according to real-time and accurate information, and the logistics efficiency is improved.

Fig. 1 shows an embodiment of a block chain-based drop-and-hang scheduling method of the present invention, which is applied to a block chain network including a scheduling center node and a sequencing node. The method comprises the following steps:

s101, the sequencing node receives the collected service data and the Internet of things data.

Specifically, the business data refers to data related to logistics, including but not limited to: information flow, fund flow, bill flow. The throwing scheduling method mainly relates to the application of information flow.

Information streams include, but are not limited to: waybill information, owner information, driver information, head-on information, operational information (e.g., pick-up, cancel, release order), etc. And the waybill information can be updated in real time according to the operation information.

The business data can be collected by each logistics transportation node and then sent to the sequencing node. If the method is adopted, the area chain network further comprises the following steps: a plurality of logistics transportation nodes.

Internet of things data includes but is not limited to: hanging head position information, hanging box position information, oil tank information, intelligent lock information, tire pressure information, hanging box load information, RFID information and the like.

The data of the internet of things is obtained by installing the sensors at corresponding positions, and the information is explained in detail as follows:

the position information of the hanging head, the positioning sensor is installed on the hanging head to obtain, for example: GPS (Global Positioning System). The hanging head is the locomotive, can pull on behind the hanging box, transports the hanging box to the destination, for example: the headstock of a container truck.

Hang case positional information, install positioning sensor in hanging the case and acquire, for example: and (6) GPS. Hanging a box is a container filled with goods, for example: the container behind the container truck.

The oil tank information indicates the oil quantity information in the oil tank, and the central control system of the hanging head can upload the information.

The intelligent lock information refers to hanging heads and/or intelligent locks used on the intelligent locks, and corresponding states of opening, closing, damage and the like are uploaded.

The tire pressure information is the pressure information of each tire obtained by the tire pressure sensor.

And the weight information of the hanging boxes can be uploaded in real time by installing corresponding weight measuring sensors in each hanging box.

The RFID (Radio Frequency Identification) information, namely the RFID is arranged on the hanging head and/or the hanging box, and when the RFID enters a specific place (such as a logistics park), the RFID can be identified, so that the position of the hanging head and/or the hanging box can be determined.

The Internet of things data can be acquired by opening up corresponding application interfaces on one or a plurality of logistics transportation nodes, corresponding Internet of things nodes can be set independently, the Internet of things data is managed in a unified mode and sent to the sequencing nodes, and the Internet of things data is determined according to actual application conditions.

S102, the sequencing node sequences the received service data and the Internet of things data according to time, writes the data into a block, and stores the data into a block chain network.

Specifically, the sequencing node integrates the acquired service data and the internet of things data together, and during integration, the service data and the internet of things data can be integrated separately, or the service data and the internet of things data can be integrated uniformly, and are selected according to actual requirements, which is not limited herein.

After integration, sorting may be performed according to the chronological order of information acquisition. When the obtained time sequence is the same, the sorting can be carried out according to factors such as order numbers, data types and the like, and the sorting rule of the next step is selected according to actual conditions.

After the sorting node finishes sorting, a block is created and written into the block according to the sorted data, and the block is stored in the block chain network. The actual operation steps stored in the blockchain network are as follows: and the sequencing node broadcasts to other nodes, and after verification, other nodes update the block chain accounts corresponding to the other nodes, so that the information stored in the block chain accounts corresponding to each node is the same.

Optionally, the rule when the sorting node generates a new block is to satisfy any one of the following:

1. according to the information storage capacity limit of one block. For example: assuming that the information storage capacity of one block is 500k at most, when one block is full, one block needs to be regenerated.

2. According to the number of pieces of information in one block. For another example: assuming that the number of pieces of information stored in one block is 100 at most, when the number of pieces of information stored in one block reaches 100, one block needs to be regenerated.

3. The generation time interval of each block. For another example: assuming that the generation time interval of each tile is 5 minutes, a new tile is generated every 5 minutes.

And S103, the dispatching center node dispatches the hanging head to transport the corresponding hanging box according to the corresponding business data on the block chain account book and the data of the Internet of things.

Specifically, based on the characteristic that the block chain technology cannot be tampered with, the accuracy and the real-time performance of each business data and the internet of things data on the block chain account book corresponding to the scheduling center node are guaranteed, and therefore the reasonability of head hanging and box hanging scheduling is guaranteed.

In this embodiment, as shown in fig. 2, the step of S103 scheduling, by the scheduling center node, to transport the corresponding hanging box according to the business data on the block chain account book and the data scheduling head of the internet of things includes:

s113, the scheduling center node acquires the information of the hanging box to be transported in the service data, wherein the information of the hanging box comprises: information of initial position of hanging box and information of destination of hanging box.

Specifically, the logistics transportation node of the freight platform stores the volume of the goods delivered by the order as a part of the service data in the block chain network, so that the adjustment center node can know accurate information of the container hanging to be transported.

Optionally, the hanging box information further comprises: cargo information, such as: cargo weight, cargo type, volume to dispatch the corresponding hanghead.

As an embodiment, the amount of goods that are ordered under the freight platform is directly calculated/represented in a case-hanging manner. For example: the freight platform issues the bubble surface of 1 hanging box for single delivery under the shipper A from Nanjing to Hangzhou, so that 1 hanging box information to be transported is generated.

As another embodiment, the goods for single delivery under the shipping platform are calculated/represented by the goods themselves, and if so, the corresponding quantity of the hanging boxes needs to be converted according to the quantity of the goods themselves and the volume of the goods, so as to obtain accurate information of the hanging boxes to be transported.

For example: the shipper B sends 1 ton of paper towels for shipment from shanghai to guangzhou, and after conversion, 3 hanging boxes are needed to be filled, so that 3 hanging box information to be transported is generated, and the 3 hanging boxes are all from shanghai to guangzhou.

It should be noted that, in actual trunk logistics, when the route between the starting point and the ending point of the goods for single shipment on the shipping platform is very long and there is no corresponding head of the route for carrying, the goods will be split into a plurality of information for box-hanging to be transported, and scheduling is performed in stages.

For example: the starting point of a cargo is Shanghai, the terminal point is Xinjiang, and no hanging head from Shanghai to Xinjiang is carried, so that the dispatching center node divides the cargo into two sections, from Shanghai to Hubei and from Hubei to Xinjiang, and generates corresponding hanging box information to be transported.

Optionally, when the scheduling center node/the logistics transportation node generates the information of the container to be transported, the corresponding information of the container to be transported is generated according to the information of the delivered goods (weight, type, volume, starting point to end point of the goods).

For example: the information of the goods which are ordered and delivered by the freight platform is as follows: bubble face, 50 cubic meters, 35 tons of weight, Shanghai to Xinjiang, and 2 stages are needed to confirm that the dispatch center node/logistics transportation node needs to hang the case according to goods volume, goods weight, and according to starting point and terminal point information, confirm that 2 stages need be divided, therefore, the case information that the transport of waiting of generating is 4, is respectively: 1. the information A of the hanging box to be transported, the bubble surface, 25 cubic meters and 17.5 tons, and the information from Shanghai (initial position information of the hanging box) to Hubei (destination information of the hanging box); the information B of the hanging box to be transported, the bubble surface, 25 cubic meters and 17.5 tons, and the information from Shanghai (initial position information of the hanging box) to Hubei (destination information of the hanging box); hanging box information C to be transported, bubble surface, 25 cubic meters and 17.5 tons, from Hubei (original hanging box position information) to Xinjiang (destination hanging box information); and the hanging box information D to be transported is bubble surface, 25 cubic meters and 17.5 tons, and the information from Hubei (initial position information of hanging box) to Xinjiang (destination information of hanging box).

The dispatching center node can confirm the position of the hanging box according to the hanging box position information and decide whether to dispatch the corresponding hanging head for transportation.

And the dispatching center node allocates a corresponding hanging head for each to-be-transported hanging box information to transport the hanging box to the corresponding destination.

And S123, the scheduling center node determines an idle head carried between the initial position information of the container hanging and the destination information of the container hanging according to the head hanging information and the waybill information in the service data.

Specifically, the information of the hanging head in the service data is used for confirming the carrying route, that is, whether the hanging head can transport the hanging box corresponding to the information of the hanging box to be transported from the position corresponding to the initial position information of the hanging box to the position corresponding to the destination information of the hanging box is judged.

The waybill information is used for determining whether the head is in transportation, so that an idle head is found out for subsequent scheduling.

The scheduling center node is positioned in the block chain network, and the information on the corresponding block chain account book can be updated in real time along with the information change of each node, so that the idle vehicle head which is found out according to the service data on the block chain account book and is carried between the initial position information of the container hanging and the destination information of the container hanging has the scheduling accuracy.

And S133, the scheduling center node schedules the idle hanging head closest to the initial hanging box position information to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information in the Internet of things data.

Specifically, the information of the position of the hanging head is to confirm the current position of the hanging head. The idle hanging head closest to the initial position information of the hanging box is scheduled, and due to the close distance, the time spent on the road is theoretically shortest, and the logistics transportation efficiency can be improved.

Preferably, S133 further includes: and the dispatching center node dispatches an idle hanging head which is closest to the initial position information of the hanging box and has the stay time longer than the preset stay time according to the hanging head position information in the data of the Internet of things to transport the hanging box corresponding to the hanging box information to be transported.

Specifically, the stay time of the hanging head can be obtained according to the change condition statistics of the hanging head position information. If a head is stopped in a place, the head position information during the stop should be unchanged.

The preset stay time is set by considering that a period of finishing time is needed when the hanging head is transported for a long distance. For example: the traffic rules stipulate that drivers need to rest for at least 20 minutes after driving for 4 hours, so that fatigue driving is avoided. For another example: in order to guarantee the transportation safety of long-distance hanging heads, the maintenance needs to be carried out regularly, and related maintenance time can be set, for example: for 10 minutes. Thus, the preset stay time can be selectively set according to the relevant consideration. For example, the preset residence time is set to 25 minutes, 30 minutes, or the like.

After some idle hanging heads are defined by the dispatching center node, the residence time of each idle hanging head can be determined according to the change condition of the hanging head position information of each idle hanging head in the data of the Internet of things, the idle hanging head with the residence time larger than the preset residence time and the nearest distance to the initial position information of the hanging box is selected, and the hanging box is dispatched to transport the corresponding hanging box.

Optionally, when the position of the hanging head is located, the auxiliary reference can be performed by using the RFID information in addition to the hanging head position information, and in actual application, each goods receiving and unloading place is provided with an RFID identification device which can identify the RFID information on the hanging head and the hanging box, so that the auxiliary reference is given.

The scheduling center node can match the corresponding hanging head for the hanging box corresponding to each hanging box information to be transported according to the scheduling method.

Optionally, as shown in fig. 3, the method for block chain-based drop scheduling further includes:

s104, when the hanging head conveys the hanging boxes according to the hanging box destination information, the dispatching center node calculates at least one unilateral conveying line and the corresponding unilateral operation time effectiveness thereof according to the business data, the Internet of things data and the map data on the corresponding block chain book;

s105, the dispatching center node recommends the unilateral transportation line with the highest unilateral running timeliness to the driver corresponding to the hanging head.

Specifically, the map data includes map route information and real-time traffic information. Corresponding application interfaces can be arranged on one or more logistics transportation nodes (or sequencing nodes) to acquire map data.

The unilateral transportation route is a transportation route from the initial position information of the hanging box to the destination information direction of the hanging box, and can be calculated according to the map route information in the map data.

For example: the initial position information of the hanging box is Shanghai, the destination information of the hanging box is Hangzhou, and 3 unilateral transportation lines from the Shanghai to the Hangzhou can be calculated according to map line information in map data.

The unilateral operation timeliness refers to timeliness calculated according to the kilometer number of a unilateral transportation line and real-time road condition information, and can be represented by time or by means of scoring and the like, and is not limited herein.

For example: the initial position information of the hanging box is Shanghai, the destination information of the hanging box is Hangzhou, and 3 unilateral transportation routes A, B, C from Shanghai to Hangzhou are calculated according to map route information in map data; according to the real-time road condition information, it is found that the unilateral transportation line A needs 2 hours, the unilateral transportation line B needs 2 hours and 15 minutes, and the unilateral transportation line C needs 2 hours and 30 minutes.

If time is adopted to represent the unilateral operation aging, the time is the minimum to represent the unilateral operation aging is the highest.

The unilateral transportation line with the highest unilateral operation timeliness is recommended to the driver corresponding to the dispatched hanging head, so that the driver can transport according to the unilateral transportation line, and the logistics transportation efficiency is improved.

Optionally, the block chain-based drop-and-hang scheduling method further includes: and the dispatching center node monitors the states of each hanging head and each hanging box according to the Internet of things data on the corresponding block chain account book, and sends out warning information when abnormality occurs.

Specifically, the data of the internet of things comprises various data of a hanging head and a hanging box, and the data can be monitored, and if the data is abnormal, a warning is sent in time to be processed by a driver or related personnel, so that accidents or inconvenience is prevented.

For example: if the oil quantity is lower than a certain value according to the information of the oil tank, warning information of oil shortage is sent out, a driver can be timely refueled, and the situation that the driver cannot run without oil on a half road is prevented.

For another example: if the intelligent lock is found to belong to the unlocking state according to the information of the intelligent lock, the warning information of unlocking the intelligent lock is sent, and the driver can timely eliminate the situation of theft.

For another example: if the pressure of a certain tire/some tires of a certain hanging head is/are not in the normal range according to the tire pressure information, the tire pressure abnormity warning information is sent out, a driver can check the tire condition in time, and the tire burst and danger in the driving process are prevented.

For another example: and judging whether the hanging box is overweight or not according to the hanging box load information, judging whether the left weight and the right weight of the hanging box are unbalanced and the like, and sending corresponding warning information. If the weight is overweight and unbalanced, the possibility of car accidents is increased during driving, for example: and the vehicle can not be turned over and braked during turning.

For another example: the position information of the hanging box is found to deviate from the normal transportation line, so that the abnormity is shown, and the warning information can be sent out to check in time.

In the embodiment, the scheduling center node obtains various real-time and accurate information according to the characteristics of sharing and non-tampering of the block chain network information, so that the accuracy of intelligent scheduling is ensured, a large amount of labor cost is saved, and the logistics transportation efficiency is improved. And automatically recommending the route with the highest timeliness, and further improving the logistics transportation efficiency. The head-hanging and box-hanging conditions can be comprehensively monitored according to the data of the Internet of things, and warning information is sent out in time when abnormality occurs, so that the probability of disaster occurrence is reduced.

Fig. 4 shows another embodiment of the block chain-based drop-and-hang scheduling method of the present invention, which is applied to a block chain network including a scheduling center node and a sequencing node. The method comprises the following steps:

s401, the sequencing node receives the collected service data and the Internet of things data.

S402, the sequencing node writes the received service data and the received Internet of things data into a block after sequencing according to time, and stores the data into a block chain network.

The dispatching center node dispatches the hanging head to transport corresponding hanging box according to the business data and the internet of things data on the corresponding block chain account book, and the dispatching center node comprises the following steps:

s403, the scheduling center node acquires the information of the hanging box to be transported in the service data, wherein the information of the hanging box comprises: initial position information of the hanging box, destination information of the hanging box and minimum stay time of the hanging box.

In this embodiment, the goods for the order delivery under the delivery platform are calculated by the goods themselves, and the number of the hanging boxes corresponding to the number of the goods themselves and the volume of the goods need to be converted, so that accurate information of the hanging boxes to be delivered is obtained.

The minimum stay time of the hanging box is confirmed according to the time of the goods loaded into the hanging box, and can be estimated/set according to the types of the goods.

For example: the shipper B sends 1 ton of paper towels for single shipment, and the paper towels are transported from shanghai to guangzhou, and after conversion, 3 hanging boxes are needed to be filled, so that 3 hanging box information to be transported is generated, wherein the 3 hanging boxes are all from shanghai to guangzhou, and according to historical data, 1 hour is needed for decorating one hanging box of paper towels, so that the minimum staying time of the hanging boxes in the 3 hanging box information to be transported is 1 hour.

S404, the dispatching center node calculates the reference time of each hanging head carried between the initial position information of the hanging box and the destination information of the hanging box to reach the initial position information of the hanging box according to the hanging head position information (hanging head GPS information) in the data of the Internet of things, the hanging head information in the service data and the freight note information.

Specifically, the reference time may be represented in the form of a time period or a time point, and mainly represents a time point corresponding to a position corresponding to the information of the initial position of each hanging head to the hanging box, or time to be spent.

The information of the hanging head in the service data is used for confirming the carrying route, namely, whether the hanging head can carry the hanging box corresponding to the information of the hanging box to be transported from the position corresponding to the initial position information of the hanging box to the position corresponding to the destination information of the hanging box is judged.

The waybill information is used for confirming whether the head is in transportation, and if the head is in transportation, the time for completing the current waybill needs to be taken into consideration when calculating the reference time; if the container is not transported, only the time spent at the position corresponding to the initial position information of the hanging box needs to be considered.

The position information of the hanging head is to confirm the current position of the hanging head to calculate the reference time.

Optionally, S404 includes: the scheduling center node calculates the time lead of each hanging head carried between the initial position information of the hanging box and the destination information of the hanging box according to the hanging head position information (hanging head GPS information) in the data of the Internet of things and the hanging head information and the freight note information in the service data;

and calculating the reference time of each hanging head reaching the initial position information of the hanging box according to the time lead of each hanging head.

Specifically, the time advance refers to the time required by the head to complete the current waybill, and if the head does not currently have a waybill, the time advance is 0.

And taking the calculated time advance of each hanging head into account to calculate the reference time of each hanging head reaching the position corresponding to the initial position information of the hanging box. The specific calculation mode of the reference time of the hanging head is as follows:

when the hanging head has the waybill information: the time lead plus the time from the destination corresponding to the waybill information currently being transported to the position corresponding to the initial position information of the hanging box;

when the hanging head has no waybill information: the time lead plus the time from the information of the hanging head position to the position corresponding to the information of the initial position of the hanging box.

For example: a rack of information to be transported comprising: the initial position information of the hanging box is Shanghai, the destination information of the hanging box is Nanjing, and the minimum stay time of the hanging box is 1 hour. Confirming that 3 hanging heads from Shanghai to Nanjing are carried according to the hanging head information, wherein the hanging heads are A, B, C; according to the waybill information, finding that the hanging head A and the hanging head B are in transportation, and the hanging head C belongs to an idle state; calculating the time lead of the hanging head A to be 30 minutes according to the hanging head position information of the hanging head A and the destination of the corresponding freight note; calculating the time lead of the hanging head B to be 15 minutes according to the hanging head position information of the hanging head B and the destination of the corresponding freight note; the time advance of the hanging head C is 0 minute; the time spent from the destination corresponding to the waybill information being transported by the head A to the position corresponding to the initial position information of the hanging box is 30 minutes, and the reference time of the head A is 1 hour from 30 minutes +30 minutes; the time spent from the destination corresponding to the waybill information being transported by the head B to the position corresponding to the initial position information of the hanging box is 35 minutes, and the reference time of the head B is 15 minutes +35 minutes which is 50 minutes; if it takes 20 minutes from the position corresponding to the hanging position information of the hanging head C to the position corresponding to the initial hanging box position information, the reference time of the hanging head C is 0+20, which is 20 minutes.

It should be noted that the timing advance of each hanging head in transit is estimated based on the distance and the vehicle speed. And the reference time is also estimated.

S405, the scheduling center node schedules the hanging head with the minimum time difference to transport the hanging box corresponding to the hanging box information to be transported according to the minimum staying time of the hanging box and the calculated reference time of each hanging head.

Specifically, S405 specifically includes:

calculating a corresponding minimum transportable time point according to the release time point of the to-be-transported hanging box information and the corresponding minimum hanging box staying time;

calculating the arrival time point of each hanging head to the initial position information of the hanging box according to the reference time of each hanging head and the calculation time point of the calculated reference time;

respectively calculating the time difference of each hanging head according to the arrival time point and the minimum transportable time point of each hanging head;

and scheduling the hanging head with the minimum time difference to transport the hanging box corresponding to the hanging box information to be transported.

For example: the reference time of the hanging head A is 1 hour, the reference time of the hanging head B is 50 minutes, the reference time of the hanging head C is 20 minutes, and the calculation time is 17:50, so that the arrival time point of the hanging head A to the initial position information of the hanging box is 18:50, the arrival time point of the hanging head B to the initial position information of the hanging box is 18:40, and the arrival time point of the hanging head C to the initial position information of the hanging box is 18: 10. The release time of the hanging box information to be transported is 17:30, the minimum stay time of the corresponding hanging box is 1 hour, and the corresponding minimum transportable time point is 18: 30. The time difference between the hanging head A and the minimum transportable time point is 20 minutes, the time difference between the hanging head B and the minimum transportable time point is 10 minutes, and the time difference between the hanging head C and the minimum transportable time point is 20 minutes. And the hanging head B is dispatched to transport the hanging box corresponding to the hanging box information to be transported.

The hanging box B with the minimum time difference is selected instead of the hanging box C which can be reached earliest, so that the hanging box C is prevented from waiting for too much time, other hanging boxes to be transported can be dispatched possibly, and the logistics transportation efficiency is improved.

Optionally, the block chain-based drop-and-hang scheduling method further includes:

when the hanging head conveys the hanging boxes according to the hanging box destination information, the dispatching center node calculates at least one unilateral transportation line and the corresponding unilateral operation time effectiveness thereof according to the service data on the block chain account book and the data of the Internet of things corresponding to the dispatching center node;

and the dispatching center node recommends the unilateral transportation line with the highest unilateral running timeliness to the driver corresponding to the hanging head.

The same parts of this embodiment as those of the above embodiment will not be described in detail herein, please refer to the above embodiment.

In this embodiment, the scheduling center node takes the transportation and idle situations into consideration when scheduling the hanging head, and also takes the minimum staying time of the hanging boxes into consideration when estimating the time difference, so as to consider from multiple aspects, and the hanging head with the minimum scheduling waiting time is used for transporting the corresponding hanging boxes, thereby improving the transportation efficiency.

In one embodiment of the scheduling center node of the present invention, the method is applied to a blockchain network comprising the scheduling center node and a sequencing node; and the block chain account book corresponding to each node stores the collected business data and the Internet of things data which are sorted according to time.

And the adjusting center node is used for scheduling hanging heads to transport corresponding hanging boxes according to the corresponding business data on the block chain account book and the data of the Internet of things.

Specifically, the business data refers to data related to logistics, including but not limited to: information flow, fund flow, account flow. The throwing scheduling method mainly relates to the application of information flow.

the position information of the hanging head, the positioning sensor is installed on the hanging head to obtain, for example: and (6) GPS. The hanging head is the locomotive, can pull on behind the hanging box, transports the hanging box to the destination, for example: the headstock of a container truck.

The RFID information, i.e., the presence of the RFID tag on the tag and/or the hanging box, is recognized when it enters a particular location (e.g., a logistics park) to determine the location of the tag and/or the hanging box.

Based on the characteristic that the block chain technology cannot be tampered with, the accuracy and the real-time performance of each business data and the internet of things data on the block chain account book corresponding to the dispatching center node are guaranteed, and therefore the reasonability of head hanging and box hanging dispatching is guaranteed.

The adjusting center node is used for scheduling the hanging heads to transport the corresponding hanging boxes according to the business data on the corresponding block chain account book and the data of the internet of things, and the following implementation modes are explained as examples:

as an embodiment, as shown in fig. 5, the adjusting center node 10 includes:

the information obtaining module 11 is configured to obtain the information of the hanging box to be transported in the service data, where the information of the hanging box includes: information of initial position of hanging box and information of destination of hanging box.

The information of the hanging box to be transported has a plurality of representation modes:

And the hanging head confirming module 12 is used for determining an idle hanging head carried between the initial position information of the hanging box and the destination information of the hanging box according to the hanging head information and the waybill information in the service data.

And the hanging head scheduling module 13 is configured to schedule an idle hanging head closest to the initial hanging box position information to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information (hanging head GPS information) in the internet of things data.

Preferably, the hanging head scheduling module 13 is configured to schedule an idle hanging head closest to the initial hanging box position information to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information (hanging head GPS information) in the data of the internet of things, and further includes:

and the hanging head scheduling module 13 is used for scheduling the idle hanging head which is closest to the initial hanging box position information and has the stay time longer than the preset stay time to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information (hanging head GPS information) in the data of the Internet of things.

As another embodiment, as shown in fig. 6, the adjusting center node 10 includes:

the information obtaining module 11 is configured to obtain the information of the hanging box to be transported in the service data, where the information of the hanging box includes: initial position information of the hanging box, destination information of the hanging box and minimum stay time of the hanging box.

In the embodiment, the goods for the order delivery under the delivery platform are calculated by the goods, and the corresponding quantity of the hanging boxes needs to be converted according to the quantity of the goods and the volume of the goods, so that accurate information of the hanging boxes to be delivered is obtained.

And the time calculation module 14 is configured to calculate, according to the hanghead position information (hanghead GPS information) in the internet of things data and the hanghead information and the waybill information in the service data, reference time for each hanghead to reach the initial position information of the container, where the reference time is carried between the initial position information of the container and the destination information of the container.

Optionally, the time calculating module 14 is configured to calculate, according to the hitching position information (the hitching GPS information) in the data of the internet of things and the hitching information and the waybill information in the service data, reference time for each hitching arrival initial position information carried between the initial position information of the hanging box and the destination information of the hanging box, and includes:

the time calculation module 14 is used for calculating the time lead of each hanging head carried between the initial position information of the hanging box and the destination information of the hanging box according to the hanging head position information (hanging head GPS information) in the data of the Internet of things, the hanging head information in the service data and the freight note information; and calculating the reference time of each hanging head reaching the initial position information of the hanging box according to the time lead of each hanging head.

And the hanging head scheduling module 13 is used for scheduling the hanging head with the minimum time difference to transport the hanging box corresponding to the hanging box information to be transported according to the minimum staying time of the hanging box and the calculated reference time of each hanging head.

Specifically, the hanging head scheduling module 13 schedules the hanging head with the minimum time difference to transport the hanging box corresponding to the hanging box information to be transported according to the minimum staying time of the hanging box and the calculated reference time of each hanging head, and specifically includes:

the hanging head scheduling module 13 is used for calculating a corresponding minimum transportable time point according to the release time point of the hanging box information to be transported and the corresponding minimum staying time of the hanging box;

The scheduling center node can match the corresponding hanging head for the hanging box corresponding to each hanging box information to be transported according to any one of the scheduling methods, or the scheduling center node and the hanging box can be used together, wherein one scheduling method is responsible for scheduling one part of the lines (for example, A-B adopts a first scheduling method), and the other scheduling method is responsible for scheduling the other part of the lines (for example, C-D adopts a second scheduling method), and the scheduling center node is set according to actual requirements.

Optionally, the scheduling center node 10 further includes:

the route calculation module 15 is configured to calculate, when the hanging head transports the hanging box according to the hanging box destination information, at least one unilateral transportation line and a unilateral operation timeliness corresponding to the unilateral transportation line according to the service data, the internet of things data and the map data on the block chain book corresponding to the unilateral transportation line;

and the route recommending module 16 is used for recommending the unilateral transportation route with the highest unilateral running timeliness to a driver corresponding to the hanging head.

If time is adopted to represent the unilateral operation aging, the time is the minimum to represent the unilateral operation aging is the highest. And if the evaluation mode is adopted for representation, determining the highest one of the unilateral operation timeliness according to the evaluation level.

Optionally, the scheduling center node 10 further includes: and the abnormity warning module 17 is used for monitoring the states of each hanging head and each hanging box according to the Internet of things data on the corresponding block chain account book, and sending warning information when abnormity occurs.

For specific examples related to this embodiment, please refer to corresponding method embodiments, which are not described herein again.

In the embodiment, the scheduling center node obtains various real-time and accurate information according to the characteristics of sharing and non-tampering of the block chain network information, so that the accuracy of intelligent scheduling is ensured, a large amount of labor cost is saved, and the logistics transportation efficiency is improved. And automatically recommending the route with the highest timeliness, and further improving the logistics transportation efficiency. The head-hanging and box-hanging conditions can be comprehensively monitored according to the data of the Internet of things, and warning information is sent out in time when abnormality occurs, so that the probability of disaster occurrence is reduced. The various scheduling methods can adapt to various scene requirements, and the application range is wide.

In an embodiment of the block chain-based drop-and-hang scheduling system of the present invention, as shown in fig. 7, the system includes a sorting node 20 and a block chain network 30 of the scheduling center node 10 in the above embodiment.

The sequencing node 20 is used for receiving the acquired service data and the internet of things data; and after the received service data and the data of the Internet of things are sorted according to time, writing the data into the block and storing the data into the block chain network.

The node 10 is the same as the above embodiment, and will not be described herein.

In this embodiment, after the collected data are sorted by the sorting node, the data are stored in the blockchain network, so that the information on the blockchain account book corresponding to each node is updated and reliable in real time, the scheduling center node is convenient to intelligently perform reasonable and efficient scheduling, and the logistics transportation efficiency is improved.

In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or recited in detail in a certain embodiment.

It should be noted that the above embodiments can be freely combined as necessary. The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.

Claims

1. A block chain-based drop-hang scheduling method is characterized by being applied to a block chain network comprising a scheduling center node and a sequencing node; the drop and hang scheduling method comprises the following steps:

the sequencing node receives the collected service data and the Internet of things data;

the sequencing node writes the received service data and the received Internet of things data into a block after sequencing according to time, and stores the data into a block chain network;

the dispatching center node dispatches a hanging head to transport a corresponding hanging box according to the business data and the Internet of things data on the corresponding block chain book;

the scheduling center node schedules the hanging head to transport the corresponding hanging box according to the business data and the internet of things data on the corresponding block chain account book, and the method comprises the following steps:

the scheduling center node obtains the information of the hanging boxes to be transported in the service data, wherein the information of the hanging boxes comprises: initial position information of the hanging box and destination information of the hanging box;

the dispatching center node determines an idle hanging head carried between the initial hanging box position information and the hanging box destination information according to the hanging head information and the waybill information in the service data;

and the dispatching center node dispatches an idle hanging head closest to the initial hanging box position information to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information in the Internet of things data.

2. The block chain-based drop and hang scheduling method of claim 1, wherein the scheduling center node schedules an idle head closest to the initial position information of the hanging box to transport the hanging box corresponding to the hanging box information to be transported according to the head position information in the data of the internet of things, further comprising:

and the dispatching center node dispatches an idle hanging head which is closest to the initial hanging box position information and has a residence time longer than a preset residence time to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information in the Internet of things data.

3. The method as claimed in claim 1, wherein the step of scheduling the head to transport the corresponding hanging box according to the service data and the data of the internet of things on the corresponding blockchain book by the scheduling center node comprises:

the scheduling center node obtains the information of the hanging boxes to be transported in the service data, wherein the information of the hanging boxes comprises: initial position information of the hung box, destination information of the hung box and minimum staying time of the hung box;

the dispatching center node calculates reference time for each hanging head carried between the initial hanging box position information and the hanging box destination information to reach the initial hanging box position information according to the hanging head position information in the Internet of things data and the hanging head information and the freight note information in the service data;

and the dispatching center node dispatches the hanging head with the minimum time difference to transport the hanging box corresponding to the hanging box information to be transported according to the minimum staying time of the hanging boxes and the calculated reference time of each hanging head.

4. The block chain-based drop and hang scheduling method according to claim 3, wherein the calculating, by the scheduling center node, the reference time for each drop carried between the initial position information of the drop box and the destination information of the drop box to reach the initial position information of the drop box according to the drop position information in the internet of things data and the drop information and the waybill information in the service data comprises:

the scheduling center node calculates the time lead of each hanging head carried between the initial position information of the hanging box and the destination information of the hanging box according to the hanging head position information in the data of the Internet of things, the hanging head information in the service data and the freight note information;

5. The block chain based drop scheduling method of claim 1, further comprising:

when the hanging head conveys the hanging box according to the hanging box destination information, the dispatching center node calculates at least one unilateral conveying line and the corresponding unilateral operation time effect thereof according to the business data, the Internet of things data and the map data on the corresponding block chain book;

6. The block chain based drop scheduling method of claim 1, further comprising:

and the dispatching center node monitors the states of each hanging head and each hanging box according to the Internet of things data on the corresponding block chain account book, and sends out warning information when abnormality occurs.

7. A scheduling center node applied to the block chain-based drop-hang scheduling method of any one of claims 1 to 6, wherein the scheduling center node is applied to a block chain network comprising the scheduling center node and a sorting node; the block chain account book corresponding to each node stores collected service data and Internet of things data which are sorted according to time;

and the adjusting center node is used for scheduling hanging heads to transport corresponding hanging boxes according to the business data and the Internet of things data on the corresponding block chain account book.

8. The scheduling center node of claim 7 comprising:

an information obtaining module, configured to obtain information of a to-be-transported hanging box in the service data, where the information of the hanging box includes: initial position information of the hanging box and destination information of the hanging box;

the hanging head confirming module is used for determining an idle hanging head carried between the initial hanging box position information and the hanging box destination information according to the hanging head information and the waybill information in the service data;

and the hanging head scheduling module is used for scheduling an idle hanging head closest to the initial hanging box position information to transport the hanging box corresponding to the hanging box information to be transported according to the hanging head position information in the Internet of things data.

9. A drop and hang scheduling system based on a blockchain, characterized by comprising a blockchain network of the scheduling center node and the sequencing node of claim 7 or 8;

the sequencing node is used for receiving the collected service data and the data of the Internet of things; and after the received service data and the received data of the Internet of things are sorted according to time, writing the data into a block, and storing the data into a block chain network.