CN113362010A - Transportation cable arranging method, device, equipment and computer readable storage medium - Google Patents

Transportation cable arranging method, device, equipment and computer readable storage medium Download PDF

Info

Publication number
CN113362010A
CN113362010A CN202110735882.6A CN202110735882A CN113362010A CN 113362010 A CN113362010 A CN 113362010A CN 202110735882 A CN202110735882 A CN 202110735882A CN 113362010 A CN113362010 A CN 113362010A
Authority
CN
China
Prior art keywords
transportation
line
article
destination
determining
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
CN202110735882.6A
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.)
Hanhai Information Technology Shanghai Co Ltd
Original Assignee
Beijing Sankuai Online 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 Beijing Sankuai Online Technology Co Ltd filed Critical Beijing Sankuai Online Technology Co Ltd
Priority to CN202110735882.6A priority Critical patent/CN113362010A/en
Publication of CN113362010A publication Critical patent/CN113362010A/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
    • G06Q10/0835Relationships between shipper or supplier and carriers
    • G06Q10/08355Routing methods
    • 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/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315Needs-based resource requirements planning or analysis

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application discloses a transportation winding displacement method, a transportation winding displacement device, equipment and a computer readable storage medium, and belongs to the technical field of computers. The method comprises the following steps: determining currently available transportation resources; acquiring the volume of the articles to be transported to each transportation destination; and generating a suggested line arranging scheme according to the geographical position of each transportation destination, the article volume of each transportation destination and the transportation resources, wherein the suggested line arranging scheme comprises at least one transportation line, each transportation line covers at least one transportation destination, and the predicted arrival time of each transportation line meets the preset time requirement. The transportation winding displacement method determined by the method can meet the requirement of article transportation and can improve the efficiency of article transportation.

Description

Transportation cable arranging method, device, equipment and computer readable storage medium
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to a transportation winding displacement method, a transportation winding displacement device, equipment and a computer readable storage medium.
Background
With the continuous development of computer equipment, electronic commerce is also developing gradually. Electronic commerce refers to a business that carries out transaction activities and related service activities in an electronic transaction manner on the internet, an intranet and a value-added network. In the electronic commerce business, people send items to a transportation destination by online or offline ordering, and people go to the transportation destination to pick up the items.
In the related art, transportation resources (such as transportation vehicles) are determined and a transportation route is planned by workers based on geographical position information of each transportation destination and articles to be transported of each transportation destination, so that the transportation resources are scheduled to transport the articles according to the planned transportation route.
However, the transportation resources and the transportation routes in the transportation and winding displacement method are determined according to manual experience, so that the transportation efficiency is low.
Disclosure of Invention
The embodiment of the application provides a transportation winding displacement method, a transportation winding displacement device, equipment and a computer readable storage medium, which can be used for solving the problems in the related art. The technical scheme is as follows:
in one aspect, an embodiment of the present application provides a transportation cable arranging method, including:
determining currently available transportation resources;
acquiring the volume of the articles to be transported to each transportation destination;
generating a suggested line arranging scheme according to the geographical position of each transportation destination, the article volume of each transportation destination and the transportation resources, wherein the suggested line arranging scheme comprises at least one transportation line, each transportation line covers at least one transportation destination, and the predicted arrival time of each transportation line meets the preset time requirement.
In one possible implementation, the generating a suggested routing scheme according to the geographic location of each transportation destination, the article volume of each transportation destination, and the transportation resource includes:
taking the sum of the article volumes of the various transportation destinations as a first article volume;
generating a plurality of initial winding schemes based on the volume of the transportation resource and the volume of the first article, wherein the initial winding schemes comprise at least one transportation line, each transportation line covers at least one transportation destination, and each transportation line corresponds to one transportation resource;
determining the suggested routing scheme among the plurality of initial routing schemes based on the geographic location of the respective transportation destination.
In one possible implementation, the determining the suggested routing scheme among the plurality of initial routing schemes based on the geographic location of the respective transportation destination includes:
determining an estimated delivery duration of each transportation route based on the geographical location of the transportation destination covered by each transportation route;
determining a predicted delivery time of each transportation route based on a second article volume corresponding to each transportation route and a predicted delivery time of each transportation route, wherein the second article volume is the sum of the article volumes of transportation destinations covered by the transportation routes;
in response to the fact that an initial wire arranging scheme with the estimated delivery time of each transportation line meeting a preset time requirement exists in the plurality of initial wire arranging schemes, taking the initial wire arranging scheme with the estimated delivery time of each transportation line meeting the preset time requirement as a reference wire arranging scheme;
determining the suggested routing scheme based on the reference routing scheme.
In one possible implementation, the determining the suggested winding scheme based on the reference winding scheme includes:
determining a total resource value corresponding to the reference line arrangement scheme based on the resource numerical value of the transportation resource corresponding to each transportation line in the reference line arrangement scheme;
and taking the reference wire arranging scheme with the total resource value meeting the preset resource requirement in the reference wire arranging scheme as the suggested wire arranging scheme.
In one possible implementation manner, the determining the estimated delivery time of each transportation route based on the second object volume corresponding to each transportation route and the estimated delivery time of each transportation route includes:
determining the delivery time of the article corresponding to each transportation line based on the volume of the second article corresponding to each transportation line;
and determining the estimated delivery time of each transportation line based on the article delivery time corresponding to each transportation line and the estimated delivery time of each transportation line.
In one possible implementation manner, the determining, based on the volume of the second article corresponding to each transportation route, the article warehouse-out time corresponding to each transportation route includes:
determining an article loading duration of each transportation line based on the second article volume of each transportation line;
and determining the delivery time of the article corresponding to each transportation line based on the article loading duration of each transportation line.
In one possible implementation, the obtaining the volume of the article to be transported to each transportation destination includes:
acquiring the quantity of the articles to be transported of each transport destination in a historical time period;
determining the quantity of the articles to be transported of each transportation destination in the current time period based on the quantity of the articles to be transported of each transportation destination in the historical time period;
and determining the article volume of the article to be transported of each transportation destination according to the article quantity of the article to be transported of each transportation destination in the current time period.
In one possible implementation manner, the determining the estimated delivery time length of each transportation route based on the geographical location of the transportation destination covered by each transportation route includes:
determining a driving distance corresponding to each transportation line based on the geographical position of the transportation destination covered by each transportation line;
taking the running speed of the transportation resource corresponding to each transportation line as the running speed corresponding to each transportation line;
and determining the estimated distribution time length of each transportation line based on the corresponding running speed of each transportation line and the corresponding running distance of each transportation line.
In one possible implementation, the determining the article loading duration of each transportation line based on the second article volume of each transportation line includes:
determining an item loading rate based on historical loading conditions;
and determining the article loading time of each transportation line according to the article loading speed and the second article volume of each transportation line.
In one possible implementation, after generating the suggested winding displacement scheme according to the geographical location of each transportation destination, the article volume of each transportation destination, and the transportation resource, the method further includes:
and scheduling the transportation resources corresponding to each transportation line in the suggested line arrangement scheme to transport the objects of the transportation destinations covered by each transportation line.
In one possible implementation, the transportation resource includes at least one of an unmanned vehicle, a drone, and a manned vehicle.
In another aspect, an embodiment of the present application provides a transportation cable device, including:
a determining module for determining currently available transportation resources;
the acquisition module is used for acquiring the volume of the articles to be transported to each transportation destination;
the generation module is used for generating a suggested line arranging scheme according to the geographical position of each transportation destination, the article volume of each transportation destination and the transportation resources, wherein the suggested line arranging scheme comprises at least one transportation line, each transportation line covers at least one transportation destination, and the predicted arrival time of each transportation line meets the preset time requirement.
In one possible implementation, the determining module is configured to use a sum of the article volumes of the transportation destinations as a first article volume;
the generation module is configured to generate a plurality of initial winding displacement schemes based on the volume of the transportation resource and the volume of the first article, where each initial winding displacement scheme includes at least one transportation route, each transportation route covers at least one transportation destination, and each transportation route corresponds to one transportation resource;
the determination module is configured to determine the suggested routing scheme among the plurality of initial routing schemes based on the geographic location of the respective transportation destination.
In a possible implementation manner, the determining module is configured to determine a predicted delivery duration of each transportation route based on a geographical location of a transportation destination covered by each transportation route;
determining a predicted delivery time of each transportation route based on a second article volume corresponding to each transportation route and a predicted delivery time of each transportation route, wherein the second article volume is the sum of the article volumes of transportation destinations covered by the transportation routes;
in response to the fact that an initial wire arranging scheme with the estimated delivery time of each transportation line meeting a preset time requirement exists in the plurality of initial wire arranging schemes, taking the initial wire arranging scheme with the estimated delivery time of each transportation line meeting the preset time requirement as a reference wire arranging scheme;
determining the suggested routing scheme based on the reference routing scheme.
In a possible implementation manner, the determining module is configured to determine, based on a resource numerical value of a transportation resource corresponding to each transportation route in the reference wire arranging scheme, a total resource value corresponding to the reference wire arranging scheme;
and taking the reference wire arranging scheme with the total resource value meeting the preset resource requirement in the reference wire arranging scheme as the suggested wire arranging scheme.
In a possible implementation manner, the determining module is configured to determine the delivery time of the article corresponding to each transportation route based on the volume of the second article corresponding to each transportation route;
and determining the estimated delivery time of each transportation line based on the article delivery time corresponding to each transportation line and the estimated delivery time of each transportation line.
In a possible implementation manner, the determining module is configured to determine the article loading duration of each transportation route based on the second article volume of each transportation route;
and determining the delivery time of the article corresponding to each transportation line based on the article loading duration of each transportation line.
In a possible implementation manner, the obtaining module is configured to obtain an item quantity of the item to be transported at each transportation destination in a historical time period;
determining the quantity of the articles to be transported of each transportation destination in the current time period based on the quantity of the articles to be transported of each transportation destination in the historical time period;
and determining the article volume of the article to be transported of each transportation destination according to the article quantity of the article to be transported of each transportation destination in the current time period.
In a possible implementation manner, the determining module is configured to determine a travel distance corresponding to each transportation route based on a geographic location of a transportation destination covered by each transportation route;
taking the running speed of the transportation resource corresponding to each transportation line as the running speed corresponding to each transportation line;
and determining the estimated distribution time length of each transportation line based on the corresponding running speed of each transportation line and the corresponding running distance of each transportation line.
In one possible implementation, the determining module is configured to determine an article loading speed based on historical loading conditions;
and determining the article loading time of each transportation line according to the article loading speed and the second article volume of each transportation line.
In one possible implementation, the apparatus further includes:
and the scheduling module is used for scheduling the transportation resources corresponding to each transportation line in the suggested line arrangement scheme to transport the objects of the transportation destinations covered by each transportation line.
In one possible implementation, the transportation resource includes at least one of an unmanned vehicle, a drone, and a manned vehicle.
In another aspect, an embodiment of the present application provides a computer device, where the computer device includes a processor and a memory, where the memory stores at least one program code, and the at least one program code is loaded and executed by the processor, so as to enable the computer device to implement any one of the transportation and cabling methods described above.
In another aspect, a computer-readable storage medium is provided, in which at least one program code is stored, and the at least one program code is loaded and executed by a processor, so as to make a computer implement any one of the transportation and wiring methods described above.
In another aspect, a computer program or a computer program product is provided, in which at least one computer instruction is stored, and the at least one computer instruction is loaded and executed by a processor, so as to enable a computer to implement any one of the transportation and wiring methods described above.
The technical scheme provided by the embodiment of the application at least has the following beneficial effects:
the technical scheme provided by the embodiment of the application plans a suggested winding displacement scheme based on available transportation resources and the article volume of the article to be transported of each transportation destination, and the predicted delivery time of each transportation line included in the suggested winding displacement scheme meets the preset time requirement, so that the transportation timeliness of each transportation line can be guaranteed when the suggested winding displacement scheme is used for transporting the article, and the article transportation efficiency can be improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic view illustrating an implementation environment of a transportation and cabling method according to an embodiment of the present disclosure;
fig. 2 is a flowchart of a transportation cable arranging method according to an embodiment of the present application;
fig. 3 is a structural diagram of a transportation cable arrangement method according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a transportation cable arranging device according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of an electronic device provided in an embodiment of the present application;
fig. 6 is a schematic structural diagram of a server according to an embodiment of the present application.
Detailed Description
To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
Fig. 1 is a schematic diagram of an implementation environment of a transportation and cable arranging method according to an embodiment of the present application, and as shown in fig. 1, the implementation environment includes: a computer device 11.
The computer device 11 may be an electronic device or a server, which is not limited in this embodiment of the present application. The computer device 11 is used for executing the transportation cable method provided by the embodiment of the application.
When the computer device 11 is an electronic device, the electronic device may be at least one of a smart phone, a game console, a desktop computer, a tablet computer, an electronic book reader, an MP3(Moving Picture Experts Group Audio Layer III) player, an MP4(Moving Picture Experts Group Audio Layer IV) player, and a laptop computer.
When the computer device 11 is a server, the server is a server, or a server cluster formed by a plurality of servers, or any one of a cloud computing platform and a virtualization center, which is not limited in this embodiment of the present application. The server may be in communication with the electronic device via a wired network or a wireless network. The server may have data processing, data storage, and data transceiving functions, and of course, the server may also have other functions, which is not limited in this embodiment of the present application.
Based on the above implementation environment, the embodiment of the present application provides a transportation and cabling method, which can be executed by the computer device 11 in fig. 1, taking the flowchart of the transportation and cabling method provided by the embodiment of the present application as an example shown in fig. 2. As shown in fig. 2, the method comprises the steps of:
in step 201, the currently available transportation resources are determined.
In the exemplary embodiment of the present application, the transportation resource includes at least one of an unmanned vehicle, an unmanned aerial vehicle, and a manned vehicle, and the type of the transportation resource is not limited in the embodiment of the present application. The computer device also stores the related information of the transportation resource, and the related information of the transportation resource comprises the volume of the transportation resource and the resource value (such as the price of the transportation resource) of the transportation resource. The volume of the transportation resource refers to the size of a space for storing commodities on the transportation resource, the volume of any one transportation resource is fixed, the volumes of any two transportation resources can be the same or different, and the embodiment of the application does not limit the volume. The resource value of the transportation resource is the resource value which needs to be transferred when the transportation resource is used for commodity transportation.
Illustratively, the currently available transportation resources include a vehicle one, a vehicle two and a vehicle three, and the correspondence relationship between the transportation resources, the volume of the transportation resources and the resource values of the transportation resources is shown in the following table one.
Watch 1
Transporting resources Volume of transported resources Resource value of a transportation resource
Vehicle 1 20 cubic meter 150 yuan
Vehicle 2 40 cubic meter 280 yuan
Vehicle III 60 cubic meter 400 yuan
As described in the first table, the volume of the first vehicle is 20 cubic meters, and the resource value of the first vehicle is 150 yuan; the volume of the second vehicle is 40 cubic meters, and the resource value of the second vehicle is 280 yuan; the volume of the vehicle III is 60 cubic meters, and the resource value of the vehicle III is 400 yuan.
In step 202, the volume of items that need to be transported to each of the transport destinations is obtained.
In one possible implementation, the process of obtaining the volume of the article to be transported to each transportation destination is: acquiring the quantity of articles to be transported of each transport destination in a historical time period; determining the quantity of the articles to be transported of each transportation destination in the current time period based on the quantity of the articles to be transported of each transportation destination in the historical time period; and determining the article volume of the article to be transported of each transportation destination according to the article quantity of the article to be transported of each transportation destination in the current time period.
In one possible implementation, the article volume of the article to be transported of each transport destination may also be determined based on the number of articles sold and the article volume of each transport destination.
Wherein the article volume of the articles to be transported of each transportation destination is the total article volume of the articles to be transported included in each transportation destination. For example, the number of articles to be transported at the first transportation destination is 8, where the article volume of two articles is 2 cubic meters, and the article volume of the remaining six articles is 1 cubic meter, and then the article volume of the article to be transported at the first transportation destination is 2 × 2+1 × 6 — 10 cubic meters.
Illustratively, the article number and the article volume of the articles to be transported of three transportation destinations are acquired. The number of the articles to be transported at the first transportation destination is 8, and the volume of the articles is 10 cubic meters. The number of articles to be transported at the second transportation destination is 7, and the volume of the articles is 13 cubic meters. The number of the articles to be transported at the transport destination three is 12, and the volume of the articles is 20 cubic meters.
In step 203, a suggested winding displacement scheme is generated according to the geographical position of each transportation destination, the article volume of each transportation destination and the transportation resources.
In an exemplary embodiment of the present application, a suggested routing scheme includes at least one transportation route, each transportation route covering at least one transportation destination, and an estimated arrival time of each transportation route satisfying a preset time requirement.
Wherein the predicted delivery time satisfies the preset time requirement that the predicted delivery time is before the target time. The target time is set by a user, and may also be adjusted based on an application scenario, which is not limited in the embodiment of the present application. Illustratively, the target time is 16: 00.
In one possible implementation, the process of generating the suggested winding displacement scheme according to the geographical location of each transportation destination, the article volume of each transportation destination, and the transportation resources is as follows: the sum of the article volumes of the individual transport destinations is taken as the first article volume. And generating a plurality of initial winding displacement schemes based on the volume of the transportation resources and the volume of the first article, wherein each initial winding displacement scheme comprises at least one transportation line, each transportation line covers at least one transportation destination, and each transportation line corresponds to one transportation resource. A suggested routing scheme is determined among a plurality of initial routing schemes based on the geographic location of each of the transportation destinations.
Wherein each initial thread arrangement scheme comprises a total volume of transportation resources not less than the first item volume.
Illustratively, the transportation destinations include a first transportation destination, a second transportation destination, and a third transportation destination, wherein the article volume of the article to be transported of the first transportation destination is 10 cubic meters, the article volume of the article to be transported of the second transportation destination is 13 cubic meters, and the article volume of the article to be transported of the third transportation destination is 20 cubic meters. Obtaining a first article volume based on the article volumes of the articles to be transported of the respective transportation destinations as: 10+13+20 ═ 43 cubic meters.
Take the available transportation resources as the transportation resources in table one above as an example. Based on the volume of the transportation resource and the volume of the first article, five initial winding schemes can be obtained, which are respectively: the first initial winding displacement scheme to the fifth initial winding displacement scheme. The first initial wire arranging scheme comprises three transportation lines, wherein the transportation destination covered by the first transportation line is a first transportation destination, and the transportation resource corresponding to the first transportation line is a first vehicle; the transportation destination covered by the second transportation line is a second transportation destination, and the transportation resource corresponding to the second transportation line is a first vehicle; the transportation destination covered by the third transportation line is a transportation destination III, and the transportation resource corresponding to the third transportation line is a vehicle I.
The initial wire arranging scheme II comprises two transportation lines, wherein the first transportation line covers two transportation destinations (a transportation destination I and a transportation destination II), the transportation resource corresponding to the first transportation line is a vehicle II, the second transportation line covers one transportation destination (a transportation destination III), and the transportation resource corresponding to the second transportation line is a vehicle I.
The initial wire arranging scheme III comprises two transportation lines, wherein the first transportation line covers two transportation destinations (a first transportation destination and a third transportation destination), the transportation resource corresponding to the first transportation line is a vehicle II, the second transportation line covers one transportation destination (a second transportation destination), and the transportation resource corresponding to the second transportation line is a vehicle I.
The initial wire arranging scheme four comprises two transportation lines, wherein the first transportation line covers two transportation destinations (a transportation destination two and a transportation destination three), the transportation resource corresponding to the first transportation line is a vehicle two, the second transportation line covers one transportation destination (a transportation destination one), and the transportation resource corresponding to the second transportation line is a vehicle one.
The initial wire arranging scheme five comprises a transportation line, the transportation line covers three transportation destinations (a transportation destination I, a transportation destination II and a transportation destination III), and the transportation resources corresponding to the transportation line are vehicles III.
It should be noted that, the above is only exemplified by three transportation destinations, and is not intended to limit the number of transportation destinations, and the number of transportation destinations may be more or less, which is not limited in the embodiments of the present application. The article volume of the article to be transported of each transport destination may be larger or smaller, which is not limited in the embodiment of the present application.
In one possible implementation, the process of determining a suggested routing scheme among the plurality of initial routing schemes based on the geographic location of the respective transportation destination is as follows: an estimated delivery duration for each transportation route is determined based on the geographical location of the transportation destination covered by each transportation route. And determining the predicted delivery time of each transportation line based on the corresponding second article volume of each transportation line and the predicted delivery time of each transportation line. And in response to the initial wire arranging scheme that the predicted delivery time of each transportation line meets the preset time requirement exists in the plurality of initial wire arranging schemes, taking the initial wire arranging scheme that the predicted delivery time of each transportation line meets the preset time requirement as a reference wire arranging scheme. A suggested routing scheme is determined based on the reference routing scheme.
Wherein the second item volume is the sum of the item volumes of the transportation destinations covered by the transportation route. For example, the first transportation route in the first initial wire arranging scheme covers only the first transportation destination, and therefore, the volume of the first transportation destination is determined as the volume of the second transportation route corresponding to the first transportation route in the first initial wire arranging scheme. That is, the volume of the second article corresponding to the first transportation route in the first initial wire arranging scheme is 10 cubic meters.
For another example, the first transportation route in the second initial routing plan covers the first transportation destination and the second transportation destination, and the sum of the article volume of the first transportation destination and the article volume of the second transportation destination is taken as the second article volume corresponding to the first transportation route in the second initial routing plan, that is, the second article volume corresponding to the first transportation route in the second initial routing plan is 23 cubic meters.
It should be noted that the determination process of the volume of the second item corresponding to other transportation routes is similar to the above process, and is not described herein again.
In one possible implementation, there are two cases where the suggested winding scheme is determined based on the reference winding scheme.
In case one, a reference wiring scheme is randomly determined as a suggested wiring scheme.
Illustratively, the estimated arrival time of each transportation line in the first initial winding displacement scheme, the second initial winding displacement scheme and the fifth initial winding displacement scheme meets the preset time requirement, and therefore the first initial winding displacement scheme, the second initial winding displacement scheme and the fifth initial winding displacement scheme are determined as reference winding displacement schemes. And randomly determining an initial wiring scheme one as a suggested wiring scheme in the reference wiring scheme.
And in the second case, the reference wire arranging scheme with the total resource value meeting the preset resource requirement in the reference wire arranging scheme is taken as the suggested wire arranging scheme.
In a possible implementation manner, the total resource value corresponding to the reference line arrangement scheme is determined based on the resource numerical value of the transportation resource corresponding to each transportation line in the reference line arrangement scheme. And taking the reference wire arranging scheme with the total resource value meeting the preset resource requirement in the reference wire arranging scheme as a suggested wire arranging scheme.
The reference winding displacement scheme meeting the preset resource requirement may be the reference winding displacement scheme with the lowest total resource value.
For example, if the transportation resources corresponding to the three transportation routes in the first initial winding displacement scheme are all the first vehicles, and the resource value of the first vehicle is 150 yuan, the total resource value of the first initial winding displacement scheme is 450 yuan. The transportation resources corresponding to the two transportation lines in the initial winding displacement scheme two are a vehicle I and a vehicle II respectively, the resource value of the vehicle I is 150 yuan, the resource value of the vehicle II is 280 yuan, and the total resource value of the initial winding displacement scheme II is 430 yuan. And the transportation resource corresponding to the transportation line in the initial wire arranging scheme five is a vehicle three, the resource value of the vehicle three is 400 yuan, and the total resource value of the initial wire arranging scheme five is 400 yuan.
It should be noted that the process for determining the total resource value of the other reference traverse schemes is similar to the process for determining the total resource value of the initial traverse scheme one, and is not described herein again.
Illustratively, the estimated arrival time of each transportation line in the first initial winding displacement scheme, the second initial winding displacement scheme and the fifth initial winding displacement scheme meets the preset time requirement, and therefore the first initial winding displacement scheme, the second initial winding displacement scheme and the fifth initial winding displacement scheme are determined as reference winding displacement schemes. The first initial winding displacement scheme corresponds to a total resource value of 450 yuan, the second initial winding displacement scheme corresponds to a total resource value of 430 yuan, and the fifth initial winding displacement scheme corresponds to a total resource value of 400 yuan. And determining the initial wire arranging scheme five as a suggested wire arranging scheme because the total resource value corresponding to the initial wire arranging scheme five is the lowest.
It should be noted that any one of the above cases may be selected to determine the suggested flat cable scheme, which is not limited in the embodiments of the present application.
In one possible implementation, the process of determining the estimated delivery time of each transportation route based on the second item volume corresponding to each transportation route and the estimated delivery duration of each transportation route is as follows: and determining the delivery time of the article corresponding to each transportation line based on the volume of the second article corresponding to each transportation line. And determining the estimated delivery time of each transportation line based on the article delivery time corresponding to each transportation line and the estimated delivery time of each transportation line.
In one possible implementation, the article loading duration for each transport lane is determined based on the second article volume for each transport lane. And determining the delivery time of the article corresponding to each transportation line based on the article loading duration of each transportation line.
Wherein the article loading speed is determined based on historical loading conditions. And determining the article loading time of each transportation line according to the article loading speed and the volume of the second article of each transportation line.
Illustratively, the historical loading case is: with a loading of 40 cubic meters for two hours, the article loading rate is 20 cubic meters per hour. The volume of the second article in the first transportation route in the initial wire arranging scheme is 10 cubic meters, and the article loading time of the first transportation route in the first initial wire arranging scheme is 10/20-0.5-30 minutes. The article loading time of the second transport route in the first initial line arranging scheme is 13/20-0.65-39 minutes. The third transport lane in the first initial lane arrangement has an article loading duration of 20/20-1 hour-60 minutes.
It should be noted that, the above description only takes the determination process of the article loading time lengths of the three transportation routes in the first initial line arranging scheme as an example, and the determination process of the article loading time lengths of the transportation routes included in other initial line arranging schemes is similar to the determination process of the article loading time lengths of the three transportation routes in the first initial line arranging scheme, and is not repeated here.
In one possible implementation manner, after the article loading duration of each transportation line is determined, the article delivery time corresponding to each transportation line is determined based on the article loading duration and the first time of each transportation line. Wherein the first time is the time when the article arrives at the transfer station.
In a possible implementation manner, article loading duration corresponding to each transportation line is respectively superposed at the first time, and article delivery time corresponding to each transportation line is obtained.
Illustratively, the first time is 10: 00, the article loading duration corresponding to the first transportation line in the first initial line arranging scheme is 30 minutes, and the article delivery time corresponding to the first transportation line in the first initial line arranging scheme is 10: 30. the article loading time corresponding to the second transportation line in the first initial line arranging scheme is 39 minutes, and the article delivery time corresponding to the second transportation line in the first initial line arranging scheme is 10: 39. the article loading time corresponding to the third transportation line in the first initial line arranging scheme is 60 minutes, and the article delivery time corresponding to the third transportation line in the first initial line arranging scheme is 11: 00.
it should be noted that the process for determining the delivery time of the articles corresponding to each transportation route is the same as the process for determining the delivery time of the articles corresponding to the three transportation routes in the first initial winding displacement scheme, and details are not repeated herein.
In one possible implementation, the process of determining the estimated delivery duration for each transportation route based on the geographical location of the transportation destination covered by each transportation route is as follows: and determining the corresponding travel distance of each transportation line based on the geographical position of the transportation destination covered by each transportation line. And taking the running speed of the transportation resource corresponding to each transportation line as the running speed corresponding to each transportation line. And determining the estimated distribution time length of each transportation line based on the corresponding running speed of each transportation line and the corresponding running distance of each transportation line.
In one possible implementation, in response to the transportation route covering only one transportation destination, the travel distance corresponding to the transportation route is determined based on the target geographical location and the geographical location of the transportation destination. In response to the transportation route covering a plurality of transportation destinations, determining a transportation sequence of the transportation route based on the distance between each transportation destination and the target geographical position, and determining a corresponding travel distance of the transportation route based on the target geographical position, the geographical position of the transportation destination covered by the transportation route and the transportation sequence of the transportation route.
The target geographic location is the location of the transfer station, and the items are transported from the warehouse to the transfer station and then from the transfer station to each transport destination.
In one possible implementation, the process of determining the transportation order of the transportation routes based on the distance between the respective transportation destination and the target geographical location is as follows: and determining the distance between each transportation destination and the target geographical position, and determining the transportation sequence according to the distance. The transport destination closest to the transport destination is used as the transport destination of the first transport, and the transport destination farthest from the transport destination is used as the transport destination of the last transport.
For example, if the first transportation route in the first initial routing scheme covers only the first transportation destination, the distance between the target geographical location and the first transportation destination is determined, and the distance is determined as the travel distance corresponding to the first transportation route in the first initial routing scheme.
For another example, the initial wire arranging plan five includes a transportation route covering three transportation destinations (a transportation destination one, a transportation destination two, and a transportation destination three), distances from the transportation destination one, the transportation destination two, and the transportation destination three to target geographical positions are determined based on the geographical position of the transportation destination one, the geographical position of the transportation destination two, and the geographical position of the transportation destination three, respectively, a distance between the transportation destination one and the target geographical positions is the closest, a distance between the transportation destination three and the target geographical positions is the farthest, therefore, the transportation sequence of the transportation route included in the initial winding scheme five is the first transportation destination, the second transportation destination and the third transportation destination. And further determining the distance from the first transportation destination to the second transportation destination and determining the distance from the second transportation destination to the third transportation destination. And determining the sum of the distance from the target geographic position to the first transportation destination, the distance from the first transportation destination to the second transportation destination and the distance from the second transportation destination to the third transportation destination as the running distance corresponding to the transportation route included in the initial wire arranging scheme five.
It should be noted that the determination process of the travel distance corresponding to other transportation routes is consistent with any one of the above processes, and is not described herein again.
And determining the running speed of the transportation resource corresponding to each transportation line as the running speed corresponding to each transportation line. For example, if the transportation resource corresponding to the first transportation route in the first initial routing plan is the first vehicle, the driving speed of the first vehicle is determined as the driving speed corresponding to the first transportation route in the first initial routing plan. For another example, if the transportation resource corresponding to the transportation route in the initial wire arranging plan five is the vehicle three, the running speed of the vehicle three is determined as the running speed corresponding to the transportation route in the initial wire arranging plan five.
In a possible implementation manner, the computer device stores a corresponding relationship between each transportation resource and the driving speed of the transportation resource, and the following table is a table of the corresponding relationship between the transportation resource and the driving speed of the transportation resource provided in the embodiment of the present application.
Watch two
Transporting resources Travel speed of transportation resources
Vehicle 1 70 km/h
Vehicle 2 60 km/h
Vehicle III 50 km/h
As shown in the second table, the first vehicle corresponds to a driving speed of 70 km/h; the corresponding running speed of the vehicle II is 60 kilometers per hour; the third vehicle corresponds to a travel speed of 50 km/h.
Illustratively, in the first initial wire arranging scheme, the travel distance corresponding to the first transportation route is 210 kilometers, the travel distance corresponding to the second transportation route is 280 kilometers, and the travel distance corresponding to the third transportation route is 245 kilometers. And determining the predicted distribution time length of each transportation line based on the driving speed of the first vehicle and the driving distance corresponding to each transportation line. The estimated delivery time of the first transportation route is 210/70-3 hours, the estimated delivery time of the second transportation route is 280/70-4 hours, and the estimated delivery time of the third transportation route is 245/70-3.5 hours.
It should be noted that the determination process of the estimated distribution time length of the transportation route included in the other initial wire arranging schemes is consistent with the determination process of the estimated distribution time length of the three transportation routes in the first initial wire arranging scheme, and details are not repeated here.
In one possible implementation manner, after the article delivery time of each transportation line and the estimated delivery time of each transportation line are determined, the estimated delivery time of each transportation line is superposed on the article delivery time of each transportation line, so that the estimated delivery time of each transportation line is obtained.
Illustratively, the time for the first transportation route to deliver the articles in the first initial winding displacement scheme is 10: 30, the estimated delivery time of the first transportation line in the first initial wire arranging scheme is 3 hours, and the estimated delivery time of the first transportation line in the first initial wire arranging scheme is 13: 30. the article delivery time of the second transportation line in the first initial line arranging scheme is 10: 39, the estimated delivery time of the second transportation route in the first initial routing plan is 4 hours, the estimated delivery time of the second transportation route in the first initial routing plan is 14: 39. the article delivery time of the third transportation line in the first starting line arrangement scheme is 11: 00, the estimated delivery time of the third transportation route in the first initial wire arranging scheme is 3.5 hours, the estimated delivery time of the second transportation route in the first initial wire arranging scheme is 14: 30.
it should be noted that the determination process of the estimated arrival times of the transportation routes included in the other initial wire arranging schemes is consistent with the determination process of the estimated arrival times of the three transportation routes in the first initial wire arranging scheme, and details thereof are not repeated herein.
In one possible implementation manner, after the suggested winding displacement scheme is determined, the transportation resources corresponding to each transportation line in the suggested winding displacement scheme are scheduled to transport the objects of the transportation destinations covered by each transportation line.
Illustratively, the suggested line arranging scheme is an initial line arranging scheme I, and then the dispatching vehicle I transports the objects of a first transportation destination covered by the first transportation line; dispatching the first vehicle to transport the second goods at the second transport destination covered by the second transport route; and dispatching the third vehicle to transport the third article of the transport destination covered by the third transport route.
For another example, if the suggested routing scheme is the initial routing scheme five, then the third vehicle is dispatched to transport the objects at the first transport destination, the second transport destination and the third transport destination.
According to the method, the suggested winding displacement scheme is planned based on available transportation resources and the article volume of the article to be transported of each transportation destination, and the estimated delivery time of each transportation line included in the suggested winding displacement scheme meets the preset time requirement, so that the transportation timeliness of each transportation line can be guaranteed when the suggested winding displacement scheme is used for transporting the article, and the article transportation efficiency can be improved.
Fig. 3 is a schematic diagram illustrating a transportation line arrangement method according to an embodiment of the present application, where fig. 3 includes a sales prediction module, a capacity screening module, a predicted delivery time determination module, and a scheduling module.
The sales forecasting module is used for acquiring the quantity of the articles to be transported of each transport destination in a historical time period, determining the quantity of the articles to be transported of each transport destination in the current time period based on the quantity of the articles to be transported of each transport destination in the historical time period, and determining the volume of the articles to be transported of each transport destination in the current time period based on the quantity of the articles to be transported of each transport destination in the current time period. The process is the same as the process in step 202, and will not be described herein.
And the capacity screening module is used for determining at least one initial winding displacement scheme based on the article volume of the articles to be transported, the volume of the transportation resources and the geographical position of the transportation destination of each transportation destination in the current time period, wherein each initial winding displacement scheme comprises at least one transportation line, and each transportation line covers at least one transportation destination. The process of determining the initial winding displacement scheme is the same as the process of step 203, and is not described herein again. And determining the predicted distribution time length of each transportation line included in each initial wiring scheme. The process of determining the expected delivery duration of each transportation route is the same as the process of step 203, and will not be described herein.
And the predicted delivery time determining module is used for acquiring a first time, and the first time is the time when the article arrives at the transfer station. Determining the article loading duration of each transportation line, and determining the article delivery time of each transportation line based on the first time and the article loading duration of each transportation line. And determining the estimated delivery time of each transportation line based on the article delivery time of each transportation line and the estimated delivery time of each transportation line. The procedure for determining the estimated delivery time of each transport route is identical to the procedure of step 203, and will not be described herein.
And a scheduling module, configured to use the initial wire arranging scheme in which the expected arrival time of each transport line in the initial wire arranging schemes meets the preset time requirement as a reference wire arranging scheme, determine a suggested wire arranging scheme in the reference wire arranging scheme, where a process of determining the suggested wire arranging scheme is consistent with the process of step 203, and is not described herein again. And the transportation resources corresponding to each transportation line in the scheduling suggestion line arrangement scheme are used for transporting the objects of the transportation destinations covered by each transportation line.
Fig. 4 is a schematic structural diagram of a transportation cable device according to an embodiment of the present application, and as shown in fig. 4, the transportation cable device includes:
a determining module 401, configured to determine currently available transportation resources;
an obtaining module 402, configured to obtain a volume of an item to be transported to each transportation destination;
a generating module 403, configured to generate a suggested routing scheme according to the geographic location of each transportation destination, the volume of the articles at each transportation destination, and the transportation resources, where the suggested routing scheme includes at least one transportation route, each transportation route covers at least one transportation destination, and an estimated arrival time of each transportation route meets a preset time requirement.
In one possible implementation, the determining module 401 is configured to use a sum of the article volumes of the respective transportation destinations as the first article volume;
a generating module 403, configured to generate a plurality of initial wire arranging schemes based on the volume of the transportation resource and the volume of the first article, where the initial wire arranging schemes include at least one transportation route, each transportation route covers at least one transportation destination, and each transportation route corresponds to one transportation resource;
a determination module 401 for determining a suggested routing scheme among a plurality of initial routing schemes based on the geographic location of each of the transportation destinations.
In a possible implementation manner, the determining module 401 is configured to determine a predicted delivery duration of each transportation route based on a geographical location of a transportation destination covered by each transportation route;
determining the predicted delivery time of each transportation line based on the second article volume corresponding to each transportation line and the predicted delivery time of each transportation line, wherein the second article volume is the sum of the article volumes of the transportation destinations covered by the transportation lines;
in response to the fact that an initial wire arranging scheme that the predicted delivery time of each transportation line meets the preset time requirement exists in the plurality of initial wire arranging schemes, taking the initial wire arranging scheme that the predicted delivery time of each transportation line meets the preset time requirement as a reference wire arranging scheme;
a suggested routing scheme is determined based on the reference routing scheme.
In a possible implementation manner, the determining module 401 is configured to determine, based on a resource value of a transportation resource corresponding to each transportation route in the reference wire arranging scheme, a total resource value corresponding to the reference wire arranging scheme;
and taking the reference wire arranging scheme with the total resource value meeting the preset resource requirement in the reference wire arranging scheme as a suggested wire arranging scheme.
In a possible implementation manner, the determining module 401 is configured to determine the delivery time of the article corresponding to each transportation route based on the volume of the second article corresponding to each transportation route;
and determining the estimated delivery time of each transportation line based on the article delivery time corresponding to each transportation line and the estimated delivery time of each transportation line.
In one possible implementation, the determining module 401 is configured to determine an article loading duration for each transportation route based on a second article volume of each transportation route;
and determining the delivery time of the article corresponding to each transportation line based on the article loading duration of each transportation line.
In a possible implementation manner, the obtaining module 402 is configured to obtain an item quantity of an item to be transported at each transportation destination in a historical time period;
determining the quantity of the articles to be transported of each transportation destination in the current time period based on the quantity of the articles to be transported of each transportation destination in the historical time period;
and determining the article volume of the article to be transported of each transportation destination according to the article quantity of the article to be transported of each transportation destination in the current time period.
In a possible implementation manner, the determining module 401 is configured to determine a driving distance corresponding to each transportation route based on a geographic location of a transportation destination covered by each transportation route;
taking the running speed of the transportation resource corresponding to each transportation line as the running speed corresponding to each transportation line;
and determining the estimated distribution time length of each transportation line based on the corresponding running speed of each transportation line and the corresponding running distance of each transportation line.
In one possible implementation, the determining module 401 is configured to determine an article loading speed based on historical loading conditions;
and determining the article loading time of each transportation line according to the article loading speed and the volume of the second article of each transportation line.
In one possible implementation, the apparatus further includes:
and the scheduling module is used for scheduling the transportation resources corresponding to each transportation line in the suggested line arrangement scheme to transport the objects of the transportation destinations covered by each transportation line.
In one possible implementation, the transportation resource includes at least one of an unmanned vehicle, a drone, and a manned vehicle.
The device plans out the suggested winding displacement scheme based on available transportation resources and the article volume of the article to be transported of each transportation destination, and the estimated delivery time of each transportation line included in the suggested winding displacement scheme meets the preset time requirement, so that the transportation timeliness of each transportation line can be guaranteed when the suggested winding displacement scheme is used for transporting the article, and the article transportation efficiency can be improved.
It should be understood that, when the apparatus provided in fig. 4 implements its functions, it is only illustrated by the division of the functional modules, and in practical applications, the above functions may be distributed by different functional modules according to needs, that is, the internal structure of the apparatus is divided into different functional modules to implement all or part of the functions described above. In addition, the apparatus and method embodiments provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the method embodiments for details, which are not described herein again.
When the computer device is an electronic device, fig. 5 shows a block diagram of an electronic device 500 provided in an exemplary embodiment of the present application. The electronic device 500 may be a portable mobile terminal, such as: a smart phone, a tablet computer, an MP3 player (Moving Picture Experts Group Audio Layer III, motion video Experts compression standard Audio Layer 3), an MP4 player (Moving Picture Experts Group Audio Layer IV, motion video Experts compression standard Audio Layer 4), a notebook computer, or a desktop computer. The electronic device 500 may also be referred to by other names such as user equipment, portable terminal, laptop terminal, desktop terminal, and the like.
In general, the electronic device 500 includes: a processor 501 and a memory 502.
The processor 501 may include one or more processing cores, such as a 4-core processor, an 8-core processor, and so on. The processor 501 may be implemented in at least one hardware form of a DSP (Digital Signal Processing), an FPGA (Field-Programmable Gate Array), and a PLA (Programmable Logic Array). The processor 501 may also include a main processor and a coprocessor, where the main processor is a processor for Processing data in an awake state, and is also called a Central Processing Unit (CPU); a coprocessor is a low power processor for processing data in a standby state. In some embodiments, the processor 501 may be integrated with a GPU (Graphics Processing Unit), which is responsible for rendering and drawing the content required to be displayed by the display screen. In some embodiments, processor 501 may also include an AI (Artificial Intelligence) processor for processing computational operations related to machine learning.
Memory 502 may include one or more computer-readable storage media, which may be non-transitory. Memory 502 may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in memory 502 is used to store at least one instruction for execution by processor 501 to implement the cableway method provided by method embodiments herein.
In some embodiments, the electronic device 500 may further optionally include: a peripheral interface 503 and at least one peripheral. The processor 501, memory 502 and peripheral interface 503 may be connected by a bus or signal lines. Each peripheral may be connected to the peripheral interface 503 by a bus, signal line, or circuit board. Specifically, the peripheral device includes: at least one of radio frequency circuitry 504, display screen 505, camera assembly 506, audio circuitry 507, positioning assembly 508, and power supply 509.
The peripheral interface 503 may be used to connect at least one peripheral related to I/O (Input/Output) to the processor 501 and the memory 502. In some embodiments, the processor 501, memory 502, and peripheral interface 503 are integrated on the same chip or circuit board; in some other embodiments, any one or two of the processor 501, the memory 502, and the peripheral interface 503 may be implemented on a separate chip or circuit board, which is not limited in this embodiment.
The Radio Frequency circuit 504 is used for receiving and transmitting RF (Radio Frequency) signals, also called electromagnetic signals. The radio frequency circuitry 504 communicates with communication networks and other communication devices via electromagnetic signals. The rf circuit 504 converts an electrical signal into an electromagnetic signal to transmit, or converts a received electromagnetic signal into an electrical signal. Optionally, the radio frequency circuit 504 includes: an antenna system, an RF transceiver, one or more amplifiers, a tuner, an oscillator, a digital signal processor, a codec chipset, a subscriber identity module card, and so forth. The radio frequency circuitry 504 may communicate with other terminals via at least one wireless communication protocol. The wireless communication protocols include, but are not limited to: the world wide web, metropolitan area networks, intranets, generations of mobile communication networks (2G, 3G, 4G, and 5G), Wireless local area networks, and/or WiFi (Wireless Fidelity) networks. In some embodiments, the rf circuit 504 may further include NFC (Near Field Communication) related circuits, which are not limited in this application.
The display screen 505 is used to display a UI (User Interface). The UI may include graphics, text, icons, video, and any combination thereof. When the display screen 505 is a touch display screen, the display screen 505 also has the ability to capture touch signals on or over the surface of the display screen 505. The touch signal may be input to the processor 501 as a control signal for processing. At this point, the display screen 505 may also be used to provide virtual buttons and/or a virtual keyboard, also referred to as soft buttons and/or a soft keyboard. In some embodiments, the display screen 505 may be one, disposed on the front panel of the electronic device 500; in other embodiments, the display screens 505 may be at least two, respectively disposed on different surfaces of the electronic device 500 or in a folded design; in other embodiments, the display 505 may be a flexible display disposed on a curved surface or on a folded surface of the electronic device 500. Even more, the display screen 505 can be arranged in a non-rectangular irregular figure, i.e. a shaped screen. The Display screen 505 may be made of LCD (Liquid Crystal Display), OLED (Organic Light-Emitting Diode), and other materials.
The camera assembly 506 is used to capture images or video. Optionally, camera assembly 506 includes a front camera and a rear camera. Generally, a front camera is disposed at a front panel of the terminal, and a rear camera is disposed at a rear surface of the terminal. In some embodiments, the number of the rear cameras is at least two, and each rear camera is any one of a main camera, a depth-of-field camera, a wide-angle camera and a telephoto camera, so that the main camera and the depth-of-field camera are fused to realize a background blurring function, and the main camera and the wide-angle camera are fused to realize panoramic shooting and VR (Virtual Reality) shooting functions or other fusion shooting functions. In some embodiments, camera assembly 506 may also include a flash. The flash lamp can be a monochrome temperature flash lamp or a bicolor temperature flash lamp. The double-color-temperature flash lamp is a combination of a warm-light flash lamp and a cold-light flash lamp, and can be used for light compensation at different color temperatures.
Audio circuitry 507 may include a microphone and a speaker. The microphone is used for collecting sound waves of a user and the environment, converting the sound waves into electric signals, and inputting the electric signals to the processor 501 for processing, or inputting the electric signals to the radio frequency circuit 504 to realize voice communication. For stereo capture or noise reduction purposes, the microphones may be multiple and disposed at different locations of the electronic device 500. The microphone may also be an array microphone or an omni-directional pick-up microphone. The speaker is used to convert electrical signals from the processor 501 or the radio frequency circuit 504 into sound waves. The loudspeaker can be a traditional film loudspeaker or a piezoelectric ceramic loudspeaker. When the speaker is a piezoelectric ceramic speaker, the speaker can be used for purposes such as converting an electric signal into a sound wave audible to a human being, or converting an electric signal into a sound wave inaudible to a human being to measure a distance. In some embodiments, audio circuitry 507 may also include a headphone jack.
The positioning component 508 is used to locate the current geographic Location of the electronic device 500 for navigation or LBS (Location Based Service). The Positioning component 508 may be a Positioning component based on the Global Positioning System (GPS) in the united states, the beidou System in china, or the galileo System in russia.
The power supply 509 is used to power the various components in the electronic device 500. The power source 509 may be alternating current, direct current, disposable or rechargeable. When power supply 509 includes a rechargeable battery, the rechargeable battery may be a wired rechargeable battery or a wireless rechargeable battery. The wired rechargeable battery is a battery charged through a wired line, and the wireless rechargeable battery is a battery charged through a wireless coil. The rechargeable battery may also be used to support fast charge technology.
In some embodiments, the electronic device 500 also includes one or more sensors 510. The one or more sensors 510 include, but are not limited to: acceleration sensor 511, gyro sensor 512, pressure sensor 513, fingerprint sensor 514, optical sensor 515, and proximity sensor 516.
The acceleration sensor 511 may detect the magnitude of acceleration on three coordinate axes of a coordinate system established with the electronic device 500. For example, the acceleration sensor 511 may be used to detect components of the gravitational acceleration in three coordinate axes. The processor 501 may control the display screen 505 to display the user interface in a landscape view or a portrait view according to the gravitational acceleration signal collected by the acceleration sensor 511. The acceleration sensor 511 may also be used for acquisition of motion data of a game or a user.
The gyro sensor 512 may detect a body direction and a rotation angle of the electronic device 500, and the gyro sensor 512 may cooperate with the acceleration sensor 511 to acquire a 3D motion of the user on the electronic device 500. The processor 501 may implement the following functions according to the data collected by the gyro sensor 512: motion sensing (such as changing the UI according to a user's tilting operation), image stabilization at the time of photographing, game control, and inertial navigation.
The pressure sensor 513 may be disposed on a side bezel of the electronic device 500 and/or underneath the display screen 505. When the pressure sensor 513 is disposed on the side frame of the electronic device 500, the holding signal of the user to the electronic device 500 can be detected, and the processor 501 performs left-right hand recognition or shortcut operation according to the holding signal collected by the pressure sensor 513. When the pressure sensor 513 is disposed at the lower layer of the display screen 505, the processor 501 controls the operability control on the UI interface according to the pressure operation of the user on the display screen 505. The operability control comprises at least one of a button control, a scroll bar control, an icon control and a menu control.
The fingerprint sensor 514 is used for collecting a fingerprint of the user, and the processor 501 identifies the identity of the user according to the fingerprint collected by the fingerprint sensor 514, or the fingerprint sensor 514 identifies the identity of the user according to the collected fingerprint. Upon recognizing that the user's identity is a trusted identity, the processor 501 authorizes the user to perform relevant sensitive operations including unlocking the screen, viewing encrypted information, downloading software, paying, and changing settings, etc. The fingerprint sensor 514 may be disposed on the front, back, or side of the electronic device 500. When a physical button or vendor Logo is provided on the electronic device 500, the fingerprint sensor 514 may be integrated with the physical button or vendor Logo.
The optical sensor 515 is used to collect the ambient light intensity. In one embodiment, the processor 501 may control the display brightness of the display screen 505 based on the ambient light intensity collected by the optical sensor 515. Specifically, when the ambient light intensity is high, the display brightness of the display screen 505 is increased; when the ambient light intensity is low, the display brightness of the display screen 505 is reduced. In another embodiment, processor 501 may also dynamically adjust the shooting parameters of camera head assembly 506 based on the ambient light intensity collected by optical sensor 515.
A proximity sensor 516, also known as a distance sensor, is typically disposed on the front panel of the electronic device 500. The proximity sensor 516 is used to capture the distance between the user and the front of the electronic device 500. In one embodiment, when the proximity sensor 516 detects that the distance between the user and the front surface of the electronic device 500 gradually decreases, the processor 501 controls the display screen 505 to switch from the bright screen state to the dark screen state; when the proximity sensor 516 detects that the distance between the user and the front surface of the electronic device 500 becomes gradually larger, the processor 501 controls the display screen 505 to switch from the breath screen state to the bright screen state.
Those skilled in the art will appreciate that the configuration shown in fig. 5 is not intended to be limiting of the electronic device 500 and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components may be used.
In response to the computer device being a server, fig. 6 is a schematic structural diagram of the server provided in the embodiments of the present application, where the server 600 may generate a relatively large difference due to different configurations or performances, and may include one or more processors (CPUs) 601 and one or more memories 602, where at least one program code is stored in the one or more memories 602, and is loaded and executed by the one or more processors 601 to implement the transportation and distribution line method provided in the embodiments of the method described above. Of course, the server 600 may also have components such as a wired or wireless network interface, a keyboard, and an input/output interface, so as to perform input and output, and the server 600 may also include other components for implementing the functions of the device, which is not described herein again.
In an exemplary embodiment, there is also provided a computer-readable storage medium having at least one program code stored therein, the at least one program code being loaded and executed by a processor to cause a computer to implement any of the above-described transportation lane method.
Alternatively, the computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a Compact Disc Read-Only Memory (CD-ROM), a magnetic tape, a floppy disk, an optical data storage device, and the like.
In an exemplary embodiment, there is also provided a computer program or a computer program product having at least one computer instruction stored therein, the at least one computer instruction being loaded and executed by a processor to cause a computer to implement any of the above-described transportation cable methods.
It should be understood that reference to "a plurality" herein means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
The above description is only exemplary of the present application and should not be taken as limiting the present application, and any modifications, equivalents, improvements and the like that are made within the spirit and principle of the present application should be included in the protection scope of the present application.

Claims (14)

1. A method of transporting a flat cable, the method comprising:
determining currently available transportation resources;
acquiring the volume of the articles to be transported to each transportation destination;
generating a suggested line arranging scheme according to the geographical position of each transportation destination, the article volume of each transportation destination and the transportation resources, wherein the suggested line arranging scheme comprises at least one transportation line, each transportation line covers at least one transportation destination, and the predicted arrival time of each transportation line meets the preset time requirement.
2. The method of claim 1, wherein generating a suggested platoon scheme based on the geographic location of each transport destination, the volume of items at each transport destination, and the transport resources comprises:
taking the sum of the article volumes of the various transportation destinations as a first article volume;
generating a plurality of initial winding schemes based on the volume of the transportation resource and the volume of the first article, wherein the initial winding schemes comprise at least one transportation line, each transportation line covers at least one transportation destination, and each transportation line corresponds to one transportation resource;
determining the suggested routing scheme among the plurality of initial routing schemes based on the geographic location of the respective transportation destination.
3. The method of claim 2, wherein determining the suggested routing scheme among the plurality of initial routing schemes based on the geographic location of the respective transportation destination comprises:
determining an estimated delivery duration of each transportation route based on the geographical location of the transportation destination covered by each transportation route;
determining a predicted delivery time of each transportation route based on a second article volume corresponding to each transportation route and a predicted delivery time of each transportation route, wherein the second article volume is the sum of the article volumes of transportation destinations covered by the transportation routes;
in response to the fact that an initial wire arranging scheme with the estimated delivery time of each transportation line meeting a preset time requirement exists in the plurality of initial wire arranging schemes, taking the initial wire arranging scheme with the estimated delivery time of each transportation line meeting the preset time requirement as a reference wire arranging scheme;
determining the suggested routing scheme based on the reference routing scheme.
4. The method of claim 3, wherein the determining the proposed scheduling scheme based on the reference scheduling scheme comprises:
determining a total resource value corresponding to the reference line arrangement scheme based on the resource numerical value of the transportation resource corresponding to each transportation line in the reference line arrangement scheme;
and taking the reference wire arranging scheme with the total resource value meeting the preset resource requirement in the reference wire arranging scheme as the suggested wire arranging scheme.
5. The method of claim 3, wherein determining the estimated time of arrival for each transportation route based on the corresponding second item volume for each transportation route and the estimated delivery duration for each transportation route comprises:
determining the delivery time of the article corresponding to each transportation line based on the volume of the second article corresponding to each transportation line;
and determining the estimated delivery time of each transportation line based on the article delivery time corresponding to each transportation line and the estimated delivery time of each transportation line.
6. The method of claim 5, wherein determining the time to warehouse out for the article corresponding to each transport lane based on the second article volume corresponding to each transport lane comprises:
determining an article loading duration of each transportation line based on the second article volume of each transportation line;
and determining the delivery time of the article corresponding to each transportation line based on the article loading duration of each transportation line.
7. The method of any one of claims 1 to 6, wherein said obtaining a volume of the item to be transported to each transport destination comprises:
acquiring the quantity of the articles to be transported of each transport destination in a historical time period;
determining the quantity of the articles to be transported of each transportation destination in the current time period based on the quantity of the articles to be transported of each transportation destination in the historical time period;
and determining the article volume of the article to be transported of each transportation destination according to the article quantity of the article to be transported of each transportation destination in the current time period.
8. The method of claim 3, wherein determining the projected delivery duration for each transportation route based on the geographic location of the transportation destination covered by the transportation route comprises:
determining a driving distance corresponding to each transportation line based on the geographical position of the transportation destination covered by each transportation line;
taking the running speed of the transportation resource corresponding to each transportation line as the running speed corresponding to each transportation line;
and determining the estimated distribution time length of each transportation line based on the corresponding running speed of each transportation line and the corresponding running distance of each transportation line.
9. The method of claim 6, wherein the determining the item loading duration for each transport lane based on the second item volume for each transport lane comprises:
determining an item loading rate based on historical loading conditions;
and determining the article loading time of each transportation line according to the article loading speed and the second article volume of each transportation line.
10. The method of any one of claims 1 to 6, wherein after generating the suggested routing scheme based on the geographic location of each transportation destination, the volume of the items at each transportation destination, and the transportation resources, the method further comprises:
and scheduling the transportation resources corresponding to each transportation line in the suggested line arrangement scheme to transport the objects of the transportation destinations covered by each transportation line.
11. The method of any one of claims 1 to 6, wherein the transportation resource comprises at least one of an unmanned vehicle, a drone, a manned vehicle.
12. A transportation cable arrangement, the arrangement comprising:
a determining module for determining currently available transportation resources;
the acquisition module is used for acquiring the volume of the articles to be transported to each transportation destination;
the generation module is used for generating a suggested line arranging scheme according to the geographical position of each transportation destination, the article volume of each transportation destination and the transportation resources, wherein the suggested line arranging scheme comprises at least one transportation line, each transportation line covers at least one transportation destination, and the predicted arrival time of each transportation line meets the preset time requirement.
13. A computer device comprising a processor and a memory, the memory having stored therein at least one program code, the at least one program code being loaded and executed by the processor to cause the computer device to carry out the carrier aggregation method according to any one of claims 1 to 11.
14. A computer-readable storage medium having at least one program code stored therein, the at least one program code being loaded and executed by a processor to cause a computer to implement the carrier aggregation method according to any one of claims 1 to 11.
CN202110735882.6A 2021-06-30 2021-06-30 Transportation cable arranging method, device, equipment and computer readable storage medium Pending CN113362010A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110735882.6A CN113362010A (en) 2021-06-30 2021-06-30 Transportation cable arranging method, device, equipment and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110735882.6A CN113362010A (en) 2021-06-30 2021-06-30 Transportation cable arranging method, device, equipment and computer readable storage medium

Publications (1)

Publication Number Publication Date
CN113362010A true CN113362010A (en) 2021-09-07

Family

ID=77537382

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110735882.6A Pending CN113362010A (en) 2021-06-30 2021-06-30 Transportation cable arranging method, device, equipment and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN113362010A (en)

Similar Documents

Publication Publication Date Title
CN111080207A (en) Order processing method, device, equipment and storage medium
CN113469620A (en) Dispatching method, device and equipment for distribution resources and computer readable storage medium
CN111144822A (en) Warehouse-out time length determining method and device, computer equipment and storage medium
CN110648099A (en) Storage resource allocation method and device, electronic equipment and storage medium
CN113434589B (en) Distribution route display method, device, equipment and computer readable storage medium
CN112734346B (en) Method, device and equipment for determining lane coverage and readable storage medium
CN113362010A (en) Transportation cable arranging method, device, equipment and computer readable storage medium
CN115545593A (en) Target distribution service determination method, device, equipment and storage medium
CN114598992A (en) Information interaction method, device, equipment and computer readable storage medium
CN113935678A (en) Method, device, equipment and storage medium for determining multiple distribution terminals held by distributor
CN115439036A (en) Material transportation method, device, equipment and computer readable storage medium
CN114723372B (en) Article storage method, device, equipment and storage medium
CN114723371B (en) Article storage method, device, equipment and storage medium
CN115439035A (en) Scheduling method, device and equipment of transport tool and readable storage medium
CN116523582A (en) Order processing method, device, equipment and computer readable storage medium
CN115204783A (en) Transferring method, device and equipment for catering articles
CN115293839A (en) Order distribution method, device, equipment and computer readable storage medium
CN116151709A (en) Vehicle source information selection method, device, equipment and computer readable storage medium
CN116432912A (en) Distribution method and device of waybill collection, electronic equipment and readable storage medium
CN115439034A (en) Logistics resource scheduling method, device and equipment and computer readable storage medium
CN116151708A (en) Method, device, equipment and computer readable storage medium for determining resource value
CN117575447A (en) Planning method, device, equipment and storage medium for sorting delivery path
CN116757565A (en) Adjusting method, adjusting device, adjusting equipment and storage medium
CN116227104A (en) Method for acquiring information processing model, information processing method, device and equipment
CN114971103A (en) Distribution capacity selection method, distribution capacity selection device, distribution capacity selection equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
TA01 Transfer of patent application right

Effective date of registration: 20220617

Address after: Room C201, 2 / F, building 4, No. 492 Anhua Road, Changning District, Shanghai, 200050

Applicant after: HANHAI INFORMATION TECHNOLOGY SHANGHAI Co.,Ltd.

Address before: 100080 2106-030, 9 North Fourth Ring Road, Haidian District, Beijing.

Applicant before: BEIJING SANKUAI ONLINE TECHNOLOGY Co.,Ltd.

TA01 Transfer of patent application right
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination