CN111461383A - Method and device for planning distribution path - Google Patents
Method and device for planning distribution path Download PDFInfo
- Publication number
- CN111461383A CN111461383A CN201910193457.1A CN201910193457A CN111461383A CN 111461383 A CN111461383 A CN 111461383A CN 201910193457 A CN201910193457 A CN 201910193457A CN 111461383 A CN111461383 A CN 111461383A
- Authority
- CN
- China
- Prior art keywords
- user
- delivery
- distribution
- planning
- priority
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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
Abstract
The invention discloses a method and a device for planning a distribution path, and relates to the field of warehouse logistics. One embodiment of the method comprises: for user goods which are carried by a distribution tool and correspond to user orders, determining the distribution priority of the user goods according to user order configuration information, user position information, a distribution path algorithm model and constraint conditions, wherein the user order configuration information indicates preference information of user goods delivery; and planning a delivery path of the delivery tool according to the delivery priority. The implementation method solves the technical problems of low distribution efficiency and poor user experience in the prior art, further reduces time overhead and cost overhead caused by repeated distribution of the logistics terminal, and improves the overall distribution efficiency of logistics and the technical effect of user experience.
Description
Technical Field
The invention relates to the field of warehouse logistics, in particular to a method and a device for planning a delivery path.
Background
The distribution is a component of a logistics system, and is a logistics activity directly facing to a client, and the service level and the fineness of the distribution directly influence the satisfaction degree of the client on the whole logistics service. The reasonable optimization of the distribution route influences the transportation mileage, the time expenditure and the cost expenditure of the whole logistics process.
Vehicle Routing distribution (VRP) during distribution is a classical combinatorial optimization Problem. At present, a vehicle path planning method mainly researches an optimal vehicle use scheme and a vehicle route scheme which meet certain constraint conditions (such as the cargo demand of a customer, vehicle capacity limitation, delivery and delivery time, vehicle mileage limitation and the like).
Generally, to simplify the solution of the vehicle path problem, the vehicle path problem is often decomposed into one or more basic problems by constructing an integer programming model or a related graph theory model, and then the optimal solution is obtained by using a corresponding mature basic theory.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
(1) under the scene without a proxy sign-in address (such as a logistics post station) or a proxy sign-in person, if a user is not near the receiving address in a distribution time period, the distribution time of distribution personnel is delayed, so that the overall distribution efficiency of logistics is reduced, and the subsequent distribution is required to be repeated, so that the time overhead and the cost overhead of the same batch of goods are increased;
(2) in the vehicle path planning process, the main consideration is how to use the fewest delivery vehicles and how to adopt the shortest vehicle driving path, and the consideration of the matching degree of the actual position information of the user end and the receiving address is lacked, so that the user experience is influenced;
(3) under the delivery scene that adopts unmanned aerial vehicle or unmanned car, because need discern the identity of addressee, if the user does not cause near delivery address in the delivery time quantum user's goods can't sign for, not only occupied the transport capacity of unmanned aerial vehicle or unmanned car like this, still lead to the holistic delivery speed of commodity circulation to reduce, caused the waste of electric power resource simultaneously.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for planning a delivery path, which can combine delivery time of a logistics terminal with preference information delivered by a user, reduce time overhead and cost overhead caused by repeated delivery of the logistics terminal, and improve overall delivery efficiency and user experience of logistics.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of planning a delivery path, including: for user goods which are carried by a distribution tool and correspond to user orders, determining the distribution priority of the user goods according to user order configuration information, user position information, a distribution path algorithm model and constraint conditions, wherein the user order configuration information indicates preference information of user goods delivery; and planning a distribution path of the distribution tool according to the distribution priority.
In an embodiment of the present invention, the user order configuration information includes one or more of the following: whether the delivery address is a delivery-on-behalf address, whether the user sets a delivery-on-behalf person, whether the user allows access to the location information, and whether the user specifies a delivery time period.
In an embodiment of the invention, the distribution path algorithm model is an integer programming model or a graph theory model.
In an embodiment of the invention, the constraint condition includes one or more of the following: distance constraints, time constraints, delivery tool number constraints, cost constraints.
In an embodiment of the present invention, the distribution priority of the user goods corresponding to the user order is adjusted according to the weighting factor for the user order.
In an embodiment of the present invention, the weight coefficient of the user order is determined according to the matching degree between the user order configuration information and/or the user location information and the receiving address indicated by the user order.
In an embodiment of the present invention, the weight coefficient of the user order is adjusted according to the matching degree between the actual delivery path and the planned delivery path.
In an embodiment of the present invention, the delivery priority is periodically adjusted according to the matching degree between the user order configuration information and/or the user location information and the receiving address indicated by the user order.
According to another aspect of the embodiments of the present invention, there is provided an apparatus for planning a delivery route, the apparatus including: the distribution priority determining module is used for determining the distribution priority of the user goods according to user order configuration information, user position information, a distribution path algorithm model and constraint conditions, wherein the user order configuration information indicates preference information of user goods delivery; and the distribution path planning module is used for planning the distribution path of the distribution tool according to the distribution priority.
In an embodiment of the invention, the user order configuration information includes one or more of the following: whether the delivery address is a delivery-on-behalf address, whether the user sets a delivery-on-behalf person, whether the user allows access to the location information, and whether the user specifies a delivery time period.
In an embodiment of the invention, the distribution path algorithm model is an integer programming model or a graph theory model.
In an embodiment of the invention, the constraint condition includes one or more of the following: distance constraints, time constraints, delivery tool number constraints, cost constraints.
In an embodiment of the present invention, the distribution priority determining module is further configured to: and adjusting the distribution priority of the user goods corresponding to the user order according to the weight coefficient for the user order.
In an embodiment of the present invention, the distribution priority determining module is further configured to: and determining the weight coefficient of the user order according to the matching degree of the user order configuration information and/or the user position information and the receiving address indicated by the user order.
In an embodiment of the present invention, the distribution priority determining module is further configured to: and adjusting the weight coefficient of the user order according to the matching degree of the actual delivery path and the planned delivery path.
In an embodiment of the present invention, the distribution priority determining module is further configured to: and periodically adjusting the distribution priority according to the matching degree of the user order configuration information and/or the user position information and the receiving address indicated by the user order.
According to another aspect of the embodiments of the present invention, there is provided a terminal apparatus, including: one or more processors; storage means for storing one or more programs which, when executed by one or more processors, cause the one or more processors to carry out a method according to any one of the preceding claims.
According to 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 a processor, performs the method of any one of the above.
One embodiment of the above invention has the following advantages or benefits: the distribution priority of the user goods is determined according to the user order configuration information, the user position information, the distribution path algorithm model and the constraint conditions, wherein the user order configuration information indicates the preference information of the delivery of the user goods, and then the distribution path of the distribution tool is planned according to the distribution priority, so that the technical problems of low distribution efficiency and poor user experience in the prior art are solved, the time overhead and the cost overhead caused by repeated distribution of the logistics terminal are reduced, and the overall distribution efficiency of logistics and the technical effect of user experience are improved.
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 view of a main flow of a method of planning a delivery path according to a first embodiment of the present invention;
fig. 2 is a schematic view of a main flow of a method of planning a delivery path according to a second embodiment of the present invention;
fig. 3 is a schematic diagram of main modules of an apparatus for planning delivery routes according to an embodiment of the present invention;
FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 5 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 a main flow of a method for planning a delivery route according to a first embodiment of the present invention, and as shown in fig. 1, the method for planning a delivery route according to the embodiment of the present invention mainly includes the following steps:
step S101: for user goods carried by a delivery tool and corresponding to a user order, determining delivery priority of the user goods according to user order configuration information, user position information, a delivery path algorithm model and constraint conditions, wherein the user order configuration information indicates preference information of delivery of the user goods. In the use scenario of the present invention, the delivery tools include delivery vehicles, unmanned aerial vehicles, and the like.
In an embodiment of the present invention, in order to improve user experience, the user order configuration information may be further set, specifically including one or more of the following: whether the delivery address is a delivery-on-behalf address, whether the user sets a delivery-on-behalf person, whether the user allows access to the location information, and whether the user specifies a delivery time period. The goods collecting and replacing address can be a post house, an express cabinet, an intelligent cabinet and the like, and is used for temporarily storing user goods and automatically taking the goods when the user is left for convenience. The delivery time period can be selected to be multiple, and the delivery time period can be appropriately refined, for example, in units of 15, 20 and 30 minutes, so as to further improve the user experience.
Further, in order to facilitate subsequent planning of the distribution path, a distribution path algorithm model needs to be considered when determining the distribution priority, and specifically, in an embodiment of the present invention, the distribution path algorithm model is an integer planning model or a graph theory model. In the conventional distribution path planning, the logistics terminal distribution problem can be decomposed into basic problems such as a traveler problem, a knapsack problem, a shortest path problem, a minimum cost flow problem and the like through a distribution path algorithm model, and then an optimal solution is obtained by using a corresponding mature basic theory such as a branch-and-bound method, a secant plane method, a linear programming method, a dynamic programming method, a Lagrange relaxation technology and the like, so that the conventional distribution path is obtained. The conventional distribution route is taken into consideration to determine the distribution priority, so that the distribution efficiency can be effectively improved.
Further, in order to enable the distribution route obtained by subsequent planning to have a more optimized distribution mileage scheme, a time overhead scheme, a distribution tool number scheme, a cost overhead scheme, and the like, the corresponding constraint conditions need to be considered when determining the distribution priority, and in an embodiment of the present invention, the constraint conditions include one or more of the following: distance constraints, time constraints, delivery tool number constraints, cost constraints. The distance constraint means that in the distribution process of the same batch of user goods, the whole distribution distance is optimized to be as short as possible; the time constraint means that in the distribution process of the same batch of user goods, the whole distribution time is optimized to be as short as possible; the distribution tool quantity constraint represents that in the distribution process of the same batch of user goods, the number of used distribution tools is optimized to be as small as possible; cost constraints mean that during the distribution of the same batch of customer goods, the optimization makes the overall distribution cost as low as possible.
In another embodiment of the present invention, in order to further improve the delivery efficiency and the user experience, the delivery priority of the user goods corresponding to the user order needs to be adjusted according to the weighting factor for the user order. The weight coefficient of the user order is determined according to the matching degree of the user order configuration information and/or the user position information and the receiving address indicated by the user order. Specifically, when the receiving address is a delivery substitute address, the weight coefficient of the user order is improved; when the user is provided with the agent, the weight coefficient of the order of the user is improved; when a user designates a specific distribution time period, the weight coefficient of the order of the user is improved; when the user allows to access the position information, the weight coefficient of the order of the user is reduced/improved according to the distance between the real-time position of the user displayed by the position information and the receiving address of the user. Similarly, a priority factor can be set for each user order, the priority factor and the weight factor represent similar meanings, and the delivery priority corresponding to the user order assigned with the higher weight factor or the priority factor is higher, so that in the subsequent path planning process, in order to reach the optimal delivery path, the user goods with the delivery priority will be delivered preferentially according to the planning result.
In addition, in order to further optimize the method for planning the delivery path, improve the accuracy, perform feedback correction on the planned delivery path according to the actual delivery path, and continuously optimize and improve the delivery efficiency and the user experience, in an embodiment of the present invention, the weight coefficient of the corresponding user order may be adjusted according to the matching degree of the actual delivery path and the planned delivery path, so as to adjust the delivery priority of the user goods.
In another embodiment of the present invention, the delivery priority of the user order needs to be periodically adjusted according to the matching degree between the user order configuration information and/or the user location information and the receiving address indicated by the user order. The reason why the delivery priority is periodically adjusted is that the actual position of the user is moved, and if delivery is performed only according to the user position information at the start of delivery, and delivery efficiency may be reduced when a delivery tool arrives at a delivery address because the user is not near the delivery address, the delivery priority of the user order is periodically adjusted according to the matching degree of the user order configuration information and/or the user position information and the delivery address indicated by the user order, and the overall delivery efficiency can be significantly improved. The adjustment period of the delivery priority may be a fixed time length, for example, every 15 minutes, 30 minutes, 60 minutes, and the like from the time of delivery, and the specific time length may be set according to the actual situation; it may also be set to make one adjustment for each completed delivery of a customer's goods.
Step S102: and planning a delivery path of the delivery tool according to the delivery priority and the real-time position information of the delivery tool and the user. In step S101, the distribution priority is determined, the distribution order of the same batch of user goods is planned according to the distribution priority corresponding to the user goods, and the user goods corresponding to the user order with the higher priority are preferentially distributed to obtain the distribution path of the distribution tool.
According to the method for planning the delivery path, the delivery priority of the user goods is determined according to the user order configuration information, the user position information, the delivery path algorithm model and the constraint conditions, wherein the user order configuration information indicates the preference information of the delivery of the user goods, and then the delivery path of the delivery tool is planned according to the delivery priority, so that the technical problems of low delivery efficiency and poor user experience in the prior art are solved, the time overhead and the cost overhead caused by repeated delivery of the logistics terminal are reduced, and the overall delivery efficiency of the logistics and the technical effect of the user experience are improved.
Fig. 2 is a schematic diagram of a main flow of a method for planning a delivery route according to a second embodiment of the present invention, and as shown in fig. 2, the method for planning a delivery route according to the embodiment of the present invention mainly includes the following steps:
step 201, the order distribution system distributes the same batch of user orders to be distributed to the distribution center. An area is divided into areas (e.g., a city), and one or more distribution centers are established for each area. And the order distribution system distributes the user orders to the corresponding distribution centers according to the receiving addresses in the user orders. The user order comprises user order configuration information.
Step S202, initializing a priority of the user order and/or the user goods corresponding to the user order. In one embodiment, the user orders/goods to be delivered in the same batch are set to have the same priority, for example, the second priority, and the same weighting coefficients, for example, the weighting coefficients are all 1.
Step S203, determining whether the user designates a distribution time period according to the user order configuration information. If the judgment result is yes, go to step S206, namely, increase the weighting factor of the user order; if the determination result is "no", step S207 is performed, i.e., the weighting factor of the user order is decreased.
And step S204, judging whether the receiving address is a delivery substitute address or not by combining the user order configuration information, and whether a delivery substitute receiver is arranged by the user or not. If the judgment result is yes, go to step S206, namely, increase the weighting factor of the user order; if the determination result is "no", step S207 is performed, i.e., the weighting factor of the user order is decreased.
And step S205, judging whether the real-time position is matched with the receiving address or not by combining the configuration information of the user order. If the judgment result is yes, go to step S206, namely, increase the weighting factor of the user order; if the determination result is "no", step S207 is performed, i.e., the weighting factor of the user order is decreased. Whether the user is allowed to access the position information is specified by the user in the user order configuration information, if the user is allowed, the real-time position of the user is obtained, and then the weight coefficient of the user order/goods is correspondingly increased or decreased according to the matching degree of the real-time position and the goods receiving address, such as the distance between the real-time position and the goods receiving address; if not, the weighting factor for the user order/good is lowered.
Step S206, the weight coefficient of the corresponding order is increased. For example, the weighting factor of the corresponding order is set to 1.2, 1.5, etc., that is, the weighting factor of the corresponding order is greater than 1, and the specific value setting is determined according to the above determination result.
Step S207, the weight coefficient of the corresponding order is reduced. For example, the weighting factor of the corresponding order is set to 0.5, 0.8, etc., that is, the weighting factor of the corresponding order is less than 1, and the specific value setting is determined according to the above judgment result.
In step S208, the distribution priority is determined. The user orders assigned with higher weighting factors correspond to higher delivery priorities, such as the first priority. The user orders assigned with the lower weighting factor correspond to a lower delivery priority, such as the third priority. Wherein, the high-low order of priority is as follows in sequence: a first priority, a second priority, and a third priority. The distribution priority is determined according to the weight coefficient, the user position information, a distribution path algorithm model and a constraint condition (not shown in the figure). It should be noted that the process of determining the distribution priority is not limited to the above conditions, and the adjustment of the weight coefficient is not limited to the above judgment conditions.
Step S209, the distribution center collects the real-time geographic locations of the distribution tools and the users.
Step S210, planning a distribution route of the distribution tool according to the determined distribution priority and the real-time location information of the distribution tool and the user. Wherein the priority level is high for preferential delivery.
Step S211, pushing the distribution route to the distribution terminal. The distribution terminal may be a handheld terminal of a distributor or a route guidance terminal of an unmanned distribution tool.
In step S212, it is determined whether the delivery route generation time is 15 minutes. If the determination result is "no", returning to step S211, and maintaining the obtained distribution route; if the judgment result is yes, the process returns to step S208 to re-determine the distribution priority and plan the distribution route. The step is to periodically adjust the distribution priority of the user order and update the distribution path in real time, so that the distribution efficiency and the user experience are further improved. It should be noted that the setting of 15 minutes is only one embodiment of the present invention, and the duration of the adjustment period can be adaptively adjusted according to actual situations in different delivery scenarios.
From the above description, it can be seen that, because the distribution priority is determined according to the user order configuration information, the user location information, the distribution path algorithm model and the constraint conditions, where the user order configuration information indicates the preference information of the user for delivering goods, the technical problems of low distribution efficiency and poor user experience in the prior art are overcome, so that the time overhead and the cost overhead caused by repeated distribution at the logistics terminal are reduced, and the overall distribution efficiency and the user experience of logistics are improved.
FIG. 3 is a schematic diagram of the main modules of the apparatus for planning delivery routes according to the embodiment of the present invention; as shown in fig. 3, an apparatus for planning a distribution route according to an embodiment of the present invention mainly includes:
the delivery priority determining module 301 is configured to determine, for a user cargo carried by a delivery tool and corresponding to a user order, a delivery priority of the user cargo according to user order configuration information, user location information, a delivery path algorithm model, and a constraint condition, where the user order configuration information indicates preference information for delivery of the user cargo. By the technical scheme provided by the invention, different user cargos have distribution priorities,
wherein the user order configuration information comprises one or more of the following: whether the delivery address is a delivery-on-behalf address, whether the user sets a delivery-on-behalf person, whether the user allows access to the location information, and whether the user specifies a delivery time period. The distribution path algorithm model is an integer programming model or a graph theory model. The constraints include one or more of the following: distance constraints, time constraints, delivery tool number constraints, cost constraints.
The delivery priority determination module 301 of the present invention is further configured to: and adjusting the distribution priority of the user goods corresponding to the user order according to the weight coefficient for the user order.
Further, the dispatch priority determination module 301 is further configured to: and determining the weight coefficient of the user order according to the matching degree of the user order configuration information and/or the user position information and the receiving address indicated by the user order.
Further, in an embodiment of the present invention, the dispatch priority determining module 301 is further configured to: and adjusting the weight coefficient of the user order according to the matching degree of the actual delivery path and the planned delivery path.
In an embodiment of the present invention, the dispatch priority determining module 301 is further configured to: and periodically adjusting the distribution priority according to the matching degree of the user order configuration information and/or the user position information and the receiving address indicated by the user order.
A delivery path planning module 302 for planning a delivery path of the delivery tool according to the delivery priority.
From the above description, it can be seen that, because the distribution priority is determined according to the user order configuration information, the user location information, the distribution path algorithm model and the constraint conditions, where the user order configuration information indicates the preference information of the user for delivering goods, the technical problems of low distribution efficiency and poor user experience in the prior art are overcome, so that the time overhead and the cost overhead caused by repeated distribution at the logistics terminal are reduced, and the overall distribution efficiency and the user experience of logistics are improved.
Fig. 4 illustrates an exemplary system architecture 400 of a method of planning a delivery route or an apparatus for planning a delivery route to which an embodiment of the present invention may be applied.
As shown in fig. 4, the system architecture 400 may include terminal devices 401, 402, 403, a network 404, and a server 405. The network 404 serves as a medium for providing communication links between the terminal devices 401, 402, 403 and the server 405. Network 404 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use terminal devices 401, 402, 403 to interact with a server 405 over a network 404 to receive or send messages or the like. The terminal devices 401, 402, 403 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 401, 402, 403 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 405 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the terminal devices 401, 402, 403. The backend 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 (for example, target push information, product information — just an example) to the terminal device.
It should be noted that the method for planning the delivery route provided by the embodiment of the present invention is generally executed by the server 405, and accordingly, the apparatus for planning the delivery route is generally disposed in the server 405.
It should be understood that the number of terminal devices, networks, and servers in fig. 4 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 5, shown is a block diagram of a computer system 500 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 5 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. 5, the computer system 500 includes a Central Processing Unit (CPU)501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data necessary for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
To the I/O interface 505, AN input section 506 including a keyboard, a mouse, and the like, AN output section 507 including a keyboard such as a Cathode Ray Tube (CRT), a liquid crystal display (L CD), and the like, a speaker, and the like, a storage section 508 including a hard disk and the like, and a communication section 509 including a network interface card such as a L AN card, a modem, and the like, the communication section 509 performs communication processing via a network such as the internet, a drive 510 is also connected to the I/O interface 505 as necessary, a removable medium 511 such as a magnetic disk, AN optical disk, a magneto-optical disk, a semiconductor memory, and the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure 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 flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 501.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may 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 suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable 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, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also 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 flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a determination module and a processing module. Wherein the names of the modules do not in some cases constitute a limitation of the module itself.
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; 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: for customer shipments carried by a distribution tool corresponding to a customer order, determining a distribution priority for the customer shipments based on one or more of: the method comprises the steps that user order configuration information, user position information, user goods size, user goods weight, a distribution path algorithm model and constraint conditions are obtained, wherein the user order configuration information indicates preference information of user goods delivery; and planning a delivery path of the delivery tool according to the delivery priority.
According to the technical scheme of the embodiment of the invention, the distribution priority is determined according to the user order configuration information, the user position information, the distribution path algorithm model and the constraint conditions, wherein the user order configuration information indicates the preference information of user goods delivery, so that the technical problems of low distribution efficiency and poor user experience in the prior art are solved, the time overhead and the cost overhead caused by repeated distribution of the logistics terminal are further reduced, and the overall distribution efficiency and the user experience of logistics are improved.
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 (18)
1. A method of planning a delivery route, comprising:
for user goods which are carried by a distribution tool and correspond to a user order, determining the distribution priority of the user goods according to user order configuration information, user position information, a distribution path algorithm model and constraint conditions, wherein the user order configuration information indicates preference information of user goods delivery;
and planning a delivery path of the delivery tool according to the delivery priority.
2. The method of planning a delivery path of claim 1, wherein the user order configuration information comprises one or more of:
whether the delivery address is a delivery-on-behalf address, whether the user sets a delivery-on-behalf person, whether the user allows access to the location information, and whether the user specifies a delivery time period.
3. The method for planning a delivery path according to claim 1, wherein the delivery path algorithm model is an integer programming model or a graph theory model.
4. The method of planning a delivery route according to claim 1, wherein the constraints comprise one or more of: distance constraints, time constraints, delivery tool number constraints, cost constraints.
5. The method for planning a delivery path according to any one of claims 1 to 4, wherein a delivery priority of the user goods corresponding to the user order is adjusted according to a weight coefficient for the user order.
6. The method for planning a distribution path according to claim 5, wherein the weighting factor of the user order is determined according to the matching degree of the user order configuration information and/or the user location information and the receiving address indicated by the user order.
7. The method for planning a distribution path according to claim 5, wherein the weight coefficient of the user order is adjusted according to a matching degree of the actual distribution path and the planned distribution path.
8. The method for planning a delivery path according to any one of claims 6 or 7, wherein the delivery priority is adjusted periodically according to a matching degree of the user order configuration information and/or the user location information with a receiving address indicated by the user order.
9. An apparatus for planning a delivery route, the apparatus comprising:
the distribution priority determining module is used for determining the distribution priority of the user goods according to user order configuration information, user position information, a distribution path algorithm model and constraint conditions, wherein the user order configuration information indicates preference information of user goods delivery;
and the distribution path planning module is used for planning the distribution path of the distribution tool according to the distribution priority.
10. The apparatus for planning a delivery path of claim 9, wherein the user order configuration information comprises one or more of:
whether the delivery address is a delivery-on-behalf address, whether the user sets a delivery-on-behalf person, whether the user allows access to the location information, and whether the user specifies a delivery time period.
11. The apparatus for planning a distribution route according to claim 9, wherein the distribution route algorithm model is an integer programming model or a graph theory model.
12. The apparatus for planning a delivery route according to claim 9, wherein the constraint condition comprises one or more of: distance constraints, time constraints, delivery tool number constraints, cost constraints.
13. The apparatus for planning a delivery path according to any one of claims 9 to 12, wherein the delivery priority determination module is further configured to:
and adjusting the distribution priority of the user goods corresponding to the user order according to the weight coefficient for the user order.
14. The apparatus for planning a delivery route according to claim 13, wherein the delivery priority determining module is further configured to:
and determining a weight coefficient of the user order according to the matching degree of the user order configuration information and/or the user position information and a receiving address indicated by the user order.
15. The apparatus for planning a delivery route according to claim 13, wherein the delivery priority determining module is further configured to:
and adjusting the weight coefficient of the user order according to the matching degree of the actual delivery path and the planned delivery path.
16. The apparatus for planning a delivery path according to any one of claims 14 or 15, wherein the delivery priority determination module is further configured to:
and periodically adjusting the distribution priority according to the matching degree of the user order configuration information and/or the user position information and the receiving address indicated by the user order.
17. A terminal device, characterized in that the terminal device comprises:
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-8.
18. A computer-readable medium, on which a computer program is stored, which program, when being executed by a processor, is adapted to carry out the method of any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910193457.1A CN111461383A (en) | 2019-03-14 | 2019-03-14 | Method and device for planning distribution path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910193457.1A CN111461383A (en) | 2019-03-14 | 2019-03-14 | Method and device for planning distribution path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111461383A true CN111461383A (en) | 2020-07-28 |
Family
ID=71679107
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910193457.1A Pending CN111461383A (en) | 2019-03-14 | 2019-03-14 | Method and device for planning distribution path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111461383A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111942795A (en) * | 2020-08-17 | 2020-11-17 | 东华大学 | Operation efficiency evaluation method for four-way vehicle dense warehousing system |
| CN113506056A (en) * | 2021-06-23 | 2021-10-15 | 广州佳帆计算机有限公司 | Shuttle vehicle path planning method and device |
| WO2022147722A1 (en) * | 2021-01-07 | 2022-07-14 | Nokia Shanghai Bell Co., Ltd. | Smart efficient parcel delivery system |
| CN117387634A (en) * | 2023-12-13 | 2024-01-12 | 江西啄木蜂科技有限公司 | Color-changing wood forest zone unmanned aerial vehicle path multi-target planning method based on user preference |
| CN117436776A (en) * | 2023-12-19 | 2024-01-23 | 广东鑫港湾供应链管理有限公司 | Supply chain intelligent logistics distribution management system |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110258134A1 (en) * | 2010-04-16 | 2011-10-20 | Klassic Corporation | Method and system for providing adaptive processing and delivery of food catering orders |
| CN103473612A (en) * | 2013-09-06 | 2013-12-25 | 周伟华 | Site selection and transportation optimization method for super-large scale logistics distribution |
| CN105868843A (en) * | 2016-03-22 | 2016-08-17 | 南京邮电大学 | Route planning method oriented to goods delivery |
| CN106296100A (en) * | 2016-08-19 | 2017-01-04 | 河南易之信网络科技有限公司 | The management method of a kind of cross-border logistics business, Apparatus and system |
| CN107145971A (en) * | 2017-04-18 | 2017-09-08 | 苏州工业职业技术学院 | A kind of express delivery dispatching optimization method of dynamic adjustment |
| CN107180370A (en) * | 2016-03-10 | 2017-09-19 | 阿里巴巴集团控股有限公司 | Merchandise items information processing method, apparatus and system |
| CN107358325A (en) * | 2017-07-19 | 2017-11-17 | 武汉轻工大学 | A kind of Location Selection of Logistics Distribution Center method, apparatus and computer-readable recording medium |
| CN107918839A (en) * | 2016-10-08 | 2018-04-17 | 阿里巴巴集团控股有限公司 | A kind of sequence information processing method, apparatus and system |
| CN108681845A (en) * | 2018-08-13 | 2018-10-19 | 叶苑庭 | A kind of wisdom logistics worksheet processing management system based on big data |
| CN108921470A (en) * | 2018-06-26 | 2018-11-30 | 广东步同城网络科技有限公司 | Method, apparatus, computer equipment and the storage medium of order delivery management |
| CN109002960A (en) * | 2018-06-12 | 2018-12-14 | 广东工业大学 | It is a kind of based on the online order of scoring and path planning distribution and allocator |
| CN109345161A (en) * | 2018-08-29 | 2019-02-15 | 广西大学 | A kind of delivery assignment method towards monetary value flow |
| CN109447535A (en) * | 2018-08-28 | 2019-03-08 | 浙江工业大学 | A kind of colleges and universities' take-away Logistics Distribution Method based on GIS |
-
2019
- 2019-03-14 CN CN201910193457.1A patent/CN111461383A/en active Pending
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110258134A1 (en) * | 2010-04-16 | 2011-10-20 | Klassic Corporation | Method and system for providing adaptive processing and delivery of food catering orders |
| CN103473612A (en) * | 2013-09-06 | 2013-12-25 | 周伟华 | Site selection and transportation optimization method for super-large scale logistics distribution |
| CN107180370A (en) * | 2016-03-10 | 2017-09-19 | 阿里巴巴集团控股有限公司 | Merchandise items information processing method, apparatus and system |
| CN105868843A (en) * | 2016-03-22 | 2016-08-17 | 南京邮电大学 | Route planning method oriented to goods delivery |
| CN106296100A (en) * | 2016-08-19 | 2017-01-04 | 河南易之信网络科技有限公司 | The management method of a kind of cross-border logistics business, Apparatus and system |
| CN107918839A (en) * | 2016-10-08 | 2018-04-17 | 阿里巴巴集团控股有限公司 | A kind of sequence information processing method, apparatus and system |
| CN107145971A (en) * | 2017-04-18 | 2017-09-08 | 苏州工业职业技术学院 | A kind of express delivery dispatching optimization method of dynamic adjustment |
| CN107358325A (en) * | 2017-07-19 | 2017-11-17 | 武汉轻工大学 | A kind of Location Selection of Logistics Distribution Center method, apparatus and computer-readable recording medium |
| CN109002960A (en) * | 2018-06-12 | 2018-12-14 | 广东工业大学 | It is a kind of based on the online order of scoring and path planning distribution and allocator |
| CN108921470A (en) * | 2018-06-26 | 2018-11-30 | 广东步同城网络科技有限公司 | Method, apparatus, computer equipment and the storage medium of order delivery management |
| CN108681845A (en) * | 2018-08-13 | 2018-10-19 | 叶苑庭 | A kind of wisdom logistics worksheet processing management system based on big data |
| CN109447535A (en) * | 2018-08-28 | 2019-03-08 | 浙江工业大学 | A kind of colleges and universities' take-away Logistics Distribution Method based on GIS |
| CN109345161A (en) * | 2018-08-29 | 2019-02-15 | 广西大学 | A kind of delivery assignment method towards monetary value flow |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111942795A (en) * | 2020-08-17 | 2020-11-17 | 东华大学 | Operation efficiency evaluation method for four-way vehicle dense warehousing system |
| CN111942795B (en) * | 2020-08-17 | 2021-11-12 | 东华大学 | Operation efficiency evaluation method for four-way vehicle dense warehousing system |
| WO2022147722A1 (en) * | 2021-01-07 | 2022-07-14 | Nokia Shanghai Bell Co., Ltd. | Smart efficient parcel delivery system |
| CN113506056A (en) * | 2021-06-23 | 2021-10-15 | 广州佳帆计算机有限公司 | Shuttle vehicle path planning method and device |
| CN117387634A (en) * | 2023-12-13 | 2024-01-12 | 江西啄木蜂科技有限公司 | Color-changing wood forest zone unmanned aerial vehicle path multi-target planning method based on user preference |
| CN117387634B (en) * | 2023-12-13 | 2024-02-27 | 江西啄木蜂科技有限公司 | Color-changing wood forest zone unmanned aerial vehicle path multi-target planning method based on user preference |
| CN117436776A (en) * | 2023-12-19 | 2024-01-23 | 广东鑫港湾供应链管理有限公司 | Supply chain intelligent logistics distribution management system |
| CN117436776B (en) * | 2023-12-19 | 2024-03-29 | 广东鑫港湾供应链管理有限公司 | Supply chain intelligent logistics distribution management system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111461383A (en) | Method and device for planning distribution path | |
| CN108492068B (en) | Method and device for path planning | |
| EP3806013A1 (en) | Method and apparatus for carrying shelf | |
| CN111553548A (en) | Goods picking method and device | |
| US20210312359A1 (en) | Method and device for scheduling automated guided vehicle | |
| CN109345166B (en) | Method and apparatus for generating information | |
| CN113259144A (en) | Storage network planning method and device | |
| CN110648089A (en) | Method and device for determining delivery timeliness of articles | |
| CN107633358B (en) | Facility site selection and distribution method and device | |
| CN109934427B (en) | Method and device for generating item distribution scheme | |
| CN111044062B (en) | Path planning and recommending method and device | |
| CN113205300B (en) | Distribution vehicle scheduling method and device, electronic equipment and computer readable medium | |
| CN110858332B (en) | Order production method and device | |
| CN110930080A (en) | Logistics distribution method and device | |
| CN108898435A (en) | Session data processing method and system, computer system and readable storage medium storing program for executing | |
| CN113449895A (en) | Vehicle dispatching method and device | |
| CN113222205A (en) | Path planning method and device | |
| CN112520284A (en) | Shelf storage position adjusting method and system | |
| CN113762674B (en) | Order distribution method and device | |
| CN113077106A (en) | Time window-based article transportation method and device | |
| CN112486033A (en) | Simulation test method and device for equipment | |
| CN113706064A (en) | Order processing method and device | |
| CN113537676A (en) | Method and device for determining completion time of transportation task | |
| CN111144601A (en) | Path planning method and device | |
| CN112651536A (en) | Method and device for determining delivery address |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200728 |