TWI667623B - Computer device and method for arranging freight delivery - Google Patents

Abstract

A computer apparatus and method for arranging the transportation of goods is disclosed. The computer device stores a historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group includes one or more historical shipping destinations. The computer device selects one or more target groups from the plurality of historical shipping destination groups based on a cargo shipping list and assigns the selected target group to a vehicle, wherein each selected target The historical shipping destinations included in the group are present in the goods shipping list.

Description

Computer device and method for arranging cargo transportation

The present disclosure relates to a computer device. More specifically, the present disclosure relates to a computer apparatus and method for arranging shipment of goods.

In the process of transporting goods, there are many factors that affect the cost of transportation, and one of the important factors is the destination. For example, if a plurality of shipping destinations of the same vehicle are dispersed in a plurality of areas that are far apart from each other, the shipping destinations are located in the same area, but the driving path between them is roundabout rather than straight, or the same vehicle Too many shipments from the site may increase the cost of shipping directly or indirectly. Therefore, in arranging the shipment of goods, it is in principle desirable to assign a plurality of delivery destinations in the same area or between each other with a straight line to the same vehicle, in order to avoid an increase in shipping costs.

In order to assign multiple destinations in the same area or between each other with a straight line to the same vehicle, the traditional method must rely on real-time map information, but the cost of obtaining real-time map information is often more than that of shipping. Additional shipping costs incurred due to improper destination arrangements. In addition, even with real-time map information, traditional methods need to be optimized for different goods and different destinations due to the variety of goods and destinations. Such calculations are quite complex and time consuming. . In view of this, how to provide a calculation The less complex and efficient way of arranging the shipment of goods is a very important issue in the relevant technical field.

In order to address at least the above problems, the present disclosure provides a computer device for arranging shipment of goods. The computer device can include a memory and a processor electrically coupled to the memory. The storage can be used to store a historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group includes one or more historical shipping destinations. The processor can be configured to select one or more target groups from the plurality of historical shipping destination groups based on a shipment delivery list, and assign the selected target group to a vehicle, each of which is selected The historical shipping destination included in the target group exists in the cargo shipping list.

In order to solve at least the above problems, the present disclosure also provides a method of arranging the transportation of goods. The method can include the steps of: storing, by a computer device, a historical shipping record, the historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group comprising one or more historical shipping destinations And selecting, by the computer device, one or more target groups from the plurality of historical shipping destination groups according to a cargo shipping list and assigning the selected target group to a vehicle, wherein each The historical shipping destination included in the selected target group exists in the goods shipping list.

According to the computer apparatus and method described above, each historical shipping destination group composed of a plurality of shipping destinations that have historically been scheduled to be transported to the same vehicle can be recorded. And with such a historical shipping record, each vehicle is assigned a suitable shipping destination, thereby avoiding multiple shipping destinations in different areas or multiple shipping paths between each other Destinations are assigned to the same vehicle, which in turn reduces shipping costs. In addition, the above computer apparatus and method do not need to use real-time map information, and do not need to perform complicated optimization for different goods and different shipping destinations, thereby reducing computational complexity and increasing scheduling efficiency.

The above content is not intended to limit the present invention, but merely describes the technical problems that can be solved by the present invention, the technical means that can be adopted, and the achievable technical effects, so that those having ordinary knowledge in the technical field of the present invention can initially understand the present invention. invention. The various embodiments of the present invention can be further understood by those of ordinary skill in the art of the invention.

As follows:

1‧‧‧Computer equipment for transporting goods

11‧‧‧ Processor

13‧‧‧Storage

15‧‧‧Input device

10‧‧‧Historical record

12‧‧‧Cargo Shipping List

2‧‧‧Operational process

201~205‧‧‧Action

3‧‧‧Operational process

301~307‧‧‧ action

40‧‧‧Historical destination group

42‧‧‧Group candidates

14‧‧‧ Arrange the results

D1~D9‧‧‧Delivery destination

V1~V3‧‧‧Vehicles

5‧‧‧How to arrange the delivery of goods

501, 503‧‧ steps

Figure 1 illustrates a schematic diagram of a computer device for arranging shipment of goods in certain embodiments of the present invention.

Figure 2 illustrates a schematic diagram of how the computer device shown in Figure 1 arranges the shipment of goods in certain embodiments of the present invention.

Figure 3 illustrates another schematic diagram of how the computer device shown in Figure 1 illustrates the delivery of goods in certain embodiments of the present invention.

Figure 4 illustrates a schematic diagram of the results of an arrangement for the shipment of goods in certain embodiments of the present invention.

Figure 5 illustrates a schematic diagram of a method of arranging shipment of goods in certain embodiments of the present invention.

The invention is illustrated by the following examples, which are not intended to limit the scope of the invention. In the drawings, elements that are not directly related to the present invention have been omitted. In the drawings, the dimensions of the elements and the ratios between the elements are merely exemplary and are not intended to limit the invention. Unless otherwise stated, the same (or similar) element symbols may correspond to the same (or similar) elements in the following. In the case where it can be realized, the number of each element described below means one or more unless otherwise specified.

Figure 1 illustrates a schematic diagram of a computer device 1 for arranging shipment of goods in certain embodiments of the present invention. The drawings are for illustrative purposes only and are not intended to limit the invention.

Referring to Fig. 1, a computer device 1 for arranging cargo transportation basically includes a processor 11, a storage 13 and an input device 15. Each of the processor 11, the storage 13 and the input device 15 may be directly electrically connected (ie, not connected via other components) or indirectly electrically connected (ie, connected via other components) to other One. For example, as shown in FIG. 1 , the processor 11 can be directly electrically connected to the storage device 13 and the input device 15 , respectively, and the storage device 13 can be electrically connected to the input device 15 indirectly via the processor 11 .

The processor 11 may include a microprocessor or microcontroller to perform various operations required by the computer device 1 for arranging shipments. A microprocessor or microcontroller is a programmable special integrated circuit that has the functions of operation, storage, output/input, etc., and can accept and process various coding instructions, thereby performing various logic operations and arithmetic operations, and outputting The corresponding operation result.

The storage 13 can include various storage devices provided in a general computer device/computer for storing various materials required for the computer device 1 for arranging goods. The storage 13 may include a first level storage device (also referred to as a primary memory or an internal memory), and the first level memory is in direct communication with the processor 11. The processor 11 can directly read the instruction set stored in the first level memory and execute the instruction sets as needed. The memory 13 can also include a second level storage device (also referred to as external memory or auxiliary memory), and the second level memory is connected to the processor 11 through the I/O channel of the memory, and uses a data buffer to Transfer the data to the first level memory. The data of the second level memory will not disappear (ie, non-volatile) without power supply. The second level memory can be, for example, various types of hard disks, optical disks, and the like. Alternatively, the storage 13 may also include a third level storage device, such as a flash drive that can be inserted and removed.

The input device 15 can be any type of input device/interface provided in a general computer device/computer for inputting external data, signals, and messages to the computer device 10 for arranging the shipment. For example, the input device 15 can include, but is not limited to, : One or more of a mouse, trackball, trackpad, keyboard, scanner, microphone, user interface, and web interface.

The storage 13 can be used to store a historical shipping record 10, which can include a plurality of historical shipping destination groups, and each historical shipping destination group includes one or more historical shipping destinations. In addition to the historical shipping destination group, the historical shipping record 10 may also contain other relevant information about the historical shipping destination group. The input device 15 can be used to input the goods delivery list 12, and the input goods delivery list 12 can include, for example, a plurality of shipping destinations and corresponding cargo information. For example, the input goods shipping list 12 may include a plurality of shipping destinations and corresponding shipping material number information.

Figure 2 illustrates the arrangement of the goods shown in Figure 1 in certain embodiments of the invention. A schematic diagram of how the computer device 1 of the shipment arranges the shipment of the goods. The illustrations in Figure 2 are only intended to illustrate embodiments of the invention and are not intended to limit the invention.

Referring to FIG. 2, the operational flow 2 of the computer device 1 for arranging cargo transportation may include actions 201, 203, and 205. In particular, first, the input device 15 can input the cargo shipping list 12 to the computer device 1 (labeled as action 201). Next, the processor 11 can obtain the actual shipping destination from the cargo shipping list 12, and then compare the actual shipping destinations obtained from the cargo shipping list 12 with the historical shipping destinations included in each of the historical shipping records 10 The historical shipping destination selects one group candidate (indicated as action 203) from a plurality of historical shipping destination groups in the historical shipping record 10, wherein the selected group candidate includes a historical shipping destination Present in the cargo shipping list. Processor 11 may then select the group candidate as the target group and assign the target group and the historical shipping destinations it contains to a vehicle (labeled as action 205).

For the sake of explanation, it is assumed that the transportation cost is the sum of the basic cost, the trans-regional loss, the insufficient material loss, and the subsidy loss. The basic cost is the fixed transportation cost, and the trans-regional loss is due to multiple regions in different regions. The transportation destination or the driving route between each other is the additional cost incurred by the multiple delivery destinations assigned to the same vehicle, and the insufficient material loss is the additional cost due to the unutilized utilization of the carrying capacity of the vehicle, and the subsidy Loss is the additional cost of subsidizing driver fees when assigning too many shipping destinations to the same vehicle. Since the computer device 1 can assign a suitable shipping destination to each vehicle by means of the historical shipping record 10, it is possible to avoid multiple shipping destinations in different areas or multiple shipping paths between the two. Destinations are assigned to the same vehicle to remove or reduce cross-zone losses.

In some embodiments, processor 11 is in a plurality of calendars from historical record 10 When one group candidate (ie, target group) is selected from the history shipping destination group, in addition to considering whether the historical shipping destination included in the selected group candidate exists in the goods shipping list, It may be considered whether the sum of the number of materials of the selected group candidate matches the carrying capacity of the vehicle amount (ie, whether the sum of the material numbers is equal to or slightly smaller than the carrying capacity). In this case, the loss of the number of materials can be further removed or reduced.

In some embodiments, the processor 11 selects one of the group candidates (ie, the target group) from the plurality of historical shipping destination groups in the historical shipping record 10, in addition to considering the selected group candidates. Whether or not the historical shipping destination included in the person exists outside the cargo shipping list may also consider whether the number of historical shipping destinations among the selected group candidates exceeds a threshold. In this case, the subsidy loss can be further removed or reduced.

Hereinafter, a subsequent operation after the processor 11 selects a plurality of group candidates from a plurality of historical transport destination groups in the history transport record 10 will be described by taking the contents shown in FIGS. 3 and 4 as an example. Figure 3 illustrates another schematic diagram of how the computer device 1 for arranging cargo shipments, as illustrated in Figure 1 of the present invention, arranges for the transport of goods. Figure 4 illustrates a schematic diagram of the results of an arrangement for the shipment of goods in certain embodiments of the present invention. 3 and 4 are merely illustrative of embodiments of the invention and are not intended to limit the invention.

Referring to Fig. 3, the operational flow 3 of the computer device 1 for arranging the shipment of goods may include actions 301, 303, 305, and 307. In particular, first, the input device 15 can input the cargo shipping list 12 to the computer device 1 (labeled as action 301). Next, the processor 11 can obtain the actual shipping destination from the cargo shipping list 12, and then compare the actual shipping destinations obtained from the cargo shipping list 12 with the historical shipping destinations included in each of the historical shipping records 10 Historical shipping destination, selected from a plurality of historical shipping destination groups in the historical shipping record 10 A plurality of group candidates (labeled as action 303) are present, wherein the historical shipping destinations included in each of the selected group candidates are present in the shipment list. Processor 11 may then select one or more target groups (labeled as action 305) to be assigned to a vehicle from the plurality of group candidates. Finally, processor 11 may assign the selected target group and its contained historical shipping destination to a vehicle (labeled as action 307).

Processor 11 may decide how to select one or more target groups to assign to a vehicle from among the plurality of group candidates. For example, in some embodiments, the historical shipping record 10 can further include a respective cumulative number of each historical shipping destination group, and the processor 11 can only rely on the plurality of cumulatives of the plurality of group candidates The number of times is selected from one or more target groups to be assigned to a vehicle from the plurality of group candidates.

For another example, in some embodiments, the processor 11 may first select each of the group candidates according to the number of shipping materials corresponding to the actual shipping destination in the cargo shipping list 12 and a carrying capacity of a vehicle. Determining a sum of material numbers, and then selecting one or more of the plurality of group candidates to be assigned to the vehicle based only on the sum of the plurality of material numbers determined by the processor 11 for the plurality of group candidates Target group.

For example, in some embodiments, the processor 11 may be based on a plurality of accumulated times of the plurality of group candidates and a sum of the plurality of materials determined by the plurality of group candidates. And selecting one or more target groups to be assigned to a vehicle from the plurality of group candidates.

Referring to Fig. 4, it is assumed that the cargo transport list 12 includes six transport destinations D1, D2, D3, D7, D8, and D9 and the number of transport materials corresponding thereto. For example, the number of transported materials required for the destination D1 is "3" units, and the transport required for the destination D2. The number of materials to be delivered is "13" units. The unit of the number of materials to be transported can be defined by the user according to different needs.

Referring to FIG. 4, the historical shipping record 10 may include a plurality of historical shipping destination groups 40 and the cumulative number of shipments of the respective historical shipping destination groups 40 in the history. For example, in the history shipping record 10, a historical shipping destination group including the historical shipping destination D1, the historical shipping destination D2, and the historical shipping destination D3 (i.e., group 1 shown in FIG. 4) is once included. The cumulative number of assignments to the same vehicle is ten (10) times, and the historical shipping destination group (ie, group 7 shown in FIG. 4) including the historical shipping destination D7 and the historical shipping destination D9 has been assigned. The cumulative number of times for the same vehicle is six (6) times.

Continuing with reference to FIG. 4, by comparing the cargo shipping list 12 with the historical shipping record 10, the processor 11 can determine the respective historical shipping destination groups 40 of the groups "1-3" and "6-8". All historical shipping destinations are present in the cargo shipping list 12. Then, the processor 11 records the six group candidates 42 that can be selected from the plurality of historical shipping destination groups 40 of the historical shipping record 10. In other words, the processor 11 selects the historical shipping destination group 40 of the groups "1-3" and "6-8" as the group candidate 42. In other embodiments, the processor 11 may also be present in the cargo shipping list 12 when one or a portion (not all) of the historical shipping destinations included in a certain historical shipping destination group 40 are present. The historical shipping destination group 40 is selected as the group candidate 42.

As shown in FIG. 3, in some implementations, when the computer device 1 that arranges the shipment of the goods performs the action 305, the processor 11 can be based on the cumulative number of the plurality of group candidates 42 and the plurality of group candidates. 42 determines the sum of the number of materials, and selects one or more target groups to be assigned to a vehicle from among the plurality of group candidates. For example, refer to the arrangement shown in Figure 4. In the case of the vehicle V1, the group candidate 42 of the group "2" has the highest cumulative number of times, but the total number of corresponding materials is "13", which is different from the carrying capacity of the vehicle V1. If the total number of the group candidates 42 of the group "1" is the second highest, and the total number of corresponding materials is exactly the same as the carrying capacity of the vehicle V1, the processor 11 can preferably set the group "1". The group candidate 42 is assigned to the vehicle V1. For example, referring to the arrangement result 14 shown in FIG. 4, taking the vehicle V2 as an example, although the cumulative number of times of the group candidate 42 of the group "8" is the highest, the total number of corresponding materials is "35". Since the carrying capacity of the vehicle V2 is "20", the processor 11 can assign the group candidate 42 of the group "7" to the vehicle V2. In this case, the processor 11 can assign the group candidate 42 of the remaining group "6" (the total number of corresponding materials is "15") to the vehicle V3 having the carrying capacity of "15".

As shown in FIG. 3, in some implementations, when the computer device 1 that arranges the shipment of the goods performs the action 305, the processor 11 may also follow the cumulative number of times of the plurality of group candidates 42 from the plurality of groups. One or more target groups to be assigned to a vehicle are selected among the candidates. For example, referring to FIG. 4, taking the vehicle V1 as an example, the group candidate 42 of the group "2" is considered regardless of whether or not the total number of materials of the group candidate 42 conforms to the carrying capacity of the vehicle V1. The cumulative number of times is the highest, so the processor 11 can assign the group candidate 42 of the group "2" to the vehicle V1.

As shown in FIG. 3, in some implementations, when the computer device 1 that arranges the shipment of the goods performs the action 305, the processor 11 may also follow the sum of the number of the plurality of group candidates 42 from the plurality of groups. One or more target groups to be assigned to a vehicle are selected among the group candidates. For example, assuming that there is a vehicle having a carrying capacity of "13", the processor 11 can assign the group candidate 42 of the group "3" regardless of the cumulative number of accumulated times of the group candidate 42. Give the vehicle.

In some embodiments, the number of historical shipping destinations included by each of the group candidates 42 selected by the processor 11 from the historical shipping destination group 40 is less than a predetermined value. The preset value can be set according to different needs. For example, when the number of shipping destinations assigned to the same vehicle exceeds four, resulting in additional shipping costs and increased shipping costs, the preset value may be set to four, and the processor 11 is in the historical shipping destination group. When the group candidate 42 is selected in the group 40, only the historical shipping destination group in which the number of shipping destinations included therein is less than four is selected as the group candidate 42.

In some embodiments, if one or more actual shipping destinations in the shipping manifest 12 are not present in the historical shipping record 10, the processor 11 may also follow the instructions of the user or according to preset rules. Such an actual shipping destination is assigned to a vehicle whose carrying capacity is not filled.

The processor 11 may also update the historical shipping record 10 based on the scheduling result 14 after the processor 11 produces the scheduling result 14 and arranges for the shipment according to the scheduling result 14. Taking FIG. 4 as an example, the processor 11 can add "1" to the cumulative number of times recorded in the history shipping destination group 40 of the group "1, 6, 7". In some embodiments, if the processor 11 assigns a new shipping destination group to a vehicle, the new shipping destination group can also be added to the historical shipping record 10.

Figure 5 illustrates a schematic diagram of a method of arranging shipment of goods in certain embodiments of the present invention. The illustrations in Figure 5 are only intended to illustrate embodiments of the invention and are not intended to limit the invention.

Referring to Figure 5, a method 5 of arranging shipments can basically include the steps of: storing a historical shipping record by a computer device, the historical shipping record comprising a plurality of calendars a destination shipping group, and each historical shipping destination group includes one or more historical shipping destinations (labeled as step 501); and from the plurality of history by the computer device based on a shipment shipping list One or more target groups are selected from the delivery destination group and the selected target group is assigned to a vehicle, and the historical delivery destination included in each selected target group exists in the cargo delivery list (labeled as step 503).

In some embodiments, in addition to steps 501, 503, the method 5 of arranging the shipment of goods may further comprise the step of, by the computer device, from the plurality of historical shipping destination groups based on the shipment manifest Selecting a group candidate as the target group to be assigned to the vehicle, or selecting, by the computer device, a plurality of groups from the plurality of historical shipping destination groups according to the cargo shipping list a group of candidates, and selecting the target group or the plurality of target groups to be assigned to the vehicle from the plurality of group candidates; wherein each selected group candidate includes The historical shipping destination may be present in the cargo shipping list.

In some embodiments, the historical shipping record may further include a cumulative number of times each of the plurality of historical shipping destination groups, and the computer device may be based on a cumulative number of the plurality of group candidates. And selecting the target group or the plurality of target groups to be assigned to the vehicle from the plurality of group candidates.

In some embodiments, in addition to steps 501, 503, the method 5 of arranging the shipment of goods may further comprise the following steps: Determining, by the computer device, a sum of materials for each group candidate according to the cargo shipping list and a carrying capacity of the vehicle; wherein the computer device may be the plurality of groups according to the a sum of the plurality of material numbers determined by the candidate, and selecting the target group or the plurality of target groups to be assigned to the vehicle from the plurality of group candidates.

In some embodiments, the number of historical shipping destinations included by each of the group candidates selected by the computer device from the plurality of historical shipping destination groups is less than a predetermined value.

In some embodiments, in addition to steps 501, 503, the method 5 of arranging shipments may further comprise the step of entering the shipment manifest to the computer device.

