Distribution scheme determination method and device

Abstract

The invention discloses an allocation scheme determination method and device, and relates to the technical field of logistics. A specific embodiment of the method comprises the following steps: obtaining a to-be-distributed zero-load order; obtaining carriage information of each transport vehicle in the current vehicle resource pool; and based on the to-be-allocated zero-load order and the carriage information of each transport vehicle, determining a whole vehicle allocation scheme with the lowest transport cost. According to the embodiment of the invention, a plurality of zero-load orders of one or more users are combined into a whole vehicle order, and the transportation cost is effectively reduced.

Description

Technical Field

[0001] The present application relates to the field of computer technology, specifically to the field of logistics technology, and in particular to a method and device for determining an allocation plan. Background Art

[0002] With the development of the logistics industry, the original method of manually allocating orders to corresponding vehicles is difficult to meet the increasing demand for order volume, and the allocation effect is also heavily dependent on manual experience. Therefore, it is necessary to establish an efficient intelligent scheduling system in the field of logistics terminal distribution.

[0003] At present, there are vehicle demands for full truckload, less-than-truckload, and full truckload-to-point delivery in the market. Full truckload refers to the scenario where users expect a single truck to deliver a specific order, less-than-truckload refers to the scenario where users specify the number of cubic meters and weight of goods but have no requirements on how to transport them, and full truckload-to-point delivery refers to the transportation of orders from multiple users to multiple locations. However, most of them are still based on manual scheduling, and each scenario is independent, without considering the mixing of transportation capacity to reduce the overall transportation cost. Summary of the invention

[0004] Embodiments of the present application provide a method, apparatus, device, and storage medium for determining an allocation scheme.

[0005] According to the first aspect, an embodiment of the present application provides a method for determining an allocation plan, the method comprising: obtaining LTL orders to be allocated; obtaining the shipping information of each transport vehicle in the current vehicle resource pool; and determining a full vehicle allocation plan with the lowest transportation cost based on the LTL orders to be allocated and the shipping information of each transport vehicle.

[0006] According to the second aspect, an embodiment of the present application provides a distribution plan determination device, which includes: a first acquisition module, configured to obtain less-than-truckload orders to be allocated; a second acquisition module, configured to obtain the carrier information of each transport vehicle in the current vehicle resource pool; and a plan determination module, configured to determine a full-vehicle distribution plan with the lowest transportation cost based on the less-than-truckload orders to be allocated and the carrier information of each transport vehicle.

[0007] According to the third aspect, an embodiment of the present application provides an electronic device, which includes one or more processors; a storage device, on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement an allocation scheme determination method as in any embodiment of the first aspect.

[0008] According to a fourth aspect, an embodiment of the present application provides a computer-readable medium having a computer program stored thereon, which, when executed by a processor, implements an allocation scheme determination method as in any embodiment of the first aspect.

[0009] This application obtains the LTL orders to be allocated; obtains the transportation information of each transport vehicle in the current vehicle resource pool; based on the LTL orders to be allocated and the transportation information of each transport vehicle, determines the full vehicle allocation plan with the lowest transportation cost, and realizes the conversion of LTL to full vehicle, that is, the LTL orders with matching destinations are merged into one vehicle, and delivered as a full vehicle, which effectively reduces transportation costs.

[0010] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] Figure 1 is an exemplary system architecture diagram to which the present application may be applied;

[0012] Figure 2a is a flow chart of an embodiment of a method for determining an allocation scheme according to the present application;

[0013] Figure 2b is a schematic diagram of an embodiment of a method for determining an allocation scheme according to the present application;

[0014] Figure 3 is a schematic diagram of an application scenario of the allocation scheme determination method according to the present application;

[0015] Figure 4 is a flow chart of another embodiment of the method for determining an allocation scheme according to the present application;

[0016] Figure 5 is a schematic diagram of an embodiment of an allocation scheme determination device according to the present application;

[0017] Figure 6 It is a structural diagram of a computer system suitable for implementing a server of an embodiment of the present application. DETAILED DESCRIPTION

[0018] The following is a description of exemplary embodiments of the present application in conjunction with the accompanying drawings, including various details of the embodiments of the present application to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the present application. Similarly, for the sake of clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0019] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0020] Figure 1 An exemplary system architecture 100 is shown to which an embodiment of the allocation scheme determination method of the present application can be applied.

[0021] like Figure 1 As shown, the system architecture 100 may include terminal devices 101, 102, 103, a network 104 and a server 105. The network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0022] The terminal devices 101, 102, 103 interact with the server 105 via the network 104 to receive or send messages, etc. Various communication client applications, such as transportation scheduling applications, communication applications, etc., may be installed on the terminal devices 101, 102, 103.

[0023] Terminal devices 101, 102, 103 can be hardware or software. When terminal devices 101, 102, 103 are hardware, they can be various electronic devices with display screens, including but not limited to mobile phones and laptops. When terminal devices 101, 102, 103 are software, they can be installed in the electronic devices listed above. They can be implemented as multiple software or software modules (for example, to provide allocation scheme determination services), or they can be implemented as a single software or software module. No specific limitation is made here.

[0024] Server 105 can be a server that provides various services, for example, obtaining the LTL orders to be allocated; obtaining the carrier information of each transport vehicle in the current vehicle resource pool; and determining the vehicle allocation plan with the lowest transportation cost based on the LTL orders to be allocated and the carrier information of each transport vehicle.

[0025] It should be noted that the server 105 can be hardware or software. When the server 105 is hardware, it can be implemented as a distributed server cluster consisting of multiple servers, or it can be implemented as a single server. When the server is software, it can be implemented as multiple software or software modules (for example, for providing allocation scheme determination services), or it can be implemented as a single software or software module. No specific limitation is made here.

[0026] It should be noted that the allocation scheme determination method provided in the embodiment of the present disclosure can be executed by the server 105, or by the terminal devices 101, 102, 103, or by the server 105 and the terminal devices 101, 102, 103 cooperating with each other. Accordingly, the various parts (such as various units, sub-units, modules, sub-modules) included in the allocation scheme determination device can be all set in the server 105, or all set in the terminal devices 101, 102, 103, or respectively set in the server 105 and the terminal devices 101, 102, 103.

[0027] It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to the implementation requirements.

[0028] Figure 2a A flowchart 200 of an embodiment of a method for determining an allocation scheme that can be applied to the present application is shown. In this embodiment, the method for determining an allocation scheme includes the following steps:

[0029] Step 201, obtaining the LTL order to be allocated.

[0030] In this embodiment, the execution subject (such as Figure 1 The server 105 or terminal devices 101, 102, 103) shown in the figure can obtain multiple LTL orders to be distributed in a wired or wireless manner.

[0031] Among them, LTL orders are used to indicate orders in which users specify volume and weight but do not specify the mode of transportation.

[0032] Here, the delivery time, delivery starting point and destination of the LTL orders to be allocated match, for example, are the same or similar. For example, the LTL orders to be allocated are all LTL orders with a delivery time of February 15, a delivery starting point of Area A and a destination of Area B.

[0033] The wireless connection methods mentioned above may include but are not limited to 3G / 4G connection, WiFi connection, Bluetooth connection, WiMAX connection, Zigbee connection, UWB (ultra wideband) connection, and other wireless connection methods currently known or to be developed in the future.

[0034] In some optional methods, obtaining the LTL order to be allocated includes: obtaining an initial LTL order; and in response to a first cost of LTL transportation of the initial LTL order being less than or equal to a second cost of full truckload transport, determining the initial LTL order as the LTL order to be allocated.

[0035] In this implementation, the execution entity can obtain the initial LTL order by wired or wireless means. Furthermore, the execution entity can calculate the first cost of LTL transportation of the initial LTL order and the second cost of full truckload transport of the initial LTL order, and compare the first cost and the second cost. If the first cost is less than or equal to the second cost, the initial LTL order will be determined as the LTL order to be allocated for full truckload delivery.

[0036] Among them, the whole vehicle serial point is used to indicate the serial point transportation of orders for multiple users with multiple locations as destinations.

