WO2023124239A1 - 分流路径生成方法、装置、电子设备和计算机可读介质 - Google Patents

分流路径生成方法、装置、电子设备和计算机可读介质 Download PDF

Info

Publication number
WO2023124239A1
WO2023124239A1 PCT/CN2022/118737 CN2022118737W WO2023124239A1 WO 2023124239 A1 WO2023124239 A1 WO 2023124239A1 CN 2022118737 W CN2022118737 W CN 2022118737W WO 2023124239 A1 WO2023124239 A1 WO 2023124239A1
Authority
WO
WIPO (PCT)
Prior art keywords
loading
route
path
candidate
transportation
Prior art date
Application number
PCT/CN2022/118737
Other languages
English (en)
French (fr)
Inventor
赵可
陈夏
严良
吴盛楠
庄晓天
Original Assignee
北京京东振世信息技术有限公司
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 北京京东振世信息技术有限公司 filed Critical 北京京东振世信息技术有限公司
Publication of WO2023124239A1 publication Critical patent/WO2023124239A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Definitions

  • the embodiments of the present disclosure relate to the field of computer technology, and in particular, to a method, device, electronic device, and computer-readable medium for generating a shunt path.
  • some embodiments of the present disclosure provide a distribution route generation method, the method includes: according to the fluctuation parameter of the historical cargo volume of each transportation route, select the transport whose fluctuation parameter is less than the preset threshold value from the transport route set According to the loading rate of each transport route, select the transport route whose loading rate is less than the preset loading rate threshold from the transport route subset as the target transport route, and obtain the target transport route set; for each target transport For each loading in the corresponding loading set of the path, a set of candidate paths for loading is generated; according to the set of candidate paths corresponding to each loading, the available loading margin of each candidate path and the number of distribution paths, generate The distribution path corresponding to each stowage.
  • some embodiments of the present disclosure provide a distribution route generation device, the device includes: a first route selection unit configured to select from a transport route set according to the fluctuation parameter of the historical cargo volume of each transport route A transport route whose fluctuation parameter is less than a preset threshold is obtained as a subset of transport routes; the second route selection unit is configured to select from the subset of transport routes whose loading rate is less than a preset loading rate threshold according to the loading rate of each transport route The transport route of the target transport route is used as the target transport route to obtain a set of target transport routes; the first generation unit is configured to generate a set of candidate routes for the load for each load in the load set corresponding to each target transport route; The second generating unit is configured to generate a distribution path corresponding to each loading according to the candidate path set corresponding to each loading, the available loading margin of each candidate path, and the number of distribution paths.
  • some embodiments of the present disclosure provide an electronic device, including: at least one processor; and a storage device, on which at least one program is stored.
  • the device implements the method described in any implementation manner of the first aspect above.
  • some embodiments of the present disclosure provide a computer-readable medium on which a computer program is stored, wherein when the program is executed by a processor, the method described in any implementation manner of the above-mentioned first aspect is implemented.
  • FIG. 1 is a schematic diagram of an application scenario of a distribution path generation method according to some embodiments of the present disclosure
  • FIG. 2 is a flow chart of some embodiments of a method for generating shunt paths according to the present disclosure
  • Fig. 3 is a flow chart of another embodiment of a method for generating a shunt path according to the present disclosure
  • Fig. 4 is a schematic structural diagram of some embodiments of a shunt path generation device according to the present disclosure
  • FIG. 5 is a schematic structural diagram of an electronic device suitable for implementing some embodiments of the present disclosure.
  • some embodiments of the present disclosure propose methods and devices for generating shunt routes, which can adjust the existing transportation routes when the overall volume of goods is small, and avoid the loss of goods due to route cancellation. Backlog, and ultimately improve the overall transport efficiency.
  • Fig. 1 is a schematic diagram of an application scenario of a method for generating a distribution path according to some embodiments of the present disclosure.
  • the executing body of the method for generating a distribution path may be the computing device 101 .
  • the computing device 101 can acquire the fluctuation parameters of the historical cargo volume of each route in the existing transport route set 102 .
  • the coefficients of variation are 20, 30, and 40, respectively. Among them, the smaller the coefficient of variation, the smaller the fluctuation and the better the stability.
  • the preset threshold is 35, transportation routes A and B can be selected to obtain the transportation route subset 103 .
  • the transportation route B is the target transportation route 104 .
  • the transport route B may correspond to a loading set 105, including loading 1, loading 2... loading n.
  • a set of candidate paths for that loadout is generated. Taking loading 1 as an example, a candidate path set 106 corresponding to loading 1 is generated. Similarly, a set of candidate paths can be generated for each loadout. It can be understood that when the target transport route set includes multiple routes, steps similar to those of the transport route B can be performed for each route.
  • the computing device 101 can generate a distribution path corresponding to each loading according to the candidate path set corresponding to each loading, the available loading margin of each candidate path, and the number of distribution paths.
  • the transportation route B it can be based on the candidate route set 106 corresponding to the loading 1, the available loading margin of each route in the candidate route set 106, and the number of distribution routes (assumed to be 3) , generating the distribution path 107 corresponding to loading 1.
  • the above-mentioned computing device 101 may be hardware or software.
  • the computing device When the computing device is hardware, it can be realized as a distributed cluster composed of multiple servers or terminal devices, or as a single server or a single terminal device.
  • the computing device When the computing device is embodied as software, it can be installed in the hardware devices listed above. It can be implemented, for example, as a plurality of software or software modules for providing distributed services, or as a single software or software module. No specific limitation is made here.
  • the branch path generation method includes the following steps:
  • Step 201 according to the fluctuation parameter of the historical cargo volume of each transportation route, select the transportation route whose fluctuation parameter is smaller than a preset threshold value from the transportation route set, and obtain a transportation route subset.
  • a transportation route may be used to represent an actual transportation route, and a transportation route may include multiple nodes representing passing locations.
  • the volume of goods transported through the transport route actually corresponding to each transport route within a certain period of time can be determined as the historical volume of the transport route.
  • the volume of goods can be measured in various forms such as weight and volume.
  • Each route can correspond to multiple cargo volumes within a period of time.
  • the executor (which may be various electronic devices) of the distribution route generation method can determine the fluctuations of the acquisition volume in various ways, so as to obtain the fluctuation parameters of the historical cargo volume.
  • the daily cargo volume (ie, 30 cargo volumes) of the transportation route A in the past month can be considered as the historical cargo volume of the transportation route.
  • 30 indicators such as coefficient of variation or variance of cargo volume can be determined, and the determined indicators can be used as fluctuation parameters of historical cargo volume.
  • the set of shipping routes may be any set of shipping routes. For example, it may be a set of all currently existing transport routes, or a set of transport routes that meet certain conditions and are filtered. Then, the fluctuation parameter of each transportation route in the transportation route set may be compared with a preset threshold, so as to select a transportation route whose fluctuation parameter is smaller than the preset threshold, and then obtain a transportation route subset. In practice, by setting a small fluctuation parameter, the fluctuation of the historical cargo volume of the transportation routes in the transportation route subset can be made small.
  • Step 202 according to the loading rate of each transport route, select a transport route with a loading rate lower than a preset loading rate threshold from the subset of transport routes as a target transport route to obtain a set of target transport routes.
  • the execution subject may select a transport route whose loading rate is less than a preset loading rate threshold from a subset of transport routes to obtain the target transport route.
  • the loading rate of a certain transport route may be the ratio of the cargo volume corresponding to the transport route to the highest load capacity (carrying capacity) of each transport vehicle corresponding to the transport route within a period of time.
  • the above-mentioned executive body can compare the loading rate of each transport route with a preset loading rate threshold, and select a transport route whose loading rate is less than the preset loading rate threshold, so as to obtain the target transport route.
  • the target transport route at this time is any one of the multiple transport routes.
  • the processing corresponding to steps 203 and 204 may also be performed for each transportation route whose loading rate is less than the preset loading rate.
  • Step 203 for each loading of each target transportation route, generate a set of candidate routes for loading.
  • a transport route may have multiple transport shifts, and therefore multiple loadouts.
  • each transport shift can be regarded as a stowage.
  • 3 transportation shifts are planned tomorrow.
  • 4 transport shifts are planned the day after tomorrow.
  • 7 stowages in total in this transportation route. It can be seen that the total number of stowages is related to the time interval selected in practice, which is not limited in the present disclosure.
  • a set of candidate paths for that loadout can be generated.
  • the shortest path search may be performed in a graph composed of multiple nodes of each preset transportation route according to the transportation starting node and destination node corresponding to the loading. Then, the searched paths can be used as the set of candidate paths for the loading.
  • generating a candidate path set for the loading includes: based on the transportation starting node and destination node corresponding to the loading, in the preset The route search is carried out in the graph composed of each transportation route of the system, and the set of alternative routes is obtained. Based on the constraint condition group corresponding to the loading, the paths meeting the constraint condition group are screened from the candidate path set to obtain the candidate path set.
  • the constraint condition group may include but not limited to at least one of the following: shift connection constraint condition, line loading constraint condition, aging constraint condition, cost constraint condition, stocking time constraint condition and so on.
  • the time constraint condition may be that the time to reach the target node through the alternative route is not later than the time of the original transportation route of the stowage.
  • multiple influencing factors can be comprehensively considered through constraint condition groups, so that the obtained candidate path set is more accurate.
  • Step 204 Generate a distribution path corresponding to each loading according to the candidate path set corresponding to each loading, the available loading margin of each candidate path, and the number of distribution paths.
  • the above-mentioned execution subject may, according to the set of candidate paths corresponding to each loading, the available loading margin of each candidate path, and the distribution path number to generate the shunt paths corresponding to each load.
  • the above execution subject can input the set of candidate paths corresponding to each loading, the available loading margin of each candidate path, and the number of shunt paths into a pre-built MIP (Mixed Integer Programming) model, thereby generating Load the corresponding shunt path.
  • MIP Mated Integer Programming
  • the objective function of the MIP model is:
  • the model constraints are:
  • P is the set of target transportation routes.
  • x ij indicates whether loading i can be diverted to candidate path j, 1 means yes, 0 means no.
  • L represents the candidate path set corresponding to loading i.
  • c i represents the cargo volume of stowage i
  • r j represents the available stowage margin of candidate path j
  • y j represents whether candidate path j is selected, 1 means yes, 0 means no.
  • N represents the number of shunt paths, which can be set according to actual needs.
  • t j represents the number of transfers corresponding to the candidate route j
  • g represents the transfer cost per unit of cargo.
  • d j represents the mileage corresponding to the candidate route j
  • h represents the transportation cost per unit of cargo
  • s i represents the cost of loading i before diversion.
  • constraint (1) means that each load can only be shunted once.
  • Constraint (2) indicates that the number of selected candidate paths must be less than or equal to the number of configured distribution paths.
  • Constraint (3) means that the sum of the stowed goods on the candidate route must be less than or equal to the available stowage margin of the candidate route.
  • Constraint (4) indicates that the candidate path should be selected when the load is shunted to the candidate path.
  • the candidate path corresponding to each loading is its shunt path.
  • the diversion of loading can be realized under the condition of the lowest overall cost, avoiding the backlog of transportation caused by diversion or the need to increase the transport vehicles of the diversion route.
  • constraint (5) can be added to define t j ⁇ M.
  • M is the threshold of transfer times.
  • the distribution paths corresponding to each loading are generated, It includes: according to the cargo volume corresponding to each loading, select the loadings whose cargo volume meets the preset conditions from the loading set corresponding to the target transportation route, and obtain the target loading set.
  • the preset condition may be that the cargo volume is not zero.
  • the preset condition may also be that the proportion of the cargo volume corresponding to the stowage in the cargo volume corresponding to the entire transportation route is smaller than a preset ratio.
  • the available loading margin of each candidate path and the number of distribution paths generate the distribution path corresponding to each loading, including: according to each distribution path in the target loading set According to the set of candidate paths corresponding to the loading, the available loading margin of each candidate path and the number of distribution paths, the distribution path corresponding to each loading is generated.
  • the number of stowages can be reduced without affecting the total cargo volume, thereby increasing the generated diversion path efficiency.
  • a transport route with less fluctuation in cargo volume and a lower loading rate is selected for the existing set of transport routes.
  • a corresponding diversion route is generated for each loading on the selected transport route. Therefore, the existing transportation route can be adjusted when the overall cargo volume is small. Specifically, at least one transport route in the set of target transport routes may be canceled, and the stowage on the canceled transport route may be distributed to the corresponding distribution route. Thus, the waste of transportation resources caused by low load rate can be avoided.
  • the route selection in the target transport route takes into account the cargo fluctuation and loading rate, the diversion pressure caused by the cancellation of these routes on the remaining routes can be reduced as much as possible. Avoid volume backlogs due to route cancellations. Finally, the overall transportation efficiency can be improved.
  • FIG. 3 it shows a flow 300 of another embodiment of a method for generating a shunt path.
  • the flow 300 of the distribution path generation method includes the following steps:
  • Step 301 according to the fluctuation parameter of the historical volume of each transportation route, select the transportation route whose fluctuation parameter is smaller than the preset threshold value from the transportation route set, and obtain a transportation route subset.
  • Step 302 according to the loading rate of each transport route, select a transport route with a loading rate lower than a preset loading rate threshold from the subset of transport routes as a target transport route to obtain a set of target transport routes.
  • Step 303 for each loading in the loading set corresponding to each target transportation route, generate a set of candidate routes for loading.
  • Step 304 Generate a distribution path corresponding to each loading according to the candidate path set corresponding to each loading, the available loading margin of each candidate path, and the number of distribution paths.
  • steps 301-304 for specific implementation of steps 301-304 and corresponding technical effects, reference may be made to steps 201-204 in those embodiments corresponding to FIG. 2 , and details are not repeated here.
  • the above-mentioned executive body may automatically monitor the average load rate of the existing transportation route set, and automatically execute the above-mentioned steps 301-304 under the condition that the average load rate is lower than a preset threshold.
  • the adaptive adjustment of the transport route can be realized.
  • Step 305 in response to receiving a route query request, which includes route attribute information, and based on the route attribute information, select a transport route from the transport route set as a candidate transport route to obtain a candidate transport route set.
  • the execution subject of the flow path generation method may receive a path query request sent by the terminal.
  • the route query request may include route date, route category, route distance, route number and so on.
  • the above-mentioned execution subject can select the transport route from the transport route set as the candidate transport route according to the route attribute information, and obtain the candidate transport route set.
  • Step 306 sending the relevant information of the candidate transport route set to the terminal to display the relevant information of the candidate transport route set.
  • the execution subject may send the relevant information of the set of candidate transport routes to the terminal to display the relevant information of the set of candidate transport routes.
  • the relevant information of the candidate transport route set may include various attribute information of each candidate transport route. Furthermore, relevant information of the candidate transportation route set can be displayed.
  • a delete operation control for the target transport route can also be configured to respond to the user's delete operation.
  • Step 307 receiving path deletion indication information sent by the terminal, and generating line deletion control information according to the path deletion indication information.
  • the terminal user can browse, operate, and so on the relevant information of the above-mentioned set of candidate transportation routes. For example, a user can pick a path to delete.
  • the path deletion indication information may include the identifier of the path to be deleted.
  • the execution subject may generate line deletion control information.
  • the line deletion control information corresponds to the path to be deleted.
  • the path deletion instruction information may be input by the user by clicking the above-mentioned deletion operation control.
  • Step 308 sending the route deletion control information to the transportation terminal corresponding to the transportation route corresponding to the route deletion indication information.
  • the route deletion control information may be sent to the transportation terminal corresponding to the transportation route corresponding to the route deletion instruction information.
  • the transportation terminal can be the vehicle central control system.
  • the central control system can display information or control the vehicle to lock for a period of time.
  • the transport terminal may also be a terminal used by drivers. At this time, the driver can perform the operation of running or canceling the vehicle according to the line deletion control information.
  • FIG. 3 It can be seen from FIG. 3 that, compared with the description of some embodiments corresponding to FIG. 2 , the flow 300 of the distribution route generation method in some embodiments corresponding to FIG. The user instructs to perform steps such as path deletion operation.
  • the present disclosure provides some embodiments of a shunt path generation device. These device embodiments correspond to those method embodiments shown in FIG. 2 , and the device specifically It can be applied to various electronic devices.
  • the diversion route generation device 400 of some embodiments includes: the first route selection unit 401 is configured to select a fluctuation parameter from the transport route set that is less than the preset value according to the fluctuation parameter of the historical cargo volume of each transport route Threshold the transport path to get a subset of transport paths.
  • the second route selection unit 402 is configured to select, according to the loading rate of each transport route, a transport route with a loading rate less than a preset loading rate threshold from the subset of transport routes as a target transport route to obtain a set of target transport routes.
  • the first generating unit 403 is configured to, for each loading in the loading set corresponding to each target transportation route, generate a set of candidate routes for loading.
  • the second generating unit 404 is configured to generate a distribution path corresponding to each loading according to the set of candidate paths corresponding to each loading, the available loading margin of each candidate path, and the number of distribution paths.
  • the first generating unit 403 is configured to: perform path search in a graph composed of preset transportation routes based on the transportation start node and destination node corresponding to the loading , to obtain the set of candidate paths; based on the constraint condition group corresponding to the loading, the path meeting the constraint condition set is screened from the set of candidate paths to obtain the set of candidate paths.
  • the device 400 further includes: a load selection unit configured to select loads from the load set corresponding to the target transportation route according to the load volume corresponding to each load and the second generating unit 404 is configured to: according to the set of candidate paths corresponding to each loading in the target loading set, the available loading balance of each candidate path According to the quantity and the number of diversion paths, the diversion path corresponding to each load is generated.
  • a load selection unit configured to select loads from the load set corresponding to the target transportation route according to the load volume corresponding to each load
  • the second generating unit 404 is configured to: according to the set of candidate paths corresponding to each loading in the target loading set, the available loading balance of each candidate path According to the quantity and the number of diversion paths, the diversion path corresponding to each load is generated.
  • the device 400 further includes: a third route selection unit configured to, in response to receiving a route query request, the route query request including route attribute information, based on the route attribute information, from the transportation route collection The transportation path is selected as the candidate transportation path, and the candidate transportation path set is obtained.
  • the display unit is configured to send the relevant information of the set of candidate transport routes to the terminal to display the relevant information of the set of candidate transport routes.
  • the apparatus 400 further includes: a receiving unit configured to receive the path deletion indication information sent by the terminal, and generate line deletion control information according to the path deletion indication information; a sending unit configured to send the line The deletion control information is sent to the transportation terminal corresponding to the transportation route corresponding to the route deletion instruction information.
  • the units recorded in the device 400 correspond to the steps in the method described with reference to FIG. 2 . Therefore, the operations, features and beneficial effects described above for the method are also applicable to the device 400 and the units contained therein, and will not be repeated here.
  • FIG. 5 it shows a schematic structural diagram of an electronic device (such as the computing device in FIG. 1 ) 500 suitable for implementing some embodiments of the present disclosure.
  • the electronic device shown in FIG. 5 is only an example, and should not limit the functions and scope of use of the embodiments of the present disclosure.
  • an electronic device 500 may include a processing device (such as a central processing unit, a graphics processing unit, etc.) 501, which may be randomly accessed according to a program stored in a read-only memory (ROM) 502 or loaded from a storage device 508.
  • ROM read-only memory
  • RAM random access memory
  • various appropriate actions and processes are executed by programs in the memory (RAM) 503 .
  • RAM random access memory
  • various programs and data necessary for the operation of the electronic device 500 are also stored.
  • the processing device 501, ROM 502, and RAM 503 are connected to each other through a bus 504.
  • An input/output (I/O) interface 505 is also connected to the bus 504 .
  • the following devices can be connected to the I/O interface 505: input devices 506 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; including, for example, a liquid crystal display (LCD), speaker, vibration an output device 507 such as a computer; a storage device 508 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 509.
  • the communication means 509 may allow the electronic device 500 to perform wireless or wired communication with other devices to exchange data. While FIG. 5 shows electronic device 500 having various means, it is to be understood that implementing or having all of the means shown is not a requirement. More or fewer means may alternatively be implemented or provided. Each block shown in FIG. 5 may represent one device, or may represent multiple devices as required.
  • the processes described above with reference to the flowcharts may be implemented as computer software programs.
  • some embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer-readable medium, where the computer program includes program codes for executing the methods shown in the flowcharts.
  • the computer program may be downloaded and installed from a network via communication means 509, or from storage means 508, or from ROM 502.
  • the processing device 501 When the computer program is executed by the processing device 501, the above-mentioned functions defined in the methods of some embodiments of the present disclosure are performed.
  • the computer-readable medium described in some embodiments of the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two.
  • a computer readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any combination thereof. More specific examples of computer readable storage media may include, but are not limited to: electrical connections having at least one lead, portable computer diskettes, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable Read memory (EPROM or flash memory), fiber optics, portable compact disk read only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the above.
  • a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.
  • a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code thereon. Such propagated data signals may take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • a computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which can transmit, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device .
  • Program code embodied on a computer readable medium may be transmitted by any appropriate medium, including but not limited to wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.
  • the client and the server can communicate using any currently known or future network protocols such as HTTP (HyperText Transfer Protocol, Hypertext Transfer Protocol), and can communicate with digital data in any form or medium
  • HTTP HyperText Transfer Protocol
  • the communication eg, communication network
  • Examples of communication networks include local area networks (“LANs”), wide area networks (“WANs”), internetworks (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network of.
  • the above-mentioned computer-readable medium may be included in the above-mentioned electronic device, or may exist independently without being incorporated into the electronic device.
  • the above-mentioned computer-readable medium carries one or more programs, and when the above-mentioned one or more programs are executed by the electronic device, the electronic device: according to the fluctuation parameters of the historical volume of each transport route, from the set of transport routes Select the transport route whose fluctuation parameter is less than the preset threshold value to obtain a subset of transport routes; according to the loading rate of each transport route, select the transport route whose loading rate is less than the preset loading rate threshold from the transport route subset as the target transport route, and obtain the target transport route Transportation path set; for each loading in the corresponding loading set of each target transportation path, generate a loading candidate path set; according to the candidate path set corresponding to each loading, and the available loading of each candidate path The margin and the number of distribution paths are used to generate the distribution paths corresponding to each load.
  • Computer program code for carrying out operations of some embodiments of the present disclosure can be written in one or more programming languages, or combinations thereof, including object-oriented programming languages—such as Java, Smalltalk, C++ , also includes conventional procedural programming languages—such as the "C" language or similar programming languages.
  • the program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server.
  • the remote computer may be connected to the user computer through any kind of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (for example, using an Internet service provider to connected via the Internet).
  • LAN local area network
  • WAN wide area network
  • Internet service provider for example, using an Internet service provider to connected via the Internet.
  • each block in the flowchart or block diagram may represent a module, program segment, or part of code that contains at least one programmable logic function for implementing the specified logical function.
  • Execute instructions may also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or they may sometimes be executed in the reverse order, depending upon the functionality involved.
  • each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations can be implemented by a dedicated hardware-based system that performs the specified functions or operations , or may be implemented by a combination of dedicated hardware and computer instructions.
  • the units described in some embodiments of the present disclosure may be realized by software or by hardware.
  • the described units may also be set in a processor.
  • a processor includes a first path selection unit, a second path selection unit, a first generation unit, and a second generation unit.
  • the names of these units do not constitute a limitation of the unit itself in some cases, for example, the first route selection unit can also be described as "according to the fluctuation parameters of the historical volume of each transport route, from the transport route Select the transport route whose fluctuation parameter is less than the preset threshold in the set, and obtain the unit of the transport route subset".
  • exemplary types of hardware logic components include: Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), System on Chips (SOCs), Complex Programmable Logical device (CPLD) and so on.
  • FPGAs Field Programmable Gate Arrays
  • ASICs Application Specific Integrated Circuits
  • ASSPs Application Specific Standard Products
  • SOCs System on Chips
  • CPLD Complex Programmable Logical device

Landscapes

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

Abstract

分流路径生成方法、装置、电子设备和计算机可读介质。包括：根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集（201）；根据每条运输路径的装载率，从运输路径子集中选取装载率小于预设装载率阈值的运输路径作为目标运输路径，得到目标运输路径集合（202）；对于每个目标运输路径的对应的配载集合中的每个配载，生成配载的候选路径集（203）；根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径（204）。

Description

分流路径生成方法、装置、电子设备和计算机可读介质
相关申请的交叉引用
本申请要求于申请日为2021年12月27日提交的，申请号为202111608072.0、发明名称为“分流路径生成方法、装置、电子设备和计算机可读介质”的中国专利申请的优先权，其全部内容作为整体并入本申请中。
技术领域
本公开的实施例涉及计算机技术领域，具体涉及分流路径生成方法、装置、电子设备和计算机可读介质。
背景技术
随着运输行业的快速发展，逐步形成了一些固定的运输路线。例如，北京到上海对应一条固定运输路线。一般来说，在一定的时期内，在这些运输路线上运行的运输班期是固定的。例如，在北京至上海这条运输路线，可以在每个整点进行发车。
发明内容
本公开的内容部分用于以简要的形式介绍构思，这些构思将在后面的具体实施方式部分被详细描述。本公开的内容部分并不旨在标识要求保护的技术方案的关键特征或必要特征，也不旨在用于限制所要求的保护的技术方案的范围。本公开的一些实施例提出了分流路径生成方法、装置、设备和计算机可读介质，来解决以上背景技术部分提到的技术问题中的一项或多项。
第一方面，本公开的一些实施例提供了一种分流路径生成方法，该方法包括：根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集； 根据每条运输路径的装载率，从运输路径子集中选取装载率小于预设装载率阈值的运输路径作为目标运输路径，得到目标运输路径集合；对于每个目标运输路径的对应的配载集合中的每个配载，生成配载的候选路径集；根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
第二方面，本公开的一些实施例提供了一种分流路径生成装置，装置包括：第一路径选取单元，被配置成根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集；第二路径选取单元，被配置成根据每条运输路径的装载率，从所述运输路径子集中选取装载率小于预设装载率阈值的运输路径作为目标运输路径，得到目标运输路径集合；第一生成单元，被配置成对于每个目标运输路径对应的配载集合中的每个配载，生成所述配载的候选路径集；第二生成单元，被配置成根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
第三方面，本公开的一些实施例提供了一种电子设备，包括：至少一个处理器；存储装置，其上存储有至少一个程序，当至少一个程序被至少一个处理器执行，使得至少一个处理器实现上述第一方面任一实现方式所描述的方法。
第四方面，本公开的一些实施例提供了一种计算机可读介质，其上存储有计算机程序，其中，程序被处理器执行时实现上述第一方面任一实现方式所描述的方法。
附图说明
结合附图并参考以下具体实施方式，本公开各实施例的上述和其他特征、优点及方面将变得更加明显。贯穿附图中，相同或相似的附图标记表示相同或相似的元素。应当理解附图是示意性的，元件和元素不一定按照比例绘制。
图1是根据本公开的一些实施例的分流路径生成方法的一个应用场景的示意图；
图2是根据本公开的分流路径生成方法的一些实施例的流程图；
图3是根据本公开的分流路径生成方法的另一些实施例的流程图；
图4是根据本公开的分流路径生成装置的一些实施例的结构示意图；
图5是适于用来实现本公开的一些实施例的电子设备的结构示意图。
具体实施方式
下面将参照附图更详细地描述本公开的实施例。虽然附图中显示了本公开的某些实施例，然而应当理解的是，本公开可以通过各种形式来实现，而且不应该被解释为限于这里阐述的实施例。相反，提供这些实施例是为了更加透彻和完整地理解本公开。应当理解的是，本公开的附图及实施例仅用于示例性作用，并非用于限制本公开的保护范围。
另外还需要说明的是，为了便于描述，附图中仅示出了与有关发明相关的部分。在不冲突的情况下，本公开中的实施例及实施例中的特征可以相互组合。
需要注意，本公开中提及的“第一”、“第二”等概念仅用于对不同的装置、模块或单元进行区分，并非用于限定这些装置、模块或单元所执行的功能的顺序或者相互依存关系。
需要注意，本公开中提及的“一个”、“多个”的修饰是示意性而非限制性的，本领域技术人员应当理解，除非在上下文另有明确指出，否则应该理解为“至少一个”。
本公开实施方式中的多个装置之间所交互的消息或者信息的名称仅用于说明性的目的，而并不是用于对这些消息或信息的范围进行限制。
相关的运输方法，例如，在每个整点进行发车等经常会存在如下技术问题：一些运输路线上的货物量会发生波动。当货物量较少时，固定的运输路线和班期会造成运输资源的浪费。
为了解决以上所阐述的问题，本公开的一些实施例提出了分流路径生成方法及装置，可以在整体货量较小的情况下，对现有的运输路径进行调整，避免由于路径取消造成货量积压，最终实现整体的运输效率的提升。
下面将参考附图并结合实施例来详细说明本公开。
图1是本公开的一些实施例的分流路径生成方法的一个应用场景的示意图。
在图1的应用场景中，分流路径生成方法的执行主体可以是计算设备101。然后，计算设备101可以获取现有的运输路径集合102中各条路径的历史货量的波动参数。例如，运输路径集合中有标识分别A、B、C的三条运输路径，变异系数(Coefficient of Variation，CV)分别为20、30、40。其中，变异系数越小，代表波动越小，稳定性越好。假设预设阈值为35，可以选取运输路径A和B，得到运输路径子集103。
在此基础上，假设运输路径A、B、C的装载率分别为80、90、95，若预设装载率阈值为85，那么运输路径B即为目标运输路径104。运输路径B可以对应配载集合105，其中包括配载1、配载2……配载n。对于其中每个配载，生成该配载的候选路径集。以配载1为例，生成配载1对应的候选路径集106。类似的，可以为每个配载生成候选路径集。可以理解，当目标运输路径集合中包括多条路径时，可以对于每条路径执行与运输路径B类似的步骤。在此基础上，计算设备101可以根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。继续以运输路径B为例，对于配载1，可以根据配载1对应的候选路径集106、候选路径集106中各条路径的可用配载余量，以及分流路径个数(假设为3)，生成配载1对应的分流路径107。
需要说明的是，上述计算设备101可以是硬件，也可以是软件。当计算设备为硬件时，可以实现成多个服务器或终端设备组成的分布式集群，也可以实现成单个服务器或单个终端设备。当计算设备体现为软件时，可以安装在上述所列举的硬件设备中。其可以实现成例如 用来提供分布式服务的多个软件或软件模块，也可以实现成单个软件或软件模块。在此不做具体限定。
应该理解，图1中的计算设备的数目仅仅是示意性的。根据实现需要，可以具有任意数目的计算设备。
继续参考图2，示出了根据本公开的分流路径生成方法的一些实施例的流程200。该分流路径生成方法，包括以下步骤：
步骤201，根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集。
在一些实施例中，运输路径可以用于表征实际的运输路线，运输路径可以包括多个用于表征途径地点的节点。在此基础上，可以将在一定的时间段内通过每条运输路径实际对应的运输路线运输的货物量确定为该运输路径的历史货量。其中，货物量可以通过重量、体积等各种形式来度量。每条路径在一段时间内可以对应多个货物量。在此基础上，分流路径生成方法的执行主体(可以是各种电子设备)可以通过多种方式来确定这些获取量的波动情况，从而得到历史货量的波动参数。例如，在过去一个月内A运输路径的每天的货物量(即，30个货物量)可以认为是该运输路径的历史货量。在此基础上，可以确定30个货物量的变异系数或方差等指标，并将确定的指标作为历史货量的波动参数。
在一些实施例中，运输路径集合可以是任意的运输路径集合。例如，可以是当前存在的所有运输路径组成的集合，也可以是符合一定条件筛选到的运输路径组成的集合。然后，可以将运输路径集合中的每个运输路径的波动参数与预设阈值比较，从而选取波动参数小于预设阈值的运输路径，进而得到运输路径子集。实践中，通过设置较小的波动参数，可以使得运输路径子集中的运输路径的历史货量的波动较小。
步骤202，根据每条运输路径的装载率，从运输路径子集中选取装载率小于预设装载率阈值的运输路径作为目标运输路径，得到目标运输路径集合。
在一些实施例中，上述执行主体可以根据每条运输路径的装载率，从运输路径子集中选取装载率小于预设装载率阈值的运输路径，得到目标运输路径。
其中，某条运输路径的装载率可以是一段时间内该运输路径对应的货物量与该运输路径对应的各个运输车辆的最高载量(载容)的比值。在此基础上，上述执行主体可以将每条运输路径的装载率与预设装载率阈值进行比较，以及选取装载率小于预设装载率阈值的运输路径，从而得到目标运输路径。需要说明的是，实践中，可能存在多条装载率小于预设装载率阈值的运输路径，此时目标运输路径为多条运输路径中的任意一条。根据实际需要，也可以对每条装载率小于预设装载率的运输路径执行步骤203和204对应的处理。
步骤203，对于每个目标运输路径的每个配载，生成配载的候选路径集。
在一些实施例中，某条运输路径会有多个运输班次，因此会有多个配载。其中，每个运输班次，都可以看作一个配载。例如，北京至上海对应的运输路径，明天计划了3个运输班次。那么，可以认为该运输路径存在3个配载。又如，同样是北京至上海对应的运输路径，明天计划了3个运输班次，后天计划了4个运输班次。那么，可以认为该运输路径总共存在7个配载。可以看出，配载总数与实践中选取的时间区间相关，对此本公开不进行限定。在此基础上，对于每个配载，可以生成该配载的候选路径集。作为示例，可以根据该配载对应的运输起始节点和目的节点，在预设的各个运输路径途径的多个节点所组成的图中，执行最短路径搜索。然后，可以将搜索到的路径作为该配载的候选路径集。
在一些实施例的一些可选的实现方式中，对于目标运输路径的每个配载，生成该配载的候选路径集，包括：基于配载对应的运输起始节点和目标节点，在预设的各个运输路径所组成的图中进行路径搜索，得到备选路径集。基于配载对应的约束条件组，从备选路径集中筛选符合约束条件组的路径，得到候选路径集。其中，约束条件组可以包括但不限于以下至少一项：班次衔接约束条件、线路配载约束条件、 时效约束条件、成本约束条件、囤积时间约束条件等等。例如，时效约束条件可以是通过备选路径到达目标节点的时间不晚于该配载的原运输路径的时间。在这些实现方式中，通过约束条件组进行约束，可以综合考虑多个影响因素，从而使得得到的候选路径集更加准确。
步骤204，根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
在一些实施例中，在步骤203得到每个配载的候选路径集的基础上，上述执行主体可以根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
作为示例，上述执行主体可以将每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数输入预先构建的MIP(混合整数规划)模型，从而生成每个配载对应的分流路径。
其中，作为示例，MIP模型的目标函数为：
Figure PCTCN2022118737-appb-000001
模型约束为：
Σ j∈Lx ij＝1，i∈P，     (1)
Σ j∈Ly j≤N，    (2)
Σ i∈Px ij*c i≤r j*y j，j∈L，   (3)
Figure PCTCN2022118737-appb-000002
其中，P为目标运输路径集合。x ij表示配载i是否可以分流到候选路径j，1表示可以，0表示不可以。L表示配载i对应的候选径集。c i表示配载i的货物量，r j表示候选路径j的可用配载余量，y j表示候选路径j是否被选择，1表示是，0表示不是。N表示分流路径个数，可以根据实际需要进行设定。t j表示候选路径j对应的中转次数，g表示单位货物量每次的中转成本。d j表示候选路径j对应的里程数，h表示单位货物量的运输成本，s i表示配载i的分流前的成本。
其中，约束(1)表示每个配载只能被分流一次。约束(2)表示候选路径的选择个数需要小于或等于配置的分流路径个数。约束(3)表示候选路径上分流的配载的货物量总和需要小于或等于候选路径的 可用配载余量。约束(4)表示配载分流到候选路径上时该候选路径要被选择。
由此，目标函数为最小值时，每个配载对应的候选路径即为其分流路径。
在此过程中，通过综合考虑中转成本g和运输成本h，从而使得在综合成本最低的情况下实现配载的分流，避免由于分流造成其他路径的运输积压或需要增加分流路径的运输车辆。
可以理解，上述目标函数以及约束均为示例性的。根据实际需要可以进行调整。例如，为了对中转次数进行控制，可以增加约束(5)，以限定t j≤M。M为中转次数阈值。
在一些实施例的一些可选的实现方式中，根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径，包括：根据每个配载对应的载货量，从目标运输路径对应的配载集合中选取载货量符合预设条件的配载，得到目标配载集合。其中，预设条件可以是载货量不为零。又如，预设条件也可以是配载对应的载货量在整个运输路径对应的载货量中的占比小于预设比值。以及，根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径，包括：根据目标配载集合中每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
实践中，通过载货量对配载集中的配载进行筛选，剔除载货量占比较低的配载，可以在不影响总的载货量的同时减少配载的数量，进而提高生成的分流路径的效率。
本公开的一些实施例提供的方法，对于现有的运输路径集合，从中选取货量波动较小且装载率较小的运输路径。在基础上，对于所选取的运输路径上的每个配载，生成对应的分流路径。从而可以在整体货量较小的情况下，对现有的运输路径进行调整。具体的，可以将目标运输路径集合中的至少一个运输路径取消，并将取消的运输路径上的配载分流到对应的分流路径上。从而可以避免低负载率造成的运输资源浪费。在此过程中，由于目标运输路径中的路径选取综合考虑了 货物波动以及装载率，从而可以尽可能的减少取消这些路径对其余的路径所造成的分流压力。避免由于路径取消造成货量积压。最终实现整体的运输效率的提升。
参考图3，其示出了分流路径生成方法的另一些实施例的流程300。该分流路径生成方法的流程300，包括以下步骤：
步骤301，根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集。
步骤302，根据每条运输路径的装载率，从运输路径子集中选取装载率小于预设装载率阈值的运输路径作为目标运输路径，得到目标运输路径集合。
步骤303，对于每个目标运输路径对应的配载集合中的每个配载，生成配载的候选路径集。
步骤304，根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
在一些实施例中，步骤301-304的具体实现及其所对应的技术效果可以参考图2对应的那些实施例中的步骤201-204，在此不再赘述。
可选的，上述执行主体可以自动监控现有的运输路径集合的平均负载率，在平均负载率低于预设阈值的条件下，自动执行上述步骤301-304。从而可以实现运输路径的自适应调整。
步骤305，响应于接收到路径查询请求，路径查询请求中包括路径属性信息，基于路径属性信息，从运输路径集合中筛选出运输路径作为候选运输路径，得到候选运输路径集合。
在一些实施例中，流路径生成方法的执行主体可以接收终端发送的路径查询请求。实践中，路径查询请求中可以包括路径日期、路径类别、路径距离、线路编号等等。
在此基础上，上述执行主体可以根据路径属性信息，对运输路径集合中筛选出运输路径作为候选运输路径，得到候选运输路径集合。
步骤306，将候选运输路径集合的相关信息发送至终端以对候选运输路径集合的相关信息进行显示。
在一些实施例中，上述执行主体可以将候选运输路径集合的相关信息发送至终端以对候选运输路径集合的相关信息进行显示。其中，候选运输路径集合的相关信息可以包括各个候运输路径的各种属性信息。进而可以候选运输路径集合的相关信息进行显示。
可选的，若候选运输路径集合中包括上述目标运输路径，对目标运输路径进行差异化展示。可选的，如果包含目标运输路径，还可以配置针对该目标运输路径的删除操作控件，以响应用户的删除操作。
步骤307，接收终端发送的路径删除指示信息，根据路径删除指示信息生成线路删除控制信息。
在一些实施例中，终端用户可以对上述候选运输路径集合的相关信息进行浏览、操作等。例如，用户可以选取想要删除的路径。此时，路径删除指示信息可以包括待删除的路径的标识。在此基础上，上述执行主体可以生成线路删除控制信息。其中，线路删除控制信息与待删除的路径是相对应的。可选的，路径删除指示信息可以是用户通过点击上述删除操作控件所输入的。
步骤308，将线路删除控制信息发送至路径删除指示信息对应的运输路径对应的运输终端。
在一些实施例中，为了控制待删除的路径对应的车辆停止运行，可以将线路删除控制信息发送至路径删除指示信息对应的运输路径对应的运输终端。实践中，根据实际需要，运输终端可以是车辆中控系统，当接收到线路删除控制信息时，中控系统可以进行信息显示或者控制车辆在一段时间内锁定。此外，运输终端也可以是驾驶人员所使用的终端。此时，驾驶人员可以根据线路删除控制信息执行车辆运行或取消的操作。
从图3中可以看出，与图2对应的一些实施例的描述相比，图3对应的一些实施例中的分流路径生成方法的流程300增加了对候选运输路径集合的相关信息，以及根据用户指示进行路径删除操作等步骤。
参考图4，作为对上述各图所示方法的实现，本公开提供了一种分流路径生成装置的一些实施例，这些装置实施例与图2所示的那些 方法实施例相对应，该装置具体可以应用于各种电子设备中。
如图4所示，一些实施例的分流路径生成装置400包括：第一路径选取单元401被配置成根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集。第二路径选取单元402被配置成根据每条运输路径的装载率，从运输路径子集中选取装载率小于预设装载率阈值的运输路径作为目标运输路径，得到目标运输路径集合。第一生成单元403被配置成对于每个目标运输路径对应的配载集合中的每个配载，生成配载的候选路径集。第二生成单元404被配置成根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
在一些实施例的可选实现方式中，其中，第一生成单元403被配置成：基于配载对应的运输起始节点和目标节点，在预设的各个运输路径所组成的图中进行路径搜索，得到备选路径集；基于配载对应的约束条件组，从备选路径集中筛选符合约束条件组的路径，得到候选路径集。
在一些实施例的可选实现方式中，其中，装置400还包括：配载选取单元，被配置成根据每个配载对应的载货量，从目标运输路径对应的配载集合中选取载货量符合预设条件的配载，得到目标配载集合；以及第二生成单元404被配置成：根据目标配载集合中每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
在一些实施例的可选实现方式中，装置400还包括：第三路径选取单元被配置成响应于接收到路径查询请求，路径查询请求中包括路径属性信息，基于路径属性信息，从运输路径集合中筛选出运输路径作为候选运输路径，得到候选运输路径集合。显示单元，被配置成将候选运输路径集合的相关信息发送至终端以对候选运输路径集合的相关信息进行显示。
在一些实施例的可选实现方式中，装置400还包括：接收单元，被配置成接收终端发送的路径删除指示信息，根据路径删除指示信息 生成线路删除控制信息；发送单元，被配置成将线路删除控制信息发送至路径删除指示信息对应的运输路径对应的运输终端。
可以理解的是，该装置400中记载的诸单元与参考图2描述的方法中的各个步骤相对应。由此，上文针对方法描述的操作、特征以及产生的有益效果同样适用于装置400及其中包含的单元，在此不再赘述。
下面参考图5，其示出了适于用来实现本公开的一些实施例的电子设备(例如图1中的计算设备)500的结构示意图。图5示出的电子设备仅仅是一个示例，不应对本公开的实施例的功能和使用范围带来任何限制。
如图5所示，电子设备500可以包括处理装置(例如中央处理器、图形处理器等)501，其可以根据存储在只读存储器(ROM)502中的程序或者从存储装置508加载到随机访问存储器(RAM)503中的程序而执行各种适当的动作和处理。在RAM 503中，还存储有电子设备500操作所需的各种程序和数据。处理装置501、ROM 502以及RAM 503通过总线504彼此相连。输入/输出(I/O)接口505也连接至总线504。
通常，以下装置可以连接至I/O接口505：包括例如触摸屏、触摸板、键盘、鼠标、摄像头、麦克风、加速度计、陀螺仪等的输入装置506；包括例如液晶显示器(LCD)、扬声器、振动器等的输出装置507；包括例如磁带、硬盘等的存储装置508；以及通信装置509。通信装置509可以允许电子设备500与其他设备进行无线或有线通信以交换数据。虽然图5示出了具有各种装置的电子设备500，但是应理解的是，并不要求实施或具备所有示出的装置。可以替代地实施或具备更多或更少的装置。图5中示出的每个方框可以代表一个装置，也可以根据需要代表多个装置。
特别地，根据本公开的一些实施例，上文参考流程图描述的过程可以被实现为计算机软件程序。例如，本公开的一些实施例包括一种计算机程序产品，其包括承载在计算机可读介质上的计算机程序，该 计算机程序包含用于执行流程图所示的方法的程序代码。在这样的一些实施例中，该计算机程序可以通过通信装置509从网络上被下载和安装，或者从存储装置508被安装，或者从ROM 502被安装。在该计算机程序被处理装置501执行时，执行本公开的一些实施例的方法中限定的上述功能。
需要说明的是，本公开的一些实施例中记载的计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质或者是上述两者的任意组合。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的更具体的例子可以包括但不限于：具有至少一个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本公开的一些实施例中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。而在本公开的一些实施例中，计算机可读信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读信号介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：电线、光缆、RF(射频)等等，或者上述的任意合适的组合。
在一些实施方式中，客户端、服务器可以利用诸如HTTP(HyperText Transfer Protocol，超文本传输协议)之类的任何当前已知或未来研发的网络协议进行通信，并且可以与任意形式或介质的数字数据通信(例如，通信网络)互连。通信网络的示例包括局域网(“LAN”)，广域网(“WAN”)，网际网(例如，互联网)以及端对端 网络(例如，ad hoc端对端网络)，以及任何当前已知或未来研发的网络。
上述计算机可读介质可以是上述电子设备中所包含的；也可以是单独存在，而未装配入该电子设备中。上述计算机可读介质承载有一个或者多个程序，当上述一个或者多个程序被该电子设备执行时，使得该电子设备：根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集；根据每条运输路径的装载率，从运输路径子集中选取装载率小于预设装载率阈值的运输路径作为目标运输路径，得到目标运输路径集合；对于每个目标运输路径的对应的配载集合中的每个配载，生成配载的候选路径集；根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
可以以一种或多种程序设计语言或其组合来编写用于执行本公开的一些实施例的操作的计算机程序代码，所述程序设计语言包括面向对象的程序设计语言—诸如Java、Smalltalk、C++，还包括常规的过程式程序设计语言—诸如“C”语言或类似的程序设计语言。程序代码可以完全地在用户计算机上执行、部分地在用户计算机上执行、作为一个独立的软件包执行、部分在用户计算机上部分在远程计算机上执行、或者完全在远程计算机或服务器上执行。在涉及远程计算机的情形中，远程计算机可以通过任意种类的网络——包括局域网(LAN)或广域网(WAN)——连接到用户计算机，或者，可以连接到外部计算机(例如利用因特网服务提供商来通过因特网连接)。
附图中的流程图和框图，图示了按照本公开各种实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段、或代码的一部分，该模块、程序段、或代码的一部分包含至少一个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是， 框图和/或流程图中的每个方框、以及框图和/或流程图中的方框的组合，可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本公开的一些实施例中的单元可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的单元也可以设置在处理器中，例如，可以描述为：一种处理器包括第一路径选取单元、第二路径选取单元、第一生成单元和第二生成单元。其中，这些单元的名称在某种情况下并不构成对该单元本身的限定，例如，第一路径选取单元还可以被描述为“根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集的单元”。
本文中以上描述的功能可以至少部分地由至少一个硬件逻辑部件来执行。例如，非限制性地，可以使用的示范类型的硬件逻辑部件包括：现场可编程门阵列(FPGA)、专用集成电路(ASIC)、专用标准产品(ASSP)、片上系统(SOC)、复杂可编程逻辑设备(CPLD)等等。
以上描述仅为本公开的一些较佳实施例以及对所运用技术原理的说明。本领域技术人员应当理解，本公开的实施例中所涉及的发明范围，并不限于上述技术特征的特定组合而成的技术方案，同时也应涵盖在不脱离上述发明构思的情况下，由上述技术特征或其等同特征进行任意组合而形成的其它技术方案。例如上述特征与本公开的实施例中公开的(但不限于)具有类似功能的技术特征进行互相替换而形成的技术方案。

Claims (10)

  1. 一种分流路径生成方法，包括：
    根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集；
    根据每条运输路径的装载率，从所述运输路径子集中选取装载率小于预设装载率阈值的运输路径作为目标运输路径，得到目标运输路径集合；
    对于每个目标运输路径对应的配载集合中的每个配载，生成所述配载的候选路径集；
    根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
  2. 根据权利要求1所述的方法，其中，所述对于每个目标运输路径对应的配载集合中的每个配载，生成所述配载的候选路径集，包括：
    基于所述配载对应的运输起始节点和目标节点，在预设的各个运输路径所组成的图中进行路径搜索，得到备选路径集；
    基于所述配载对应的约束条件组，从所述备选路径集中筛选符合所述约束条件组的路径，得到所述候选路径集。
  3. 根据权利要求1或2所述的方法，其中，在所述根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径之前，所述方法还包括：
    根据每个配载对应的载货量，从所述目标运输路径对应的配载集合中选取载货量符合预设条件的配载，得到目标配载集合；以及
    所述根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径，包括：
    根据所述目标配载集合中每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
  4. 根据权利要求1-3之一所述的方法，其中，所述方法还包括：
    响应于接收到路径查询请求，所述路径查询请求中包括路径属性信息，基于所述路径属性信息，从所述运输路径集合中筛选出运输路径作为候选运输路径，得到候选运输路径集合；
    将所述候选运输路径集合的相关信息发送至终端以对所述候选运输路径集合的相关信息进行显示。
  5. 根据权利要求4所述的方法，其中，所述方法还包括：
    接收所述终端发送的路径删除指示信息，根据所述路径删除指示信息生成线路删除控制信息；
    将所述线路删除控制信息发送至所述路径删除指示信息对应的运输路径对应的运输终端。
  6. 一种分流路径生成装置，包括：
    第一路径选取单元，被配置成根据每条运输路径的历史货量的波动参数，从运输路径集合中选取波动参数小于预设阈值的运输路径，得到运输路径子集；
    第二路径选取单元，被配置成根据每条运输路径的装载率，从所述运输路径子集中选取装载率小于预设装载率阈值的运输路径作为目标运输路径，得到目标运输路径集合；
    第一生成单元，被配置成对于每个目标运输路径对应的配载集合中的每个配载，生成所述配载的候选路径集；
    第二生成单元，被配置成根据每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
  7. 根据权利要求6所述的装置，其中，所述第一生成单元进一步被配置成：
    基于所述配载对应的运输起始节点和目标节点，在预设的各个运输路径所组成的图中进行路径搜索，得到备选路径集；
    基于所述配载对应的约束条件组，从所述备选路径集中筛选符合 所述约束条件组的路径，得到所述候选路径集。
  8. 根据权利要求6或7所述的装置，其中，所述装置还包括：
    配载选取单元，被配置成根据每个配载对应的载货量，从所述目标运输路径对应的配载集合中选取载货量符合预设条件的配载，得到目标配载集合；以及所述第二生成单元进一步被配置成：
    根据所述目标配载集合中每个配载对应的候选路径集、每个候选路径的可用配载余量和分流路径个数，生成每个配载对应的分流路径。
  9. 一种电子设备，包括：
    至少一个处理器；
    存储装置，其上存储有至少一个程序，
    当所述至少一个程序被所述至少一个处理器执行，使得所述至少一个处理器实现如权利要求1-5中任一所述的方法。
  10. 一种计算机可读介质，其上存储有计算机程序，其中，所述程序被处理器执行时实现如权利要求1-5中任一所述的方法。
PCT/CN2022/118737 2021-12-27 2022-09-14 分流路径生成方法、装置、电子设备和计算机可读介质 WO2023124239A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111608072.0A CN113988720B (zh) 2021-12-27 2021-12-27 分流路径生成方法、装置、电子设备和计算机可读介质
CN202111608072.0 2021-12-27

Publications (1)

Publication Number Publication Date
WO2023124239A1 true WO2023124239A1 (zh) 2023-07-06

Family

ID=79734469

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/118737 WO2023124239A1 (zh) 2021-12-27 2022-09-14 分流路径生成方法、装置、电子设备和计算机可读介质

Country Status (2)

Country Link
CN (1) CN113988720B (zh)
WO (1) WO2023124239A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113988720B (zh) * 2021-12-27 2022-06-07 北京京东振世信息技术有限公司 分流路径生成方法、装置、电子设备和计算机可读介质
CN115660244B (zh) * 2022-12-27 2023-09-01 北京京东振世信息技术有限公司 路线信息生成方法、装置、设备和介质
CN116911724A (zh) * 2023-03-21 2023-10-20 中国兵器科学研究院 一种确定运输路径的方法、装置及设备

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109902987A (zh) * 2018-02-06 2019-06-18 华为技术有限公司 确定运输方案的方法、训练快速装载模型的方法及设备
CN110503528A (zh) * 2019-08-28 2019-11-26 江苏满运软件科技有限公司 一种线路推荐方法、装置、设备和存储介质
CN111553626A (zh) * 2020-04-09 2020-08-18 北京顺达同行科技有限公司 一种路径规划方法、装置、电子设备及其存储介质
US20200327497A1 (en) * 2019-04-11 2020-10-15 Federal Express Corporation System and method for linehaul optimization
CN113988720A (zh) * 2021-12-27 2022-01-28 北京京东振世信息技术有限公司 分流路径生成方法、装置、电子设备和计算机可读介质

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111832783B (zh) * 2019-04-19 2023-03-31 顺丰科技有限公司 全货机联程转板预警及决策方法及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109902987A (zh) * 2018-02-06 2019-06-18 华为技术有限公司 确定运输方案的方法、训练快速装载模型的方法及设备
US20200327497A1 (en) * 2019-04-11 2020-10-15 Federal Express Corporation System and method for linehaul optimization
CN110503528A (zh) * 2019-08-28 2019-11-26 江苏满运软件科技有限公司 一种线路推荐方法、装置、设备和存储介质
CN111553626A (zh) * 2020-04-09 2020-08-18 北京顺达同行科技有限公司 一种路径规划方法、装置、电子设备及其存储介质
CN113988720A (zh) * 2021-12-27 2022-01-28 北京京东振世信息技术有限公司 分流路径生成方法、装置、电子设备和计算机可读介质

