CN110555642A - Method and device for determining route starting point - Google Patents
Method and device for determining route starting point Download PDFInfo
- Publication number
- CN110555642A CN110555642A CN201810552458.6A CN201810552458A CN110555642A CN 110555642 A CN110555642 A CN 110555642A CN 201810552458 A CN201810552458 A CN 201810552458A CN 110555642 A CN110555642 A CN 110555642A
- Authority
- CN
- China
- Prior art keywords
- route
- routing
- time
- starting point
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Abstract
The invention discloses a method and a device for determining a route starting point, and relates to the technical field of warehouse logistics. One embodiment of the method comprises: matching a preset route starting point according to a route end point; determining whether the preset route starting point meets a delivery condition; if not, inquiring a route starting point which meets the delivery condition and has the shortest planned route time to the route terminal point, and determining the predicted route time from the preset route starting point to the route terminal point; and when the predicted routing time is not more than the shortest planned routing time, determining the preset routing starting point as the actual routing starting point of the routing end point. According to the implementation method, the shortest route starting point can be determined by estimating the arrival time, so that the timeliness is improved, and the cost is saved.
Description
Technical Field
The invention relates to the field of warehouse logistics, in particular to a method and a device for determining a route starting point, electronic equipment and a computer readable medium.
Background
A complete e-commerce system is composed of order source, order system, storage system and logistics system. After a user finishes ordering (order source) at a website, the order system judges whether an order meets the delivery condition or not, customizes a delivery plan, selects a delivery center and a storehouse which can be produced according to an address required to be delivered by the user, then sends the delivery center and the storehouse to a storage system for printing, picking, delivering out of a warehouse and packaging, and finally sends the delivery to a client through the sorting of a logistics system and the delivery checking of delivery points. The scheduling coordination between the warehousing system and the logistics system greatly influences the delivery timeliness of the orders. The delivery time of the order is the time required for the order goods to be delivered from the delivery place to the receiving place, namely the transportation time required from the route starting point to the route ending point. Generally, the further the physical distance between the route start and route end is, the higher the required delivery cost and delivery time may be.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
The existing route aging solution is to determine whether a preset route starting point can deliver the goods, if the preset route starting point cannot deliver the goods, other deliveries which can deliver the goods are inquired, and the goods are delivered directly from the inquired route starting point no matter how long the delivery time from the delivery place to the receiving place is, for example, the preset route starting point of the order is Hangzhou, the receiving place is Shanghai, but the preset route starting point is out of stock, and the order is allocated to Harbin delivery if the preset route starting point is inquired that the Harbin can deliver the goods, so that the route of the order is prolonged from Hangzhou to Shanghai to Harbin to Shanghai, and the delivery time and the delivery cost are also increased correspondingly.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for determining a route starting point, which can determine a route starting point with the shortest time by estimating an arrival time, improve the time efficiency, and save the cost.
to achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method for determining a route start point, including: matching a preset route starting point according to a route end point; determining whether the preset route starting point is met; if not, inquiring a route starting point which meets the delivery condition and has the shortest planned route time to the route terminal point, and determining the predicted route time from the preset route starting point to the route terminal point; and when the predicted routing time is not more than the shortest planned routing time, determining the preset routing starting point as the actual routing starting point of the routing end point.
Optionally, when the predicted routing time is greater than the shortest planned routing time, determining the starting point of the route with the shortest planned routing time as the actual starting point of the route end point.
optionally, the estimated route time is equal to the sum of the arrival time of the preset route starting point and the route time from the preset route starting point to the route ending point.
optionally, the method for determining the routing time includes: determining the routing time by the deadline of each routing subtask, wherein a task from the routing start point to the routing end point comprises a plurality of routing subtasks.
to achieve the above object, according to another aspect of the embodiments of the present invention, there is provided an apparatus for determining a route start point, including: the matching module is used for matching a preset route starting point according to the route end point; the verification module is used for determining whether the preset route starting point meets the delivery condition; the query module is used for querying the route starting point which meets the delivery condition and has the shortest planned route time to the route end point if the preset route starting point does not meet the delivery condition; the routing module is used for determining the predicted routing time from the preset routing starting point to the routing end point; and the comparison module is used for determining the preset route starting point as the actual route starting point of the route end point when the predicted route time is not more than the shortest planned route time.
Optionally, the comparing module is further configured to: and when the predicted routing time is greater than the shortest planned routing time, determining the routing starting point with the shortest planned routing time as the actual routing starting point of the routing end point.
optionally, the estimated route time is equal to the sum of the arrival time of the preset route starting point and the route time of the delivery place to the route terminal point.
Optionally, the routing module is further configured to determine a routing time by an expiration time of each routing subtask, where a task from the routing start point to the routing end point includes a plurality of routing subtasks.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: one or more processors; storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to perform a method as set forth in any one of the methods of determining a route start point.
to achieve the above object, according to still another aspect of embodiments of the present invention, there is provided a computer-readable medium having stored thereon a computer program which, when executed by one or more processors, implements any one of the methods of determining a route start point.
One embodiment of the above invention has the following advantages or benefits: because the technical means of determining the estimated route time by estimating the arrival time to select the route starting point with the shortest route time is adopted, the technical problems of high cost and long route time possibly selected in the traditional method are solved, and the technical effects of saving the cost and improving the timeliness are achieved.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
Fig. 1 is a schematic diagram of the main steps of a method for determining a route start point according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a route link that a cargo passes from a route start point to a route end point;
FIG. 3 is a schematic diagram of a transit route through which goods pass from a source bin to a destination bin;
Fig. 4 is a schematic diagram of a main part of an apparatus for determining a route start point according to an embodiment of the present invention;
FIG. 5 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
Fig. 6 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
fig. 1 is a schematic diagram of main steps of a method for determining a route starting point according to an embodiment of the present invention, as shown in fig. 1:
Step S101 represents matching a preset route starting point according to a route end point; the preset route starting point refers to the position of the preset route starting point, and the preset route starting point corresponds to the route end point to form a complete route. For example, the e-commerce site may preset one or more shipping locations based on the shipping address. The route end point can be order information from an e-commerce website, and the route end point is used for indicating the position of a goods transportation route end point, such as a receiving address filled in by a user when the e-commerce website purchases goods.
Step S102 represents that whether the preset route starting point meets the delivery condition is determined; if the preset route starting point meets the delivery condition, the preset route starting point is used for delivering the goods directly, namely the preset route starting point is determined to be the route starting point corresponding to the route end point, but temporary conditions such as goods shortage and goods breakage may occur at the preset route starting point, and at the moment, the preset route starting point cannot deliver the goods immediately. The shipping condition refers to the conditions such as quantity, quality and type requirements of the goods to be transported, and can be the order information from the e-commerce website.
Step S103, inquiring a route starting point which meets the delivery condition and has the shortest planned route time to the route end point if the delivery condition is not met, and determining the predicted route time from the preset route starting point to the route end point; if the preset route starting point does not have enough goods or the quality of the goods does not meet the requirement of the delivery condition, and the preset route starting point cannot deliver the goods immediately at the moment, inquiring other delivery places (namely route starting points) which meet the delivery condition and have the shortest planned route time to the route terminal point, wherein the route time from the non-preset route starting point to the route terminal point is the planned route time.
The routing time refers to a transportation time required from a routing start point to a routing end point, for example, a transportation time required from a delivery location to a receiving location, and generally, the longer the routing distance, the longer the required routing time, and the higher the transportation cost. The shortest route time from the route starting point to the route end point can be determined to find the route starting point closest to the route end point, or the route starting point which can be transported to the route end point within the shortest time when the transportation cost is fixed. The estimated routing time is estimated to be the time required for transporting the goods to the routing terminal because the preset routing starting point cannot deliver the goods currently, and is equal to the sum of the arrival time of the preset routing starting point and the routing time from the preset routing starting point to the routing terminal, namely the time required for transporting the goods to the routing terminal after the arrival of the goods, namely the preset routing starting point and the like. The arrival duration refers to the length of the time from the current time to the preset route starting point to the shipment time (the arrival duration refers to the time when the route starting point reaches the delivery condition).
The method for determining the routing time comprises the following steps: determining the routing time by the deadline of each routing subtask, wherein a task from the routing start point to the routing end point comprises a plurality of routing subtasks. For example, the arrival of the preset route starting point is taken as a route subtask, the arrival time of the preset route starting point is taken as the deadline of the route subtask, and the expected route time comprises the duration from the arrival deadline to the current time. Further, in general, a complete routing route may include multiple transit warehouses, so that the transit between each transit warehouse may be regarded as a routing subtask, and the estimated routing time is determined by the deadline of each transit step.
For example, fig. 2 is a schematic diagram of a routing link that goods pass from a routing start point (where a warehousing system is located) to a routing end point (where a customer is located), where the warehousing system includes picking, ex-warehouse and packing routing subtasks, each subtask has an expiration time of picking, an ex-warehouse expiration time and a packing expiration time, the logistics system includes sorting, checking and delivering routing subtasks, each subtask has an expiration time of sorting, checking and delivering, and an estimated routing time is calculated according to a time length between the expiration time and a current time, for example, the current time is 8:00 am, the checking expiration time is 12:00 am, the delivering expiration time is 13:00 am, and the delivering time is 1 hour, and the estimated routing time is 6 hours.
Furthermore, the route before the goods are sent from the preset route starting point can be further refined into the flow shown in fig. 3, fig. 3 is a schematic diagram of a transit route link that the goods pass from a source bin (source location) to a destination bin (preset route starting point), and the order taking time (indicating that the order cannot be modified later), the production end time (indicating that the order starts to be scheduled for delivery), the delivery cut time and the delivery cut time of the source bin pass through the transit route link; the source collection and transportation center stops the goods pick-up time, stops the departure time and predicts the delivery time; the target collection and transportation center is used for stopping the time of sending the car to the warehouse, stopping the time of arriving at the warehouse and stopping the time of handover; and determining the arrival time of the target bin by the warehouse-in ending time and the shelf-up ending time of the target bin, and then determining the predicted routing time.
Step S104 represents determining the preset route starting point as the actual route starting point of the route end point when the predicted route time is not greater than the shortest planned route time. And when the predicted routing time is greater than the shortest routing time, determining the starting point of the route with the shortest planned routing time as the actual starting point of the route end point. The purpose of this step is to select a less expensive delivery location with a shorter route distance, while minimizing the routing time.
For example, the preset route starting point of the order is Hangzhou, the receiving place is Shanghai, but Hangzhou is out of stock, the situation that Harbin and Beijing can be delivered is found, and under the condition that the same transport means is used, the route time for transporting Harbin to Shanghai is 4 days, the route time for transporting Beijing to Shanghai is 3 days, the arrival time of Hangzhou is 1 day, and the estimated route time for transporting to Shanghai is 2 days, so the route time for transporting to Shanghai after Hangzhou arrives at the goods is shortest, and the cost is lower.
Fig. 4 is a schematic diagram of a main part of an apparatus 400 for determining a route starting point according to an embodiment of the present invention, as shown in fig. 4:
A matching module 401, configured to match a preset route starting point according to a route end point; the preset route starting point refers to the position of the preset route starting point, and the preset route starting point corresponds to the route end point to form a complete route. For example, the e-commerce site may preset one or more shipping locations based on the shipping address. The route end point can be order information from an e-commerce website, and the route end point is used for indicating the position of a goods transportation route end point, such as a receiving address filled in by a user when the e-commerce website purchases goods.
A verification module 402, configured to determine whether the preset route starting point meets a shipping condition; if the preset route starting point meets the delivery condition, the preset route starting point is used for delivering the goods directly, namely the preset route starting point is determined to be the route starting point corresponding to the route end point, but temporary conditions such as goods shortage and goods breakage may occur at the preset route starting point, and at the moment, the preset route starting point cannot deliver the goods immediately. The shipping condition refers to the conditions such as quantity, quality and type requirements of the goods to be transported, and can be the order information from the e-commerce website.
An inquiring module 403, configured to, if the preset route starting point does not satisfy the delivery condition, inquire a route starting point that satisfies the delivery condition and has a shortest planned route time to the route end point; if the preset route starting point does not have enough goods or the quality of the goods does not meet the requirement of the delivery condition, and the preset route starting point cannot immediately deliver the goods, other delivery places (namely route starting points) meeting the delivery condition are inquired. The routing time refers to a transportation time required from a routing start point to a routing end point, for example, a transportation time required from a delivery location to a receiving location, and generally, the longer the routing distance, the longer the required routing time, and the higher the transportation cost. The shortest route time from the route starting point to the route end point can be determined to find the route starting point closest to the route end point, or the route starting point which can be transported to the route end point within the shortest time when the transportation cost is fixed. The arrival duration refers to the length of the time from the current time to the preset route starting point to the shipment time (the arrival duration refers to the time when the route starting point reaches the delivery condition).
A routing module 404, configured to determine an expected routing time from the preset routing start point to the routing end point; the estimated routing time is estimated to be the time required for transporting the goods to the routing terminal because the preset routing starting point cannot deliver the goods currently, and is equal to the sum of the arrival time of the preset routing starting point and the routing time from the preset routing starting point to the routing terminal, namely the time required for transporting the goods to the routing terminal after the arrival of the goods, namely the preset routing starting point and the like. The arrival duration refers to the length of the time from the current time to the preset route starting point to the shipment time (the arrival duration refers to the time when the route starting point reaches the delivery condition).
The routing module 404 is further configured to determine a routing time by the deadline of each routing subtask, wherein the task from the routing start point to the routing end point comprises a plurality of routing subtasks.
For example, the arrival of the preset route starting point is taken as a route subtask, the arrival time of the preset route starting point is taken as the deadline of the route subtask, and the expected route time comprises the duration from the arrival deadline to the current time. Further, in general, a complete routing route may include multiple transit warehouses, so that the transit between each transit warehouse may be regarded as a routing subtask, and the estimated routing time is determined by the deadline of each transit step.
for example, fig. 2 is a schematic diagram of a routing link that goods pass from a routing start point (where a warehousing system is located) to a routing end point (where a customer is located), where the warehousing system includes picking, ex-warehouse and packing routing subtasks, each subtask has an expiration time of picking, an ex-warehouse expiration time and a packing expiration time, the logistics system includes sorting, checking and delivering routing subtasks, each subtask has an expiration time of sorting, checking and delivering, and an estimated routing time is calculated according to a time length between the expiration time and a current time, for example, the current time is 8:00 am, the checking expiration time is 12:00 am, the delivering expiration time is 13:00 am, and the delivering time is 1 hour, and the estimated routing time is 6 hours.
furthermore, the route before the goods are sent from the preset route starting point can be further refined into the flow shown in fig. 3, fig. 3 is a schematic diagram of a transit route link that the goods pass from a source bin (source location) to a destination bin (preset route starting point), and the order taking time (indicating that the order cannot be modified later), the production end time (indicating that the order starts to be scheduled for delivery), the delivery cut time and the delivery cut time of the source bin pass through the transit route link; the source collection and transportation center stops the goods pick-up time, stops the departure time and predicts the delivery time; the target collection and transportation center is used for stopping the time of sending the car to the warehouse, stopping the time of arriving at the warehouse and stopping the time of handover; and determining the arrival time of the target bin by the warehouse-in ending time and the shelf-up ending time of the target bin, and then determining the predicted routing time.
A comparing module 405, configured to determine that the preset starting point of the route is the actual starting point of the route end point when the predicted route time is not greater than the shortest planned route time. The comparison module 405 is further configured to: and when the predicted routing time is greater than the shortest planned routing time, determining the routing starting point with the shortest planned routing time as the actual routing starting point of the routing end point. The purpose is to select a destination with a short routing distance and low cost on the premise of shortest routing time.
For example, the preset route starting point of the order is Hangzhou, the receiving place is Shanghai, but Hangzhou is out of stock, the situation that Harbin and Beijing can be delivered is found, and under the condition that the same transport means is used, the route time for transporting Harbin to Shanghai is 4 days, the route time for transporting Beijing to Shanghai is 3 days, the arrival time of Hangzhou is 1 day, and the estimated route time for transporting to Shanghai is 2 days, so the route time for transporting to Shanghai after Hangzhou arrives at the goods is shortest, and the cost is lower.
Fig. 5 illustrates an exemplary system architecture 500 of a method or apparatus for determining a route start point to which embodiments of the invention may be applied.
As shown in fig. 5, the system architecture 500 may include terminal devices 501, 502, 503, a network 504, and a server 505. The network 504 serves to provide a medium for communication links between the terminal devices 501, 502, 503 and the server 505. Network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 501, 502, 503 to interact with a server 505 over a network 504 to receive or send messages or the like. The terminal devices 501, 502, 503 may have various communication client applications installed thereon, such as a shopping application, a web browser application, a search application, an instant messaging tool, a mailbox client, social platform software, and the like.
the terminal devices 501, 502, 503 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
the server 505 may be a server that provides various services, such as a background management server that supports shopping websites browsed by users using the terminal devices 501, 502, 503. The background management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (e.g., target push information and product information) to the terminal device.
it should be noted that, a method for determining a route starting point provided by the embodiment of the present invention is generally executed by the server 505, and accordingly, an apparatus for determining a route starting point is generally disposed in the server 505.
It should be understood that the number of terminal devices, networks, and servers in fig. 5 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
FIG. 6 is a block diagram illustrating a computer system 600 suitable for implementing a terminal device according to an embodiment of the invention. The terminal device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
in particular, the processes described in the above step diagrams may be implemented as computer software programs, according to embodiments of the present disclosure. For example, the disclosed embodiments of the invention include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the step diagrams. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 601.
It should be noted that the computer readable media shown in the present invention include computer readable signal media or computer readable storage media, or any combination of the two. A computer readable storage medium includes, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, semiconductor system, apparatus, or device, or any combination of the foregoing. Computer-readable storage media specifically include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any combination of the foregoing. In the present invention, a computer readable storage medium includes any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device; a computer readable signal medium includes a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave, which may take many forms, including, but not limited to, electromagnetic signals, optical signals, or any combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF (radio frequency), etc., or any combination of the preceding.
the block diagrams or step diagrams in the figures, which illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention, may each represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or step diagrams, and combinations of blocks in the block diagrams or step diagrams, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules or units described in the embodiments of the present invention may be implemented by software, or may be implemented by hardware. The described modules or units may also be provided in a processor, and may be described as: a processor includes a matching module, a verification module, a query module, a routing module, and a comparison module. The names of these modules or units do not in some cases constitute a limitation to the modules or units themselves, and for example, the matching module may also be described as a "module for matching a preset route start point according to a route end point".
On the other hand, the embodiment of the present invention also provides a computer-readable medium, which may be included in the apparatus described in the above embodiment; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: matching a preset route starting point according to a route end point; determining whether the preset route starting point meets a delivery condition; if not, inquiring a route starting point which meets the delivery condition and has the shortest planned route time to the route terminal point, and determining the predicted route time from the preset route starting point to the route terminal point; and when the predicted routing time is not more than the shortest planned routing time, determining the preset routing starting point as the actual routing starting point of the routing end point.
According to the technical scheme of the embodiment of the invention, because the technical means of estimating the arrival time to determine the estimated routing time to select the routing starting point with the shortest routing time is adopted, the technical problems of high cost and long routing time possibly selected in the traditional method are solved, and the technical effects of saving the cost and improving the timeliness are further achieved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. a method for determining a starting point of a route, comprising:
Matching a preset route starting point according to a route end point;
Determining whether the preset route starting point meets a delivery condition;
If not, inquiring a route starting point which meets the delivery condition and has the shortest planned route time to the route terminal point, and determining the predicted route time from the preset route starting point to the route terminal point;
And when the predicted routing time is not more than the shortest planned routing time, determining the preset routing starting point as the actual routing starting point of the routing end point.
2. the method of claim 1, wherein when the predicted routing time is greater than the shortest planned routing time, determining a starting point of the route with the shortest planned routing time as an actual starting point of the route to the end point.
3. The method of claim 1, wherein the estimated route time is equal to a sum of a time of arrival at the preset route start point and a route time from the preset route start point to the route end point.
4. the method of claim 1, wherein determining a routing time comprises:
Determining the routing time by the deadline of each routing subtask, wherein a task from the routing start point to the routing end point comprises a plurality of routing subtasks.
5. an apparatus for determining a starting point of a route, comprising:
The matching module is used for matching a preset route starting point according to the route end point;
The verification module is used for determining whether the preset route starting point meets the delivery condition;
The query module is used for querying the route starting point which meets the delivery condition and has the shortest planned route time to the route end point if the preset route starting point does not meet the delivery condition;
The routing module is used for determining the predicted routing time from the preset routing starting point to the routing end point;
And the comparison module is used for determining the preset route starting point as the actual route starting point of the route end point when the predicted route time is not more than the shortest planned route time.
6. The apparatus of claim 5, wherein the comparison module is further configured to:
and when the predicted routing time is greater than the shortest planned routing time, determining the routing starting point with the shortest planned routing time as the actual routing starting point of the routing end point.
7. The apparatus of claim 5, wherein the estimated route time is equal to the sum of the arrival time of the preset route start point and the route time of the shipment destination to the route end point.
8. The apparatus of claim 5, wherein the routing module is further configured to determine a routing time by a deadline for each routing subtask, wherein the task from the routing start point to the routing end point comprises a plurality of routing subtasks.
9. An electronic device, comprising:
One or more processors;
A storage device for storing one or more programs,
When executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-4.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by one or more processors, carries out the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810552458.6A CN110555642A (en) | 2018-05-31 | 2018-05-31 | Method and device for determining route starting point |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810552458.6A CN110555642A (en) | 2018-05-31 | 2018-05-31 | Method and device for determining route starting point |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110555642A true CN110555642A (en) | 2019-12-10 |
Family
ID=68734645
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810552458.6A Pending CN110555642A (en) | 2018-05-31 | 2018-05-31 | Method and device for determining route starting point |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110555642A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113128933A (en) * | 2021-04-20 | 2021-07-16 | 北京京东振世信息技术有限公司 | Abnormity positioning method and device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104732368A (en) * | 2015-03-25 | 2015-06-24 | 广州天图物流有限公司 | Order route system and method |
| CN105354633A (en) * | 2015-10-26 | 2016-02-24 | 努比亚技术有限公司 | Transportation route calculation system and method |
| CN106296100A (en) * | 2016-08-19 | 2017-01-04 | 河南易之信网络科技有限公司 | The management method of a kind of cross-border logistics business, Apparatus and system |
| CN106485457A (en) * | 2016-12-27 | 2017-03-08 | 东华互联宜家数据服务有限公司 | interval logistics platform and system |
| CN107256473A (en) * | 2017-06-08 | 2017-10-17 | 北京惠赢天下网络技术有限公司 | The dispatching method of adjustment and device of a kind of standard container kinds of goods based on storage |
| CN107292547A (en) * | 2016-03-31 | 2017-10-24 | 阿里巴巴集团控股有限公司 | For the system of the method, device and the logistics distribution that determine logistics distribution |
| CN107527146A (en) * | 2017-08-23 | 2017-12-29 | 北京惠赢天下网络技术有限公司 | A kind of processing method of cargo transaction information, device, and system |
| WO2018072556A1 (en) * | 2016-10-18 | 2018-04-26 | 无锡知谷网络科技有限公司 | Logistics control method for goods, and electronic device |
-
2018
- 2018-05-31 CN CN201810552458.6A patent/CN110555642A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104732368A (en) * | 2015-03-25 | 2015-06-24 | 广州天图物流有限公司 | Order route system and method |
| CN105354633A (en) * | 2015-10-26 | 2016-02-24 | 努比亚技术有限公司 | Transportation route calculation system and method |
| CN107292547A (en) * | 2016-03-31 | 2017-10-24 | 阿里巴巴集团控股有限公司 | For the system of the method, device and the logistics distribution that determine logistics distribution |
| CN106296100A (en) * | 2016-08-19 | 2017-01-04 | 河南易之信网络科技有限公司 | The management method of a kind of cross-border logistics business, Apparatus and system |
| WO2018072556A1 (en) * | 2016-10-18 | 2018-04-26 | 无锡知谷网络科技有限公司 | Logistics control method for goods, and electronic device |
| CN106485457A (en) * | 2016-12-27 | 2017-03-08 | 东华互联宜家数据服务有限公司 | interval logistics platform and system |
| CN107256473A (en) * | 2017-06-08 | 2017-10-17 | 北京惠赢天下网络技术有限公司 | The dispatching method of adjustment and device of a kind of standard container kinds of goods based on storage |
| CN107527146A (en) * | 2017-08-23 | 2017-12-29 | 北京惠赢天下网络技术有限公司 | A kind of processing method of cargo transaction information, device, and system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113128933A (en) * | 2021-04-20 | 2021-07-16 | 北京京东振世信息技术有限公司 | Abnormity positioning method and device |
| CN113128933B (en) * | 2021-04-20 | 2023-11-03 | 北京京东振世信息技术有限公司 | Abnormality positioning method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110533353B (en) | Method and device for handling shelves | |
| CN110826831A (en) | Method and device for restocking a picking zone of a warehouse | |
| CN110348650B (en) | Order converging method and device | |
| CN111553548A (en) | Goods picking method and device | |
| CN110188969B (en) | Method and device for controlling task issuing | |
| CN111861298A (en) | Order canceling method and device | |
| CN107085754B (en) | Information output method and device | |
| CN110555642A (en) | Method and device for determining route starting point | |
| CN112101690A (en) | Article sorting method and device | |
| CN111580952A (en) | Method and apparatus for assigning a multi-tasking set to cache ways | |
| CN115390958A (en) | Task processing method and device | |
| CN113159659A (en) | Method, device, equipment and computer readable medium for updating manifest aging | |
| CN112015565B (en) | Method and device for determining task downloading queue | |
| CN114202210A (en) | Task allocation method and device | |
| CN112441364B (en) | Container warehouse-in or warehouse-back method and device for automatic warehouse | |
| CN113537676A (en) | Method and device for determining completion time of transportation task | |
| CN112446565A (en) | Method and device for matching vehicles for orders | |
| CN113487260A (en) | Method for solving after-sale problem of express delivery | |
| CN113177754A (en) | Article management method and device | |
| CN112520282B (en) | Dispatching method and device for goods to be transported | |
| CN113240367B (en) | Order processing method and system | |
| CN112785212A (en) | Transportation equipment management method and device | |
| CN113537680B (en) | Method and device for determining completion time of transportation task | |
| CN111950756A (en) | Unmanned forklift routing planning method and device | |
| CN111260269A (en) | Store order processing method and device for improving distribution efficiency |
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 |