[0037] This implementation method obtains an initial LTL order; in response to the first cost of LTL transportation of the initial LTL order being less than or equal to the second cost of full truckload serial transportation, the initial LTL order is determined as the LTL order to be allocated, which helps to improve the accuracy of the determined LTL orders to be allocated.

[0038] In some optional embodiments, the method further includes: in response to a first cost of LTL transportation of the initial LTL order being greater than a second cost of LTL transportation, performing LTL transportation on the initial LTL order.

[0039] In this implementation, the executing entity can calculate the first cost of LTL transportation for the initial LTL order and the second cost of full truckload multi-point transportation for the initial LTL order, and compare the first cost and the second cost. If the first cost is greater than the second cost, the executing entity can transport the initial LTL order by full truckload.

[0040] Here, the executing entity can adopt the solution algorithms in existing technologies or future development technologies, such as VRP algorithm, clustering algorithm, etc. The solution goal is the lowest cost / shortest distance, and the constraints are weight / volume / location / timeliness, to solve the optimal whole vehicle serial transportation plan.

[0041] This implementation method helps to determine the optimal transportation plan by performing full truckload multi-point transportation for the initial LTL order in response to the first cost of LTL transportation for the initial LTL order being greater than the second cost of full truckload multi-point transportation.

[0042] Step 202, obtaining the transport information of each transport vehicle in the current vehicle resource pool.

[0043] In this embodiment, the execution entity may obtain the transport information of each transport vehicle in the current vehicle resource pool by wired or wireless means.

[0044] The transport information may include the carrying capacity (carrying weight, carrying volume) and transport cost information of the transport vehicle.

[0045] In some optional embodiments, the transport vehicles in the current vehicle resource pool include: transport vehicles minus the loaded space after the whole vehicle order allocation is completed.

[0046] In this implementation, the executing entity may first allocate full-truckload orders, that is, determine the optimal full-truckload allocation plan, and after determining the optimal full-truckload allocation plan, put the transport vehicle from which the loaded space has been subtracted as a new vehicle resource into the current vehicle resource pool for the allocation of the pending LTL orders.

[0047] Here, the executor may adopt a solution algorithm from existing technology or future development technology, such as a greedy algorithm, a KM algorithm, etc. The solution objective is to minimize the cost, and the constraint condition is weight / volume, to solve the optimal vehicle allocation plan.

[0048] Among them, the greedy algorithm is used to instruct to traverse all car models for each order and find the car model with the best price that can accommodate the order. It can be considered that the vehicle resources of each car model are unlimited.

[0049] The KM algorithm is used to indicate that when vehicle resources are limited, the KM algorithm is used to find the cost-optimal solution based on the cost score of order i assigned to vehicle j.

[0050] This implementation method realizes the mixed distribution of full truckload and LTL orders with common or similar delivery times, common or similar starting points and destinations by putting the transport vehicles with loaded space into the current vehicle resource pool as new vehicle resources for the distribution of LTL orders to be allocated, thereby further saving distribution costs.

[0051] In some optional embodiments, the method further includes: in the process of allocating vehicle orders, sorting the vehicles by price, and determining a primary transport vehicle model that meets the loading requirements and is priced lower than the ordered vehicle model; based on the primary transport vehicle model, determining a target transport vehicle model.

[0052] In this implementation, since the vehicle models ordered by users are often unreasonable in the whole vehicle order allocation scenario, the execution entity can first sort all vehicles by price in the process of allocating the whole vehicle order, and determine the primary transport model that meets the loading requirements and is lower in price than the ordered model; based on the primary transport model, determine the target transport model.

[0053] Here, the executing entity may determine any type of primary transport vehicle model as the target transport vehicle model, or may determine the lowest-priced type of primary transport vehicle model as the target transport vehicle model, and this application does not impose any limitation on this.

[0054] Specifically, Figure 2bAs shown, in the vehicle order allocation scenario, the execution entity can first obtain the price list of each vehicle model according to the starting place, destination, customer, etc. If the price list match is not empty, it is sorted by price (if the price list match is empty, it is determined whether there is an ordered model. If so, the ordered model is filled. If not, the smallest model that meets the loading requirements is found in the vehicle pool to generate a task), and it is determined whether there is a model that meets the loading requirements. If so, it is further determined whether there is a model with a lower price than the ordered model. If so, the model with the lowest price is determined as the target model (if not, the ordered model is directly filled), and it is further determined whether the driver is matched in the vehicle pool. If so, the driver information is filled and the task is generated. If not, the task is directly generated.

[0055] Step 203, based on the LTL orders to be allocated and the transport information of each transport vehicle, determine the vehicle allocation plan with the lowest transportation cost.

[0056] In this embodiment, the executing entity can determine the full-truckload distribution plan with the lowest transportation cost based on the quantity, volume, weight, etc. of the LTL orders to be allocated and the carrier information of each transport vehicle, for example, N full truckloads, M full truckloads and 1 LTL, etc.

[0057] Specifically:

[0058] O = {1...n} represents the order set;

[0059] V = {1...m} represents the set of vehicles;

[0060] C = {1...h} represents the set of charging methods;

[0061] represents the volume limit of the kth vehicle;

[0062] represents the weight limit of the kth vehicle;

[0063] represents the fixed cost of using the kth vehicle;

[0064] Decision variables:

[0065] y k Indicates whether the kth vehicle is used;

[0066] x i，k Represents the kth vehicle assigned to the i-th order;

[0067] Represents the k-th vehicle using the z-th cost calculation function;

[0068] Optimization goal:

[0069]

[0070] The goal is to find the best price combination based on LTL and overall price comparison

[0071] Constraints:

[0072] Each order is assigned to a unique vehicle;

[0073] Each vehicle is assigned a billing method;

[0074] Vehicle size restrictions;

[0075] Vehicle weight limits;

[0076]

[0077]

[0078] Continue to see Figure 3 , Figure 3 It is a schematic diagram of an application scenario of the allocation scheme determination method according to this embodiment.

[0079] exist Figure 3 In the order scheduling scenario, the execution subject can first allocate the whole vehicle order. Specifically, the execution subject can determine whether the whole vehicle order supports multiple orders. If multiple orders are not allowed, the vehicle pre-processing operation is performed: parameter verification, obtaining the whole vehicle price, and adjusting the vehicle model capacity (load, volume); and algorithm solving: such as using the vehicle infinite greedy algorithm and the vehicle limited KM algorithm to solve, the solution goal is: optimal cost, and the solution constraint is weight / volume. Further, it is determined whether the remaining space of the vehicle is allocated to the LTL order allocation scenario. If so, the transport vehicle with the loaded space subtracted is put into the current vehicle resource pool as a new vehicle resource for LTL order allocation. For the LTL order allocation scenario, the execution entity can first obtain the initial LTL order. Further, the execution entity can calculate the first cost of LTL transportation for the initial LTL order and the second cost of full-truck serial point transportation for the initial LTL order, and compare the first cost and the second cost. If the first cost is less than or equal to the second cost, the initial LTL order is determined as the LTL order to be allocated for full-truck delivery. Here, the starting point, destination, and transportation time of the LTL order to be allocated are the same or similar. Further, the execution entity performs vehicle pre-processing operations: parameter verification, full-truck and LTL price acquisition, vehicle capacity adjustment, and decision whether to split the order; and algorithm solution, that is, full-truck planning (which orders are allocated to which vehicle), the solution target is the optimal cost, and the solution constraint is weight / volume, and finally outputs the allocation result, such as: N full-trucks, M full-trucks 1 LTL, etc.

[0080] For the scenario of vehicle-to-vehicle order allocation, the execution entity can first determine whether it is a single-warehouse pickup. If so, it will perform vehicle pre-processing operations: input parameter verification, obtain the vehicle-to-vehicle price, and dynamically load; and perform algorithm solving: such as using VRP algorithm, clustering algorithm and other algorithms to solve and perform real-time scheduling at the same time. The solution goal is: optimal cost / distance, and the solution constraints are weight / volume / point / timeliness. Finally, the solution result is output.

[0081] Further references Figure 4 , which shows a process 400 of another embodiment of the method for determining an allocation scheme shown in FIG2. In this embodiment, the process 400 of the method for determining an allocation scheme may include the following steps:

[0082] Step 401, obtaining the LTL order to be allocated.

[0083] In this embodiment, the implementation details and technical effects of step 401 can refer to the description of step 201 and will not be repeated here.

[0084] Step 402, obtaining the transport information of each transport vehicle in the current vehicle resource pool.

[0085] In this embodiment, the implementation details and technical effects of step 402 can refer to the description of step 202 and will not be repeated here.

[0086] Step 403, based on the new LTL order to be allocated and the carrier information of each transport vehicle, determine the vehicle allocation plan with the lowest transportation cost.

[0087] In this embodiment, the executing entity can determine the vehicle allocation plan with the lowest transportation cost based on the quantity, volume, weight, etc. of the new LTL orders to be allocated and the carrier information of each transport vehicle, for example, N full vehicles, N full vehicles and 1 LTL, etc.

[0088] Among them, new LTL orders to be allocated can be obtained based on the reallocation of the total number of packages corresponding to each LTL order to be allocated.

[0089] Here, for each LTL order to be allocated with the number of packages greater than or equal to 2, the redistribution method can be set according to actual needs, such as random allocation, average allocation, etc. Specifically, for example, for each LTL order to be allocated, each package is determined as a new LTL order to be allocated; every two packages correspond to a new LTL order to be allocated; every four packages correspond to a new LTL order to be allocated, and so on. This application does not limit this.

[0090] Specifically, for each LTL order to be allocated, each package is determined as a new LTL order to be allocated, and the method for solving the optimal vehicle delivery solution is as follows:

[0091] O = {1...n} represents the order set;

[0092] V = {1...m} represents the set of vehicles;

[0093] O i ={1...l} represents the set of packages in the i-th order;

[0094] C = {1...h} represents the set of charging methods;

[0095] represents the volume limit of the kth vehicle;

[0096] represents the weight limit of the kth vehicle;

[0097] represents the fixed cost of using the kth vehicle;

[0098] ucost(O i ) represents the penalty cost of whether the packages in order i belong to the same vehicle;

[0099] Decision variables:

[0100] y k Indicates whether the kth vehicle is used;

[0101] x i，j，k Represents the assignment of the jth package in the i-th order to the k-th vehicle;

[0102] Represents the k-th vehicle using the z-th cost calculation function;

[0103] Optimization goal:

[0104]

[0105] The goal is to find the best price combination based on LTL and overall price comparison

[0106] Constraints:

[0107] Each package is assigned to a unique vehicle;

[0108] Each vehicle is assigned a billing method;

[0109] Vehicle size restrictions;

[0110] Vehicle weight limits;

[0111]

[0112]

[0113] from Figure 4 It can be seen that, compared with the embodiment corresponding to FIG2 , the process 400 of the allocation scheme determination method in this embodiment reflects the determination of the vehicle allocation scheme with the lowest transportation cost based on the new LTL orders to be allocated and the carrier information of each transport vehicle, that is, the orders to be allocated are split according to the number of packages corresponding to the LTL orders to be allocated, and the vehicle allocation scheme is determined based on the new LTL orders to be allocated after the split. This method improves the flexibility and effectiveness of vehicle allocation and helps to further reduce the overall transportation cost.

[0114] Further references Figure 5 As an implementation of the methods shown in the above figures, the present application provides an embodiment of an allocation scheme determination device, which corresponds to the method embodiment shown in Figure 2 and can be specifically applied to various electronic devices.

[0115] like Figure 5 As shown, the allocation scheme determination device 500 of this embodiment includes: a first acquisition module 501 , a second acquisition module 502 and a scheme determination module 503 .

[0116] Among them, the first acquisition module 501 can be configured to obtain the LTL orders to be allocated.

[0117] The second acquisition module 502 may be configured to acquire the transport information of each transport vehicle in the current vehicle resource pool.

[0118] The plan determination module 503 can be configured to determine the vehicle allocation plan with the lowest transportation cost based on the LTL orders to be allocated and the carrier information of each transport vehicle.

[0119] In some optional aspects of this embodiment, the solution determination module is further configured to determine a vehicle allocation solution with the lowest transportation cost based on new LTL orders to be allocated and the carrier information of each transport vehicle.

[0120] In some optional modes of this embodiment, the first acquisition module is further configured to: obtain an initial LTL order; in response to a first cost of LTL transportation of the initial LTL order being less than or equal to a second cost of full truckload transportation, determine the initial LTL order as a LTL order to be allocated.

[0121] In some optional modes of this embodiment, the device also includes: a serial point transportation module, which is configured to perform full truckload serial point transportation on the initial LTL order in response to the first cost of LTL transportation of the initial LTL order being greater than the second cost of full truckload serial point transportation.

[0122] In some optional modes of this embodiment, the transport vehicles in the current vehicle resource pool include: transport vehicles minus the loaded space after the whole vehicle order is allocated.

[0123] In some optional embodiments of this embodiment, the device also includes: a whole vehicle transportation module, which is configured to sort the vehicles according to price in the process of allocating whole vehicle orders, and determine a primary transportation vehicle model that meets the loading requirements and has a lower price than the ordered vehicle model; based on the primary transportation vehicle model, determine the target transportation vehicle model.

[0124] It should be noted that the collection, collection, updating, analysis, processing, use, transmission, storage and other aspects of user personal information involved in the technical solution of this disclosure are in compliance with the provisions of relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. Necessary measures are taken for user personal information to prevent illegal access to user personal information data and maintain the security of user personal information, network security and national security.

[0125] According to an embodiment of the present application, the present application also provides an electronic device and a readable storage medium.

[0126] like Figure 6 , which is a block diagram of an electronic device according to the allocation scheme determination method of an embodiment of the present application.

[0127] 600 is a block diagram of an electronic device according to a method for determining a distribution scheme of an embodiment of the present application. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples, and are not intended to limit the implementation of the present application described herein and / or required.

[0128] like Figure 6As shown, the electronic device includes: one or more processors 601, a memory 602, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. The various components are interconnected using different buses and can be installed on a common mainboard or installed in other ways as needed. The processor can process instructions executed in the electronic device, including instructions stored in or on the memory to display the graphical information of the GUI on an external input / output device (such as a display device coupled to the interface). In other embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple electronic devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 6 A processor 601 is taken as an example.

[0129] The memory 602 is a non-transient computer-readable storage medium provided in the present application. The memory stores instructions executable by at least one processor to enable the at least one processor to perform the allocation scheme determination method provided in the present application. The non-transient computer-readable storage medium of the present application stores computer instructions, which are used to enable a computer to perform the allocation scheme determination method provided in the present application.

[0130] The memory 602 is a non-transient computer-readable storage medium that can be used to store non-transient software programs, non-transient computer executable programs and modules, such as program instructions / modules corresponding to the allocation scheme determination method in the embodiment of the present application (for example, the attached Figure 5 The processor 601 executes various functional applications and data processing of the server by running the non-transient software programs, instructions and modules stored in the memory 602, that is, the allocation scheme determination method in the above method embodiment is implemented.

[0131] The memory 602 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created by the use of the electronic device determined by the allocation scheme, etc. In addition, the memory 602 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory 602 may optionally include a memory remotely arranged relative to the processor 601, and these remote memories may be connected to the electronic device determined by the allocation scheme via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0132] The electronic device of the allocation scheme determination method may further include: an input device 603 and an output device 604. The processor 601, the memory 602, the input device 603 and the output device 604 may be connected via a bus or other means. Figure 6 The example of connecting through bus is taken in the following.

[0133] The input device 603 can receive input digital or character information, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, an indicator bar, one or more mouse buttons, a track ball, a joystick, and other input devices. The output device 604 may include a display device, an auxiliary lighting device (e.g., an LED), and a tactile feedback device (e.g., a vibration motor). The display device may include, but is not limited to, a liquid crystal display (LCD), a light emitting diode (LED) display, and a plasma display. In some embodiments, the display device may be a touch screen.

[0134] Various implementations of the systems and techniques described herein can be realized in digital electronic circuit systems, integrated circuit systems, dedicated ASICs (application specific integrated circuits), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0135] These computer programs (also referred to as programs, software, software applications, or code) include machine instructions for programmable processors and can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, device, and / or means (e.g., disk, optical disk, memory, programmable logic device (PLD)) for providing machine instructions and / or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal for providing machine instructions and / or data to a programmable processor.

[0136] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0137] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0138] A computer system may include clients and servers. Clients and servers are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship to each other.

[0139] According to the technical solution of the embodiment of the present application, multiple LTL orders of one or more users can be merged into a full truckload order, effectively reducing transportation costs.

[0140] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this application can be executed in parallel, sequentially or in different orders, as long as the expected results of the technical solution disclosed in this application can be achieved, and this document is not limited here.

[0141] The above specific implementations do not constitute a limitation on the protection scope of this application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of this application should be included in the protection scope of this application.

Claims

1. A method for determining an allocation scheme, the method comprising: Obtaining the LTL order to be allocated, wherein the delivery time, delivery starting point and destination of the LTL order to be allocated match; Acquire the transport information of each transport vehicle in the current vehicle resource pool, wherein the transport information includes: the carrying capacity and transport cost information of the transport vehicle; Based on the LTL orders to be allocated and the transport information of each transport vehicle, a full vehicle allocation plan with the lowest transport cost is determined.

2. The method according to claim 1, wherein: The method of determining a vehicle allocation scheme with the lowest transportation cost based on the LTL order to be allocated and the transport information of each transport vehicle comprises: Based on the new LTL orders to be allocated and the transport information of each transport vehicle, a full vehicle allocation plan with the lowest transportation cost is determined, wherein the new LTL orders to be allocated are obtained by reallocating the total number of packages corresponding to each LTL order to be allocated.

3. The method according to claim 1, wherein: The obtaining of the LTL order to be allocated includes: Get initial LTL orders; In response to the first cost of LTL transportation of the initial LTL order being less than or equal to the second cost of full truckload transport, the initial LTL order is determined as the LTL order to be allocated.

4. The method according to claim 3, further comprising: In response to the first cost of LTL transportation for the initial LTL order being greater than the second cost of truckload transport, the initial LTL order is transported by truckload.

5. The method according to claim 1, wherein: The transport vehicles in the current vehicle resource pool include: transport vehicles minus the loaded space after the whole vehicle order allocation is completed.

6. The method according to claim 5, further comprising: In the process of allocating vehicle orders, the vehicles are sorted by price, and the primary transport model that meets the loading requirements and is cheaper than the ordered model is determined; Based on the primary transport vehicle type, a target transport vehicle type is determined.

7. A device for determining an allocation scheme, the device comprising: A first acquisition module is configured to acquire a to-be-allocated LTL order, wherein the delivery time, delivery origin, and destination of the to-be-allocated LTL order match; The second acquisition module is configured to acquire the transport information of each transport vehicle in the current vehicle resource pool, wherein the transport information includes: the carrying capacity and transport cost information of the transport vehicle; The plan determination module is configured to determine the vehicle allocation plan with the lowest transportation cost based on the LTL orders to be allocated and the carrier information of each transport vehicle.

8. The device according to claim 7, wherein: The solution determination module is further configured to: Based on the new LTL orders to be allocated and the transport information of each transport vehicle, a full vehicle allocation plan with the lowest transportation cost is determined, wherein the new LTL orders to be allocated are obtained by reallocating the total number of packages corresponding to each LTL order to be allocated.

9. An electronic device, characterized in that: include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions executable by the at least one processor so that the at least one processor can perform the method according to any one of claims 1 to 6.

10. A non-transitory computer-readable storage medium storing computer instructions, characterized in that: The computer instructions are used to cause the computer to execute the method according to any one of claims 1 to 6.

Images