CN112766555A - Same-city logistics capacity scheduling system and method - Google Patents
Same-city logistics capacity scheduling system and method Download PDFInfo
- Publication number
- CN112766555A CN112766555A CN202110042573.0A CN202110042573A CN112766555A CN 112766555 A CN112766555 A CN 112766555A CN 202110042573 A CN202110042573 A CN 202110042573A CN 112766555 A CN112766555 A CN 112766555A
- Authority
- CN
- China
- Prior art keywords
- dispatching
- point
- logistics
- dispatcher
- coincidence
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman 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
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
-
- 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/0836—Recipient pick-ups
Abstract
The invention relates to the field of cargo transportation, in particular to a method and a system for scheduling the logistics capacity in the same city, wherein the method comprises the following steps: acquiring current logistics order information, wherein the logistics order information comprises a delivery address and a receiving address; determining the coincidence degree between the dispatching paths of all current logistics order information; and under the condition that the contact ratio meets the preset condition, taking a preset contact point in at least two delivery paths corresponding to the contact ratio as a dispatching point, wherein the dispatching point is used for transferring goods. Aiming at the problem of how to improve the efficiency of logistics distribution, a method and a system for scheduling the logistics capacity in the same city are provided.
Description
Technical Field
The invention relates to the field of cargo transportation, in particular to a method and a system for scheduling the logistics capacity in the same city.
Background
In recent years, with rapid economic development, the coverage of online shopping is wider and wider, many people can choose online shopping in clothes and food residences, and with the continuous expansion of the online shopping demands of users, the demands of not less people are not limited to next day or multiple days, and the purchases of medicines and foods or living necessities usually need to be completed within a certain time.
The distribution time of goods is more and more strict with people shopping online. Resulting in increasingly intense competition among logistics companies. The logistics distribution process comprises four aspects of distribution, delivery and distribution. The logistics distribution vehicle path planning during distribution is the most important ring in the whole logistics distribution process. The distribution route is reasonably selected, so that the distribution speed can be effectively increased, and the distribution cost is reduced. The method comprises the steps of planning paths for multi-target logistics distribution in the same city, and selecting the path with the lowest cost from the aspect of path planning, so that the distribution efficiency is higher, and the transportation cost is lower.
The prior art provides a same-city logistics multipoint distribution path planning system aiming at the problems, which comprises a server side and a logistics vehicle, and also comprises position information which is acquired by the server side and used for distributing an article to be distributed to a plurality of target points through the logistics vehicle, wherein the plurality of target points are positive integers greater than or equal to zeta; and the server side sends the planned path to the logistics vehicle according to the current position information of the logistics vehicle and the position information of the target points, and the logistics vehicle runs according to the received planned path. The invention solves the problem of path planning of multi-target point logistics distribution in same city logistics distribution in life, greatly improves the distribution efficiency in same city logistics distribution and reduces the distribution cost.
Above-mentioned technical scheme is when transporting many goods to a rider with the city, carry out a reasonable path planning, usually the goods delivery in same city often is that a plurality of riders correspond a plurality of users of a plurality of trade companies, so a plurality of users and a plurality of trade companies just the condition that exists easily is that a plurality of riders go to same target and dispatch or get goods, then a plurality of riders are too high in route overlap ratio in getting goods and dispatching this moment, this dispatch that can a rider accomplish or get goods by a plurality of riders go to, this condition has just caused the waste of rider manpower resources and rider time, make delivery efficiency high enough, the efficiency of delivery is not high enough
For the above situation, how to deal with the problem that the contact ratio of the paths of a plurality of riders in the same city logistics after reasonable path planning is performed is too high in goods taking and dispatching, which causes the waste of manpower resources and rider time of the riders, how to further be a more efficient way for logistics distribution, and how to solve the technical problem which needs to be solved urgently at present.
Disclosure of Invention
The invention provides a same-city logistics transport capacity scheduling system and method, aiming at the problem that the coincidence degree of paths of a plurality of riders in the existing same-city logistics is too high in goods taking and dispatching, so that the manpower resources and the rider time are wasted.
In order to solve the technical problem, the present application provides the following technical solutions:
the same-city logistics transportation capacity scheduling method comprises the following steps:
acquiring current logistics order information, wherein the logistics order information comprises a delivery address and a receiving address;
determining the coincidence degree between the dispatching paths of all current logistics order information;
and under the condition that the contact ratio meets the preset condition, taking a preset contact point in at least two delivery paths corresponding to the contact ratio as a dispatching point, wherein the dispatching point is used for transferring goods.
Has the advantages that: by calculating the contact ratio among the plurality of delivery paths and determining a contact point as a dispatching point, different deliverers can obtain goods of the other side according to the logistics order information of other people, and obtain the goods of the deliverers at the dispatching point to finish the delivery, so that the delivery process is more flexible, and the logistics transportation efficiency is improved.
Further, the current logistics information comprises position information of a dispatcher, wherein the dispatcher is used for transporting goods from a delivery address to an addressee;
determining the coincidence degree between the delivery paths with the current logistics order information, comprising the following steps:
and determining the coincidence degree of the paths between the current position of each dispatcher and a target place as the coincidence degree of the dispatching paths, wherein the target place is a sending address or a receiving address.
Has the advantages that: the higher the degree of coincidence between the current position of each dispatcher and the target site, the closer the relative distance between the dispatcher and the target site, and the more efficient the logistics maneuver.
Further, the preset conditions include at least one of:
the contact ratio is highest;
and under the condition that the target places of the two dispatchers are the respective dispatching addresses and the coincidence degree of the dispatching paths between the respective dispatching addresses and the receiving addresses is greater than the preset coincidence degree, the distances from the two dispatchers to the opposite target places are smaller than the distances from the two dispatchers to the target places of the two dispatchers.
Has the advantages that: the coincidence degree of the dispatching paths is high, and the distances from the two dispatchers to the target places of the opposite parties are smaller than the distances from the two dispatchers to the target places of the two dispatchers, so that the actual dispatching distance of the dispatched dispatchers is smaller than the original dispatching distance, and the logistics dispatching cost is saved.
Further, using a preset coincidence point in at least two delivery paths corresponding to the coincidence degree as a scheduling point includes:
the preset overlapping point is a point at which the sum of at least two dispatch paths is shortest.
Has the advantages that: by selecting the place which enables the sum of the two delivery paths to be shortest as the dispatching point, and the delivery points are originally places which need to be passed by respectively, the path of a certain delivery person is not increased, namely, under the condition, the total delivery path is relatively shortened, and the delivery cost is saved.
Further, after the preset coincidence point in the at least two delivery paths corresponding to the coincidence degree is taken as the scheduling point, the method includes:
calculating the time interval between two dispatchers to reach the dispatching point;
and if the time interval is smaller than the preset time interval, respectively informing two dispatchers of logistics scheduling information, wherein the logistics scheduling information comprises logistics order information and scheduling points of the other dispatcher.
Has the advantages that: if the time interval between the two dispatchers and the dispatching point is smaller than the preset time interval, the waiting time of one party at the dispatching point is not too long after the logistics dispatching, namely the dispatching time is not increased while the dispatching route is shortened, and the dispatching efficiency is improved.
Further, after the preset coincidence point in the at least two delivery paths corresponding to the coincidence degree is taken as the scheduling point, the method includes:
updating the position information of another dispatcher in real time;
and guiding the dispatchers of the two dispatching paths to respectively pick up the goods from the dispatching place of the other dispatcher, and transferring the respective goods at the dispatching point.
Has the advantages that: the position information of another dispatcher is updated in real time, so that the dispatcher can know the information of the other dispatcher in time, and the dispatching point can be reached in time.
With city logistics capacity dispatch system includes:
the order information acquisition module is used for acquiring current logistics order information, wherein the logistics order information comprises a delivery address and a receiving address;
the coincidence degree calculation module is used for determining coincidence degrees among the dispatching paths of all current logistics order information;
and the scheduling module is used for taking preset coincidence points in at least two delivery paths corresponding to the coincidence degrees as scheduling points under the condition that the coincidence degrees meet preset conditions, and the scheduling points are used for transferring goods.
Has the advantages that: by calculating the contact ratio among the plurality of delivery paths and determining a contact point as a dispatching point, different deliverers can obtain goods of the other side according to the logistics order information of other people, and obtain the goods of the deliverers at the dispatching point to finish the delivery, so that the delivery process is more flexible, and the logistics transportation efficiency is improved.
Drawings
Fig. 1 is a schematic flow chart illustrating a method for scheduling transportation capacity of the same city logistics according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an embodiment of the same-city logistics capacity scheduling system provided in the present invention.
Detailed Description
The following is further detailed by way of specific embodiments:
example one
As shown in fig. 1, the method for scheduling transportation capacity of the same city logistics of the embodiment includes the following steps:
step S11: and acquiring current logistics order information, wherein the logistics order information comprises a delivery address and a receiving address.
In the embodiment of the present disclosure, the logistics order information may be take-away order information, the sending address may be a merchant address, and the receiving address may be a customer address, that is, a delivery address for ordering. The current logistics order information may include a delivery time requirement, dispatcher information, and a delivery path from the delivery address to the recipient address, in addition to the delivery address and the recipient address. The dispatcher information may include information such as the current location of the dispatcher and the contact information of the dispatcher. Wherein the dispatcher is used to ship goods from the shipping address to the receiving address. Optionally, the sending address and the receiving address belong to the same city.
The method for acquiring the current logistics order information can be obtained from a database, wherein the database can be connected with a merchant platform and a client terminal and is used for collecting and storing merchant information, merchant address information, client ordering information and goods distribution address information in the merchant platform. The client terminal is used for client information management, and the merchant platform is connected with the client terminal, manages merchant information and provides the client for ordering. Wherein, the time for acquiring the current logistics order information may be the generation time of the new logistics order. That is, if a new logistics order is generated, the step of acquiring the information of the current logistics order is executed. Alternatively, only the logistics order information in the same city as the newly generated order is acquired. For example, when a take-out order is newly generated, acquisition of information of the take-out order in the same city is started. Certainly, the obtained current logistics information is invisible to the customer, the merchant and the dispatcher, so that the privacy of each party of the logistics order is protected.
Step S12: and determining the coincidence degree between the delivery paths of all current logistics order information.
The method for determining the coincidence degree between the delivery paths of all current logistics order information comprises the following steps: the coincidence degree of the paths between the current position of each dispatcher and the target place is determined as the coincidence degree between the dispatching paths. Wherein the destination may be a distribution address or a reception address. For example, the current location of the first dispatcher is at location A, the destination is at location B, the current location of the second dispatcher is at location B, the destination is at location C, wherein if the second dispatcher needs to go to location C, the second dispatcher must pass through location A, the first dispatcher's dispatch route is A-B, and the second dispatcher's dispatch route is B-A-C, and the coincident route is the route between A and B. Of course, in other embodiments, the dispatch path may be a path that calculates the entire process of dispatching the dispatcher to the dispatch address and then to the dispatch address. The degree of coincidence refers to the degree of coincidence of the delivery paths. The higher the degree of coincidence between the current position of each dispatcher and the target site, the closer the relative distance between the dispatcher and the target site, and the more efficient the logistics maneuver.
Wherein, the preset condition may be at least one of the following: the first condition is that the degree of coincidence is highest; the highest coincidence degree means that the common path in the dispatching path passes the most. For example, the dispatch path of the first dispatcher is a-B-C-D, the dispatch path of the second dispatcher is a-B-C-E, and the dispatch path of the third dispatcher is H-J-C-D, wherein the coincidence path between the first dispatcher and the second dispatcher is a-B-C, the coincidence path between the first dispatcher and the third dispatcher is C-D, and if the distances between any two locations are the same, the coincidence degree between the first dispatcher and the second dispatcher is greater than the coincidence degree between the first dispatcher and the third dispatcher. Thus, the degree of overlap between the first and second dispatchers is highest.
The second condition is that the distances from the two dispatchers to the destination places of the two dispatchers are both smaller than the distances from the two dispatchers to the destination places of the two dispatchers under the condition that the destination places of the two dispatchers are both the respective dispatching addresses and the coincidence degree of the dispatching paths between the respective dispatching addresses and the receiving addresses is larger than the preset coincidence degree. In this case, the first courier can simply pick the goods of the second courier to the dispatch of the second courier, and the second courier picks the goods of the first courier to the dispatch of the first courier and then exchanges the respective goods to a location in the coinciding paths. By the mode, the coincidence degree of the dispatching paths is high, and the distances from the two dispatchers to the target places of the opposite parties are smaller than the distances from the two dispatchers to the target places of the two dispatchers, so that the actual dispatching distance of the dispatched dispatchers is smaller than the original dispatching distance, and the logistics dispatching cost is saved.
Step S13: and under the condition that the contact ratio meets the preset condition, taking a preset contact point in at least two delivery paths corresponding to the contact ratio as a dispatching point, wherein the dispatching point is used for transferring goods.
The preset coincidence point may be any point in the coincidence path. Optionally, the preset overlapping point is a point at which the sum of the at least two delivery paths is the shortest. That is, the preset coincidence point is a point at which the two delivery paths with the highest coincidence degree are the smallest after the logistics scheduling. Of course, the minimum value of the sum of the two dispatch paths after scheduling is smaller than the minimum value of the sum of the two dispatch paths before scheduling. The point which enables the sum of the two delivery paths to be shortest is selected as the dispatching point, and the delivery points are originally points which need to be passed by respectively, so that the path of a certain delivery person is not increased, namely, under the condition, the total delivery path is relatively shortened, and the delivery cost is saved.
Optionally, after an overlap point is preset in at least two delivery paths corresponding to the overlap ratio as a scheduling point, a time interval between two dispatchers reaching the scheduling point is calculated. I.e. the time for the two dispatchers to reach the dispatch point from the current location is calculated separately. Of course, the time that the dispatch arrives at the dispatch point from the current location may specifically include the time that the dispatch went to the dispatch location of another dispatch and the sum of the time that the item was taken and the time that the dispatch point arrived from the delivery location. And if the time interval is smaller than the preset time interval, respectively informing two dispatchers of logistics scheduling information, wherein the logistics scheduling information comprises logistics order information and scheduling points of the other dispatcher. Specifically, the logistics scheduling information is updated information of the dispatching route, for example, for a first dispatcher, the updated route information of the first dispatcher acquires the dispatched goods of a second dispatcher from a dispatching place of the second dispatcher for the current position, and then the dispatched goods are sent to a dispatching place from the dispatching place to the dispatching place after the goods which are changed by the second dispatcher and need to be dispatched by the dispatching place are sent to the receiving place from the dispatching place. That is, the recipient addresses in the logistics order information do not change for the dispatcher before and after the scheduling. Of course, in other embodiments, in order to better schedule the logistics resources, if it is determined that the corresponding delivery cost is reduced after the recipient address of each delivery person is changed, the respective recipient address may still be updated, and of course, the item delivered by the delivery person naturally needs to be updated when the recipient address is changed. Therefore, if the time interval between two dispatchers to the dispatching point is less than the preset time interval, it indicates that the waiting time of one party at the dispatching point is not too long after the logistics dispatching, that is, the dispatching time is not increased while the dispatching route is shortened, and the dispatching efficiency is improved.
In some disclosed embodiments, the time of each dispatcher from the scheduling point is calculated in real time, and if the time interval of each dispatcher from the scheduling point exceeds a preset time interval, a new scheduling point is determined again. Wherein, the new scheduling point is a place on the respective coincident path. Specifically, if an unexpected situation occurs in the dispatch process of the first dispatcher, for example, a route to the dispatch point is changed due to a wrong walk, and the time to the dispatch point is increased, but if the time interval between the first dispatcher and another dispatcher to another coincidence point in the coincidence route is smaller than the preset time interval, the another coincidence point is used as a new dispatch point, so that the waiting time of the another dispatcher is reduced. By the method, the dispatching point can be dynamically adjusted, and the logistics dispatching cost can be saved.
Of course, in other disclosed embodiments, if a dispatch exceeds a dispatch path, a coincident path between the new dispatch path and the dispatch path of another dispatch may be redetermined such that the coincident path is redetermined. In the actual logistics dispatching process, accidents such as traffic jam and the like are inevitable, so that the original dispatching path cannot be realized, a new dispatching path needs to be determined again, and if the dispatching point is still a certain coincidence point between the two original dispatching paths, the logistics dispatching cost may be increased instead, and the logistics dispatching is not facilitated. After the dispatcher exceeds the original dispatching path, the coincident path between the dispatcher and another dispatcher is determined again, so that the dispatching point is determined again, and the logistics dispatching cost is reduced.
Of course, in some disclosed embodiments, after each dispatcher is notified of the dispatch point, and each dispatcher does not pick up the goods of the other party, a certain dispatcher suddenly goes out of the original dispatch path, and finds that the certain dispatcher cannot reach any point in the original or adjusted coincident path with another dispatcher within a preset time interval according to the current address and the driving direction of the certain dispatcher, and then cancels the original dispatch point. And informing each dispatcher whether to cancel the dispatching, and if one of the dispatchers selects to cancel the dispatching, canceling the logistics dispatching. At this time, each of the dispatchers still needs to go to each of the respective goods without going to the counterpart goods and then exchanging them. After the original scheduling point is cancelled, if each dispatcher insists on continuing scheduling, the scheduling point is determined again. Of course, in other embodiments, after the dispatch point is cancelled, each dispatcher may be notified of the dispatch cancellation directly, without each dispatcher selecting. Optionally, after the dispatch points are notified to each dispatcher, and one dispatcher has taken the goods of the other side, a certain dispatcher suddenly goes out of the original dispatch path, and finds that the certain dispatcher cannot reach any point in the original or dynamically adjusted coincident path with another dispatcher within a preset time interval according to the current address and the driving direction of the certain dispatcher, and then the respective logistics order information can be selected to be exchanged. By the method, whether the dispatching is continued can be determined according to the action information of each dispatcher, and the logistics dispatching cost can be saved.
After the preset coincidence point in at least two delivery paths corresponding to the coincidence degree is taken as a scheduling point, the position information of another delivery member is updated in real time. The position information of another dispatcher is updated in real time, so that the dispatcher can know the information of the other dispatcher in time, and the dispatching point can be reached in time. Of course, after the preset coincidence point in the at least two delivery paths corresponding to the coincidence degree is used as the dispatching point, the deliverers in the two delivery paths can be guided to respectively go to the dispatching place of the other deliverer to take goods, and the respective goods are transferred at the dispatching point. Of course, the way of guidance may be to navigate to the dispatcher. Of course, the status of the other party's deliverer may also be reported in real time, such as whether or not the item has been taken, or how long it has been, how long it is expected to reach the dispatch point, and so forth.
According to the scheme, the contact degree among the plurality of delivery paths is calculated, and the contact point is determined to be the dispatching point, so that different delivery personnel can obtain the goods of the other side according to the logistics order information of other people, and obtain the goods of the dispatching personnel at the dispatching point to finish the delivery, so that the delivery process is more flexible, and the logistics transportation efficiency is improved.
Example two
As shown in fig. 2, the present embodiment provides a city logistics capacity scheduling system 20, which includes: the order information acquisition module 21, the contact ratio calculation module 22 and the scheduling module 23. The order information acquiring module 21 is configured to acquire current logistics order information, where the logistics order information includes a delivery address and a receiving address; the coincidence degree calculation module 22 is used for determining coincidence degrees among the dispatching paths of all current logistics order information; and the scheduling module 23 is configured to take preset coincidence points in the at least two delivery paths corresponding to the coincidence degrees as scheduling points when the coincidence degrees meet preset conditions, and the scheduling points are used for transferring goods.
According to the scheme, the contact degree among the plurality of delivery paths is calculated, and the contact point is determined to be the dispatching point, so that different delivery personnel can obtain the goods of the other side according to the logistics order information of other people, and obtain the goods of the dispatching personnel at the dispatching point to finish the delivery, so that the delivery process is more flexible, and the logistics transportation efficiency is improved.
The functions and functions of the modules refer to the above embodiments of the scheduling method for logistics capacity in the same city, and are not described herein again.
The foregoing is merely an example of the present invention, and common general knowledge in the field of known specific structures and characteristics is not described herein in any greater extent than that known in the art at the filing date or prior to the priority date of the application, so that those skilled in the art can now appreciate that all of the above-described techniques in this field and have the ability to apply routine experimentation before this date can be combined with one or more of the present teachings to complete and implement the present invention, and that certain typical known structures or known methods do not pose any impediments to the implementation of the present invention by those skilled in the art. It should be noted that, for those skilled in the art, without departing from the structure of the present invention, several changes and modifications can be made, which should also be regarded as the protection scope of the present invention, and these will not affect the effect of the implementation of the present invention and the practicability of the patent. The scope of the claims of the present application shall be determined by the contents of the claims, and the description of the embodiments and the like in the specification shall be used to explain the contents of the claims.
Claims (7)
1. The scheduling method of the logistics capacity in the same city is characterized by comprising the following steps:
acquiring current logistics order information, wherein the logistics order information comprises a delivery address and a receiving address;
determining the coincidence degree between the dispatching paths of all current logistics order information;
and under the condition that the contact ratio meets the preset condition, taking a preset contact point in at least two delivery paths corresponding to the contact ratio as a dispatching point, wherein the dispatching point is used for transferring goods.
2. The city logistics capacity scheduling method of claim 1, wherein the current logistics information comprises location information of a dispatcher, wherein the dispatcher is used for transporting goods from a delivery address to a receiving address;
determining the coincidence degree between the delivery paths with the current logistics order information, comprising the following steps:
and determining the coincidence degree of the paths between the current position of each dispatcher and a target place as the coincidence degree of the dispatching paths, wherein the target place is a sending address or a receiving address.
3. The method according to claim 1, wherein the preset conditions include at least one of the following conditions:
the contact ratio is highest;
and under the condition that the target places of the two dispatchers are the respective dispatching addresses and the coincidence degree of the dispatching paths between the respective dispatching addresses and the receiving addresses is greater than the preset coincidence degree, the distances from the two dispatchers to the opposite target places are smaller than the distances from the two dispatchers to the target places of the two dispatchers.
4. The method for scheduling logistics capacity in the same city according to any one of claims 1 to 3, wherein the step of using a preset coincidence point of the at least two delivery paths corresponding to the coincidence degree as the scheduling point comprises:
the preset overlapping point is a point at which the sum of at least two dispatch paths is shortest.
5. The method as claimed in claim 4, wherein the step of taking a predetermined coincidence point of the at least two dispatch paths corresponding to the coincidence degree as the dispatch point comprises:
calculating the time interval between two dispatchers to reach the dispatching point;
and if the time interval is smaller than the preset time interval, respectively informing two dispatchers of logistics scheduling information, wherein the logistics scheduling information comprises logistics order information and scheduling points of the other dispatcher.
6. The method as claimed in claim 5, wherein the step of taking a predetermined coincidence point of the at least two dispatch paths corresponding to the coincidence degree as the dispatch point comprises:
updating the position information of another dispatcher in real time;
and guiding the dispatchers of the two dispatching paths to respectively pick up the goods from the dispatching place of the other dispatcher, and transferring the respective goods at the dispatching point.
7. With city logistics capacity dispatch system, its characterized in that includes:
the order information acquisition module is used for acquiring current logistics order information, wherein the logistics order information comprises a delivery address and a receiving address;
the coincidence degree calculation module is used for determining coincidence degrees among the dispatching paths of all current logistics order information;
and the scheduling module is used for taking preset coincidence points in at least two delivery paths corresponding to the coincidence degrees as scheduling points under the condition that the coincidence degrees meet preset conditions, and the scheduling points are used for transferring goods.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110042573.0A CN112766555B (en) | 2021-01-13 | 2021-01-13 | Same-city logistics capacity scheduling system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110042573.0A CN112766555B (en) | 2021-01-13 | 2021-01-13 | Same-city logistics capacity scheduling system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112766555A true CN112766555A (en) | 2021-05-07 |
| CN112766555B CN112766555B (en) | 2023-10-20 |
Family
ID=75700115
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110042573.0A Active CN112766555B (en) | 2021-01-13 | 2021-01-13 | Same-city logistics capacity scheduling system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112766555B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113031629A (en) * | 2021-05-27 | 2021-06-25 | 德阳恒博秸油科技有限公司 | Intelligent conveying terminal for catering industry and working method thereof |
| CN114819860A (en) * | 2022-06-23 | 2022-07-29 | 武汉理工大学 | Logistics electric vehicle energy-saving optimization method and system under cargo exchange mode |
| CN116400706A (en) * | 2023-04-26 | 2023-07-07 | 巴斯夫一体化基地(广东)有限公司 | Method and device for transporting test samples and optimizing planned paths |
| CN117494922A (en) * | 2024-01-02 | 2024-02-02 | 全盛物流科技(山东)有限公司 | Logistics path planning method |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107194630A (en) * | 2017-03-31 | 2017-09-22 | 无锡漫途科技有限公司 | With city Logistic Scheduling method, apparatus and system |
| CN107886266A (en) * | 2016-09-29 | 2018-04-06 | 福特全球技术公司 | Method and apparatus for coordinating food dispatching |
| CN108364099A (en) * | 2018-02-11 | 2018-08-03 | 武汉科技大学 | A kind of logistics distribution system and allocator based on emulation |
| CN108550015A (en) * | 2018-04-24 | 2018-09-18 | 仝相宝 | A kind of quick despatch forwarding method and its system for logistics transportation |
| CN108846617A (en) * | 2018-07-05 | 2018-11-20 | 北京智行者科技有限公司 | Method of servicing is sent in full-automatic logistics pool with charge free |
| CN109214553A (en) * | 2018-08-09 | 2019-01-15 | 何晨亮 | A kind of logistics transportation method and its system for e-commerce |
| US20190204856A1 (en) * | 2017-12-28 | 2019-07-04 | Cheng-Ying Weng | Goods transporting system with an aerial machine and goods transporting method using an aerial machine |
| CN110852469A (en) * | 2019-08-27 | 2020-02-28 | 广西大学 | Method, system and medium for optimizing design of medicine logistics distribution path |
| CN111191976A (en) * | 2019-11-29 | 2020-05-22 | 北京京东乾石科技有限公司 | Dynamic path planning method and device |
| CN112183938A (en) * | 2020-09-02 | 2021-01-05 | 浙江吉城云创科技有限公司 | Logistics scheduling method and device |
-
2021
- 2021-01-13 CN CN202110042573.0A patent/CN112766555B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107886266A (en) * | 2016-09-29 | 2018-04-06 | 福特全球技术公司 | Method and apparatus for coordinating food dispatching |
| CN107194630A (en) * | 2017-03-31 | 2017-09-22 | 无锡漫途科技有限公司 | With city Logistic Scheduling method, apparatus and system |
| US20190204856A1 (en) * | 2017-12-28 | 2019-07-04 | Cheng-Ying Weng | Goods transporting system with an aerial machine and goods transporting method using an aerial machine |
| CN108364099A (en) * | 2018-02-11 | 2018-08-03 | 武汉科技大学 | A kind of logistics distribution system and allocator based on emulation |
| CN108550015A (en) * | 2018-04-24 | 2018-09-18 | 仝相宝 | A kind of quick despatch forwarding method and its system for logistics transportation |
| CN108846617A (en) * | 2018-07-05 | 2018-11-20 | 北京智行者科技有限公司 | Method of servicing is sent in full-automatic logistics pool with charge free |
| CN109214553A (en) * | 2018-08-09 | 2019-01-15 | 何晨亮 | A kind of logistics transportation method and its system for e-commerce |
| CN110852469A (en) * | 2019-08-27 | 2020-02-28 | 广西大学 | Method, system and medium for optimizing design of medicine logistics distribution path |
| CN111191976A (en) * | 2019-11-29 | 2020-05-22 | 北京京东乾石科技有限公司 | Dynamic path planning method and device |
| CN112183938A (en) * | 2020-09-02 | 2021-01-05 | 浙江吉城云创科技有限公司 | Logistics scheduling method and device |
Non-Patent Citations (5)
| Title |
|---|
| LUCA BARTOLI等: "Exact and Approximate Drone Warehouse for a Mixed Landscape Delivery System", 《2019 IEEE INTERNATIONAL CONFERENCE ON SMART COMPUTING (SMARTCOMP)》, pages 266 - 273 * |
| LUO DAN: "The applications of gsm-r system in high-speed railway", 《SOUTH CHINA UNIVERSITY OF TECHNOLOGY (PEOPLE\'S REPUBLIC OF CHINA)》 * |
| 江海: "面向同城快递配送的车辆路径问题模型与算法研究", 《中国优秀硕士学位论文全文数据库 基础科学辑》, no. 06, pages 002 - 414 * |
| 罗丹等: "基于PGSA的冷链物流配送中心选址研究", 《信息技术与信息化》, no. 12, pages 126 - 130 * |
| 靳志宏等: "O2O模式下外卖骑手的配送路径优化", 《大连海事大学学报》, vol. 45, no. 04, pages 55 - 64 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113031629A (en) * | 2021-05-27 | 2021-06-25 | 德阳恒博秸油科技有限公司 | Intelligent conveying terminal for catering industry and working method thereof |
| CN114819860A (en) * | 2022-06-23 | 2022-07-29 | 武汉理工大学 | Logistics electric vehicle energy-saving optimization method and system under cargo exchange mode |
| CN116400706A (en) * | 2023-04-26 | 2023-07-07 | 巴斯夫一体化基地(广东)有限公司 | Method and device for transporting test samples and optimizing planned paths |
| CN117494922A (en) * | 2024-01-02 | 2024-02-02 | 全盛物流科技(山东)有限公司 | Logistics path planning method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112766555B (en) | 2023-10-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112766555A (en) | Same-city logistics capacity scheduling system and method | |
| CN111328404B (en) | Warehouse and supply chain coordinator | |
| CA2465226C (en) | Method and apparatus for providing virtual capacity to a provider of services | |
| US20160019501A1 (en) | Systems, methods and computer-program products for automation of dispatch of shipment delivery order | |
| KR101910045B1 (en) | Real-time Sharing Method of Cargo Transportation Information through Cargo Information Sharing Community centered on Cloud Hub with Dynamic Routing and Safe Driving Requirements | |
| CN105069593A (en) | Logistics integrated transportation method and system based on social idle resources | |
| CN105678485A (en) | System and method for smart passenger and freight transportation | |
| CN111815210A (en) | Outdoor and indoor full-automatic unmanned distribution system and method | |
| CN110472912B (en) | Method and system for providing express delivery same-city delivery service by using network appointment vehicle | |
| KR20140031611A (en) | Home delivery system and delivery method using this | |
| CN209821882U (en) | Outdoor and indoor full-automatic unmanned distribution system | |
| KR101867456B1 (en) | Real-time Sharing Method of Cargo Transportation Information through Cargo Information Sharing Community centered on Cloud Hub with the Enforced State Change Adaptability and Allocation Stability | |
| US20180260780A1 (en) | Movable hub distribution system | |
| JP3875672B2 (en) | Joint delivery information management system | |
| CN111563708A (en) | Intelligent logistics cargo link transportation method and system | |
| CN112766557A (en) | Logistics intelligent optimization scheduling system and method | |
| CN111695859A (en) | Data processing method of rapid distribution system | |
| CN110111039B (en) | Express delivery addressee management system | |
| KR101910050B1 (en) | Real-time Sharing Method of Cargo Transportation Information through Cargo Information Sharing Community centered on Cloud Hub with State Change Adaptabiliy and Safe Driving Requirements | |
| JP2002259522A (en) | Efficiency improving system for load transportation service | |
| JP2003072951A (en) | Tracking multi service system of combined-transported cargo | |
| CN111311140A (en) | Logistics transfer method, unmanned logistics vehicle, receiving end and logistics transfer system | |
| JP6884315B2 (en) | Logistics support methods, systems and programs | |
| US20200286027A1 (en) | System and methods for last mile delivery of goods | |
| US20220012827A1 (en) | System and method for utilizing transit data to determine where a transit traveler's order is placed in an order queue |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: No. 6, 46th Floor, Unit 1, Building 15, Zone V, Wulichong Street, Nanming District, Guiyang City, Guizhou Province [Wulichong Office] Applicant after: Guizhou Yirong Technology Group Co.,Ltd. Address before: 550000 zone a, 5 / F, national digital content Industrial Park, No.31, Changling South Road, Jinyang science and Technology Industrial Park, national high tech Industrial Development Zone, Guiyang City, Guizhou Province Applicant before: Guizhou Yirong Deshang Network Technology Service Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |