CN110910005A - Vehicle scheduling method, device and storage medium - Google Patents
Vehicle scheduling method, device and storage medium Download PDFInfo
- Publication number
- CN110910005A CN110910005A CN201911128855.1A CN201911128855A CN110910005A CN 110910005 A CN110910005 A CN 110910005A CN 201911128855 A CN201911128855 A CN 201911128855A CN 110910005 A CN110910005 A CN 110910005A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- idle
- order
- determining
- information
- 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 52
- 238000012163 sequencing technique Methods 0.000 claims description 12
- 238000007726 management method Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 230000005540 biological transmission Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 4
- 230000009467 reduction Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000007774 longterm Effects 0.000 description 3
- 238000005034 decoration Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 229910052500 inorganic mineral Inorganic materials 0.000 description 2
- 239000011707 mineral Substances 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 239000003245 coal Substances 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010295 mobile communication Methods 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
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
Abstract
The application discloses a vehicle scheduling method and device and a storage medium. Wherein, the method comprises the following steps: acquiring order detailed information of an order to be scheduled, wherein the order detailed information comprises address information of a goods source and a goods loading date; according to the detailed order information, determining a first idle vehicle of which the operation state is an idle state and the position information of the vehicle is matched with a goods source or a specified area; according to the detailed information of the order, determining a second idle vehicle which is in a non-idle state and can reach a goods source or a specified area within a preset time from a goods date; and determining a target idle vehicle matched with the order to be dispatched according to the first idle vehicle and the second idle vehicle. The information collection, vehicle matching and vehicle dispatching opportunities of the idle vehicle resources which may appear in the goods source and the designated area from the current time of vehicle dispatching to the goods loading period are increased, and the condition that a vehicle dispatching company finds the appropriate idle vehicle at the appropriate price can be better met.
Description
Technical Field
The present application relates to the field of vehicle scheduling technologies, and in particular, to a vehicle scheduling method, apparatus, and storage medium.
Background
The conventional vehicle-cargo matching and vehicle scheduling is based on the current idle vehicles in the cargo source and the designated area, and does not consider the dynamics of the idle vehicles in time and area, namely, the change of the number of the vehicles and the idle state of the vehicles from the current time of the vehicle scheduling to the loading period. For example: at the current time of vehicle dispatch, although vehicles a and B have been assigned delivery orders, it is possible for vehicles a and B to ensure that the orders being delivered are completed before the loading date and can reach the area where the source of the goods is located within a predetermined time (e.g., 12 hours in advance). Therefore, the vehicles a and B should be taken into account also in the process of vehicle scheduling. However, the existing dispatching scheme does not take the above situations into consideration, which results in the reduction of the number of dispatchable idle vehicle sources, thereby reducing the idle vehicle selection range and price negotiation chips of the vehicle dispatching company.
In view of the above-mentioned prior art, the vehicle dispatching scheme does not consider idle vehicle resources that may occur in a cargo source or in a designated area from the current time of vehicle dispatching to the loading period, which results in a reduction in the number of schedulable idle vehicle sources, thereby reducing the technical problem of idle vehicle selection range and price negotiation chips of the vehicle dispatching company, and an effective solution is not proposed at present.
Disclosure of Invention
The embodiment of the disclosure provides a vehicle dispatching method, a vehicle dispatching device and a storage medium, so as to at least solve the technical problem that a vehicle dispatching scheme in the prior art does not consider idle vehicle resources which may appear in a goods source place or a specified area from the current time of vehicle dispatching to the goods loading period, so that the number of schedulable idle vehicle sources is reduced, and therefore the idle vehicle selection range and price negotiation chips of a vehicle dispatching company are reduced.
According to an aspect of an embodiment of the present disclosure, there is provided a scheduling method of a vehicle, including: acquiring order detailed information of an order to be scheduled, wherein the order detailed information comprises address information of a goods source and a goods loading date; according to the detailed order information, determining a first idle vehicle of which the operation state is an idle state and the position information of the vehicle is matched with a goods source place or a designated area, wherein the designated area is an area within a designated distance from the goods source place; according to the detailed information of the order, determining a second idle vehicle which is in a non-idle state and can reach a goods source or a specified area within a preset time from a goods date; and determining a target idle vehicle matched with the order to be dispatched according to the first idle vehicle and the second idle vehicle.
According to another aspect of the embodiments of the present disclosure, there is also provided a storage medium including a stored program, wherein the method of any one of the above is performed by a processor when the program is executed.
According to another aspect of the embodiments of the present disclosure, there is also provided a scheduling apparatus of a vehicle, including: the system comprises a first obtaining module, a second obtaining module and a scheduling module, wherein the first obtaining module is used for obtaining order detailed information of an order to be scheduled, and the order detailed information comprises address information of a goods source and a goods loading date; the first determining module is used for determining a first idle vehicle of which the operation state is an idle state and the position information of the vehicle is matched with a goods source place or a designated area according to the detailed order information, wherein the designated area is an area within a designated distance from the goods source place; the second determining module is used for determining a second idle vehicle which is in a non-idling state in an operation state and can reach a goods source or a specified area within a preset time from a goods loading date according to the detailed order information; and the third determining module is used for determining the target idle vehicle matched with the order to be dispatched according to the first idle vehicle and the second idle vehicle.
According to another aspect of the embodiments of the present disclosure, there is also provided a scheduling apparatus of a vehicle, including: a processor; and a memory coupled to the processor for providing instructions to the processor for processing the following processing steps: acquiring order detailed information of an order to be scheduled, wherein the order detailed information comprises address information of a goods source and a goods loading date; according to the detailed order information, determining a first idle vehicle of which the operation state is an idle state and the position information of the vehicle is matched with a goods source place or a designated area, wherein the designated area is an area within a designated distance from the goods source place; according to the detailed information of the order, determining a second idle vehicle which is in a non-idle state and can reach a goods source or a specified area within a preset time from a goods date; and determining a target idle vehicle matched with the order to be dispatched according to the first idle vehicle and the second idle vehicle.
In the embodiment of the disclosure, order detailed information of an order to be scheduled is firstly acquired, then a first idle vehicle with an operation state of an idle state and position information of the vehicle matched with a cargo source area or a specified area is determined according to the order detailed information, then a second idle vehicle with an operation state of a non-idle state and capable of reaching the cargo source area or the specified area within a preset time from a cargo date is determined according to the order detailed information, and finally a target idle vehicle matched with the order to be scheduled is determined according to the first idle vehicle and the second idle vehicle. By the method, the opportunity of information collection, vehicle matching and vehicle dispatching of the idle vehicle resources possibly occurring in the goods source area and the designated area from the current time of vehicle dispatching to the loading period is increased, so that the number of the schedulable idle vehicle sources is increased, a vehicle dispatching company can better find the appropriate idle vehicle at an appropriate price and lock the vehicle resources to ensure the on-time shipment of goods. The technical problem that idle vehicle resources possibly occurring in a goods source place or a specified area during the period from the current time of vehicle scheduling to the time of loading goods are not considered in a vehicle scheduling scheme in the prior art, so that the number of schedulable idle vehicle sources is reduced, and therefore the idle vehicle selection range and price negotiation chips of a vehicle scheduling company are reduced is solved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the disclosure and together with the description serve to explain the disclosure and not to limit the disclosure. In the drawings:
fig. 1 is a hardware block diagram of a computing device for implementing the method according to embodiment 1 of the present disclosure;
FIG. 2 is a schematic diagram of a dispatch system for a vehicle according to embodiment 1 of the present disclosure;
fig. 3 is a schematic flow chart of a scheduling method of a vehicle according to a first aspect of embodiment 1 of the present disclosure;
fig. 4 is an overall flowchart of a scheduling method of a vehicle according to embodiment 1 of the present disclosure;
fig. 5 is a schematic diagram of a scheduling device of a vehicle according to embodiment 2 of the present disclosure; and
fig. 6 is a schematic diagram of a vehicle scheduling device according to embodiment 3 of the present disclosure.
Detailed Description
In order to make those skilled in the art better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure. It is to be understood that the described embodiments are merely exemplary of some, and not all, of the present disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1
According to the present embodiment, there is provided an embodiment of a method for scheduling vehicles, it being noted that the steps illustrated in the flowchart of the drawings may be performed in a computer system such as a set of computer executable instructions, and that while a logical order is illustrated in the flowchart, in some cases the steps illustrated or described may be performed in an order different than here.
The method embodiments provided by the present embodiment may be executed in a mobile terminal, a computer terminal, a server or a similar computing device. Fig. 1 shows a hardware block diagram of a computing device for implementing a scheduling method for a vehicle. As shown in fig. 1, the computing device may include one or more processors (which may include, but are not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA), a memory for storing data, and a transmission device for communication functions. Besides, the method can also comprise the following steps: a display, an input/output interface (I/O interface), a Universal Serial Bus (USB) port (which may be included as one of the ports of the I/O interface), a network interface, a power source, and/or a camera. It will be understood by those skilled in the art that the structure shown in fig. 1 is only an illustration and is not intended to limit the structure of the electronic device. For example, the computing device may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
It should be noted that the one or more processors and/or other data processing circuitry described above may be referred to generally herein as "data processing circuitry". The data processing circuitry may be embodied in whole or in part in software, hardware, firmware, or any combination thereof. Further, the data processing circuitry may be a single, stand-alone processing module, or incorporated in whole or in part into any of the other elements in the computing device. As referred to in the disclosed embodiments, the data processing circuit acts as a processor control (e.g., selection of a variable resistance termination path connected to the interface).
The memory may be used to store software programs and modules of application software, such as program instructions/data storage devices corresponding to the scheduling method of the vehicle in the embodiments of the present disclosure, and the processor executes various functional applications and data processing by running the software programs and modules stored in the memory, that is, the scheduling method of the vehicle implementing the application program. The memory may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory may further include memory located remotely from the processor, which may be connected to the computing device over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission device is used for receiving or transmitting data via a network. Specific examples of such networks may include wireless networks provided by communication providers of the computing devices. In one example, the transmission device includes a Network adapter (NIC) that can be connected to other Network devices through a base station to communicate with the internet. In one example, the transmission device may be a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
The display may be, for example, a touch screen type Liquid Crystal Display (LCD) that may enable a user to interact with a user interface of the computing device.
It should be noted here that in some alternative embodiments, the computing device shown in fig. 1 described above may include hardware elements (including circuitry), software elements (including computer code stored on a computer-readable medium), or a combination of both hardware and software elements. It should be noted that FIG. 1 is only one example of a particular specific example and is intended to illustrate the types of components that may be present in a computing device as described above.
Fig. 2 is a schematic diagram of a scheduling system of a vehicle according to the present embodiment. Referring to fig. 2, the system includes: a server 200 and a terminal device 100. The server 200 is a server providing vehicle scheduling, and the terminal device 100 is a terminal device of the vehicle dispatcher 110. The vehicle dispatcher 110 can access the server 200 through the terminal device 100, transmit a dispatch request to the server 200, determine vehicles available for dispatch by the server 200 based on the request, and transmit dispatchable vehicle information to the terminal device 100 so that the vehicle dispatcher 110 can perform vehicle dispatch in accordance with the dispatchable vehicle information. It should be noted that the server 200 and the terminal device 100 in the system can be applied to the above-described hardware configuration.
Under the above-described operating environment, according to a first aspect of the present embodiment, there is provided a scheduling method of a vehicle, which is implemented by the server 200 shown in fig. 2. Fig. 3 shows a flow diagram of the method, which, with reference to fig. 3, comprises:
s302: acquiring order detailed information of an order to be scheduled, wherein the order detailed information comprises address information of a goods source and a goods loading date;
s304: according to the detailed order information, determining a first idle vehicle of which the operation state is an idle state and the position information of the vehicle is matched with a goods source place or a designated area, wherein the designated area is an area within a designated distance from the goods source place;
s306: according to the detailed information of the order, determining a second idle vehicle which is in a non-idle state and can reach a goods source or a specified area within a preset time from a goods date; and
s308: and determining a target idle vehicle matched with the order to be dispatched according to the first idle vehicle and the second idle vehicle.
As described in the background, the conventional vehicle-cargo matching and vehicle scheduling is based on the current idle vehicles in the cargo source and the designated area, and does not consider the dynamics of the vehicles idle in time and area, i.e. the number of vehicles and the idle state of the vehicles from the current time of vehicle scheduling to the loading period. For example: at the current time of vehicle dispatch, although vehicles a and B have been assigned a delivery order, it is possible that vehicles a and B ensure that the delivery order is completed before the loading date and can reach the area where the source is within a predetermined hour (e.g., within 12 hours). Therefore, the vehicles a and B should be taken into account also in the process of vehicle scheduling. However, existing dispatch solutions do not take these situations into account, resulting in a reduction in the number of sources of dispatchable idle vehicles, and thus a reduction in the idle vehicle selection range and price negotiation chips of vehicle dispatch companies.
In view of the problems in the background art described above, in the present embodiment, as shown in fig. 2, the vehicle dispatcher 110 can access the server 200 through the terminal device 100 and send a dispatch request to the server 200. At this time, the server 200 acquires order detail information of the order to be scheduled. The order detail information comprises address information of a goods source and a goods loading date. The address information of the source of shipment includes, for example, detailed address information (stored hierarchically by administrative division) and geographical position information (latitude and longitude information).
Illustratively, obtaining order details is obtaining order details for which the vehicle dispatcher 110 needs to dispatch or pre-dispatch a vehicle. The method comprises the following steps: order list information of a vehicle to be dispatched or a pre-dispatched vehicle and order detailed information of an order to be dispatched are acquired by the vehicle dispatcher 110 through SaaS-based order management. The vehicle dispatcher 110 enters the SaaS ordering management, and may query the order list information associated with the ID of the vehicle dispatcher 110 and the order detail information of the order to be dispatched, so that the server 200 may acquire the order detail information from the terminal device 100 of the vehicle dispatcher 110.
Further, the server 200 determines, according to the order detail information, a first idle vehicle whose operation state is an idle state and whose position information matches the source or the designated area. Wherein the designated areas are all designated areas which are a predetermined distance away from the source of the goods. Such as but not limited to: if the source is address a, the designated area may be an area within 10 km of the address a. Specifically, in order to accurately obtain information of a currently available idle vehicle to be scheduled (i.e., a first idle vehicle), and meet a vehicle scheduling requirement of the vehicle dispatcher 110, in the present embodiment, the server 200 determines the first idle vehicle that can be currently scheduled through an association relationship between a company to which the vehicle dispatcher 110 belongs and the vehicle, a current operation state of the vehicle, and a vehicle management and control state in the system. That is, the first idle vehicles whose operation state is an empty state and whose position information matches the source of the cargo or the designated area are determined, for example, the first idle vehicles are vehicle a, vehicle B, and vehicle C.
Further, the server 200 determines, according to the order detail information, a second idle vehicle whose operation state is a non-empty state and which can reach the source or the designated area within a predetermined time from the loading date. The non-unloaded state comprises a heavy-load state and a light-load state, and the vehicle in the non-unloaded state is carrying the order. For example, at the current time of vehicle scheduling, although the vehicles D and E have been assigned a delivery order (i.e., the current state of the vehicles D and E is a non-empty state), the vehicles D and E can complete the delivery order before the loading date and can reach the area where the source is located 12 hours in advance. Therefore, the vehicle D and the vehicle E should be taken into account also in the process of vehicle scheduling. For this case, the server 200 needs to determine a second idle vehicle whose operation state is a non-empty state and which can reach the source or the designated area within a predetermined time from the loading date. For example, the second idling vehicles are vehicle D and vehicle E.
Finally, the server 200 determines the target idle vehicles matched with the order to be scheduled according to the first idle vehicle and the second idle vehicle, that is, determines the target idle vehicles to be a vehicle a, a vehicle B, a vehicle C, a vehicle D and a vehicle E.
Therefore, by the mode, the information collection, vehicle matching and vehicle dispatching opportunities of the idle vehicle resources possibly occurring in the goods source area and the designated area from the current time of vehicle dispatching to the goods loading period are increased, the number of the schedulable idle vehicle sources is increased, and the conditions that a vehicle dispatching company finds the appropriate idle vehicle at an appropriate price and locks the vehicle resources are better met, so that the goods are delivered on time are ensured. And the technical problems that in the prior art, the existing vehicle dispatching scheme does not consider idle vehicle resources possibly occurring in a goods source place or a specified area from the current time of vehicle dispatching to the goods loading period, so that the number of schedulable idle vehicle sources is reduced, and the idle vehicle selection range and price negotiation chips of a vehicle dispatching company are reduced are solved.
In addition, the order detailed information may further include unloading address information, unloading time, administrative division codes of the loading and unloading addresses, longitude and latitude information, and goods information. The administrative division code, the longitude and latitude information and the unloading time of the unloading address are mainly used for judging that the vehicle operation state is a non-empty state and can reach a goods source or a specified area within a preset time from a loading date, and the goods type is mainly used for matching with a proper transport vehicle.
Optionally, the order details further include ID information of a vehicle dispatcher, and the operation of determining a first idle vehicle whose operation state is an empty state and whose position information matches a source or a designated area according to the order details includes: determining a first owned vehicle which has a binding relationship with a company to which a vehicle dispatcher belongs and is owned by the company according to the detailed order information; according to the detailed order information, determining a first operating vehicle which is not owned by a company and has a binding relationship with the company to which the vehicle dispatcher belongs and the vehicle management and control state is an operating state; and determining a first idle vehicle from the first owned-by vehicle and the first operating vehicle.
Specifically, the order detail information is information necessary for the vehicle dispatcher 110 to dispatch the vehicle, and is stored in a table of the relational database, where the table structure is exemplified by: UserID, consignor name, carrier name, item name, total weight, total number, total volume, shipping address (hierarchically stored by administrative division), location information (latitude and longitude), shipping start date, shipping end date, and the like. For example, ("UserID _ X, jordan, mineral water, 10000 tons, 100000, 50000 cubes, 78 days on the southwest street sense lane of the san shui district, fogshan, guangdong province Han wide building 1 level, 113.12, 23.02, 2019-09-09, 2019-09-10, etc."), indicate that the vehicle dispatcher 110 with the ID of UserID _ X belongs to the carrier jordan department and is responsible for providing vehicle dispatching service for the mineral water transportation service of the jordan department, and the loading address is Han wide building 1 level (position information: longitude 113.12, latitude 23.02) on the southwest street sense lane of the san shui district, fogshan, guangdong province, and the loading start and stop date is information of 2019-09-2019-09-10.
Further, fig. 4 shows an overall flowchart of the vehicle scheduling method according to the embodiment. Referring to fig. 4, the server 200 obtains the information of the company a's own vehicle (i.e., the first own vehicle), mainly the license plate number, the vehicle control state, the operation state, the location information, etc., from the system according to the binding relationship between the company (e.g., company a) to which the vehicle dispatcher 110 belongs and the vehicle by acquiring the order list information and the detailed information of the vehicle dispatcher 110 that needs to be dispatched or pre-dispatched. Wherein company a has its own vehicle as the vehicle company a has purchased itself. Then, the server 200 obtains vehicle information in which the vehicle management and control state in the system is the "operation" state, and obtains information of a vehicle owned by non-company a (i.e., a first operation vehicle) from the vehicle information according to the binding relationship between the company a and the vehicle, mainly including a license plate number, a vehicle management and control state, an operation state, and the like. The non-company a owned vehicle is a vehicle not purchased by the company a, but the operation right of the vehicle belongs to the company a. Finally, the server 200 merges the first own vehicle and the first operating vehicle, and obtains therefrom a currently idle vehicle (i.e., the first idle vehicle) whose operating state is an empty state and whose position information matches the source of the cargo or the designated area. By the method, the current idle vehicle can be accurately acquired.
Optionally, the order details further include ID information of a vehicle dispatcher, and the operation of determining, from the order details, a second idle vehicle whose operation state is a non-empty state and which can reach the source or the designated area within a predetermined time from the loading date includes: determining a second owned vehicle which has a binding relationship with a company to which the vehicle dispatcher belongs and is owned by the company according to the detailed order information; according to the detailed order information, determining a second operating vehicle which is not owned by the company and has a binding relationship with the company to which the vehicle dispatcher belongs and the vehicle management and control state is an operating state; and determining a second idle vehicle from the second own vehicle and the second operating vehicle.
Specifically, referring to fig. 4, the server 200 may obtain information of a company a own vehicle (i.e., a second own vehicle), mainly a license plate number, a vehicle management state, an operation state, location information, and the like, from the system according to a binding relationship between a company (e.g., company a) to which the vehicle dispatcher 110 belongs and the vehicle by acquiring order list information and detailed information that the vehicle dispatcher 110 needs to dispatch or pre-dispatch the vehicle. Then, the server 200 obtains vehicle information in which the vehicle management and control state in the system is the operating state, and obtains information of a vehicle owned by a non-company a (i.e., a second operating vehicle) from the vehicle information according to the binding relationship between the company a and the vehicle, wherein the information mainly includes a license plate number, a vehicle management and control state, an operating state, and the like. Finally, the server 200 merges the second own vehicle and the second operating vehicle, and obtains therefrom a forward idling vehicle (i.e., the first idling vehicle) whose operating state is the "no-empty" state and which can reach the source of the shipment or the designated area within a predetermined time from the date of shipment. For example: the server 200 calculates the matched long-term idle vehicles according to the position information of the destinations of the orders carried by the vehicles in the non-empty state and the time of reaching the destinations, and the position information of the designated areas of the orders to be loaded and the loading time. By the method, the current idle vehicle can be accurately acquired.
For example, the matching future idle vehicle may be calculated as follows: and the transport company dispatcher a dispatches the automobile V to carry the order of transporting coal from the point A to the point B, the automobile is loaded and dispatched from the point A at the point 11, month 1, day 10, the automobile is expected to reach the point B at the point 11, month 3 and day 10, and the unloading is finished at the point 11. The carrier on day 2 of 11 months receives another shipment from B to C with an estimated delivery time of 11 months 3 days 19: 00, the server 200 calculates that the vehicle V can finish unloading within the preset time and reach a new loading place in time to finish loading and dispatching according to the information of the current idle vehicles in the area and the vehicles which are pre-arrived in the area B. At this time, the server 200 determines that the vehicle V meets the requirements such as the scheduled time, and therefore the server 200 calculates that the vehicle V is a long-term idle vehicle.
Optionally, the operation of determining a target idle vehicle matched with the order to be scheduled according to the first idle vehicle and the second idle vehicle includes: carrying out merging operation on the first idle vehicle and the second idle vehicle; carrying out duplicate removal operation on the result obtained by the merging operation; and determining the result obtained by the duplicate removal operation as the target idle vehicle.
Specifically, the server 200 performs a merging operation on a first idle vehicle (a current idle vehicle) and a second idle vehicle (a long-term idle vehicle), and removes repeated vehicles to finally form a target idle vehicle matched with the order to be scheduled, that is, controllably scheduled. By the method, the target idle vehicle matched with the order to be dispatched can be obtained as comprehensively as possible.
Optionally, the method further comprises: acquiring a preset sequencing rule; and sequencing the target idle vehicles according to the sequencing rule, and sending the sequenced target idle vehicles to terminal equipment of a vehicle dispatcher.
Specifically, since the target idle vehicles determined by the server 200 are not ranked, in order to be intelligently recommended to the vehicle dispatcher 110, the server 200 first acquires a preset ranking rule. The ordering rule may be set by the vehicle dispatcher 110 or its supervisor, and may be formed by combining the priority information of the current idle and the future idle, the owned vehicle and the outsourced vehicle (i.e. the non-owned vehicle), the source of the goods and the designated area. Then, the server 200 performs combined sorting on the target idle vehicles according to the obtained sorting rule, finally forms sorted target idle vehicles, and sends (recommends) the sorted target idle vehicles to the terminal device of the vehicle dispatcher 110, so that the vehicle dispatcher 110 can perform vehicle dispatching according to the recommendation.
Further, referring to fig. 1, according to a second aspect of the present embodiment, there is provided a storage medium. The storage medium comprises a stored program, wherein the method of any of the above is performed by a processor when the program is run.
Thus, according to this embodiment, the server 200 first obtains order detailed information of an order to be scheduled, then determines, according to the order detailed information, a first idle vehicle whose operation state is an idle state and whose position information matches the source of the goods or the designated area, next determines, according to the order detailed information, a second idle vehicle whose operation state is a non-idle state and which can reach the source of the goods or the designated area within a predetermined time from the date of the goods loading, and finally determines, according to the first idle vehicle and the second idle vehicle, a target idle vehicle matching the order to be scheduled. By the method, the opportunity of information collection, vehicle matching and vehicle dispatching of the idle vehicle resources possibly occurring in the goods source area and the designated area from the current time of vehicle dispatching to the loading period is increased, so that the number of the schedulable idle vehicle sources is increased, a vehicle dispatching company can better find the appropriate idle vehicle at an appropriate price and lock the vehicle resources to ensure the on-time shipment of goods. The technical problem that idle vehicle resources possibly occurring in a goods source place or a specified area during the period from the current time of vehicle scheduling to the time of loading goods are not considered in a vehicle scheduling scheme in the prior art, so that the number of schedulable idle vehicle sources is reduced, and therefore the idle vehicle selection range and price negotiation chips of a vehicle scheduling company are reduced is solved.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present invention is not limited by the order of acts, as some steps may occur in other orders or concurrently in accordance with the invention. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required by the invention.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
Example 2
Fig. 5 shows a vehicle dispatching device 500 according to the present embodiment, the device 500 corresponding to the method according to the first aspect of embodiment 1. Referring to fig. 5, the apparatus 500 includes: a first obtaining module 510, configured to obtain order details of an order to be scheduled, where the order details include address information of a source and a loading date; the first determining module 520 is configured to determine, according to the order detail information, a first idle vehicle whose operation state is an idle state and whose position information matches a cargo source or a designated area, where the designated area is an area within a designated distance from the cargo source; a second determining module 530, configured to determine, according to the order detail information, a second idle vehicle whose operation status is a non-idle status and which can reach the source or the designated area within a predetermined time from the loading date; and a third determining module 540, configured to determine a target idle vehicle matched with the order to be scheduled according to the first idle vehicle and the second idle vehicle.
Optionally, the order details further include ID information of a vehicle dispatcher, and the first determination module 520 includes: the first determining submodule is used for determining a first owned vehicle which has a binding relationship with a company to which the vehicle dispatcher belongs and is owned by the company according to the detailed order information; the second determining submodule is used for determining a first operating vehicle which is in an operating state and has a binding relationship with a company to which the vehicle dispatcher belongs and is not owned by the company according to the detailed order information; and a third determination submodule for determining a first idle vehicle from the first own vehicle and the first operating vehicle.
Optionally, the order detail information further includes ID information of a vehicle dispatcher, and the second determining module 530 includes: the fourth determining submodule is used for determining a second owned vehicle which has a binding relationship with the company to which the vehicle dispatcher belongs and is owned by the company according to the detailed order information; the fifth determining sub-module is used for determining a second operating vehicle which is in the vehicle control state as the operating state, has a binding relationship with a company to which the vehicle dispatcher belongs and is not owned by the company according to the detailed order information; and a sixth determination submodule for determining a second idle vehicle from the second own vehicle and the second operating vehicle.
Optionally, the third determining module 540 includes: the merging submodule is used for performing merging operation on the first idle vehicle and the second idle vehicle; the duplication removing submodule is used for carrying out duplication removing operation on the result obtained by the merging operation; and the seventh determining submodule is used for determining the result obtained by the duplicate removal operation as the target idle vehicle.
Optionally, the method further comprises: the second acquisition module is used for acquiring a preset sequencing rule; and the sending module is used for sequencing the target idle vehicles according to the sequencing rule and sending the sequenced target idle vehicles to the terminal equipment of the vehicle dispatcher.
Thus, according to this embodiment, the apparatus 500 first obtains order detailed information of an order to be scheduled, then determines, according to the order detailed information, a first idle vehicle whose operation state is an idle state and whose position information matches the source of the goods or the designated area, next determines, according to the order detailed information, a second idle vehicle whose operation state is a non-idle state and which can reach the source of the goods or the designated area within a predetermined time from the date of the goods loading, and finally determines, according to the first idle vehicle and the second idle vehicle, a target idle vehicle matching the order to be scheduled. By the method, the opportunity of information collection, vehicle matching and vehicle dispatching of the idle vehicle resources possibly occurring in the goods source area and the designated area from the current time of vehicle dispatching to the loading period is increased, so that the number of the schedulable idle vehicle sources is increased, a vehicle dispatching company can better find the appropriate idle vehicle at an appropriate price and lock the vehicle resources to ensure the on-time shipment of goods. The technical problem that idle vehicle resources possibly occurring in a goods source place or a specified area during the period from the current time of vehicle scheduling to the time of loading goods are not considered in a vehicle scheduling scheme in the prior art, so that the number of schedulable idle vehicle sources is reduced, and therefore the idle vehicle selection range and price negotiation chips of a vehicle scheduling company are reduced is solved.
Example 3
Fig. 6 shows a vehicle scheduling apparatus 600 according to the present embodiment, the apparatus 600 corresponding to the method according to the first aspect of embodiment 1. Referring to fig. 6, the apparatus 600 includes: a processor 610; and a memory 620 coupled to the processor 610 for providing instructions to the processor 610 to process the following processing steps: acquiring order detailed information of an order to be scheduled, wherein the order detailed information comprises address information of a goods source and a goods loading date; according to the detailed order information, determining a first idle vehicle of which the operation state is an idle state and the position information of the vehicle is matched with a goods source place or a designated area, wherein the designated area is an area within a designated distance from the goods source place; according to the detailed information of the order, determining a second idle vehicle which is in a non-idle state and can reach a goods source or a specified area within a preset time from a goods date; and determining a target idle vehicle matched with the order to be dispatched according to the first idle vehicle and the second idle vehicle.
Optionally, the order details further include ID information of a vehicle dispatcher, and the operation of determining a first idle vehicle whose operation state is an empty state and whose position information matches a source or a designated area according to the order details includes: determining a first owned vehicle which has a binding relationship with a company to which a vehicle dispatcher belongs and is owned by the company according to the detailed order information; according to the detailed order information, determining a first operating vehicle which is not owned by a company and has a binding relationship with the company to which the vehicle dispatcher belongs and the vehicle management and control state is an operating state; and determining a first idle vehicle from the first owned-by vehicle and the first operating vehicle.
Optionally, the order details further include ID information of a vehicle dispatcher, and the operation of determining, from the order details, a second idle vehicle whose operation state is a non-empty state and which can reach the source or the designated area within a predetermined time from the loading date includes: determining a second owned vehicle which has a binding relationship with a company to which the vehicle dispatcher belongs and is owned by the company according to the detailed order information; according to the detailed order information, determining a second operating vehicle which is not owned by the company and has a binding relationship with the company to which the vehicle dispatcher belongs and the vehicle management and control state is an operating state; and determining a second idle vehicle from the second own vehicle and the second operating vehicle.
Optionally, the operation of determining a target idle vehicle matched with the order to be scheduled according to the first idle vehicle and the second idle vehicle includes: carrying out merging operation on the first idle vehicle and the second idle vehicle; carrying out duplicate removal operation on the result obtained by the merging operation; and determining the result obtained by the duplicate removal operation as the target idle vehicle.
Optionally, the memory 620 is further configured to provide the processor 610 with instructions to process the following processing steps: acquiring a preset sequencing rule; and sequencing the target idle vehicles according to the sequencing rule, and sending the sequenced target idle vehicles to terminal equipment of a vehicle dispatcher.
Thus, according to this embodiment, the apparatus 600 first obtains order detailed information of an order to be scheduled, then determines, according to the order detailed information, a first idle vehicle whose operation state is an idle state and whose position information matches the source of goods or the designated area, next determines, according to the order detailed information, a second idle vehicle whose operation state is a non-idle state and which can reach the source of goods or the designated area within a predetermined time from the date of goods loading, and finally determines, according to the first idle vehicle and the second idle vehicle, a target idle vehicle matching the order to be scheduled. By the method, the opportunity of information collection, vehicle matching and vehicle dispatching of the idle vehicle resources possibly occurring in the goods source area and the designated area from the current time of vehicle dispatching to the loading period is increased, so that the number of the schedulable idle vehicle sources is increased, a vehicle dispatching company can better find the appropriate idle vehicle at an appropriate price and lock the vehicle resources to ensure the on-time shipment of goods. The technical problem that idle vehicle resources possibly occurring in a goods source place or a specified area during the period from the current time of vehicle scheduling to the time of loading goods are not considered in a vehicle scheduling scheme in the prior art, so that the number of schedulable idle vehicle sources is reduced, and therefore the idle vehicle selection range and price negotiation chips of a vehicle scheduling company are reduced is solved.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
In the above embodiments of the present invention, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.
Claims (10)
1. A vehicle scheduling method is applied to a server for vehicle scheduling, and is characterized by comprising the following steps:
acquiring order detailed information of an order to be scheduled, wherein the order detailed information comprises address information of a goods source and a goods loading date;
according to the detailed order information, determining a first idle vehicle of which the operation state is an idle state and the position information of the vehicle is matched with the goods source place or a designated area, wherein the designated area is an area within a designated distance from the goods source place;
according to the order detailed information, determining a second idle vehicle which is in a non-idle state and can reach the goods source or the designated area within a preset time from the goods loading date; and
and determining a target idle vehicle matched with the order to be dispatched according to the first idle vehicle and the second idle vehicle.
2. The method of claim 1, wherein the order details further include ID information of a vehicle dispatcher, and wherein determining operation of a first idle vehicle having an operation status of an empty load and a vehicle position information matching the source or designated area based on the order details comprises:
determining a first owned vehicle which has a binding relationship with a company to which the vehicle dispatcher belongs and is owned by the company according to the order detailed information;
according to the order detailed information, determining a first operating vehicle of which the vehicle management and control state is an operating state, and which has a binding relationship with a company to which the vehicle dispatcher belongs and is not owned by the company; and
determining the first idle vehicle from the first owned-by vehicle and the first operating vehicle.
3. The method of claim 1, wherein the order details further include ID information of a vehicle dispatcher, and wherein determining operation of a second idle vehicle having an operational status of non-empty and capable of reaching the source or the designated area within a predetermined time from the loading date based on the order details comprises:
determining a second owned vehicle which has a binding relationship with a company to which the vehicle dispatcher belongs and is owned by the company according to the order detailed information;
according to the order detailed information, determining a second operation vehicle of which the vehicle management and control state is an operation state, which has a binding relationship with a company to which the vehicle dispatcher belongs and is not owned by the company; and
determining the second idle vehicle from the second owned-by vehicle and the second operating vehicle.
4. The method of claim 1, wherein determining operation of a target idle vehicle matching the order to be scheduled from the first idle vehicle and the second idle vehicle comprises:
performing merging operation on the first idle vehicle and the second idle vehicle;
carrying out duplication removing operation on the result obtained by the merging operation; and
and determining the result obtained by the duplicate removal operation as the target idle vehicle.
5. The method of claim 2 or 3, further comprising:
acquiring a preset sequencing rule; and
and sequencing the target idle vehicles according to the sequencing rule, and sending the sequenced target idle vehicles to the terminal equipment of the vehicle dispatcher.
6. A storage medium comprising a stored program, wherein the method of any one of claims 1 to 5 is performed by a processor when the program is run.
7. A scheduling apparatus of a vehicle, comprising:
the system comprises a first obtaining module, a second obtaining module and a scheduling module, wherein the first obtaining module is used for obtaining order detailed information of an order to be scheduled, and the order detailed information comprises address information of a goods source and a goods loading date;
the first determining module is used for determining a first idle vehicle of which the operation state is an idle state and the position information of the vehicle is matched with the goods source place or the designated area according to the order detailed information, wherein the designated area is an area within a designated distance from the goods source place;
the second determining module is used for determining a second idle vehicle which is in a non-idle state in an operation state and can reach the goods source or the designated area within a preset time from the goods loading date according to the order detailed information; and
and the third determining module is used for determining a target idle vehicle matched with the order to be dispatched according to the first idle vehicle and the second idle vehicle.
8. The apparatus of claim 7, wherein the order details further include ID information of a vehicle dispatcher, and the first determination module includes:
the first determining submodule is used for determining a first owned vehicle which has a binding relationship with a company to which the vehicle dispatcher belongs and is owned by the company according to the order detailed information;
the second determining submodule is used for determining that the vehicle management and control state is the operation state and has a binding relationship with a company to which the vehicle dispatcher belongs and is not a first operation vehicle owned by the company according to the order detailed information; and
a third determination submodule for determining the first idle vehicle from the first own vehicle and the first operating vehicle.
9. The apparatus of claim 7, wherein the order details further include ID information of a vehicle dispatcher, and the second determination module includes:
the fourth determining submodule is used for determining a second owned vehicle which has a binding relationship with the company to which the vehicle dispatcher belongs and is owned by the company according to the order detailed information;
a fifth determining submodule, configured to determine, according to the order detail information, that a vehicle management and control state is an operating state, and that a second operating vehicle, which is not owned by the company and has a binding relationship with the company to which the vehicle dispatcher belongs; and
a sixth determination submodule for determining the second idle vehicle from the second own vehicle and the second operating vehicle.
10. A scheduling apparatus of a vehicle, comprising:
a processor; and
a memory coupled to the processor for providing instructions to the processor for processing the following processing steps:
acquiring order detailed information of an order to be scheduled, wherein the order detailed information comprises address information of a goods source and a goods loading date;
according to the detailed order information, determining a first idle vehicle of which the operation state is an idle state and the position information of the vehicle is matched with the goods source place or the designated area, wherein the designated area is an area within a designated distance from the goods source place;
according to the order detailed information, determining a second idle vehicle which is in a non-idle state and can reach the goods source or the designated area within a preset time from the goods loading date; and
and determining a target idle vehicle matched with the order to be dispatched according to the first idle vehicle and the second idle vehicle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911128855.1A CN110910005A (en) | 2019-11-18 | 2019-11-18 | Vehicle scheduling method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911128855.1A CN110910005A (en) | 2019-11-18 | 2019-11-18 | Vehicle scheduling method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110910005A true CN110910005A (en) | 2020-03-24 |
Family
ID=69816865
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911128855.1A Pending CN110910005A (en) | 2019-11-18 | 2019-11-18 | Vehicle scheduling method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110910005A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112633587A (en) * | 2020-12-28 | 2021-04-09 | 车主邦（北京）科技有限公司 | Logistics information processing method and device |
| CN113470410A (en) * | 2021-06-29 | 2021-10-01 | 山东旗帜信息有限公司 | Drainage cargo allocation method and system for expressway |
| CN116586312A (en) * | 2023-05-12 | 2023-08-15 | 宁波安得智联科技有限公司 | Goods sorting method, device, electronic equipment and readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103903427A (en) * | 2012-12-28 | 2014-07-02 | 上海飞田通信技术有限公司 | Taxi dispatching system, dispatching server and vehicle-borne intelligent navigation terminal |
| KR20160094173A (en) * | 2015-01-30 | 2016-08-09 | 한국토지주택공사 | Electric Vehicle Standard Charging Apparatus |
| CN109635971A (en) * | 2018-11-21 | 2019-04-16 | 北京智行者科技有限公司 | A kind of people's goods is shared to use vehicle method of servicing |
| CN109800896A (en) * | 2018-12-21 | 2019-05-24 | 浙江数链科技有限公司 | Vehicle dispatching method, device, computer equipment and storage medium |
| CN110363466A (en) * | 2019-06-04 | 2019-10-22 | 江苏卡满行物联科技有限公司 | Logistics order allocation method and system |
-
2019
- 2019-11-18 CN CN201911128855.1A patent/CN110910005A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103903427A (en) * | 2012-12-28 | 2014-07-02 | 上海飞田通信技术有限公司 | Taxi dispatching system, dispatching server and vehicle-borne intelligent navigation terminal |
| KR20160094173A (en) * | 2015-01-30 | 2016-08-09 | 한국토지주택공사 | Electric Vehicle Standard Charging Apparatus |
| CN109635971A (en) * | 2018-11-21 | 2019-04-16 | 北京智行者科技有限公司 | A kind of people's goods is shared to use vehicle method of servicing |
| CN109800896A (en) * | 2018-12-21 | 2019-05-24 | 浙江数链科技有限公司 | Vehicle dispatching method, device, computer equipment and storage medium |
| CN110363466A (en) * | 2019-06-04 | 2019-10-22 | 江苏卡满行物联科技有限公司 | Logistics order allocation method and system |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112633587A (en) * | 2020-12-28 | 2021-04-09 | 车主邦（北京）科技有限公司 | Logistics information processing method and device |
| CN113470410A (en) * | 2021-06-29 | 2021-10-01 | 山东旗帜信息有限公司 | Drainage cargo allocation method and system for expressway |
| CN113470410B (en) * | 2021-06-29 | 2022-11-08 | 山东旗帜信息有限公司 | Drainage cargo allocation method and system for expressway |
| CN116586312A (en) * | 2023-05-12 | 2023-08-15 | 宁波安得智联科技有限公司 | Goods sorting method, device, electronic equipment and readable storage medium |
| CN116586312B (en) * | 2023-05-12 | 2023-11-24 | 宁波安得智联科技有限公司 | Goods sorting method, device, electronic equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110910005A (en) | Vehicle scheduling method, device and storage medium | |
| CN111415104B (en) | Vehicle scheduling method, device, equipment and storage medium | |
| CN104751272A (en) | Intelligent order scheduling method and server, electric vehicle, mobile terminal and system | |
| CN110728480A (en) | Transportation scheduling device based on mobile positioning | |
| CN105787659A (en) | Intelligent scheduling method | |
| CN110009278A (en) | Cargo matching process, server and storage medium based on shared boot | |
| US20180089608A1 (en) | Systems and methods for managing delivery routes | |
| CN107203858B (en) | Distribution time determining method and device | |
| CN102479368A (en) | Method and system for realizing price comparison of commodities of entity store | |
| CN112686516A (en) | Distribution equipment battery replacement management method and device and electronic equipment | |
| CN106372822B (en) | Service object reservation time period processing method and device | |
| CN101236625A (en) | Mobile positioning communications terminal logistic information systems and goods distribution method | |
| CN116362431A (en) | Scheduling method and device for shared vehicle, computer equipment and storage medium | |
| CN113177766B (en) | Method and device for storing materials and terminal equipment | |
| CN115409439A (en) | Multi-vehicle type supply chain scheduling method based on improved ant colony algorithm and electronic equipment | |
| CN111222822B (en) | Goods source pushing method and device, electronic equipment and readable storage medium | |
| CN111325611A (en) | Order distribution method and device | |
| CN115860419A (en) | Scheduling method, device and equipment suitable for transport vehicle | |
| CN113320760B (en) | Material allocation method, storage medium, server and material allocation system | |
| CN114841455A (en) | Logistics transportation aging forecasting method and device, electronic equipment and storage medium | |
| CN117217420B (en) | Method, device, equipment and storage medium for determining transportation information | |
| CN117689314B (en) | Order intelligent processing method, device, computer equipment and storage medium | |
| CN103186869A (en) | Vehicle-mounted information cueing system, service center and vehicle-mounted terminal | |
| CN112668745A (en) | Order distribution timeliness estimation method, device and equipment | |
| CN117670491A (en) | Lease management method and lease management device for engineering mechanical equipment |
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 |
Address after: No.356-11 Hulunbuir Road (business on the ground floor of No.5 building) of Tianjin Binhai New Area pilot free trade zone (Dongjiang Bonded Port Area) Applicant after: Wanlian Yida Logistics Technology Co.,Ltd. Address before: 071700 No.9 shop, building 3, comprehensive business building, South Baiyangdian, Rongren Road, Baiyangdian Tourism Development Zone, Rongcheng County, Baoding City, Hebei Province Applicant before: Wanlian Yida Logistics Technology Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200324 |
|
| RJ01 | Rejection of invention patent application after publication |