CN111652439A - Method and device for generating delivery quantity of delivery points and computer system - Google Patents
Method and device for generating delivery quantity of delivery points and computer system Download PDFInfo
- Publication number
- CN111652439A CN111652439A CN202010501784.1A CN202010501784A CN111652439A CN 111652439 A CN111652439 A CN 111652439A CN 202010501784 A CN202010501784 A CN 202010501784A CN 111652439 A CN111652439 A CN 111652439A
- Authority
- CN
- China
- Prior art keywords
- target
- transportation
- transport
- stations
- waybill
- 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
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000012545 processing Methods 0.000 claims description 13
- 238000012423 maintenance Methods 0.000 claims description 4
- 238000012546 transfer Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 238000000605 extraction Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/904—Browsing; Visualisation therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- 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
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Databases & Information Systems (AREA)
- Educational Administration (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a method, a device and a computer system for generating dispatch quantity of dispatch points, which comprises the steps of positioning the current position of a target freight note, wherein the target freight note comprises a transportation route; according to the transportation route, matching the transportation stations and the passing sequence which the target waybill needs to pass through; determining a preset number of transport stations through which the target freight notes are to pass as target transport stations according to the passing sequence; when the target transport station comprises the dispatching points, the quantity to be dispatched corresponding to the dispatching points is updated, the dispatching points can conveniently know the quantity of the express mails to be dispatched according to the updated quantity to be dispatched, the dispatching points can conveniently prepare in advance, and the dispatching efficiency of the dispatching points is improved.
Description
Technical Field
The invention relates to the field of logistics, in particular to a method and a device for generating a delivery quantity of a delivery point and a computer system.
Background
With the rapid expansion of the e-commerce industry, the logistics industry is also greatly developed. Since the order quantity of the e-commerce is frequently floating, the dispatch quantity required to be processed every day at the dispatch point of each logistics is also floating. The staff of the dispatch point often needs to estimate the number of the freight notes to be dispatched on the same day according to experience, and when the quantity of the freight notes to be dispatched suddenly increases, the dispatch point cannot timely process a large number of freight notes to be dispatched because the dispatch point does not receive a notice to prepare in advance, so that the user cannot timely receive the dispatched goods, and the user experience is very poor.
Disclosure of Invention
In order to solve the defects of the prior art, the invention mainly aims to provide a method, a device and a computer system for generating dispatch quantity of dispatch points.
In order to achieve the above object, a first aspect of the present invention provides a method for generating a dispatch amount of a dispatch point, the method comprising:
locating a current location of a target waybill, the target waybill including a transportation route;
according to the transportation route, matching the transportation stations and the passing sequence which the target waybill needs to pass through;
determining a preset number of transport stations through which the target freight notes are to pass as target transport stations according to the passing sequence;
and when the target transport station comprises dispatching points, updating the quantity to be dispatched corresponding to the dispatching points.
In some embodiments, the method comprises:
predicting the predicted time of the target freight note to reach each target transport station according to the current position and the position of the target transport station;
pushing a manifest arrival message to each of the target transport stations, the message including the target manifest and the projected time.
In some embodiments, said predicting an expected time of arrival of said target waybill at each said target transit station based on said current location and a location of said target transit station comprises:
acquiring the arrival time of the target waybill to the current position;
predicting the transportation time required by the target freight note to reach each target transportation station according to the current position and the position of the target transportation station;
and determining the estimated time of the target freight note arriving at the target transport station according to the arrival time and the transport duration.
In some embodiments, the destination waybill includes a starting place and a destination corresponding to the destination waybill, and the matching of the transportation stations and the passing sequence that the destination waybill needs to pass through according to the transportation route comprises:
reading a routing table matched with a preset transportation path corresponding to the target freight note according to the starting place and the destination corresponding to the target freight note, wherein the routing table is used for storing the preset transportation path corresponding to each combination of the starting place and the destination, and the preset transportation path comprises transportation stations and the passing sequence of the transportation stations;
and determining the transport stations needing to pass through and a passing sequence according to the current position of the target freight bill and the corresponding preset transport path.
In some embodiments, the projected time comprises a date, the method comprising:
and counting the number of the target freight notes expected to arrive corresponding to each date of the target transport station and visually displaying the number.
In some embodiments, the predetermined number is 3.
In a second aspect, the present application discloses an apparatus for generating a delivery point delivery amount, the apparatus comprising:
the positioning module is used for positioning the current position of a target freight note, and the target freight note comprises a transportation route;
the matching module is used for matching the transport stations and the passing sequence which the target freight notes need to pass through according to the transport route;
the processing module is used for determining a preset number of the transport stations which the target freight notes are going to pass through as target transport stations according to the passing sequence;
and the maintenance module is used for updating the quantity to be dispatched corresponding to the dispatching point when the target transport station comprises the dispatching point.
In some embodiments, the processing module may be further configured to predict an expected time of arrival of the target manifest at each of the target transportation stations based on the current location and the location of the target transportation station; pushing a manifest arrival message to each of the target transport stations, the message including the target manifest and the projected time.
In some embodiments, the processing module may be further configured to obtain an arrival time of the target waybill to the current location; predicting the transportation time required by the target freight note to reach each target transportation station according to the current position and the position of the target transportation station; and determining the estimated time of the target freight note arriving at the target transport station according to the arrival time and the transport duration.
In a third aspect, the present application discloses a computer system, the system comprising:
one or more processors;
and memory associated with the one or more processors for storing program instructions that, when read and executed by the one or more processors, perform operations comprising:
locating a current location of a target waybill, the target waybill including a transportation route;
according to the transportation route, matching the transportation stations and the passing sequence which the target waybill needs to pass through;
determining a preset number of transport stations through which the target freight notes are to pass as target transport stations according to the passing sequence;
and when the target transport station comprises dispatching points, updating the quantity to be dispatched corresponding to the dispatching points.
The invention has the following beneficial effects:
the application discloses a method for generating a delivery quantity of a delivery point, which comprises the steps of positioning the current position of a target freight note, wherein the target freight note comprises a transportation route; according to the transportation route, matching the transportation stations and the passing sequence which the target waybill needs to pass through; determining a preset number of transport stations through which the target freight notes are to pass as target transport stations according to the passing sequence; when the target transport station comprises the dispatching points, the quantity to be dispatched corresponding to the dispatching points is updated, the dispatching points can conveniently know the quantity of the express to be dispatched according to the updated quantity to be dispatched, the dispatching points can conveniently prepare in advance, and the dispatching efficiency of the dispatching points is improved;
furthermore, the application also provides a method for predicting the predicted time of the target freight note to reach each target transport station according to the current position and the position of the target transport station; the delivery order arrival information is pushed to each target transport station, the information comprises the target delivery orders and the estimated time, each transport station can know the number of the delivery orders to arrive according to the received pushing information and plan in advance, and the transfer efficiency of the transport stations is improved;
the application also discloses statistics target transport station each the date is expected to arrive the quantity and the visual show of target freight note, the manager of being convenient for supervises the goods condition that arrives of each transport station to in time adjust, improved the operating efficiency of whole circuit.
All products of the present invention need not have all of the above-described effects.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a diagram of a projected arrival single volume presentation provided by an embodiment of the present application;
FIG. 2 is a flow chart of a method provided by an embodiment of the present application;
FIG. 3 is a block diagram of an apparatus according to an embodiment of the present disclosure;
fig. 4 is a computer system structure diagram provided in the embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As described in the background art, in order to help a dispatch station to know the number of freight notes to be dispatched in advance, the application provides a dispatch point dispatch quantity generation system, which matches a corresponding transportation route according to a starting place and a destination of a target freight note, and determines a transportation station which the target freight note will pass through according to a current position, so as to send a reminding message of arrival of the freight note to the corresponding transportation station, thereby improving the processing efficiency of the transportation station.
Example one
Specifically, the above scheme can be realized by the following steps:
step one, acquiring all freight notes in transportation;
specifically, each waybill includes a corresponding origin and destination.
Reading a routing table, and matching a preset transportation line corresponding to each freight bill;
specifically, the system stores a pre-constructed routing table, in which a preset transportation route corresponding to each combination of the starting location and the destination is recorded, and the preset transportation route includes a passing transportation station and a passing sequence of the transportation station.
For example, a certain waybill starts at a residential district a in shanghai and is destined for a B-office building in beijing. According to the preset transportation route from Shanghai to Beijing recorded in the routing table, the system can determine the whole route of the waybill from A residential area to pick up the goods to load the goods, then from Shanghai to transport to the transport station passing by in sequence from Beijing and to transport to the delivery point after reaching the Beijing, and determine the transport station and the delivery point passing by.
The transportation station comprises transfer points and delivery points, wherein the transfer points comprise all transportation points which are passed by the freight note after leaving the collecting station and before reaching the delivery point, and the delivery point is a point responsible for delivering the freight note to a user.
Thirdly, positioning the current position of each waybill;
specifically, the current location of the waybill may be determined according to the code-scanning record of the waybill, the GPS location result of the vehicle transporting the waybill, and the like. Specifically, the current position may be a transportation station, or may be a real-time position of the waybill determined according to the positioning result.
Fourthly, determining a transport station through which the freight note does not pass and a passing sequence according to the preset transport route and the current position;
specifically, the preset transportation route through which the waybill has passed can be determined according to the current position of the waybill and the preset transportation route, so as to determine the transportation stations through which the waybill has not passed and the passing sequence of the transportation stations.
Step five, determining three transport stations which are to be passed by each freight note according to the passing sequence;
specifically, three transport stations through which each waybill will pass according to the corresponding passing sequence can be determined, and a prompt message of the arrival of the corresponding waybill at the transport stations is sent to the three transport stations, wherein the prompt message comprises the waybill and the predicted arrival time.
Specifically, the process of determining the estimated arrival time includes:
and when the current position of the freight note is a transfer node, determining the predicted leaving time of the freight note leaving the transfer node according to the time of the freight note reaching the current position and the preset specified loading time. According to the transport distance of the upcoming transport station whose current position is closest to the current position, the first transport time required to reach the closest transport station can be predicted. A second transit time required to reach the second upcoming transport station may be predicted based on the transit distance from the nearest upcoming transport station to the second upcoming transport station. A third transport time required to reach the third upcoming transport station may be predicted based on the transport distance from the second upcoming transport station to the third upcoming transport station.
The time of arrival of the waybill at the nearest upcoming transit station is the sum of the estimated departure time and the first transit time, i.e., the first estimated arrival time.
The time of arrival of the manifest at the second upcoming transit station is the sum of the first estimated time of arrival and the specified loading time and the second transit time, i.e., the second estimated time of arrival.
The time of arrival of the manifest at the third upcoming transport station is the sum of the second estimated time of arrival and the specified loading time and the third transport time, i.e., the third estimated time of arrival.
Specifically, based on the estimated arrival time, the system may count the number of waybills expected to arrive per day at each transit station and generate a visualization page, as shown in fig. 1.
And step six, when the three transport stations to pass contain dispatching points, updating the quantity to be dispatched corresponding to the dispatching points.
Specifically, when three transport stations through which a certain freight note is going to pass include dispatch points, the freight note is considered to be about to be dispatched, that is, the number to be dispatched of the corresponding dispatch point is increased by one, a preparation dispatch message is sent to the corresponding dispatch point, the predicted quantity to be dispatched of each dispatch point per day is counted, and the quantity to be dispatched is returned to the corresponding dispatch point, so that the dispatch point can prepare for dispatch.
Example two
Corresponding to the foregoing embodiments, the present application provides a method for generating a dispatch amount of a dispatch point, as shown in fig. 2, the method includes:
210. locating a current location of a target waybill, the target waybill including a transportation route;
220. according to the transportation route, matching the transportation stations and the passing sequence which the target waybill needs to pass through;
preferably, the target waybill includes a starting place and a destination corresponding to the target waybill, and the matching of the transportation stations and the passing sequence that the target waybill needs to pass through according to the transportation route includes:
221. reading a routing table matched with a preset transportation path corresponding to the target freight note according to the starting place and the destination corresponding to the target freight note, wherein the routing table is used for storing the preset transportation path corresponding to each combination of the starting place and the destination, and the preset transportation path comprises transportation stations and the passing sequence of the transportation stations;
222. and determining the transport stations needing to pass through and a passing sequence according to the current position of the target freight bill and the corresponding preset transport path.
230. Determining a preset number of transport stations through which the target freight notes are to pass as target transport stations according to the passing sequence;
240. and when the target transport station comprises dispatching points, updating the quantity to be dispatched corresponding to the dispatching points.
Preferably, the method comprises:
250. predicting the predicted time of the target freight note to reach each target transport station according to the current position and the position of the target transport station;
251. pushing a manifest arrival message to each of the target transport stations, the message including the target manifest and the projected time.
Preferably, the predicting the predicted time of the target waybill arriving at each of the target transportation stations according to the current position and the position of the target transportation station comprises:
252. acquiring the arrival time of the target waybill to the current position;
253. predicting the transportation time required by the target freight note to reach each target transportation station according to the current position and the position of the target transportation station;
preferably, the projected time comprises a date, the method comprising:
254. and counting the number of the target freight notes expected to arrive at each date of the target transport station and visually displaying the number.
And determining the estimated time of the target freight note arriving at the target transport station according to the arrival time and the transport duration.
Preferably, the preset number is 3.
EXAMPLE III
Corresponding to the above method, the present application provides a device for generating a delivery point delivery amount, as shown in fig. 3, the device includes:
a location module 310 for locating a current location of a target waybill, the target waybill including a transportation route;
the matching module 320 is used for matching the transportation stations and the passing sequence which the target freight notes need to pass through according to the transportation routes;
the processing module 330 is configured to determine, according to the passing sequence, that the preset number of transport stations through which the target waybill is to pass are target transport stations;
and the maintenance module 340 is configured to update the number to be dispatched corresponding to the dispatch point when the target transportation station includes the dispatch point.
Preferably, the processing module 330 is further configured to predict the expected time of arrival of the target waybill at each of the target transportation stations according to the current location and the location of the target transportation station; pushing a manifest arrival message to each of the target transport stations, the message including the target manifest and the projected time.
Preferably, the processing module 330 is further configured to obtain an arrival time of the target waybill to the current location; predicting the transportation time required by the target freight note to reach each target transportation station according to the current position and the position of the target transportation station; and determining the estimated time of the target freight note arriving at the target transport station according to the arrival time and the transport duration.
Preferably, the target waybill includes a start place and a destination corresponding to the target waybill, the matching module 320 is further configured to read a routing table to match a preset transportation path corresponding to the target waybill according to the start place and the destination corresponding to the target waybill, the routing table is configured to store a preset transportation path corresponding to each combination of the start place and the destination, and the preset transportation path includes a transportation station and a passing order of the transportation station; and determining the transport stations needing to pass through and a passing sequence according to the current position of the target freight bill and the corresponding preset transport path.
Preferably, the estimated time includes a date, and the maintenance module 340 is further configured to count and visually display the number of the target freight tickets estimated to arrive at the target transportation station on each of the dates.
Example four
Corresponding to the above method, apparatus, and system, a sixth embodiment of the present application provides a computer system, including: one or more processors; and memory associated with the one or more processors for storing program instructions that, when read and executed by the one or more processors, perform operations comprising: locating a current location of a target waybill, the target waybill including a transportation route;
according to the transportation route, matching the transportation stations and the passing sequence which the target waybill needs to pass through;
determining a preset number of transport stations through which the target freight notes are to pass as target transport stations according to the passing sequence;
and when the target transport station comprises dispatching points, updating the quantity to be dispatched corresponding to the dispatching points.
Fig. 4 illustrates an architecture of a computer system, which may include, in particular, a processor 1510, a video display adapter 1511, a disk drive 1512, an input/output interface 1513, a network interface 1514, and a memory 1520. The processor 1510, video display adapter 1511, disk drive 1512, input/output interface 1513, network interface 1514, and memory 1520 may be communicatively coupled via a communication bus 1530.
The processor 1510 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solution provided by the present Application.
The Memory 1520 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random access Memory), a static storage device, a dynamic storage device, or the like. The memory 1520 may store an operating system 1521 for controlling the operation of the computer system 1500, a Basic Input Output System (BIOS) for controlling low-level operations of the computer system 1500. In addition, a web browser 1523, a data storage management system 1524, an icon font processing system 1525, and the like can also be stored. The icon font processing system 1525 may be an application program that implements the operations of the foregoing steps in this embodiment of the application. In summary, when the technical solution provided by the present application is implemented by software or firmware, the relevant program codes are stored in the memory 1520 and called for execution by the processor 1510. The input/output interface 1513 is used for connecting an input/output module to realize information input and output. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The network interface 1514 is used to connect a communication module (not shown) to enable the device to communicatively interact with other devices. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
The bus 1530 includes a path to transfer information between the various components of the device, such as the processor 1510, the video display adapter 1511, the disk drive 1512, the input/output interface 1513, the network interface 1514, and the memory 1520.
In addition, the computer system 1500 may also obtain information of specific extraction conditions from the virtual resource object extraction condition information database 1541 for performing condition judgment, and the like.
It should be noted that although the above devices only show the processor 1510, the video display adapter 1511, the disk drive 1512, the input/output interface 1513, the network interface 1514, the memory 1520, the bus 1530, etc., in a specific implementation, the devices may also include other components necessary for proper operation. Furthermore, it will be understood by those skilled in the art that the apparatus described above may also include only the components necessary to implement the solution of the present application, and not necessarily all of the components shown in the figures.
From the above description of the embodiments, it is clear to those skilled in the art that the present application can be implemented by software plus necessary general hardware platform. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, or the like, and includes several instructions for enabling a computer device (which may be a personal computer, a cloud server, or a network device) to execute the method according to the embodiments or some parts of the embodiments of the present application.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, the system or system embodiments are substantially similar to the method embodiments and therefore are described in a relatively simple manner, and reference may be made to some of the descriptions of the method embodiments for related points. The above-described system and system embodiments are only illustrative, wherein the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
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, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (10)
1. A method of generating a dispatch amount for a dispatch point, the method comprising:
locating a current location of a target waybill, the target waybill including a transportation route;
according to the transportation route, matching the transportation stations and the passing sequence which the target waybill needs to pass through;
determining a preset number of transport stations through which the target freight notes are to pass as target transport stations according to the passing sequence;
and when the target transport station comprises dispatching points, updating the quantity to be dispatched corresponding to the dispatching points.
2. The method according to claim 1, characterized in that it comprises:
predicting the predicted time of the target freight note to reach each target transport station according to the current position and the position of the target transport station;
pushing a manifest arrival message to each of the target transport stations, the message including the target manifest and the projected time.
3. The method of claim 2, wherein predicting the expected time of arrival of the target waybill at each of the target transportation stations based on the current location and the location of the target transportation station comprises:
acquiring the arrival time of the target waybill to the current position;
predicting the transportation time required by the target freight note to reach each target transportation station according to the current position and the position of the target transportation station;
and determining the estimated time of the target freight note arriving at the target transport station according to the arrival time and the transport duration.
4. The method of claim 1, wherein the transportation route comprises a starting place and a destination corresponding to the target waybill, and wherein the matching transportation stations and passing sequences required to be passed by the target waybill according to the transportation route comprises:
reading a routing table matched with a preset transportation path corresponding to the target freight note according to the starting place and the destination corresponding to the target freight note, wherein the routing table is used for storing the preset transportation path corresponding to each combination of the starting place and the destination, and the preset transportation path comprises transportation stations and the passing sequence of the transportation stations;
and determining the transport stations needing to pass through and a passing sequence according to the current position of the target freight bill and the corresponding preset transport path.
5. The method of claim 2 or 3, wherein the projected time comprises a date on which the target waybill is projected to reach the target transportation station, the method comprising:
and counting the number of the target freight notes expected to arrive corresponding to each date of the target transport station and visually displaying the number.
6. The method of any one of claims 1 to 4, wherein the predetermined number is 3.
7. An apparatus for generating a delivery point delivery amount, the apparatus comprising:
the positioning module is used for positioning the current position of a target freight note, and the target freight note comprises a transportation route;
the matching module is used for matching the transport stations and the passing sequence which the target freight notes need to pass through according to the transport route;
the processing module is used for determining a preset number of the transport stations which the target freight notes are going to pass through as target transport stations according to the passing sequence;
and the maintenance module is used for updating the quantity to be dispatched corresponding to the dispatching point when the target transport station comprises the dispatching point.
8. The generation apparatus as claimed in claim 7, wherein the processing module is further configured to predict the expected time of arrival of the target waybill at each of the target transportation stations according to the current location and the location of the target transportation station; pushing a manifest arrival message to each of the target transport stations, the message including the target manifest and the projected time.
9. The generation apparatus of claim 8, wherein the processing module is further configured to obtain an arrival time of the target waybill to the current location; predicting the transportation time required by the target freight note to reach each target transportation station according to the current position and the position of the target transportation station; and determining the estimated time of the target freight note arriving at the target transport station according to the arrival time and the transport duration.
10. A computer system, the system comprising:
one or more processors;
and memory associated with the one or more processors for storing program instructions that, when read and executed by the one or more processors, perform operations comprising:
locating a current location of a target waybill, the target waybill including a transportation route;
according to the transportation route, matching the transportation stations and the passing sequence which the target waybill needs to pass through;
determining a preset number of transport stations through which the target freight notes are to pass as target transport stations according to the passing sequence;
and when the target transport station comprises dispatching points, updating the quantity to be dispatched corresponding to the dispatching points.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010501784.1A CN111652439B (en) | 2020-06-04 | 2020-06-04 | Method and device for generating dispatch quantity of dispatch points and computer system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010501784.1A CN111652439B (en) | 2020-06-04 | 2020-06-04 | Method and device for generating dispatch quantity of dispatch points and computer system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111652439A true CN111652439A (en) | 2020-09-11 |
| CN111652439B CN111652439B (en) | 2024-02-23 |
Family
ID=72348786
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010501784.1A Active CN111652439B (en) | 2020-06-04 | 2020-06-04 | Method and device for generating dispatch quantity of dispatch points and computer system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111652439B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112686455A (en) * | 2020-12-31 | 2021-04-20 | 车主邦（北京）科技有限公司 | Logistics node arrangement method and device |
| CN114862304A (en) * | 2022-04-14 | 2022-08-05 | 圆通速递有限公司 | Terminal distribution station express package building method and system based on address mark mapping |
| WO2023202244A1 (en) * | 2022-04-21 | 2023-10-26 | 北京京东振世信息技术有限公司 | Waybill volume splitting method and apparatus, and electronic device and computer-readable medium |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000182179A (en) * | 1998-12-14 | 2000-06-30 | Hitachi Software Eng Co Ltd | Method and system for preparing relay plan for transportation |
| JP2003226436A (en) * | 2002-02-01 | 2003-08-12 | Nec Corp | Cargo amount calculating device, cargo amount calculating method and its program |
| US8239229B1 (en) * | 2000-02-24 | 2012-08-07 | Richard Paiz | Parallel computer network and method for real time financial resource management, inventory control, and online purchasing |
| CN105373908A (en) * | 2015-11-14 | 2016-03-02 | 合肥天之通电子商务有限公司 | Distribution method for express distribution center |
| CN106355282A (en) * | 2016-08-31 | 2017-01-25 | 广州增信信息科技有限公司 | Logistics loading optimizing method and device |
| CN108764765A (en) * | 2018-03-28 | 2018-11-06 | 上海乐愚智能科技有限公司 | One kind sending determining method of path, device, terminal and storage medium with charge free |
| CN108917774A (en) * | 2018-03-28 | 2018-11-30 | 上海乐愚智能科技有限公司 | A kind of generation method, device, terminal and the storage medium of prompting delivered information |
| CN109118131A (en) * | 2017-06-23 | 2019-01-01 | 菜鸟智能物流控股有限公司 | Logistics data processing method and device |
| CN109697523A (en) * | 2017-10-23 | 2019-04-30 | 顺丰科技有限公司 | The method, system and equipment for sending part path are received in optimization |
| CN109829667A (en) * | 2017-11-23 | 2019-05-31 | 菜鸟智能物流控股有限公司 | Method and device for predicting parcel volume of logistics node |
| CN110110932A (en) * | 2019-05-09 | 2019-08-09 | 上汽安吉物流股份有限公司 | Order forecast method and device, logistics system and computer-readable medium |
| WO2019153518A1 (en) * | 2018-02-08 | 2019-08-15 | 平安科技（深圳）有限公司 | Information pushing method and device, computer device and storage medium |
| CN110210804A (en) * | 2019-04-29 | 2019-09-06 | 德邦物流股份有限公司 | It is a kind of that courier is assisted to send the method and system for signing for package with charge free |
| CN110348612A (en) * | 2019-06-24 | 2019-10-18 | 深圳市恒路物流股份有限公司 | Distribution Center goods amount prediction technique and device |
| CN110852683A (en) * | 2019-11-12 | 2020-02-28 | 德邦物流股份有限公司 | Dispatch waybill classification method and device |
-
2020
- 2020-06-04 CN CN202010501784.1A patent/CN111652439B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000182179A (en) * | 1998-12-14 | 2000-06-30 | Hitachi Software Eng Co Ltd | Method and system for preparing relay plan for transportation |
| US8239229B1 (en) * | 2000-02-24 | 2012-08-07 | Richard Paiz | Parallel computer network and method for real time financial resource management, inventory control, and online purchasing |
| JP2003226436A (en) * | 2002-02-01 | 2003-08-12 | Nec Corp | Cargo amount calculating device, cargo amount calculating method and its program |
| CN105373908A (en) * | 2015-11-14 | 2016-03-02 | 合肥天之通电子商务有限公司 | Distribution method for express distribution center |
| CN106355282A (en) * | 2016-08-31 | 2017-01-25 | 广州增信信息科技有限公司 | Logistics loading optimizing method and device |
| CN109118131A (en) * | 2017-06-23 | 2019-01-01 | 菜鸟智能物流控股有限公司 | Logistics data processing method and device |
| CN109697523A (en) * | 2017-10-23 | 2019-04-30 | 顺丰科技有限公司 | The method, system and equipment for sending part path are received in optimization |
| CN109829667A (en) * | 2017-11-23 | 2019-05-31 | 菜鸟智能物流控股有限公司 | Method and device for predicting parcel volume of logistics node |
| WO2019153518A1 (en) * | 2018-02-08 | 2019-08-15 | 平安科技（深圳）有限公司 | Information pushing method and device, computer device and storage medium |
| CN108917774A (en) * | 2018-03-28 | 2018-11-30 | 上海乐愚智能科技有限公司 | A kind of generation method, device, terminal and the storage medium of prompting delivered information |
| CN108764765A (en) * | 2018-03-28 | 2018-11-06 | 上海乐愚智能科技有限公司 | One kind sending determining method of path, device, terminal and storage medium with charge free |
| CN110210804A (en) * | 2019-04-29 | 2019-09-06 | 德邦物流股份有限公司 | It is a kind of that courier is assisted to send the method and system for signing for package with charge free |
| CN110110932A (en) * | 2019-05-09 | 2019-08-09 | 上汽安吉物流股份有限公司 | Order forecast method and device, logistics system and computer-readable medium |
| CN110348612A (en) * | 2019-06-24 | 2019-10-18 | 深圳市恒路物流股份有限公司 | Distribution Center goods amount prediction technique and device |
| CN110852683A (en) * | 2019-11-12 | 2020-02-28 | 德邦物流股份有限公司 | Dispatch waybill classification method and device |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112686455A (en) * | 2020-12-31 | 2021-04-20 | 车主邦（北京）科技有限公司 | Logistics node arrangement method and device |
| CN114862304A (en) * | 2022-04-14 | 2022-08-05 | 圆通速递有限公司 | Terminal distribution station express package building method and system based on address mark mapping |
| WO2023202244A1 (en) * | 2022-04-21 | 2023-10-26 | 北京京东振世信息技术有限公司 | Waybill volume splitting method and apparatus, and electronic device and computer-readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111652439B (en) | 2024-02-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111652439B (en) | Method and device for generating dispatch quantity of dispatch points and computer system | |
| US20200286039A1 (en) | Information generation method and apparatus | |
| CN109697524B (en) | Method, system and equipment for optimizing matching of receiving and dispatching task and resource | |
| CN108734344B (en) | Order distribution prediction method, device, equipment and computer readable storage medium | |
| US20120246090A1 (en) | Courier Management | |
| US20140156327A1 (en) | Collaborative job dispatching systems and methods | |
| JP2013167972A (en) | Delivery schedule management system, method for managing delivery schedule, and delivery schedule management program | |
| EP4082942A1 (en) | Projection instruction device and projection instruction system | |
| WO2021073477A1 (en) | Method and apparatus for supporting modification of consignee information | |
| US10332058B1 (en) | Real time communication for carrier operations | |
| CN111256718A (en) | Dispatching route planning method, device, system, equipment and storage medium | |
| CN107085754B (en) | Information output method and device | |
| CN110826947A (en) | Logistics order processing method and device and vehicle-mounted terminal equipment | |
| EP3926562A1 (en) | Methods for merchandise sorting and packing management | |
| CN112288362A (en) | Parcel re-delivery method, parcel delivery method and related equipment | |
| WO2019015254A1 (en) | Information processing method and device | |
| CN115222328A (en) | Logistics tracking method, device, equipment and medium | |
| CN111311152B (en) | Method, device, system, equipment and storage medium for recommending dispatch route | |
| CN113780923A (en) | Method and device for sending piece, electronic equipment and medium | |
| JP2017207797A (en) | Delivery management system, method and computer program | |
| CN111325504A (en) | Dispatching track recommendation method, device, system, equipment and storage medium | |
| KR20110127550A (en) | Work management system using smart phone | |
| CN112446565A (en) | Method and device for matching vehicles for orders | |
| CN113706032B (en) | Order form and charge management method and device | |
| JP2013119460A (en) | Vehicle dispatch display system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |