CN111652439B - Method and device for generating dispatch quantity of dispatch points and computer system - Google Patents
Method and device for generating dispatch quantity of dispatch points and computer system Download PDFInfo
- Publication number
- CN111652439B CN111652439B CN202010501784.1A CN202010501784A CN111652439B CN 111652439 B CN111652439 B CN 111652439B CN 202010501784 A CN202010501784 A CN 202010501784A CN 111652439 B CN111652439 B CN 111652439B
- Authority
- CN
- China
- Prior art keywords
- target
- waybill
- transportation
- station
- dispatch
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000012545 processing Methods 0.000 claims description 11
- 238000012423 maintenance Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 description 6
- 238000012546 transfer Methods 0.000 description 3
- 230000002354 daily effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000002360 preparation method Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000000007 visual effect 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
- 230000003993 interaction Effects 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
- 230000000750 progressive effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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 comprise the steps of positioning the current position of a target waybill, wherein the target waybill comprises a transportation route; according to the transportation route, matching a transportation station and a passing sequence which the target waybill needs to pass through; according to the passing sequence, determining the preset number of the transport stations, which are about to pass through the target waybill, as target transport stations; when the target transport station comprises a dispatch point, the dispatch quantity corresponding to the dispatch point is updated, the dispatch point can conveniently know the quantity of the express to be dispatched according to the updated dispatch quantity, the dispatch point is convenient to prepare in advance, and the dispatch efficiency of the dispatch point is improved.
Description
Technical Field
The present invention relates to the field of logistics, and in particular, to a method, an apparatus, and a computer system for generating a dispatch amount of a dispatch point.
Background
With the rapid expansion of the electronic commerce industry, the logistics industry has been greatly developed. Because the order volume of the electronic commerce often floats, the dispatch volume of each logistics dispatch point to be processed every day also floats. The staff of the dispatch point often needs to estimate the quantity of the shipping slips required to be dispatched on the same day according to experience, when the quantity of the shipping slips required to be dispatched suddenly increases, the dispatch point cannot process a large quantity of shipping slips to be dispatched in time because the dispatch point does not receive notification to prepare in advance, so that a user cannot receive the dispatched goods in time, and the use experience of the user is poor.
Disclosure of Invention
In order to solve the defects in the prior art, the main purpose of the invention is to provide a method, a device and a computer system for generating dispatch quantity of dispatch points.
In order to achieve the above object, in a first aspect, the present invention provides a method for generating a dispatch amount of a dispatch, where the method includes:
locating a current position of a target waybill, the target waybill comprising a transportation route;
according to the transportation route, matching a transportation station and a passing sequence which the target waybill needs to pass through;
according to the passing sequence, determining the preset number of the transport stations, which are about to pass through the target waybill, as target transport stations;
and when the target transport station comprises a dispatch point, updating the quantity to be dispatched corresponding to the dispatch point.
In some embodiments, the method comprises:
predicting the predicted time for the target waybill to reach each target transportation station according to the current position and the position of the target transportation station;
a manifest arrival message is pushed to each of the target shipping stations, the message including the target manifest and the projected time.
In some embodiments, the predicting the predicted time for the target waybill to reach each of the target shipping stations based on the current location and the location of the target shipping station comprises:
acquiring the arrival time of the target waybill to the current position;
predicting the transportation time required by the target waybill to reach each target transportation station according to the current position and the position of the target transportation station;
and determining the estimated time for the target waybill to arrive at the target transport station according to the arrival time and the transport duration.
In some embodiments, the target waybill includes a start location and a destination corresponding to the target waybill, and the matching the transportation station and the passing order that the target waybill needs to pass according to the transportation route includes:
according to the starting place and the destination corresponding to the target waybill, a routing table is read to be matched with a preset transportation path corresponding to the target waybill, the routing table is used for storing preset transportation paths corresponding to the combination of each starting place and each destination, and the preset transportation paths comprise transportation stations and the passing sequence of the transportation stations;
and determining the transport station and the passing sequence which need to pass according to the current position of the target waybill and the corresponding preset transport path.
In some embodiments, the projected time comprises a date, the method comprising:
and counting the number of the expected destination handbill which is corresponding to each date of the destination transportation station and visually displaying the number.
In some embodiments, the preset number is 3.
In a second aspect, the present application discloses a device for generating a dispatch amount of a dispatch, where the device includes:
the positioning module is used for positioning the current position of a target waybill, wherein the target waybill comprises a transportation route;
the matching module is used for matching the transport stations and the passing sequence of the target waybills according to the transport route;
the processing module is used for determining the preset number of the transport stations, which are about to pass through the target waybill, 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 dispatch point when the target transport station comprises the dispatch point.
In some embodiments, the processing module may be further configured to predict an estimated time for the target waybill to reach each of the target shipping stations based on the current location and the location of the target shipping station; a manifest arrival message is pushed to each of the target shipping stations, the message including the target manifest and the projected time.
In some embodiments, the processing module may be further configured to obtain a time of arrival of the target waybill at the current location; predicting the transportation time required by the target waybill to reach each target transportation station according to the current position and the position of the target transportation station; and determining the estimated time for the target waybill to arrive 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 a memory associated with the one or more processors, the memory for storing program instructions that, when read for execution by the one or more processors, perform the following:
locating a current position of a target waybill, the target waybill comprising a transportation route;
according to the transportation route, matching a transportation station and a passing sequence which the target waybill needs to pass through;
according to the passing sequence, determining the preset number of the transport stations, which are about to pass through the target waybill, as target transport stations;
and when the target transport station comprises a dispatch point, updating the quantity to be dispatched corresponding to the dispatch point.
The beneficial effects achieved by the invention are as follows:
the application discloses a method for generating dispatch quantity of dispatch points, which comprises the steps of positioning the current position of a target waybill, wherein the target waybill comprises a transportation route; according to the transportation route, matching a transportation station and a passing sequence which the target waybill needs to pass through; according to the passing sequence, determining the preset number of the transport stations, which are about to pass through the target waybill, as target transport stations; when the target transport station comprises a dispatch point, updating the quantity to be dispatched corresponding to the dispatch point, and the dispatch point can conveniently know the quantity of the express to be dispatched according to the updated quantity to be dispatched, so that the dispatch point is convenient to prepare in advance, and the dispatch efficiency of the dispatch point is improved;
further, the application also proposes to predict the estimated time for the target waybill to arrive at each of the target transportation stations according to the current location and the location of the target transportation station; pushing a waybill arrival message to each target transport station, wherein the message comprises the target waybill and the predicted time, and each transport station can know the quantity of the waybills to be arrived and plan in advance according to the received push message, so that the transfer efficiency of the transport station is improved;
the method and the system also have the advantages that the quantity of the target shipping slips which are expected to be reached by each date of the target shipping stations is counted, visual display is performed, management staff are convenient to monitor the arrival condition of each shipping station, so that adjustment is performed in time, and the operation efficiency of the whole line is improved.
All of the products of the present invention need not have all of the effects described above.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a projected arrival single-volume display 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 application;
FIG. 4 is a block diagram of a computer system according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, 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 apparent that the described embodiments are only some embodiments of the present invention, not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
In order to help the dispatch stations to know the quantity of the shipping slips to be dispatched in advance, the application provides a dispatch point dispatch quantity generation system, which matches corresponding transportation routes according to the starting place and the destination of the target shipping slips, and determines the transportation station to be accessed by the target shipping slips according to the current position, so that a reminding message of arrival of the shipping slips is sent to the corresponding transportation station, and the processing efficiency of the transportation station is improved.
Example 1
Specifically, the scheme can be realized through the following steps:
step one, acquiring all freight notes in transportation;
specifically, each waybill includes a corresponding origin and destination.
Step two, reading a routing table, and matching preset transportation routes corresponding to each shipping list;
specifically, the system stores a pre-constructed routing table, and the routing table records a preset transportation route corresponding to each combination of a starting place and a destination, wherein the preset transportation route comprises passing transportation stations and passing sequences of the transportation stations.
For example, a destination for a waybill is the a residential area of the Shanghai and a destination for the B office building of Beijing. According to the preset transportation route from Shanghai to Beijing recorded in the routing table, the system can determine the transportation stations from A residential area to loading, then transport from Shanghai to Beijing, and the whole route from Beijing to the dispatch point, and determine the transportation stations and dispatch points passing through the transportation stations.
The transportation station comprises a transfer site and a dispatch site, wherein the transfer site comprises all transportation sites passing after a shipping bill leaves the receiving station and before the shipping site is reached, and the dispatch site is the site responsible for dispatching the shipping bill to a user.
Step three, locating the current position of each waybill;
specifically, the current position of the waybill can be determined according to the code scanning record of the waybill, the GPS positioning result of the vehicle transporting the waybill and the like. Specifically, the current location may be a transportation station, or may be a real-time location of a waybill determined according to the positioning result.
Step four, determining a transport station and a passing sequence which are not passed by the waybill according to the preset transport line and the current position;
specifically, the preset transportation route through which the waybill passes can be determined according to the current position of the waybill and the preset transportation route, so as to determine the transportation station through which the waybill does not pass and the passing sequence of the transportation stations.
Step five, determining three transport stations to be passed by each waybill according to the passing sequence;
specifically, three transport stations through which each waybill is about to 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 expected arrival time.
Specifically, the determining process of the estimated arrival time includes:
when the current position of the waybill is a transit point, the expected departure time of the waybill from the transit point is determined according to the time of the waybill reaching the current position and the preset specified loading time. Based on the distance of the current location from the nearest upcoming transportation station, a first transportation time required to reach the nearest transportation station can be predicted. Based on the distance of the most recent upcoming transport station to the second upcoming transport station, a second transport time required to reach the second upcoming transport station can be predicted. Based on the distance of the second upcoming transport station from the third upcoming transport station, a third transport time required to reach the third upcoming transport station can be predicted.
The time that the waybill arrives at the nearest upcoming transit station is the sum of the predicted departure time and the first transit time, i.e., the first predicted arrival time.
The time when the bill arrives at the second upcoming transport station is the sum of the first predicted arrival time and the prescribed loading time and the second transport time, i.e., the second predicted arrival time.
The time when the waybill arrives at the third upcoming transportation station is the sum of the second predicted arrival time and the specified loading time and the third transportation time, namely the third predicted arrival time.
Specifically, based on the estimated time of arrival, the system may count the number of waybills each station is estimated to arrive each day and generate a visual presentation page, as shown in fig. 1.
And step six, when the three to-be-passed transportation stations comprise dispatch points, updating the quantity to be dispatched corresponding to the dispatch points.
Specifically, when three shipping stations through which a certain waybill passes include dispatch points, the waybill is considered to be required to be dispatched, namely, the number of to-be-dispatched of the corresponding dispatch points is increased by one, a dispatch preparation message is sent to the corresponding dispatch points, statistics is carried out on the predicted daily to-be-dispatched amount of each dispatch point, and the predicted daily to-be-dispatched amount is returned to the corresponding dispatch points, so that dispatch preparation is carried out by the dispatch points.
Example two
Corresponding to the above embodiment, the present application provides a method for generating a dispatch amount of a dispatch, as shown in fig. 2, where the method includes:
210. locating a current position of a target waybill, the target waybill comprising a transportation route;
220. according to the transportation route, matching a transportation station and a passing sequence which the target waybill needs to pass through;
preferably, the target waybill includes a start location and a destination corresponding to the target waybill, and the matching the transportation station and the passing sequence of the target waybill according to the transportation route includes:
221. according to the starting place and the destination corresponding to the target waybill, a routing table is read to be matched with a preset transportation path corresponding to the target waybill, the routing table is used for storing preset transportation paths corresponding to the combination of each starting place and each destination, and the preset transportation paths comprise transportation stations and the passing sequence of the transportation stations;
222. and determining the transport station and the passing sequence which need to pass according to the current position of the target waybill and the corresponding preset transport path.
230. According to the passing sequence, determining the preset number of the transport stations, which are about to pass through the target waybill, as target transport stations;
240. and when the target transport station comprises a dispatch point, updating the quantity to be dispatched corresponding to the dispatch point.
Preferably, the method comprises:
250. predicting the predicted time for the target waybill to reach each target transportation station according to the current position and the position of the target transportation station;
251. a manifest arrival message is pushed to each of the target shipping stations, the message including the target manifest and the projected time.
Preferably, the predicting the predicted time for the target waybill to reach each of the target transportation stations according to the current location and the location of the target transportation station includes:
252. acquiring the arrival time of the target waybill to the current position;
253. predicting the transportation time required by the target waybill to reach each target transportation station according to the current position and the position of the target transportation station;
preferably, the predicted time comprises a date, the method comprising:
254. and counting the number of the target waybills expected to be reached by each date of the target transportation station and visually displaying the number.
And determining the estimated time for the target waybill to arrive 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 method, the application provides a device for generating the dispatch amount of a dispatch point, as shown in fig. 3, where the device includes:
a positioning module 310, configured to position a current location of a target waybill, where the target waybill includes a transportation route;
a matching module 320, configured to match, according to the transportation route, a transportation station and a passing sequence that the target waybill needs to pass through;
a processing module 330, configured to determine, according to the passing order, a preset number of the transportation stations that the target waybill is about to pass as target transportation 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 an estimated time for the target waybill to reach each of the target shipping stations based on the current location and the location of the target shipping station; a manifest arrival message is pushed to each of the target shipping 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 waybill to reach each target transportation station according to the current position and the position of the target transportation station; and determining the estimated time for the target waybill to arrive at the target transport station according to the arrival time and the transport duration.
Preferably, the target waybill includes a start location and a destination corresponding to the target waybill, and 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 location and the destination corresponding to the target waybill, where the routing table is used to store preset transportation paths corresponding to combinations of each start location and each destination, and the preset transportation paths include a transportation station and a passing sequence of the transportation station; and determining the transport station and the passing sequence which need to pass according to the current position of the target waybill and the corresponding preset transport path.
Preferably, the estimated time includes a date, and the maintenance module 340 is further operable to count and visually display the number of destination shipping orders that the destination shipping station is estimated to reach for each of the dates.
Example IV
In response to the above method, device and system, a sixth embodiment of the present application provides a computer system, including: one or more processors; and a memory associated with the one or more processors, the memory for storing program instructions that, when read for execution by the one or more processors, perform the following: locating a current position of a target waybill, the target waybill comprising a transportation route;
according to the transportation route, matching a transportation station and a passing sequence which the target waybill needs to pass through;
according to the passing sequence, determining the preset number of the transport stations, which are about to pass through the target waybill, as target transport stations;
and when the target transport station comprises a dispatch point, updating the quantity to be dispatched corresponding to the dispatch point.
FIG. 4 illustrates an architecture of a computer system, which may include 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, among others. 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 may be communicatively connected by 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 (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, etc. for executing relevant programs to implement the technical solutions provided herein.
The Memory 1520 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), a static storage device, a dynamic storage device, or the like. Memory 1520 may store an operating system 1521 for controlling the operation of computer system 1500, a Basic Input Output System (BIOS) for controlling the low-level operation of computer system 1500. In addition, a web browser 1523, a data storage management system 1524, an icon font processing system 1525, and the like may also be stored. The icon font processing system 1525 may be an application program that specifically implements the foregoing operations of the steps in the embodiments of the present application. In general, when the technical solutions provided in the present application are implemented in software or firmware, relevant program codes are stored in the memory 1520 and invoked for execution by the processor 1510. The input/output interface 1513 is used for connecting with an input/output module to realize information input and output. The input/output module may be configured as a component in a device (not shown) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.
The network interface 1514 is used to connect communication modules (not shown) to enable communication interactions of the present device with other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).
Bus 1530 includes a path for transporting information between various components of the device (e.g., processor 1510, video display adapter 1511, disk drive 1512, input/output interface 1513, network interface 1514, and memory 1520).
In addition, the computer system 1500 may also obtain information of specific acquisition conditions from the virtual resource object acquisition condition information database 1541 for making condition judgment, and so on.
It is noted that although the above devices illustrate only the processor 1510, video display adapter 1511, disk drive 1512, input/output interface 1513, network interface 1514, memory 1520, bus 1530, etc., the device may include other components necessary to achieve proper functioning in a particular implementation. Furthermore, it will be understood by those skilled in the art that the above-described apparatus may include only the components necessary to implement the present application, and not all the components shown in the drawings.
From the above description of embodiments, it will be apparent to those skilled in the art that the present application may be implemented in software plus a necessary general purpose hardware platform. Based on such understanding, the technical solutions of the present application may be embodied essentially or in a part contributing to the prior art 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, etc., and include several instructions to cause a computer device (which may be a personal computer, a cloud server, or a network device, etc.) to perform the methods described in the various embodiments or some parts of the embodiments of the present application.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for a system or system embodiment, since it is substantially similar to a method embodiment, the description is relatively simple, with reference to the description of the method embodiment being made in part. The systems and system embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
The foregoing description of the preferred embodiments of the invention is not intended to limit the invention to the precise form disclosed, and any such modifications, equivalents, and alternatives falling within the spirit and scope of the invention are intended to be included within the scope of the invention.
Claims (7)
1. A method for generating dispatch volume of a dispatch point, the method comprising:
locating a current position of a target waybill, the target waybill comprising a transportation route;
according to the transportation route, matching a transportation station and a passing sequence which the target waybill needs to pass through;
according to the passing sequence, determining the preset number of the transport stations, which are about to pass through the target waybill, as target transport stations; the preset number is more than or equal to 1;
predicting the predicted time for the target waybill to reach each target transportation station according to the current position and the position of the target transportation station; when the current position is a transit point, determining the estimated departure time of the waybill from the transit point according to the time of the waybill reaching the current position and the preset specified loading time, and predicting the estimated time required for reaching the nearest target transit station according to the transportation distance of the nearest upcoming transit station from the current position;
pushing a manifest arrival message to each of the target shipping stations, the message including the target manifest and the projected time;
and when the target transport station comprises a dispatch point, updating the quantity to be dispatched corresponding to the dispatch point.
2. The method of claim 1, wherein predicting the predicted time for the target waybill to reach each of the target shipping stations based on the current location and the location of the target shipping station comprises:
acquiring the arrival time of the target waybill to the current position;
predicting the transportation time required by the target waybill to reach each target transportation station according to the current position and the position of the target transportation station;
and determining the estimated time for the target waybill to arrive at the target transport station according to the arrival time and the transport duration.
3. The method of claim 1, wherein the transportation route includes a start location and a destination corresponding to the target waybill, and wherein matching transportation stations and order of passage the target waybill needs to pass according to the transportation route includes:
according to the starting place and the destination corresponding to the target waybill, a routing table is read to be matched with a preset transportation path corresponding to the target waybill, the routing table is used for storing preset transportation paths corresponding to the combination of each starting place and each destination, and the preset transportation paths comprise transportation stations and the passing sequence of the transportation stations;
and determining the transport station and the passing sequence which need to pass according to the current position of the target waybill and the corresponding preset transport path.
4. The method of claim 1, wherein the projected time comprises a date the target waybill was projected to reach the target shipping station, the method comprising:
and counting the number of the expected destination handbill which is corresponding to each date of the destination transportation station and visually displaying the number.
5. A method according to any one of claims 1-3, wherein the preset number is 3.
6. A dispatch amount generation device for dispatch, the device comprising:
the positioning module is used for positioning the current position of a target waybill, wherein the target waybill comprises a transportation route;
the matching module is used for matching the transport stations and the passing sequence of the target waybills according to the transport route;
the processing module is used for determining the preset number of the transport stations, which are about to pass through the target waybill, as target transport stations according to the passing sequence; the preset number is more than or equal to 1; predicting the predicted time for the target waybill to reach each target transportation station according to the current position and the position of the target transportation station; when the current position is a transit point, determining the estimated departure time of the waybill from the transit point according to the time of the waybill reaching the current position and the preset specified loading time, and predicting the estimated time required for reaching the nearest target transit station according to the transportation distance of the nearest upcoming transit station from the current position; pushing a manifest arrival message to each of the target shipping stations, the message including the target manifest and the projected time;
and the maintenance module is used for updating the quantity to be dispatched corresponding to the dispatch point when the target transport station comprises the dispatch point.
7. A computer system, the system comprising:
one or more processors;
and a memory associated with the one or more processors, the memory for storing program instructions that, when read for execution by the one or more processors, perform the following:
locating a current position of a target waybill, the target waybill comprising a transportation route;
according to the transportation route, matching a transportation station and a passing sequence which the target waybill needs to pass through;
according to the passing sequence, determining the preset number of the transport stations, which are about to pass through the target waybill, as target transport stations; the preset number is more than or equal to 1;
predicting the predicted time for the target waybill to reach each target transportation station according to the current position and the position of the target transportation station; when the current position is a transit point, determining the estimated departure time of the waybill from the transit point according to the time of the waybill reaching the current position and the preset specified loading time, and predicting the estimated time required for reaching the nearest target transit station according to the transportation distance of the nearest upcoming transit station from the current position;
pushing a manifest arrival message to each of the target shipping stations, the message including the target manifest and the projected time;
and when the target transport station comprises a dispatch point, updating the quantity to be dispatched corresponding to the dispatch point.
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 CN111652439A (en) | 2020-09-11 |
| CN111652439B true 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) |
Families Citing this family (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 |
| CN116992988A (en) * | 2022-04-21 | 2023-11-03 | 北京京东振世信息技术有限公司 | Method, device, electronic equipment and computer readable medium for splitting freight volume |
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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111652439A (en) | 2020-09-11 |
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 | |
| JP5753279B2 (en) | Courier management | |
| KR101955527B1 (en) | Method and system for providing delivery service using application running in delivery driver terminal | |
| JP2013167972A (en) | Delivery schedule management system, method for managing delivery schedule, and delivery schedule management program | |
| CN111027906A (en) | Distribution order determining method and device, storage medium and terminal equipment | |
| CN115081991A (en) | Raw material management method and device, electronic equipment and storage medium | |
| CN111275387A (en) | Automatic alarm method and system based on transport monitoring system | |
| CN111429073A (en) | Express receipt method, device, equipment and storage medium | |
| CN110969387A (en) | Order distribution method, server, terminal and system | |
| JP2009288946A (en) | Delivery response system, delivery response method, and delivery response program | |
| CN111698645A (en) | Position information acquisition method and device, computer equipment and storage medium | |
| CN115222328A (en) | Logistics tracking method, device, equipment and medium | |
| CN111325504B (en) | Method, device, system, equipment and storage medium for recommending dispatch track | |
| CN115310893A (en) | Distribution information acquisition method, device and system | |
| CN111311152B (en) | Method, device, system, equipment and storage medium for recommending dispatch route | |
| WO2014040133A1 (en) | A system and method for providing an indication of an anticipated time of arrival of a courier at a predetermined waypoint | |
| KR102262840B1 (en) | Visit parcel delivery service system using code invoice and method of providing visit parcel delivery service | |
| CN113780923A (en) | Method and device for sending piece, electronic equipment and medium | |
| KR20110127550A (en) | Work management system using smart phone | |
| CN112488624A (en) | Logistics routing information calculation method, device, equipment and storage medium | |
| US20200065742A1 (en) | Information processing apparatus, information processing method, and non-transitory storage medium | |
| CN113706032B (en) | Order form and charge management method and device | |
| CN116227777B (en) | Stroke information processing method and electronic equipment | |
| CN112365206A (en) | Express scanning data return abnormity early warning method and device |
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 |