CN113159561A - Freight scheduling method, computer-readable storage medium and computer equipment - Google Patents
Freight scheduling method, computer-readable storage medium and computer equipment Download PDFInfo
- Publication number
- CN113159561A CN113159561A CN202110407339.3A CN202110407339A CN113159561A CN 113159561 A CN113159561 A CN 113159561A CN 202110407339 A CN202110407339 A CN 202110407339A CN 113159561 A CN113159561 A CN 113159561A
- Authority
- CN
- China
- Prior art keywords
- order
- freight vehicle
- freight
- loadable
- orders
- 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
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000004590 computer program Methods 0.000 claims description 14
- 239000003016 pheromone Substances 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application is applicable to the field of logistics, and provides a freight scheduling method, a computer-readable storage medium and computer equipment. The method comprises the following steps: s103, judging whether an accessible order exists in the order set to be distributed according to the departure place, the departure time range and the remaining loadable weight or loadable volume of the freight vehicle; s104, if the accessible orders exist, selecting the optimal orders for the freight vehicles, and adding the optimal orders into an order receiving task path of the freight vehicles; updating the set of orders to be allocated for the freight vehicle and the departure location, departure time range and remaining loadable weight or loadable volume of the freight vehicle; and judging whether the updated order set to be allocated for the freight vehicle has orders or not, if not, taking the destination of the optimal order as the end point of the order receiving task path of the freight vehicle, and if so, returning to the step S103. The invention obviously improves the efficiency of distributing orders to drivers.
Description
Technical Field
The present application belongs to the field of logistics, and in particular, relates to a freight scheduling method, a computer-readable storage medium, and a computer device.
Background
In recent years, with the rapid development of the freight industry, the competition of each company is more and more intense, the distribution efficiency of goods is more and more concerned by enterprises and consumers, and how to improve the distribution efficiency of goods is a problem to be improved. For example, a company has freight transportation business in dozens of cities across the country, and after a customer places an order on a freight platform, a dispatcher assigns the order to a driver according to the experience of the dispatcher, and the driver receives the order from the destination. However, the scheduling efficiency is unstable due to the fact that the dispatchers enter and leave jobs, experience differences of the dispatchers and the like; meanwhile, the dispatcher is difficult to consider the conditions of whether the vehicle is loaded with goods, whether the vehicle can arrive within the time required by the customer, the loading rate of the vehicle and the like during dispatching, and the efficiency is low. In summary, the existing manual dispatching method has low efficiency of distributing orders to drivers.
Disclosure of Invention
The present application aims to provide a freight scheduling method, a computer-readable storage medium and a computer device, and aims to solve the problem of low efficiency of allocating orders to drivers in the existing manual scheduling manner.
In a first aspect, the present application provides a freight scheduling method, including the following steps:
s101, traversing a preset freight vehicle set;
s102, acquiring an order set to be distributed and a starting place, a starting time range and a residual loadable weight or loadable volume of the freight vehicle aiming at the current traversed freight vehicle; the order set to be distributed comprises all order information to be distributed, wherein each order information comprises an order number, a reserved time range for getting on the door, the weight and/or volume of goods, an order starting point, an order destination and a time range for the goods to reach the destination;
s103, judging whether an accessible order exists in an order set to be distributed according to a departure place, a departure time range and the remaining loadable weight or loadable volume of the freight vehicle, wherein the accessible order refers to an order in which the time of the freight vehicle reaching an order start point, the time of the freight vehicle reaching an order destination and the remaining loadable weight or loadable volume all meet the reservation time range of entering the door, the time range of the freight reaching the destination and the freight weight or volume;
s104, if an accessible order exists, adding all the accessible orders into an alternative list, then executing S105, if the accessible order does not exist, judging whether all the freight vehicles in the preset freight vehicle set are traversed, if so, ending the process, if not, traversing the next freight vehicle, and then returning to S102;
s105, selecting an optimal order for the freight vehicle in a candidate list, adding the optimal order to an order taking task path of the freight vehicle, and informing a driver of the freight vehicle of the information of the optimal order;
s106, updating the order set to be allocated for the freight vehicle and the departure place, the departure time range and the remaining loadable weight or loadable volume of the freight vehicle;
s107, judging whether the updated order set to be allocated for the freight vehicle has orders, if not, taking the destination of the optimal order as the end point of the order receiving task path of the freight vehicle, finishing allocating the order for the freight vehicle, and if so, returning to S103.
In a second aspect, the present application provides a computer-readable storage medium, which stores a computer program that, when executed by a processor, implements the steps of the shipment scheduling method as described.
In a third aspect, the present application provides a computer device comprising:
one or more processors;
a memory; and
one or more computer programs, the processor and the memory being connected by a bus, wherein the one or more computer programs are stored in the memory and configured to be executed by the one or more processors, which when executing the computer programs implement the steps of the shipment scheduling method as described.
In the present application, since the freight scheduling method includes S103, determining whether there is an accessible order in the order set to be allocated according to the departure location, the departure time range, and the remaining loadable or loadable volume of the freight vehicle; s104, if the accessible orders exist, selecting the optimal orders for the freight vehicles, and adding the optimal orders into an order receiving task path of the freight vehicles; updating the set of orders to be allocated for the freight vehicle and the departure location, departure time range and remaining loadable weight or loadable volume of the freight vehicle; and judging whether the updated order set to be allocated for the freight vehicle has orders or not, if not, taking the destination of the optimal order as the end point of the order receiving task path of the freight vehicle, and if so, returning to the step S103. The invention therefore significantly improves the efficiency of order allocation to drivers.
Drawings
Fig. 1 is a flowchart of a freight scheduling method according to an embodiment of the present application.
Fig. 2 is a block diagram illustrating a specific structure of a computer device according to an embodiment of the present disclosure.
FIG. 3 is a schematic illustration of an order taking mission path of a freight vehicle.
Detailed Description
In order to make the purpose, technical solution and beneficial effects of the present application more clear and more obvious, the present application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
In order to explain the technical solution described in the present application, the following description will be given by way of specific examples.
Please refer to fig. 1, which is a flowchart of a freight scheduling method according to an embodiment of the present application, wherein the freight scheduling method is mainly applied to a computer device for example, and the freight scheduling method according to an embodiment of the present application includes the following steps:
and S101, traversing a preset freight vehicle set.
In an embodiment of the present application, before S101, the method may further include the following steps:
the collection of freight vehicles is ordered from small to large in terms of loadable weight or loadable volume.
When the preset freight vehicle set is traversed, the preset freight vehicle set is traversed according to the sequence that the loadable weight or the loadable volume is from small to large, so that the freight vehicles with smaller loadable weight or the loadable volume are loaded fully, and the utilization rate of the freight vehicles is improved.
S102, acquiring an order set to be allocated and a departure place, a departure time range and a remaining loadable weight or loadable volume of the freight vehicle aiming at the current traversed freight vehicle.
In an embodiment of the present application, the set of orders to be allocated includes all the order information to be allocated (i.e. orders for which no driver has been assigned yet), each order information including an order number, a time frame for the appointment to go to the gate, a weight and/or volume of the goods, an order starting point, an order destination, a time frame for the goods to arrive at the destination, a customer type of the order, and the like. The appointment door time range may include an earliest time range (also referred to as a left time window) and a latest time range (also referred to as a right time window). The customer types of the order may include core customers, general customers, individual customers, and the like.
S103, judging whether an accessible order exists in the order set to be distributed according to the departure place, the departure time range and the remaining loadable weight or loadable volume of the freight vehicle, wherein the accessible order refers to an order in which the time of the freight vehicle reaching the order start point, the time of the freight vehicle reaching the order destination and the remaining loadable weight or loadable volume all meet the reserved time range of the door to the entrance, the time range of the freight reaching the destination and the freight weight or volume.
In an embodiment of the present application, the time when the freight vehicle arrives at the order start point may be calculated by calling a map according to the departure location, the departure time range, and the order start point of the freight vehicle; the time of the freight vehicle reaching the order destination is calculated according to the time of the freight vehicle reaching the order starting point and the order destination calling map.
And S104, if the accessible orders exist, adding all the accessible orders into the alternative list, then executing S105, if the accessible orders do not exist, judging whether all the freight vehicles in the preset freight vehicle set are traversed, if so, ending the process, if not, traversing the next freight vehicle, and then returning to S102.
S105, selecting an optimal order for the freight vehicle in the alternative list, adding the optimal order to an order taking task path of the freight vehicle, and informing a driver of the freight vehicle of the information of the optimal order.
Such as the order taking task path of the freight vehicle shown in figure 3.
In an embodiment of the present application, the selecting, in the candidate list, an optimal order for the freight vehicle specifically includes:
the scores of all orders in the alternative list are calculated based on one or any combination of the urgency of the order, the remaining loadable weight or volume of the freight vehicle, the driver's familiarity with the area of the route over which the order is routed, the customer type of the order, the price of the order, etc., with the highest scoring order being the order that is optimal for the freight vehicle.
For example, the higher the urgency of the order, the higher the score of the order; the closer the remaining loadable weight or loadable volume of the freight vehicle is to the weight and/or volume of the cargo, the higher the score of the order; the more familiar the driver is to the area of the route the order is taken along, the higher the score of the order; the more important the customer type of the order is, the higher the score of the order.
The following illustrates how the score s of an order j in the alternative list is calculated according to the urgency of the orderj。
And S106, updating the order set to be distributed for the freight vehicle and the departure place, the departure time range and the remaining loadable weight or loadable volume of the freight vehicle.
In an embodiment of the present application, the updating the to-be-allocated order set for the freight vehicle and the departure location, the departure time range, and the remaining loadable weight or loadable volume of the freight vehicle may specifically include:
deleting the optimal order added to the order taking task path of the freight vehicle from the order set to be allocated, updating the departure place of the freight vehicle to the order destination of the optimal order, updating the departure time range to the time range for the freight vehicle to reach the order destination of the optimal order, and updating the residual loadable weight or loadable volume to the residual loadable weight or loadable volume minus the weight or volume of the goods of the optimal order.
S107, judging whether the updated order set to be allocated for the freight vehicle has orders, if not, taking the destination of the optimal order as the end point of the order receiving task path of the freight vehicle, finishing allocating the order for the freight vehicle, and if so, returning to S103.
An embodiment of the present application provides a computer-readable storage medium, which stores a computer program, and the computer program, when executed by a processor, implements the steps of the freight scheduling method provided by an embodiment of the present application.
Fig. 2 shows a specific block diagram of a computer device provided in an embodiment of the present application, where the computer device 100 includes: one or more processors 101, a memory 102, and one or more computer programs, wherein the processors 101 and the memory 102 are connected by a bus, the one or more computer programs are stored in the memory 102 and configured to be executed by the one or more processors 101, and the processor 101 implements the steps of the shipment scheduling method as provided by an embodiment of the present application when executing the computer programs. The computer equipment comprises a server, a terminal and the like. The computer device may be a desktop computer, a mobile terminal or a vehicle-mounted device, and the mobile terminal includes at least one of a mobile phone, a tablet computer, a personal digital assistant or a wearable device.
In the present application, since the freight scheduling method includes S103, determining whether there is an accessible order in the order set to be allocated according to the departure location, the departure time range, and the remaining loadable or loadable volume of the freight vehicle; s104, if the accessible orders exist, selecting the optimal orders for the freight vehicles, and adding the optimal orders into an order receiving task path of the freight vehicles; updating the set of orders to be allocated for the freight vehicle and the departure location, departure time range and remaining loadable weight or loadable volume of the freight vehicle; and judging whether the updated order set to be allocated for the freight vehicle has orders or not, if not, taking the destination of the optimal order as the end point of the order receiving task path of the freight vehicle, and if so, returning to the step S103. The invention therefore significantly improves the efficiency of order allocation to drivers.
It should be understood that the steps in the embodiments of the present application are not necessarily performed in the order indicated by the step numbers. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in various embodiments may include multiple sub-steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of performing the sub-steps or stages is not necessarily sequential, but may be performed alternately or alternately with other steps or at least some of the sub-steps or stages of other steps.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the program is executed. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above examples only show some embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A freight scheduling method is characterized by comprising the following steps:
s101, traversing a preset freight vehicle set;
s102, acquiring an order set to be distributed and a starting place, a starting time range and a residual loadable weight or loadable volume of the freight vehicle aiming at the current traversed freight vehicle; the order set to be distributed comprises all order information to be distributed, wherein each order information comprises an order number, a reserved time range for getting on the door, the weight and/or volume of goods, an order starting point, an order destination and a time range for the goods to reach the destination;
s103, judging whether an accessible order exists in an order set to be distributed according to a departure place, a departure time range and the remaining loadable weight or loadable volume of the freight vehicle, wherein the accessible order refers to an order in which the time of the freight vehicle reaching an order start point, the time of the freight vehicle reaching an order destination and the remaining loadable weight or loadable volume all meet the reservation time range of entering the door, the time range of the freight reaching the destination and the freight weight or volume;
s104, if an accessible order exists, adding all the accessible orders into an alternative list, then executing S105, if the accessible order does not exist, judging whether all the freight vehicles in the preset freight vehicle set are traversed, if so, ending the process, if not, traversing the next freight vehicle, and then returning to S102;
s105, selecting an optimal order for the freight vehicle in a candidate list, adding the optimal order to an order taking task path of the freight vehicle, and informing a driver of the freight vehicle of the information of the optimal order;
s106, updating the order set to be allocated for the freight vehicle and the departure place, the departure time range and the remaining loadable weight or loadable volume of the freight vehicle;
s107, judging whether the updated order set to be allocated for the freight vehicle has orders, if not, taking the destination of the optimal order as the end point of the order receiving task path of the freight vehicle, finishing allocating the order for the freight vehicle, and if so, returning to S103.
2. The method of claim 1, wherein prior to S101, the method further comprises the steps of:
sorting the collection of freight vehicles from small to large in terms of loadable weight or loadable volume;
and when traversing the preset freight vehicle set, traversing the preset freight vehicle set from small to large according to the loadable weight or the loadable volume.
3. The method of claim 1, wherein each order information further comprises a customer type of the order.
4. The method of claim 1, wherein the appointment door time horizon comprises an earliest time horizon and a latest time horizon.
5. The method of claim 1, wherein the time for the freight vehicle to reach the order origin is calculated by calling up a map based on the departure location, departure time range, and order origin of the freight vehicle; the time of the freight vehicle reaching the order destination is calculated according to the time of the freight vehicle reaching the order starting point and the order destination calling map.
6. The method of claim 1, wherein selecting, in the alternative list, an order that is optimal for the freight vehicle specifically comprises:
calculating the scores of all orders in the alternative list according to one or any combination of the urgency of the order, the remaining loadable weight or loadable volume of the freight vehicle, the driver's familiarity with the route area via which the order is routed, the customer type of the order, the price of the order, and taking the highest scoring order as the order that is optimal for the freight vehicle.
7. The method of claim 6, wherein the score s for order j in the alternative list is calculated based on the urgency of the orderjThe method specifically comprises the following steps:
8. The method of claim 1, wherein the updating the set of orders to be allocated for the freight vehicle and the departure location, departure time range, and remaining loadable weight or volume of the freight vehicle comprises in particular:
deleting the optimal order added to the order taking task path of the freight vehicle from the order set to be allocated, updating the departure place of the freight vehicle to the order destination of the optimal order, updating the departure time range to the time range for the freight vehicle to reach the order destination of the optimal order, and updating the residual loadable weight or loadable volume to the residual loadable weight or loadable volume minus the weight or volume of the goods of the optimal order.
9. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of a freight scheduling method according to any one of claims 1 to 8.
10. A computer device, comprising:
one or more processors;
a memory; and
one or more computer programs, the processor and the memory being connected by a bus, wherein the one or more computer programs are stored in the memory and configured to be executed by the one or more processors, wherein the steps of the shipment scheduling method according to any of claims 1 to 8 are implemented when the computer programs are executed by the processors.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110407339.3A CN113159561A (en) | 2021-04-15 | 2021-04-15 | Freight scheduling method, computer-readable storage medium and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110407339.3A CN113159561A (en) | 2021-04-15 | 2021-04-15 | Freight scheduling method, computer-readable storage medium and computer equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113159561A true CN113159561A (en) | 2021-07-23 |
Family
ID=76867889
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110407339.3A Pending CN113159561A (en) | 2021-04-15 | 2021-04-15 | Freight scheduling method, computer-readable storage medium and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113159561A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113592282A (en) * | 2021-07-26 | 2021-11-02 | 北京沃东天骏信息技术有限公司 | Article distribution method and device |
| CN113723675A (en) * | 2021-08-20 | 2021-11-30 | 深圳依时货拉拉科技有限公司 | Automatic dispatching method for part collecting pieces and computer equipment |
| CN114386871A (en) * | 2022-01-18 | 2022-04-22 | 浙江木桐花开科技有限公司 | Scheduling method and system for improving transportation efficiency, computer equipment and storage medium |
| CN115235501A (en) * | 2022-09-20 | 2022-10-25 | 江苏天一航空工业股份有限公司 | Logistics bulk cargo loading vehicle driving track planning control system and method |
| CN117649164A (en) * | 2024-01-30 | 2024-03-05 | 四川宽窄智慧物流有限责任公司 | Gradient distribution method and system for overall cargo management |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070194912A1 (en) * | 2006-01-10 | 2007-08-23 | Lg Chem, Ltd. | Method for optimal multi-vehicle dispatch and system for the same |
| CN107195175A (en) * | 2016-03-14 | 2017-09-22 | 滴滴（中国）科技有限公司 | A kind of order allocation method and system |
| CN107239919A (en) * | 2017-05-23 | 2017-10-10 | 深圳大学 | A kind of distribute leaflets method and device based on same city express delivery |
| CN110009272A (en) * | 2019-02-21 | 2019-07-12 | 深圳市北斗智能科技有限公司 | More strategies parallel logistic resources dispatching method and relevant apparatus |
| CN110310057A (en) * | 2019-04-08 | 2019-10-08 | 顺丰科技有限公司 | Kinds of goods sequence and goods yard processing method, device, equipment and its storage medium |
| CN110414883A (en) * | 2019-06-20 | 2019-11-05 | 天津五八到家科技有限公司 | Cargo transport and ordering method, equipment and storage medium |
| CN110956375A (en) * | 2019-11-19 | 2020-04-03 | 北京三快在线科技有限公司 | Order processing method and device |
| CN111080048A (en) * | 2018-10-22 | 2020-04-28 | 北京嘀嘀无限科技发展有限公司 | Order dispatching method and device for reserving order of taxi taking, electronic equipment and storage medium |
-
2021
- 2021-04-15 CN CN202110407339.3A patent/CN113159561A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070194912A1 (en) * | 2006-01-10 | 2007-08-23 | Lg Chem, Ltd. | Method for optimal multi-vehicle dispatch and system for the same |
| CN107195175A (en) * | 2016-03-14 | 2017-09-22 | 滴滴（中国）科技有限公司 | A kind of order allocation method and system |
| CN107239919A (en) * | 2017-05-23 | 2017-10-10 | 深圳大学 | A kind of distribute leaflets method and device based on same city express delivery |
| CN111080048A (en) * | 2018-10-22 | 2020-04-28 | 北京嘀嘀无限科技发展有限公司 | Order dispatching method and device for reserving order of taxi taking, electronic equipment and storage medium |
| CN110009272A (en) * | 2019-02-21 | 2019-07-12 | 深圳市北斗智能科技有限公司 | More strategies parallel logistic resources dispatching method and relevant apparatus |
| CN110310057A (en) * | 2019-04-08 | 2019-10-08 | 顺丰科技有限公司 | Kinds of goods sequence and goods yard processing method, device, equipment and its storage medium |
| CN110414883A (en) * | 2019-06-20 | 2019-11-05 | 天津五八到家科技有限公司 | Cargo transport and ordering method, equipment and storage medium |
| CN110956375A (en) * | 2019-11-19 | 2020-04-03 | 北京三快在线科技有限公司 | Order processing method and device |
Non-Patent Citations (2)
| Title |
|---|
| 李文莉;李昆鹏;阮文意;: "家电送装一体化车辆路径问题建模与求解", 系统工程, no. 12 * |
| 黎继子;张念;刘春玲;: "基于全渠道设计的众包供应链订单生产决策优化", 计算机集成制造系统, no. 05 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113592282A (en) * | 2021-07-26 | 2021-11-02 | 北京沃东天骏信息技术有限公司 | Article distribution method and device |
| WO2023005653A1 (en) * | 2021-07-26 | 2023-02-02 | 北京沃东天骏信息技术有限公司 | Article allocation method and apparatus |
| CN113723675A (en) * | 2021-08-20 | 2021-11-30 | 深圳依时货拉拉科技有限公司 | Automatic dispatching method for part collecting pieces and computer equipment |
| CN113723675B (en) * | 2021-08-20 | 2024-03-26 | 深圳依时货拉拉科技有限公司 | Automatic scheduling method for spare parts and components and computer equipment |
| CN114386871A (en) * | 2022-01-18 | 2022-04-22 | 浙江木桐花开科技有限公司 | Scheduling method and system for improving transportation efficiency, computer equipment and storage medium |
| CN115235501A (en) * | 2022-09-20 | 2022-10-25 | 江苏天一航空工业股份有限公司 | Logistics bulk cargo loading vehicle driving track planning control system and method |
| CN115235501B (en) * | 2022-09-20 | 2022-12-09 | 江苏天一航空工业股份有限公司 | Logistics bulk cargo loading vehicle driving track planning control system and method |
| CN117649164A (en) * | 2024-01-30 | 2024-03-05 | 四川宽窄智慧物流有限责任公司 | Gradient distribution method and system for overall cargo management |
| CN117649164B (en) * | 2024-01-30 | 2024-04-16 | 四川宽窄智慧物流有限责任公司 | Gradient distribution method and system for overall cargo management |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113159561A (en) | Freight scheduling method, computer-readable storage medium and computer equipment | |
| JP7542208B2 (en) | Information processing method and information processing system | |
| US10021243B2 (en) | Telephone call placement | |
| CN110544142A (en) | Taxi taking method and equipment and terminal equipment | |
| CN111126643B (en) | Reservation method and reservation device of platform and readable storage medium | |
| CN114386720B (en) | Logistics system scheduling management method, system, terminal equipment and storage medium | |
| Yu et al. | Door allocations to origins and destinations at less-than-truckload trucking terminals | |
| CN113592275B (en) | Freight dispatching method, computer readable storage medium and computer equipment | |
| CN112465384A (en) | Transportation capacity scheduling method and device, computer equipment and computer readable storage medium | |
| CN111754168A (en) | Method, device, terminal and storage medium for reserving express delivery | |
| CN112669116B (en) | Order processing method and device, electronic equipment and readable storage medium | |
| US20150220865A1 (en) | Vehicle stand allocation | |
| CN112308312A (en) | Warehouse-leaving package transferring method, model training method and related equipment | |
| CN111199321A (en) | Method, device, medium and computer equipment for optimizing transport network | |
| US20220319243A1 (en) | Information processing device and information processing method | |
| CN116739315A (en) | Door and window order dispatching method and device, electronic equipment and storage medium | |
| CN116187706A (en) | Configuration method, device, computer equipment and storage medium of baggage sorting AMR | |
| CN114202280A (en) | Logistics transportation order processing method and system | |
| CN113379101A (en) | Distribution method, device and equipment of abnormal orders and storage medium | |
| JP2003233896A (en) | Method and device for generating vehicle allocation plan | |
| CN113888083A (en) | Cargo processing method, device, equipment and storage medium | |
| CN116228053A (en) | Goods distribution optimization method, device, computer equipment and storage medium | |
| CN118114953B (en) | Digital logistics big data platform and method for multi-source heterogeneous data fusion | |
| CN113536128A (en) | Recommendation method for transportation hub transfer mode and electronic equipment | |
| CN112053087A (en) | Complaint work order processing method, device, equipment and storage medium |
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 |