Also Published As

Publication number Publication date
CN113988720A (zh) 2022-01-28
CN113988720B (zh) 2022-06-07

Similar Documents

Publication Publication Date Title
WO2023124239A1 (zh) 分流路径生成方法、装置、电子设备和计算机可读介质
CN111291103B (zh) 接口数据的解析方法、装置、电子设备及存储介质
US9207090B2 (en) System and method for dynamic path optimization
WO2022007855A1 (zh) 一种引用文档的更新方法、装置、电子设备及存储介质
CN111950857A (zh) 基于业务指标的指标体系管理方法、装置以及电子设备
CN114240001A (zh) 物流路由网络确定方法和装置
CN110852720A (zh) 文档的处理方法、装置、设备及存储介质
CN111241137A (zh) 数据处理方法、装置、电子设备及存储介质
CN112365109B (zh) 配送路径信息生成方法、装置、电子设备和可读介质
CN115660244B (zh) 路线信息生成方法、装置、设备和介质
CN115102992B (zh) 数据发布方法、装置、电子设备和计算机可读介质
CN112507676B (zh) 能源报表生成方法、装置、电子设备和计算机可读介质
CN113064905B (zh) 业务流程处理方法、装置、电子设备和计算机可读介质
CN113485890B (zh) 航班查询系统业务监控方法、装置、设备及存储介质
CN109029476A (zh) 一种用于确定可达区域的方法和装置
CN114298720A (zh) 一种跨航空公司的旅客保护方法及相关设备
CN115604191A (zh) 业务流量控制方法、装置、电子设备及可读存储介质
CN116703263B (zh) 电力设备配送方法、装置、电子设备和计算机可读介质
CN113393288A (zh) 订单处理信息生成方法、装置、设备和计算机可读介质
CN111950238A (zh) 自动驾驶故障评分表生成方法、装置、电子设备
CN116541421B (zh) 地址查询信息生成方法、装置、电子设备与计算机介质
CN116402432B (zh) 路由规划方法、装置、设备及存储介质
CN111314457B (zh) 设置虚拟私有云的方法和装置
CN113077352B (zh) 基于用户信息和保险相关信息的保险服务物品推荐方法
CN117692672B (zh) 基于快照的视频信息发送方法、装置、电子设备和介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22913508

Country of ref document: EP

Kind code of ref document: A1