In some embodiments, all of the above steps of the method 5 of arranging the shipment of goods may be performed by the computer device 1 that arranges the shipment of the goods. In some embodiments, in addition to the steps described above, the method 5 of arranging the shipment of goods may also include other steps corresponding to all of the above-described embodiments of the computer device 1 in which the shipment is scheduled. Those skilled in the art to which the present invention pertains can understand these other steps in light of the above description of the computer device 1 for arranging the shipment, and no further details are provided herein.

The above-described embodiments are merely illustrative of the invention and are not intended to limit the invention. Any other embodiments which are modified, changed, adjusted, and integrated with the above-described embodiments are not limited to those skilled in the art to which the present invention pertains, and are covered by the scope of the present invention. The scope of protection of the present invention is based on the scope of the patent application.

Claims (12)

A computer device for arranging cargo transportation, comprising: a storage for storing a historical shipping record, the historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group comprising one or more a historical shipping destination; and a processor electrically coupled to the storage and configured to select one or more target groups from the plurality of historical shipping destination groups based on a shipment delivery list The selected target group is assigned to a vehicle, and the historical shipping destination included in each selected target group exists in the cargo shipping list. The computer device of claim 1, wherein the processor is further configured to select a group candidate from the plurality of historical shipping destination groups according to the cargo shipping list as to be assigned to The target group of the vehicle, or the processor is further configured to select a plurality of group candidates from the plurality of historical shipping destination groups according to the cargo shipping list, and from the plurality of Among the group candidates, the target group or the plurality of target groups to be assigned to the vehicle are selected; and wherein a historical shipping destination included in each selected group candidate exists in the In the cargo delivery list. The computer device of claim 2, wherein the historical shipping record further comprises a cumulative number of times of each of the plurality of historical shipping destination groups, and The processor selects, from the plurality of group candidates, the target group or the plurality of target groups to be assigned to the vehicle according to a cumulative number of the plurality of group candidates. The computer device of claim 2, wherein the processor is further configured to determine a sum of materials for each group candidate according to the cargo shipping list and a carrying capacity of the vehicle, and the processing And selecting, from the plurality of group candidates, the target group or the plurality of the plurality of group candidates to be assigned to the vehicle according to the sum of the plurality of materials determined for the plurality of group candidates Target groups. The computer apparatus according to claim 2, wherein the number of historical shipping destinations included in each of the group candidates selected by the processor from the plurality of historical shipping destination groups is less than a preset value. The computer device of claim 2, further comprising an input device, wherein the input device is electrically connected to the processor and configured to input the cargo shipping list. A method of arranging shipment of goods comprising: storing, by a computer device, a historical shipping record, the historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group comprising one or more historical shipping Destinations; and selecting, by the computer device, one or more target groups from the plurality of historical shipping destination groups based on a cargo shipping list and assigning the selected target groups to a vehicle, each The historical shipping destination included in the selected target group exists in the goods shipping list. The method of claim 7, further comprising: selecting, by the computer device, one group candidate from the plurality of historical shipping destination groups according to the cargo shipping list as to be assigned to the vehicle The target group, or the plurality of group candidates are selected from the plurality of historical shipping destination groups by the computer device according to the cargo shipping list, and from the plurality of group candidates The target group or the plurality of target groups to be assigned to the vehicle are selected; wherein a historical shipping destination included in each of the selected group candidates exists in the cargo shipping list. The method of claim 8, wherein: the historical shipping record further comprises a cumulative number of times of the plurality of historical shipping destination groups, and the computer device is based on the cumulative of the plurality of group candidates The number of times, and the target group or the plurality of target groups to be assigned to the vehicle are selected from the plurality of group candidates. The method of claim 8, further comprising: determining, by the computer device, a sum of materials for each group candidate according to the cargo shipping list and a carrying capacity of the vehicle; wherein the computer And selecting, by the device according to the sum of the plurality of material numbers determined for the plurality of group candidates, the target group to be assigned to the vehicle or the Multiple target groups. The method of claim 8, wherein the computer device is from the plurality of historical shipping destinations The number of historical shipping destinations included in each group candidate selected in the group is less than a preset value. The method of claim 8, further comprising: inputting the cargo shipping list to the computer device.