CN113850546A - Transportation vehicle scheduling method and device, electronic equipment and computer readable medium - Google Patents

Transportation vehicle scheduling method and device, electronic equipment and computer readable medium Download PDF

Info

Publication number
CN113850546A
CN113850546A CN202111078526.8A CN202111078526A CN113850546A CN 113850546 A CN113850546 A CN 113850546A CN 202111078526 A CN202111078526 A CN 202111078526A CN 113850546 A CN113850546 A CN 113850546A
Authority
CN
China
Prior art keywords
information
transportation
delivery
item
vehicle
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
Application number
CN202111078526.8A
Other languages
Chinese (zh)
Inventor
徐意
吴勇民
陆冠军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Pinjie Network Technology Co Ltd
Original Assignee
Hangzhou Pinjie Network Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hangzhou Pinjie Network Technology Co Ltd filed Critical Hangzhou Pinjie Network Technology Co Ltd
Priority to CN202111078526.8A priority Critical patent/CN113850546A/en
Publication of CN113850546A publication Critical patent/CN113850546A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • G06Q10/0835Relationships between shipper or supplier and carriers
    • G06Q10/08355Routing methods

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Quality & Reliability (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (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)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

The embodiment of the disclosure discloses a transportation vehicle scheduling method, a transportation vehicle scheduling device, electronic equipment and a computer readable medium. One embodiment of the method comprises: generating a transportation route according to the current position of the target transportation vehicle and the receiving address included in the article transportation information; in response to receiving an item delivery request during the traveling of a target transport vehicle along a transport route, obtaining item delivery information corresponding to the item delivery request, wherein the item delivery information includes a delivery volume, a delivery address, and a delivery address; and in response to determining that the current remaining transport amount of the target transport vehicle is greater than or equal to the delivery amount included in the item delivery information, performing vehicle scheduling according to the harvest address included in the item transport information, the delivery address included in the item delivery information and the delivery address. This embodiment reduces the waste of transportation resources.

Description

Transportation vehicle scheduling method and device, electronic equipment and computer readable medium
Technical Field
The embodiment of the disclosure relates to the technical field of computers, in particular to a transportation vehicle scheduling method, a transportation vehicle scheduling device, electronic equipment and a computer readable medium.
Background
Currently, in order to provide convenience to users, various items are generally transported to the respective users by transport vehicles. However, when the transport vehicle transports the article, there are often problems as follows:
firstly, in the transportation process, the residual transportation resources of the vehicles cannot be utilized to transport the articles of other logistics platforms, so that the transportation resources of the transportation vehicles are wasted;
secondly, because the destinations of the users are different, the remaining transportation resources of the transportation vehicle cannot be effectively utilized after the transportation vehicle finishes transporting a certain parcel, and the waste of the remaining transportation resources of the transportation vehicle is caused.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present disclosure propose a transportation vehicle scheduling method, apparatus, electronic device and computer readable medium to solve one or more of the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide a method of dispatching a transportation vehicle, the method comprising: acquiring article transportation information of each article package in each article package transported by a target transport vehicle to obtain an article transportation information sequence, wherein the article transportation information in the article transportation information sequence comprises a package identifier, a package quantity corresponding to the package identifier and a delivery address; for each item transportation information in the item transportation information sequence, executing the following processing steps: generating a transportation route according to the current position of the target transportation vehicle and the receiving address included in the article transportation information; in response to receiving an article delivery request during the traveling of the target transportation vehicle along the transportation route, acquiring article delivery information corresponding to the article delivery request, wherein the article delivery information includes a delivery volume, a delivery address and a delivery address; and in response to determining that the current remaining transport volume of the target transport vehicle is equal to or greater than the transport volume included in the item delivery information, performing vehicle scheduling based on the harvest address included in the item transport information, the delivery address included in the item delivery information, and the delivery address.
In a second aspect, some embodiments of the present disclosure provide a transportation vehicle scheduling apparatus, the apparatus comprising: the system comprises an acquisition unit, a storage unit and a delivery unit, wherein the acquisition unit is configured to acquire article transportation information of each article parcel in each article parcel transported by a target transport vehicle to obtain an article transportation information sequence, and the article transportation information in the article transportation information sequence comprises a parcel identifier, a parcel volume corresponding to the parcel identifier and a delivery address; a transportation processing unit configured to execute the following processing steps for each item transportation information in the item transportation information sequence: generating a transportation route according to the current position of the target transportation vehicle and the receiving address included in the article transportation information; in response to receiving an article delivery request during the traveling of the target transportation vehicle along the transportation route, acquiring article delivery information corresponding to the article delivery request, wherein the article delivery information includes a delivery volume, a delivery address and a delivery address; and in response to determining that the current remaining transport volume of the target transport vehicle is equal to or greater than the transport volume included in the item delivery information, performing vehicle scheduling based on the harvest address included in the item transport information, the delivery address included in the item delivery information, and the delivery address.
In a third aspect, some embodiments of the present disclosure provide an electronic device, comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors, cause the one or more processors to implement the method described in any of the implementations of the first aspect.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium on which a computer program is stored, wherein the program, when executed by a processor, implements the method described in any of the implementations of the first aspect.
The above embodiments of the present disclosure have the following advantages: by the transportation vehicle scheduling method of some embodiments of the present disclosure, waste of transportation resources is reduced. Specifically, the reason for causing the waste of transportation resources of the transportation vehicle is that: in the transportation process, the residual transportation resources of the vehicles cannot be utilized to transport the articles of other logistics platforms, so that the transportation resources of the transportation vehicles are wasted. Based on this, the vehicle control method of some embodiments of the present disclosure first obtains the item transportation information of each item parcel in the individual item parcels transported by the target transportation vehicle, and obtains an item transportation information sequence. And the article transportation information in the article transportation information sequence comprises a package identifier, a package size corresponding to the package identifier and a delivery address. Thus, it is convenient to determine the remaining transportation volume (resources) of the transportation vehicle, and to transport the items of other logistics platforms closer to the receiving address according to the respective receiving addresses. Then, for each item transportation information in the item transportation information sequence, executing the following processing steps: first, a transportation route is generated according to the current position of the target transportation vehicle and the delivery address included in the article transportation information. Then, in response to receiving an article delivery request while the target transport vehicle is traveling along the transport route, article delivery information corresponding to the article delivery request is acquired. The article delivery information includes a delivery volume, a delivery address, and a delivery address. Thus, it is convenient to determine whether the article delivery request submitted by the other received logistics platform (request terminal) is within the area of the transportation route. And finally, in response to determining that the current remaining transport amount of the target transport vehicle is equal to or greater than the transport amount included in the item delivery information, performing vehicle scheduling according to the harvest address included in the item transport information, the delivery address included in the item delivery information, and the delivery address. Thus, it is convenient to determine whether the dispensed amount of the dispensed item is equal to or less than the current remaining transport amount of the target transport vehicle to prevent the target transport vehicle from being overloaded. In addition, the target transport vehicle can be used for transporting the articles of other logistics platforms by using the residual transport resources of the vehicle. Thus, the waste of transportation resources is reduced.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and elements are not necessarily drawn to scale.
FIG. 1 is a schematic illustration of one application scenario of a transportation vehicle scheduling method according to some embodiments of the present disclosure;
FIG. 2 is a flow diagram of some embodiments of a transportation vehicle scheduling method according to the present disclosure;
FIG. 3 is a flow chart of still further embodiments of a haulage vehicle dispatching method according to the present disclosure;
FIG. 4 is a schematic block diagram of some embodiments of a haulage vehicle dispatching device according to the present disclosure;
FIG. 5 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings. The embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a schematic diagram of an application scenario of a transportation vehicle scheduling method according to some embodiments of the present disclosure.
In the application scenario of fig. 1, first, the computing device 101 may obtain item transportation information of each item parcel in the item parcels transported by the target transportation vehicle, resulting in an item transportation information sequence 102. The article transportation information in the article transportation information sequence 102 includes a package identifier, a package size corresponding to the package identifier, and a delivery address. Then, for each item transportation information in the item transportation information sequence 102, the following processing steps are performed: first, the computing device 101 may generate the transportation route 103 according to the current location of the target transportation vehicle and the receiving address included in the item transportation information. Then, the computing device 101 may acquire the item distribution information 104 corresponding to the item distribution request in response to receiving the item distribution request while the target transportation vehicle travels along the transportation route 103. The item delivery information 104 includes a delivery volume, a delivery address, and a delivery address. Finally, the computing device 101 may perform vehicle scheduling based on the harvest address included in the transportation information of the item, the delivery address included in the delivery information 104, and the delivery address in response to determining that the current remaining transportation amount of the target transportation vehicle is equal to or greater than the delivery amount included in the delivery information 104 of the item.
The computing device 101 may be hardware or software. When the computing device is hardware, it may be implemented as a distributed cluster composed of multiple servers or terminal devices, or may be implemented as a single server or a single terminal device. When the computing device is embodied as software, it may be installed in the hardware devices enumerated above. It may be implemented, for example, as multiple software or software modules to provide distributed services, or as a single software or software module. And is not particularly limited herein.
It should be understood that the number of computing devices in FIG. 1 is merely illustrative. There may be any number of computing devices, as implementation needs dictate.
With continued reference to fig. 2, a flow 200 of some embodiments of a transportation vehicle scheduling method according to the present disclosure is shown. The method may be performed by the computing device 101 of fig. 1. The transportation vehicle dispatching method comprises the following steps:
step 201, obtaining the article transportation information of each article parcel in each article parcel transported by the target transport vehicle to obtain an article transportation information sequence.
In some embodiments, an executing body (e.g., the computing device 101 shown in fig. 1) of the transportation vehicle scheduling method may obtain the item transportation information sequence of each item package in the respective item packages transported by the target transportation vehicle from the terminal device through a wired connection manner or a wireless connection manner. And the article transportation information in the article transportation information sequence comprises a package identifier, a package size corresponding to the package identifier and a delivery address. Here, the package identification may refer to a package serial number. Here, the parcel volume may refer to the volume and weight of the parcel. Here, the target transport vehicle may be a vehicle that is currently transporting the item.
As an example, the item transportation information sequence may be:
{ [ Parcel No. 1, (200 kg, 2 m), No. 56 CC Lot of ZZ region, YY, XX province ];
[ Parcel No. 2, (150 kg, 1.5 m) by Henry, YY, XX, UK, No. ZZ region DD lane 56 ];
[ Parcel No. 3, (180 kg, 2 m) by Town, No. 46 EE in ZZ region, YY city, XX;
[ Parcel No. 4, (120 kg, 1.5 m) by Heya, No. 35 EF of ZZ region, YY, XX province ];
[ Parcel No. 5, (100 kg, 1 m), DE lane No. 10 of ZZ region, YY, XX, province ].
Step 202, for each item transportation information in the item transportation information sequence, executing the following processing steps:
step 2021, generating a transportation route according to the current position of the target transportation vehicle and the receiving address included in the article transportation information.
In some embodiments, the execution body may determine the transportation route from the current location of the target transportation vehicle to the consignee address included in the goods transportation information through various methods (a simulated annealing algorithm, an artificial potential field method, a fuzzy logic algorithm, a tabu search algorithm, a visual map space method, etc.).
Step 2022, in response to receiving the article distribution request while the target transportation vehicle is traveling along the transportation route, obtaining article distribution information corresponding to the article distribution request.
In some embodiments, the execution subject may obtain the article delivery information corresponding to the article delivery request from the terminal device through a wired connection manner or a wireless connection manner in response to receiving the article delivery request while the target transportation vehicle travels along the transportation route. The article delivery information includes a delivery volume, a delivery address, and a delivery address. Here, the item delivery request may be request information of item delivery submitted by other logistics platforms. Here, the dispensed amount may refer to the volume and weight of the dispensed article. For example, the article delivery information may be "a delivery amount: (50 kg, 100 m) shipments, shipping address: no. 50 CC way of ZZ zone of YY city, XX province, harvest address: DE Lane 9, ZZ zone, YY, XX province.
Step 2023, in response to determining that the current remaining transportation amount of the target transportation vehicle is equal to or greater than the delivery amount included in the item delivery information, performs vehicle scheduling based on the harvest address included in the item transportation information, the delivery address included in the item delivery information, and the delivery address.
In some embodiments, the execution agent may perform vehicle scheduling according to a harvest address included in the transportation information of the object transportation vehicle, a delivery address included in the delivery information of the object transportation vehicle, and a delivery address, in response to determining that the current remaining transportation amount of the object transportation vehicle is equal to or greater than the delivery amount included in the delivery information of the object transportation vehicle. In practice, first, the execution body may determine the current position of the target transportation vehicle to the delivery address included in the goods delivery information, and the travel route from the harvest address included in the goods transportation information to the delivery address included in the goods delivery information by various methods (simulated annealing algorithm, artificial potential field method, fuzzy logic algorithm, tabu search algorithm, visual image space method, etc.). Then, the driving route and the vehicle-mounted terminal can be sent to the target transport vehicle, so that the vehicle-mounted terminal can control the target transport vehicle to transport the goods according to the driving route.
In some optional implementations of some embodiments, in response to determining that the current remaining transportation amount of the target transportation vehicle is greater than or equal to the amount of deliveries included in the item delivery information, the execution main body may perform vehicle scheduling according to a harvest address included in the item transportation information, a delivery address included in the item delivery information, and a delivery address, by:
the method includes a first step of determining whether or not a current remaining amount of carriers of the target transport vehicle is equal to or greater than an amount of carriers included in the item delivery information in response to a relative distance between a current position of the target transport vehicle and a delivery address included in the item delivery information being equal to or less than a first preset distance and a relative distance between a delivery address included in the item delivery information and any of the delivery addresses included in the item delivery information sequence being equal to or less than a second preset distance.
In some embodiments, the execution agent may determine whether the current remaining transport amount of the target transport vehicle is equal to or greater than the transport amount included in the article delivery information in response to a relative distance between the current position of the target transport vehicle and a delivery address included in the article delivery information being equal to or less than a first preset distance and a relative distance between the delivery address included in the article delivery information and any delivery address included in the article delivery information sequence being equal to or less than a second preset distance. Here, the setting of the first preset distance and the second preset distance is not limited. Wherein the first preset distance is smaller than the second preset distance. Here, the relative distance may refer to a route length of the travel locus of two positions. For example, the execution body may determine the route track from the current position of the target transportation vehicle to the delivery address included in the goods delivery information through various methods (a simulated annealing algorithm, an artificial potential field method, a fuzzy logic algorithm, a tabu search algorithm, a visual map space method, and the like). The length of the route trajectory may be determined again as a relative distance between the current position of the target transportation vehicle and the delivery address included in the item delivery information. Here, it is determined whether or not the current remaining transport volume of the target transport vehicle is equal to or greater than the delivery volume included in the article delivery information, that is, whether or not the current remaining transport volume of the target transport vehicle is equal to or greater than the delivery volume corresponding to the article delivery information, and whether or not the current remaining transport weight of the target transport vehicle is equal to or greater than the delivery weight corresponding to the article delivery information.
And a second step of generating confirmation carpooling information in response to a determination that the current remaining transport volume of the target transport vehicle is equal to or greater than the delivery volume included in the article delivery information.
In some embodiments, the execution agent may generate the confirmation carpool information in response to determining that the current remaining transport volume of the target transport vehicle is equal to or greater than the delivery volume included in the item delivery information. Here, the confirmation ride share information may be information indicating that delivery is determined. For example, the confirmation ride share information may be "distributable".
And thirdly, transmitting the confirmed carpooling information to a request terminal corresponding to the article delivery request.
In some embodiments, the execution subject may send the car pool confirmation information to a request terminal corresponding to the article delivery request. Here, the request terminal may refer to a terminal that transmits an article delivery request.
And fourthly, in response to receiving confirmation reply information corresponding to the confirmed carpooling information sent by the request terminal, generating a driving route according to the current position of the target transport vehicle and the delivery address included in the goods delivery information.
In some embodiments, the execution main body may generate a driving route according to the current position of the target transportation vehicle and a delivery address included in the item delivery information in response to receiving confirmation reply information corresponding to the confirmation car pool information sent by the request terminal. Here, the confirmation reply information may be feedback information representing that the confirmation carpool information is replied. For example, the confirmation reply message may be "please dispatch". In practice, the executing entity may determine the driving route from the current position of the target transportation vehicle to the delivery address included in the goods delivery information through various methods (simulated annealing algorithm, artificial potential field method, fuzzy logic algorithm, tabu search algorithm, visual image space method, etc.).
And fifthly, sending the running route to a vehicle-mounted terminal of the target transport vehicle to control the target transport vehicle to run according to the running route.
In some embodiments, the execution body may transmit the travel route to an in-vehicle terminal of the target transportation vehicle to control the target transportation vehicle to travel according to the travel route.
Thus, it is convenient to determine whether the dispensed amount of the dispensed item is equal to or less than the current remaining transport amount of the target transport vehicle to prevent the target transport vehicle from being overloaded. And after receiving the confirmation reply information corresponding to the confirmation carpooling information sent by the request terminal, enabling the target transport vehicle to transport the articles of other logistics platforms by using the residual transport resources of the vehicles.
Optionally, in response to detecting information indicating that the target transportation vehicle receives a delivery package corresponding to the item delivery information, updating the current remaining transportation volume of the target transportation vehicle, and adding the item delivery information to a preset item delivery information queue corresponding to the target transportation vehicle to update the item delivery information queue.
In some embodiments, the execution agent may update the current remaining transportation volume of the target transportation vehicle in response to detecting information indicating that the target transportation vehicle receives a delivery package corresponding to the item delivery information, and add the item delivery information to a preset item delivery information queue corresponding to the target transportation vehicle to update the item delivery information queue. Here, the information indicating that the target transportation vehicle receives the delivery package corresponding to the article delivery information may indicate that the target transportation vehicle receives the delivery package corresponding to the article delivery information. Here, the article delivery information in the article delivery information queue is information of items delivered by other logistics platforms received during transportation. Here, the updating of the current remaining transportation amount of the target transportation vehicle may be performed by subtracting the delivery amount of the delivery package of the item delivery information from the remaining transportation amount of the target transportation vehicle before the delivery package of the item delivery information is received by the target transportation vehicle.
Optionally, in response to receiving the transportation information indicating that the target transportation vehicle completes the parcel of the item corresponding to the item transportation information, updating the current remaining transportation volume of the target transportation vehicle.
In some embodiments, the execution subject may update the current remaining transportation amount of the target transportation vehicle in response to receiving transportation information sent by the vehicle-mounted terminal and indicating that the target transportation vehicle completes the package of the item corresponding to the item transportation information.
Optionally, in response to detecting information indicating that the target transportation vehicle completes transportation of each item package transported, an item delivery route is generated according to the current location of the target transportation vehicle and each delivery address included in the item delivery information queue.
In some embodiments, the executing agent may generate an item delivery route according to the current location of the target transportation vehicle and each delivery address included in the item delivery information queue in response to detecting information indicating that the target transportation vehicle completes delivery of each item package delivered. Here, the information indicating that the target transportation vehicle completes the transportation of each item package transported may be information indicating that the target transportation vehicle completes the transportation of each item package transported. In practice, the execution body may determine the article distribution route from the current position of the target transportation vehicle to each distribution address included in the article distribution information queue through various methods (a simulated annealing algorithm, an artificial potential field method, a fuzzy logic algorithm, a tabu search algorithm, a visual image space method, and the like).
Optionally, the article delivery route is sent to the vehicle-mounted terminal to control the target transportation vehicle to travel according to the article delivery route.
In some embodiments, the execution body may send the article distribution route to the vehicle-mounted terminal, so that the vehicle-mounted terminal controls the target transportation vehicle to travel according to the article distribution route.
The above embodiments of the present disclosure have the following advantages: by the transportation vehicle scheduling method of some embodiments of the present disclosure, waste of transportation resources is reduced. Specifically, the reason for causing the waste of transportation resources of the transportation vehicle is that: in the transportation process, the residual transportation resources of the vehicles cannot be utilized to transport the articles of other logistics platforms, so that the transportation resources of the transportation vehicles are wasted. Based on this, the vehicle control method of some embodiments of the present disclosure first obtains the item transportation information of each item parcel in the individual item parcels transported by the target transportation vehicle, and obtains an item transportation information sequence. And the article transportation information in the article transportation information sequence comprises a package identifier, a package size corresponding to the package identifier and a delivery address. Thus, it is convenient to determine the remaining transportation volume (resources) of the transportation vehicle, and to transport the items of other logistics platforms closer to the receiving address according to the respective receiving addresses. Then, for each item transportation information in the item transportation information sequence, executing the following processing steps: first, a transportation route is generated according to the current position of the target transportation vehicle and the delivery address included in the article transportation information. Then, in response to receiving an article delivery request while the target transport vehicle is traveling along the transport route, article delivery information corresponding to the article delivery request is acquired. The article delivery information includes a delivery volume, a delivery address, and a delivery address. Thus, it is convenient to determine whether the article delivery request submitted by the other received logistics platform (request terminal) is within the area of the transportation route. And finally, in response to determining that the current remaining transport amount of the target transport vehicle is equal to or greater than the transport amount included in the item delivery information, performing vehicle scheduling according to the harvest address included in the item transport information, the delivery address included in the item delivery information, and the delivery address. Thus, it is convenient to determine whether the dispensed amount of the dispensed item is equal to or less than the current remaining transport amount of the target transport vehicle to prevent the target transport vehicle from being overloaded. In addition, the target transport vehicle can be used for transporting the articles of other logistics platforms by using the residual transport resources of the vehicle. Thus, the waste of transportation resources is reduced.
With further reference to fig. 3, a flow 300 of further embodiments of a transportation vehicle scheduling method according to the present disclosure is shown. The method may be performed by the computing device 101 of fig. 1. The transportation vehicle dispatching method comprises the following steps:
step 301, obtaining the article transportation information of each article parcel in each article parcel transported by the target transport vehicle to obtain an article transportation information sequence.
In some embodiments, the specific implementation manner and technical effects of step 301 may refer to step 201 in those embodiments corresponding to fig. 2, and are not described herein again.
Step 302, for each item transportation information in the item transportation information sequence, executing the following processing steps:
step 3021, generating a transportation route according to the current position of the target transportation vehicle and the receiving address included in the item transportation information;
step 3022, in response to receiving the item delivery request while the target transportation vehicle is traveling along the transportation route, obtaining item delivery information corresponding to the item delivery request.
In some embodiments, the specific implementation manner and technical effects of steps 3021-3022 may refer to steps 2021-2022 in the embodiment corresponding to fig. 2, which are not described herein again.
Step 3023, in response to determining that the current remaining transportation amount of the target transportation vehicle is equal to or greater than the delivery amount included in the item delivery information, performing vehicle scheduling based on the harvest address included in the item transportation information, the delivery address included in the item delivery information, and the delivery address.
In some embodiments, in response to determining that the current remaining transport amount of the target transport vehicle is equal to or greater than the transport amount included in the item delivery information, an executing entity (e.g., the computing device 101 shown in fig. 1) of the transport vehicle scheduling method may perform vehicle scheduling according to the harvest address included in the item transport information, the delivery address included in the item delivery information, and the delivery address, by:
in a first step, in response to that a relative distance between the current position of the target transportation vehicle and a delivery address included in the item delivery information is greater than a first preset distance, and a relative distance between the delivery address included in the item delivery information and any delivery address included in the item transportation information sequence is less than or equal to a second preset distance, it is determined whether a relative distance between the delivery address included in the item delivery information and the transportation route is less than or equal to a third preset distance.
In practice, the executing agent may determine whether a relative distance between the delivery address included in the item delivery information and the transportation route is less than or equal to a third preset distance in response to that a relative distance between the current position of the target transportation vehicle and the delivery address included in the item delivery information is greater than the first preset distance and that a relative distance between the delivery address included in the item delivery information and any of the delivery addresses included in the item transportation information sequence is less than or equal to the second preset distance. Here, the relative distance between the shipping address and the transportation route included in the item delivery information may be a linear distance between the shipping address and the transportation route. Here, the setting of the third preset distance is not limited.
And a second step of generating first confirmation carpool information in response to determining that the relative distance between the delivery address and the transportation route included in the item delivery information is smaller than or equal to the third preset distance and the current remaining transportation amount of the target transportation vehicle is larger than or equal to the delivery amount included in the item delivery information, and sending the first confirmation carpool information to the request terminal.
In practice, the executing agent may generate first confirmation car pool information in response to determining that the relative distance between the delivery address included in the item delivery information and the transportation route is less than or equal to the third preset distance, and the current remaining transportation amount of the target transportation vehicle is greater than or equal to the delivery amount included in the item delivery information, and send the first confirmation car pool information to the request terminal. Here, the first confirmation ride share information may be information indicating that delivery is determined.
And thirdly, in response to receiving confirmation reply information corresponding to the first confirmation carpooling information sent by the request terminal, generating a first driving route according to the current position of the target transport vehicle and the delivery address included in the goods delivery information, and generating a second driving route according to the current position of the target transport vehicle and the delivery address included in the goods transportation information.
In practice, the executing body may generate a first driving route according to the current position of the target transportation vehicle and the delivery address included in the item delivery information, and generate a second driving route according to the current position of the target transportation vehicle and the delivery address included in the item transportation information, in response to receiving the confirmation reply information corresponding to the first confirmation carpooling information sent by the requesting terminal. In practice, the executing body may determine the first driving route from the current position of the target transportation vehicle to the delivery address included in the goods delivery information through various methods (simulated annealing algorithm, artificial potential field method, fuzzy logic algorithm, tabu search algorithm, visual map space method, etc.). The execution body may determine the second driving route from the current position of the target transportation vehicle to the delivery address included in the goods transportation information through various methods (a simulated annealing algorithm, an artificial potential field method, a fuzzy logic algorithm, a tabu search algorithm, a visual image space method, etc.).
And a fourth step of transmitting the second travel route to the vehicle-mounted terminal to control the target transportation vehicle to travel according to the second travel route in response to a determination that the route length of the first travel route is equal to or greater than the route length of the second travel route.
In practice, the execution body may send the second travel route to the on-vehicle terminal in response to determining that the route length of the first travel route is equal to or greater than the route length of the second travel route, for the on-vehicle terminal to control the target transportation vehicle to travel according to the second travel route.
And fifthly, in response to receiving the transportation information indicating that the target transportation vehicle finishes packaging the goods corresponding to the goods transportation information, updating the current residual transportation amount of the target transportation vehicle, and generating a third traveling route according to the receiving address included in the goods transportation information and the delivery address included in the goods delivery information.
In practice, the executing agent may update the current remaining transportation volume of the target transportation vehicle in response to receiving transportation information indicating that the target transportation vehicle completes packaging of the item corresponding to the item transportation information, and generate the third travel route according to the delivery address included in the item transportation information and the delivery address included in the item delivery information. Here, the transportation information indicating that the target transportation vehicle completes transportation of the item package corresponding to the item transportation information may indicate that the target transportation vehicle completes transportation of the item package corresponding to the item transportation information. In practice, the execution body may determine the third driving route from the receiving address included in the article transportation information to the delivery address included in the article delivery information through various methods (a simulated annealing algorithm, an artificial potential field method, a fuzzy logic algorithm, a tabu search algorithm, a visual map space method, etc.). Here, the updating of the current remaining transportation amount of the target transportation vehicle may be performed by adding the remaining transportation amount of the target transportation vehicle before the transportation of the item parcel corresponding to the item transportation information is completed to the parcel amount of the item parcel corresponding to the item transportation information.
And a sixth step of transmitting the third travel route to the vehicle-mounted terminal to control the target transportation vehicle to travel according to the third travel route.
In practice, the execution main body may send the third travel route to the vehicle-mounted terminal for vehicle-mounted control of the target transportation vehicle to travel according to the third travel route.
Optionally, in response to determining that the relative distance between the shipping address included in the item delivery information and the transportation route is equal to or less than the third preset distance and that the current remaining transportation amount of the target transportation vehicle is less than the delivery amount included in the item delivery information, a fourth driving route is generated according to the current position of the target transportation vehicle and the shipping address included in the item delivery information, and a fifth driving route is generated according to the current position of the target transportation vehicle and the receiving address included in the item delivery information.
In some embodiments, the execution main body may generate a fourth travel route based on the current position of the target transportation vehicle and the delivery address included in the item delivery information, and generate a fifth travel route based on the current position of the target transportation vehicle and the delivery address included in the item delivery information, in response to determining that the relative distance between the delivery address included in the item delivery information and the delivery route is equal to or less than the third preset distance, and that the current remaining transport amount of the target transportation vehicle is less than the delivery amount included in the item delivery information. In practice, the executing body may determine the fourth driving route from the current position of the target transportation vehicle to the delivery address included in the goods delivery information through various methods (a simulated annealing algorithm, an artificial potential field method, a fuzzy logic algorithm, a tabu search algorithm, a visual map space method, etc.). The execution body may determine the fifth driving route from the current position of the target transportation vehicle to the delivery address included in the goods transportation information through various methods (a simulated annealing algorithm, an artificial potential field method, a fuzzy logic algorithm, a tabu search algorithm, a visual image space method, etc.).
Alternatively, in response to determining that the route length of the fourth travel route is equal to or greater than the route length of the fifth travel route, the fifth travel route is transmitted to the vehicle-mounted terminal to control the target transport vehicle to travel according to the fifth travel route.
In some embodiments, the execution main body may transmit the fifth travel route to the in-vehicle terminal for the in-vehicle terminal to control the target transportation vehicle to travel according to the fifth travel route in response to a determination that the route length of the fourth travel route is equal to or greater than the route length of the fifth travel route.
Optionally, in response to receiving information indicating that the target transportation vehicle completes transportation of the item package corresponding to the item transportation information, updating the current remaining transportation volume of the target transportation vehicle.
In some embodiments, the execution subject may update the current remaining transportation volume of the target transportation vehicle in response to receiving information indicating that the target transportation vehicle completes transportation of the item package corresponding to the item transportation information. Here, the information indicating that the target transportation vehicle completes transportation of the item package corresponding to the item transportation information may indicate that the target transportation vehicle completes transportation of the item package corresponding to the item transportation information.
Optionally, in response to determining that the current remaining transportation amount of the target transportation vehicle is equal to or greater than the delivery amount included in the article delivery information, generating second confirmation carpool information, and sending the second confirmation carpool information to the request terminal.
In some embodiments, the executing agent may generate second confirmation carpool information in response to determining that the current remaining transportation amount of the target transportation vehicle is equal to or greater than the delivery amount included in the article delivery information, and send the second confirmation carpool information to the request terminal. Here, the second confirmation ride share information may be information indicating that delivery is determined.
Optionally, in response to receiving the confirmation reply information corresponding to the second confirmation carpool information, a sixth driving route is generated according to the receiving address included in the article transportation information and the delivery address included in the article delivery information.
In some embodiments, the executing agent may generate a sixth driving route according to a receiving address included in the article transportation information and a delivery address included in the article delivery information in response to receiving the confirmation reply information corresponding to the second confirmation carpool information. In practice, the execution body may determine the sixth driving route from the receiving address included in the article transportation information to the delivery address included in the article delivery information through various methods (a simulated annealing algorithm, an artificial potential field method, a fuzzy logic algorithm, a tabu search algorithm, a visual image space method, etc.).
Optionally, the sixth travel route is sent to the vehicle-mounted terminal to control the target transportation vehicle to travel according to the sixth travel route.
In some embodiments, the execution body may send the sixth travel route to the in-vehicle terminal, so that the in-vehicle terminal controls the target transportation vehicle to travel according to the sixth travel route.
The related content in step 3023 is used as an inventive point of the present disclosure, thereby solving the technical problem mentioned in the background art that "the remaining transportation resources of the transportation vehicle cannot be effectively utilized after the transportation vehicle finishes transporting a certain parcel due to different destinations of the user, resulting in the waste of the remaining transportation resources of the transportation vehicle". The waste factors that cause the remaining transportation resources of the transportation vehicles are often as follows: due to different destinations of users, after the transportation of a certain parcel is completed by the transportation vehicle, the residual transportation resources of the transportation vehicle cannot be effectively utilized, and the waste of the residual transportation resources of the transportation vehicle is caused. If the above factors are solved, the effect of reducing the waste of the transportation resources can be achieved. To achieve this effect, the present disclosure first generates a fourth travel route based on the current position of the target transportation vehicle and the delivery address included in the item delivery information, and generates a fifth travel route based on the current position of the target transportation vehicle and the delivery address included in the item delivery information, in response to determining that the relative distance between the delivery address included in the item delivery information and the delivery route is equal to or less than the third preset distance, and that the current remaining transport amount of the target transportation vehicle is less than the delivery amount included in the item delivery information. Thereby, it is facilitated to determine the route on which the target transportation vehicle is going to travel, according to the length of the route. Next, in response to determining that the route length of the fourth travel route is equal to or greater than the route length of the fifth travel route, the fifth travel route is transmitted to the vehicle-mounted terminal to control the target transport vehicle to travel according to the fifth travel route. Therefore, the target transport vehicle can be driven according to the shortest driving route, and energy is saved. And then, in response to receiving the information representing that the target transport vehicle finishes transporting the item package corresponding to the item transportation information, updating the current residual transport volume of the target transport vehicle. Therefore, after the transportation of a certain parcel is finished, the residual transportation resources (quantity) of the transportation vehicle are effectively utilized to transport the articles of other logistics platforms. Then, in response to determining that the current remaining transportation amount of the target transportation vehicle is equal to or greater than the delivery amount included in the article delivery information, second confirmation carpool information is generated, and the second confirmation carpool information is transmitted to the request terminal. And then, in response to receiving the confirmation reply information corresponding to the second confirmation carpool information, generating a sixth driving route according to the receiving address included in the article transportation information and the delivery address included in the article delivery information. And sending the sixth running route to the vehicle-mounted terminal so as to control the target transport vehicle to run according to the sixth running route. Therefore, after the target transport vehicle finishes transporting a certain parcel, the residual transport resources of the transport vehicle can be effectively utilized to transport the articles of other logistics platforms. Thus, the waste of transportation resources is reduced.
Step 3024, in response to that no delivery request for goods is received while the target transportation vehicle is traveling along the transportation route, and information indicating that the target transportation vehicle reaches the delivery address included in the goods transportation information is detected, updating the current remaining transportation amount of the target transportation vehicle.
In some embodiments, the executing agent may update the current remaining transportation amount of the target transportation vehicle in response to not receiving the item delivery request while the target transportation vehicle travels along the transportation route and detecting information indicating that the target transportation vehicle reaches the delivery address included in the item transportation information. Here, the information indicating that the target transport vehicle has reached the shipping address included in the article transportation information may be information indicating that the target transport vehicle has traveled to the shipping address included in the article transportation information.
As can be seen from fig. 3, compared with the description of some embodiments corresponding to fig. 2, the flow 300 of the transportation vehicle scheduling method in some embodiments corresponding to fig. 3 can transport the items of other logistics platforms by effectively utilizing the remaining transportation resources of the transportation vehicle after the target transportation vehicle completes the transportation of a certain package. Thus, the waste of transportation resources is reduced.
With further reference to fig. 4, as an implementation of the methods illustrated in the above figures, the present disclosure provides some embodiments of a transportation vehicle dispatching device, which correspond to those of the method embodiments described above in fig. 2, and which may be particularly applicable in various electronic devices.
As shown in fig. 4, the transportation vehicle dispatching device 400 of some embodiments includes: an acquisition unit 401 and a transport processing unit 402. The obtaining unit 401 is configured to obtain item transportation information of each item package in the item packages transported by the target transportation vehicle, to obtain an item transportation information sequence, where the item transportation information in the item transportation information sequence includes a package identifier, a package quantity corresponding to the package identifier, and a delivery address; the transportation processing unit 402 is configured to, for each item transportation information in the item transportation information sequence, perform the following processing steps: generating a transportation route according to the current position of the target transportation vehicle and the receiving address included in the article transportation information; in response to receiving an article delivery request during the traveling of the target transportation vehicle along the transportation route, acquiring article delivery information corresponding to the article delivery request, wherein the article delivery information includes a delivery volume, a delivery address and a delivery address; and in response to determining that the current remaining transport volume of the target transport vehicle is equal to or greater than the transport volume included in the item delivery information, performing vehicle scheduling based on the harvest address included in the item transport information, the delivery address included in the item delivery information, and the delivery address.
It will be understood that the elements described in the apparatus 400 correspond to various steps in the method described with reference to fig. 2. Thus, the operations, features and resulting advantages described above with respect to the method are also applicable to the apparatus 400 and the units included therein, and will not be described herein again.
Referring now to FIG. 5, a block diagram of an electronic device (e.g., computing device 101 of FIG. 1) 500 suitable for use in implementing some embodiments of the present disclosure is shown. The electronic device shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 5, electronic device 500 may include a processing means (e.g., central processing unit, graphics processor, etc.) 501 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage means 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data necessary for the operation of the electronic apparatus 500 are also stored. The processing device 501, the ROM502, and the RAM 503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
Generally, the following devices may be connected to the I/O interface 505: input devices 506 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 507 including, for example, a Liquid Crystal Display (LCD), speakers, vibrators, and the like; storage devices 508 including, for example, magnetic tape, hard disk, etc.; and a communication device 509. The communication means 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. While fig. 5 illustrates an electronic device 500 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 5 may represent one device or may represent multiple devices as desired.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flow diagrams may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In some such embodiments, the computer program may be downloaded and installed from a network via the communication means 509, or installed from the storage means 508, or installed from the ROM 502. The computer program, when executed by the processing device 501, performs the above-described functions defined in the methods of some embodiments of the present disclosure.
It should be noted that the computer readable medium described above in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.
The computer readable medium may be embodied in the apparatus; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring article transportation information of each article package in each article package transported by a target transport vehicle to obtain an article transportation information sequence, wherein the article transportation information in the article transportation information sequence comprises a package identifier, a package quantity corresponding to the package identifier and a delivery address; for each item transportation information in the item transportation information sequence, executing the following processing steps: generating a transportation route according to the current position of the target transportation vehicle and the receiving address included in the article transportation information; in response to receiving an article delivery request during the traveling of the target transportation vehicle along the transportation route, acquiring article delivery information corresponding to the article delivery request, wherein the article delivery information includes a delivery volume, a delivery address and a delivery address; and in response to determining that the current remaining transport volume of the target transport vehicle is equal to or greater than the transport volume included in the item delivery information, performing vehicle scheduling based on the harvest address included in the item transport information, the delivery address included in the item delivery information, and the delivery address.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in some embodiments of the present disclosure may be implemented by software, and may also be implemented by hardware. The described units may also be provided in a processor, and may be described as: a processor includes an acquisition unit and a transport processing unit. The names of the units do not in some cases constitute a limitation of the units themselves, and for example, the acquiring unit may also be described as "a unit that acquires item transportation information of each item package among the individual item packages transported by the target transportation vehicle, resulting in a sequence of item transportation information".
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.

Claims (13)

1. A method of dispatching a transportation vehicle, comprising:
acquiring article transportation information of each article package in each article package transported by a target transport vehicle to obtain an article transportation information sequence, wherein the article transportation information in the article transportation information sequence comprises a package identifier, a package quantity corresponding to the package identifier and a delivery address;
for each item transportation information in the item transportation information sequence, performing the following processing steps:
generating a transportation route according to the current position of the target transportation vehicle and the receiving address included in the article transportation information;
in response to receiving an item delivery request during the target transportation vehicle traveling along the transportation route, obtaining item delivery information corresponding to the item delivery request, wherein the item delivery information includes a delivery volume, a delivery address, and a delivery address;
and in response to determining that the current remaining transport amount of the target transport vehicle is greater than or equal to the delivery amount included in the item delivery information, performing vehicle scheduling according to the harvest address included in the item transport information, the delivery address included in the item delivery information and the delivery address.
2. The method according to claim 1, wherein the performing vehicle scheduling according to the harvest address included in the item transportation information, the delivery address included in the item delivery information, and the delivery address includes:
determining whether the current remaining transport amount of the target transport vehicle is greater than or equal to the transport amount included in the item delivery information in response to that the relative distance between the current position of the target transport vehicle and the delivery address included in the item delivery information is less than or equal to a first preset distance and that the relative distance between the delivery address included in the item delivery information and any delivery address included in the item delivery information sequence is less than or equal to a second preset distance;
and generating confirmation carpooling information in response to determining that the current remaining transport volume of the target transport vehicle is greater than or equal to the delivery volume included in the item delivery information.
3. The method according to claim 2, wherein the vehicle scheduling according to the harvest address included in the item transportation information, the delivery address included in the item delivery information, and the delivery address, further comprises:
sending the carpooling confirmation information to a request terminal corresponding to the article distribution request;
in response to receiving confirmation reply information corresponding to the confirmed carpooling information sent by the request terminal, generating a driving route according to the current position of the target transport vehicle and a delivery address included in the item delivery information;
and sending the running route to a vehicle-mounted terminal of the target transport vehicle so as to control the target transport vehicle to run according to the running route.
4. The method of claim 1, wherein the method further comprises:
in response to detecting that the target transportation vehicle receives information of a delivery package corresponding to the item delivery information, updating the current remaining transportation volume of the target transportation vehicle, and adding the item delivery information to a preset item delivery information queue corresponding to the target transportation vehicle to update the item delivery information queue;
and updating the current residual transport volume of the target transport vehicle in response to receiving the transport information representing that the target transport vehicle completes the item package corresponding to the item transport information.
5. The method according to claim 1, wherein the performing vehicle scheduling according to the harvest address included in the item transportation information, the delivery address included in the item delivery information, and the delivery address includes:
in response to that the relative distance between the current position of the target transportation vehicle and the delivery address included in the item delivery information is greater than a first preset distance, and the relative distance between the delivery address included in the item delivery information and any delivery address included in the item transportation information sequence is less than or equal to a second preset distance, determining whether the relative distance between the delivery address included in the item delivery information and the transportation route is less than or equal to a third preset distance;
in response to determining that the relative distance between the delivery address and the transportation route included in the item delivery information is smaller than or equal to the third preset distance and the current remaining transportation amount of the target transportation vehicle is larger than or equal to the delivery amount included in the item delivery information, generating first confirmation carpool information and sending the first confirmation carpool information to the request terminal corresponding to the item delivery request;
in response to receiving confirmation reply information corresponding to the first confirmation carpooling information sent by the request terminal, generating a first driving route according to the current position of the target transport vehicle and the delivery address included in the item delivery information, and generating a second driving route according to the current position of the target transport vehicle and the delivery address included in the item delivery information.
6. The method according to claim 5, wherein the vehicle scheduling according to the harvest address included in the item transportation information, the delivery address included in the item delivery information, and the delivery address, further comprises:
in response to determining that the route length of the first travel route is equal to or greater than the route length of the second travel route, sending the second travel route to the in-vehicle terminal to control the target transport vehicle to travel according to the second travel route;
in response to receiving transportation information representing that the target transportation vehicle finishes packaging the item corresponding to the item transportation information, updating the current residual transportation volume of the target transportation vehicle, and generating a third driving route according to a receiving address included in the item transportation information and a delivery address included in the item delivery information;
and sending the third traveling route to the vehicle-mounted terminal so as to control the target transport vehicle to travel according to the third traveling route.
7. The method of claim 1, wherein the method further comprises:
and in response to not receiving the item delivery request during the target transportation vehicle driving according to the transportation route and detecting the information representing that the target transportation vehicle reaches the receiving address included in the item transportation information, updating the current residual transportation volume of the target transportation vehicle.
8. The method of claim 5, wherein the method further comprises:
in response to determining that the relative distance between the shipping address included in the item delivery information and the transportation route is less than or equal to the third preset distance and that the current remaining transportation volume of the target transportation vehicle is less than the volume of the delivery included in the item delivery information, generating a fourth driving route according to the current position of the target transportation vehicle and the shipping address included in the item delivery information, and generating a fifth driving route according to the current position of the target transportation vehicle and the receiving address included in the item delivery information;
in response to determining that the route length of the fourth travel route is equal to or greater than the route length of the fifth travel route, sending the fifth travel route to the in-vehicle terminal to control the target transport vehicle to travel according to the fifth travel route;
and updating the current residual transport volume of the target transport vehicle in response to receiving the information representing that the target transport vehicle completes the transportation of the item package corresponding to the item transportation information.
9. The method of claim 8, wherein the method further comprises:
in response to determining that the current remaining transport volume of the target transport vehicle is greater than or equal to the delivery volume included in the item delivery information, generating second confirmation carpool information, and sending the second confirmation carpool information to the request terminal;
in response to receiving the confirmation reply information corresponding to the second confirmation carpooling information, generating a sixth driving route according to the receiving address included in the article transportation information and the delivery address included in the article delivery information;
and sending the sixth running route to the vehicle-mounted terminal so as to control the target transport vehicle to run according to the sixth running route.
10. The method of claim 4, wherein the method further comprises:
in response to detecting information that characterizes the target transportation vehicle as completing transportation of each item package being transported, generating an item delivery route according to the current location of the target transportation vehicle and each delivery address included in the item delivery information queue;
and sending the article distribution route to the vehicle-mounted terminal so as to control the target transport vehicle to run according to the article distribution route.
11. A transportation vehicle dispatching device, comprising:
the system comprises an acquisition unit, a storage unit and a delivery unit, wherein the acquisition unit is configured to acquire article transportation information of each article parcel in each article parcel transported by a target transport vehicle to obtain an article transportation information sequence, and the article transportation information in the article transportation information sequence comprises a parcel identifier, a parcel volume corresponding to the parcel identifier and a delivery address;
a transportation processing unit configured to perform, for each item transportation information in the item transportation information sequence, the following processing steps:
generating a transportation route according to the current position of the target transportation vehicle and the receiving address included in the article transportation information;
in response to receiving an item delivery request during the target transportation vehicle traveling along the transportation route, obtaining item delivery information corresponding to the item delivery request, wherein the item delivery information includes a delivery volume, a delivery address, and a delivery address;
and in response to determining that the current remaining transport amount of the target transport vehicle is greater than or equal to the delivery amount included in the item delivery information, performing vehicle scheduling according to the harvest address included in the item transport information, the delivery address included in the item delivery information and the delivery address.
12. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon;
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-10.
13. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one of claims 1-10.
CN202111078526.8A 2021-09-15 2021-09-15 Transportation vehicle scheduling method and device, electronic equipment and computer readable medium Pending CN113850546A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111078526.8A CN113850546A (en) 2021-09-15 2021-09-15 Transportation vehicle scheduling method and device, electronic equipment and computer readable medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111078526.8A CN113850546A (en) 2021-09-15 2021-09-15 Transportation vehicle scheduling method and device, electronic equipment and computer readable medium

Publications (1)

Publication Number Publication Date
CN113850546A true CN113850546A (en) 2021-12-28

Family

ID=78973922

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111078526.8A Pending CN113850546A (en) 2021-09-15 2021-09-15 Transportation vehicle scheduling method and device, electronic equipment and computer readable medium

Country Status (1)

Country Link
CN (1) CN113850546A (en)

Similar Documents

Publication Publication Date Title
JP7136921B2 (en) Method and apparatus for conveying merchandise shelves
CN113642935B (en) Big data analysis-based supply chain operation platform data processing method and device
CN114902257A (en) Improved logistics management system
CN111553548B (en) Goods picking method and device
CN109635980A (en) About vehicle order allocation method and system
CN114493413A (en) Intelligent warehousing distribution method and device, electronic equipment and storage medium
CN113222205B (en) Path planning method and device
CN113205300B (en) Distribution vehicle scheduling method and device, electronic equipment and computer readable medium
CN113762674B (en) Order distribution method and device
CN111738635A (en) Logistics method, device, computer system and medium
CN113850546A (en) Transportation vehicle scheduling method and device, electronic equipment and computer readable medium
CN111694350A (en) Information processing apparatus, information processing method, and program
CN115222328A (en) Logistics tracking method, device, equipment and medium
CN112953997B (en) Control device and computer-readable recording medium
CN112446565A (en) Method and device for matching vehicles for orders
CN112085359A (en) Information generation method and device, electronic equipment and computer readable medium
CN113065820A (en) Information generation method and device, electronic equipment and computer readable medium
CN113065829A (en) Logistics product determination method and device, electronic equipment and computer readable medium
CN113449053B (en) Vehicle scheduling method and device
CN115545620B (en) Logistics transportation method and device based on block chain, electronic equipment and readable medium
CN116579693B (en) Goods verification delivery method, device, equipment and readable medium based on earphone
CN111144602A (en) Vehicle scheduling method and device
CN114422549B (en) Message processing method and device, terminal equipment and storage medium
EP3040919A1 (en) Ad-hoc special delivery services in a delivery network
CN117236837B (en) Electric power material distribution and vehicle positioning information display method and device and electronic 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