WO2022156392A1 - 物料输送方法、设备、系统以及存储介质 - Google Patents

物料输送方法、设备、系统以及存储介质 Download PDF

Info

Publication number
WO2022156392A1
WO2022156392A1 PCT/CN2021/135852 CN2021135852W WO2022156392A1 WO 2022156392 A1 WO2022156392 A1 WO 2022156392A1 CN 2021135852 W CN2021135852 W CN 2021135852W WO 2022156392 A1 WO2022156392 A1 WO 2022156392A1
Authority
WO
WIPO (PCT)
Prior art keywords
cost
alternative
warehouse
user node
conveying
Prior art date
Application number
PCT/CN2021/135852
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 北京京东振世信息技术有限公司
Priority to EP21920766.9A priority Critical patent/EP4156051A4/en
Priority to JP2022579961A priority patent/JP7512447B2/ja
Priority to US18/044,557 priority patent/US20230351321A1/en
Publication of WO2022156392A1 publication Critical patent/WO2022156392A1/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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • 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/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • 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/06311—Scheduling, planning or task assignment for a person or group
    • 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0834—Choice of carriers
    • G06Q10/08345—Pricing
    • 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
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders

Definitions

  • the present application relates to the field of logistics technology, and in particular, to a material conveying method, device, system and storage medium.
  • the following processes are generally required: purchase from the supplier and then enter the central warehouse, replenish the goods from the central warehouse to the regional warehouse, and then transfer the goods from the regional warehouse to the front warehouse, and then Transfer from the front warehouse to the store, after the customer places an order, select the store closest to the customer, and deliver the goods from the store.
  • the supply chain under the new retail model is: source node ⁇ regional warehouse ⁇ store ⁇ user node. After customers place an order, they can choose the nearest store to provide materials to the user node, or they can choose the nearest regional warehouse to directly provide materials to the user node. This combination of regional warehouses and stores constitutes a new retail supply system.
  • the embodiments of the present application provide a material conveying method, device, system, and storage medium, which aim to accurately provide a storage path planning scheme, so as to generate a conveying instruction for conveying materials in a user order according to the storage path planning, thereby reducing conveying costs and improving conveyance. Effective.
  • an embodiment of the present application provides a material conveying method, which is applied to a server, and the method includes:
  • a target conveying route is determined from a plurality of alternative conveying routes according to a route planning model; wherein, the alternative conveying route refers to a route from a source node to a user node via at least one alternative warehouse;
  • the conveying instruction is sent to the conveying device, so that the conveying device conveys the material from the source node to the user node via the target conveying path.
  • the present application provides a server, including: a memory and a processor;
  • memory for storing processor-executable instructions
  • the processor is configured to implement the material conveying method involved in the first aspect and the optional solution.
  • the present application provides a material conveying system, including a conveying device and the server involved in the second aspect.
  • the present application provides a computer-readable storage medium, where computer-executable instructions are stored in the computer-readable storage medium, and when the computer-executable instructions are executed by a processor, are used to implement the material transportation involved in the first aspect and the optional solution. method.
  • the present application provides a computer program product, including a computer program/instruction, when the computer program/instruction is executed by a processor, the material conveying method involved in the first aspect and the optional solution is implemented.
  • the embodiments of the present application provide a material conveying method, device, system, and storage medium, wherein a target conveying route is determined from multiple alternative conveying routes according to a route planning model, and then conveying instructions are generated according to the target conveying route and user order information, so that the control
  • the conveying equipment can convey the material from the source node to the user node through the target conveying route, so as to realize the material route planning and material transportation control.
  • the optimization objectives are the conveying cost and conveying timeliness, the obtained target conveying path can ensure the lowest conveying cost and the fastest conveying time, so that the conveying equipment can be controlled according to the obtained target conveying path.
  • this solution can be adapted to the construction of the transmission network of any series, and is suitable for the construction of the transmission network under the traditional e-commerce sales mode, as well as the construction of the transmission network under the new retail mode.
  • FIG. 1 is a schematic diagram of an applicable scenario of a material conveying method provided by an embodiment of the present application
  • FIG. 2 is a schematic diagram of an applicable scenario of the material conveying method provided by an embodiment of the present application.
  • FIG. 3 is a schematic structural diagram of a material conveying system provided by an embodiment of the present application.
  • FIG. 4 is a schematic flowchart of a material conveying method provided by another embodiment of the present application.
  • FIG. 5 is a schematic structural diagram of a server provided by another embodiment of the present application.
  • the delivery network includes central warehouses, regional warehouses, and front-end warehouses.
  • the conveying process is as follows: purchasing materials from suppliers and sending them to the central warehouse, transporting the materials from the central warehouse to the regional warehouse, transferring the materials from the regional warehouse to the front warehouse, and then transferring the materials from the front warehouse to the regional warehouse.
  • Store, after placing an order, the user will select the store closest to the customer to deliver the materials.
  • the transportation network under the new retail includes regional warehouses and stores.
  • the conveying process is as follows: purchasing materials from suppliers, sending the materials to the regional warehouse, and transporting the materials from the regional warehouse to the store. After the customer places an order, it can be shipped at the nearest store. If the store inventory cannot be delivered, the regional warehouse can directly arrange the delivery as a supplement.
  • the regional warehouse and store model constitute the supply system of new retail.
  • the planning of the transmission network is crucial. After the conveying network layout is determined, the conveying instructions for delivering the materials in the user's order can be generated according to the conveying network. A reasonable conveying network layout can improve transportation efficiency and save costs.
  • One of the existing technologies is to use the weighted scoring method to realize the location selection of the conveying bins.
  • Another prior art is the center of gravity method. Specifically, aiming at the total transportation cost, find the address with the lowest total transportation cost among the upstream and downstream nodes as the new warehouse address, and various distance modes can be used.
  • the disadvantage of this scheme is the location of the center of gravity between multiple warehouses, and the location of the location may usually fall into lakes and rivers.
  • embodiments of the present application provide a material conveying method, device, system, and storage medium.
  • the purpose of this application is to provide a solution for determining a multi-stage conveying network with the lowest conveying cost and the highest conveying efficiency, so that the conveying instruction for controlling the conveying equipment to convey materials can be determined according to the multi-stage conveying network and the user's order information.
  • this solution can be adapted to the planning of any series of transmission networks, and is suitable for the construction of transmission networks under the traditional e-commerce sales mode, as well as for the construction of transmission networks under the new retail mode, with a wider scope.
  • a delivery system provided by an embodiment of the present application includes a server 101 and a delivery device 102 .
  • the server 101 is configured to determine a target conveyance route from multiple alternative conveyance routes according to a route planning model, and generate a conveyance instruction to determine a conveyance instruction according to the target conveyance route and user order information.
  • the conveying device 102 is configured to receive and analyze the conveying instruction, and according to the analysis result, convey the material from the source node to the user node through at least one alternative warehouse.
  • FIG. 4 another embodiment of the present application provides a material conveying method.
  • the method applies the above-mentioned conveying system, and the method includes the following steps:
  • the server determines a target conveying route from multiple alternative conveying routes according to a route planning model.
  • the alternative conveying route refers to a route from a certain source node to a certain user node via at least one alternative warehouse.
  • the route planning model is used to calculate the transportation cost for each alternative transportation route. Solve the route planning model to obtain the alternative transportation route with the lowest transportation cost from a certain source node to a certain user node, and take the obtained alternative transportation route with the lowest transportation cost as the route from a certain source node to a certain node.
  • the delivery cost may be a monetary cost, or an aging cost, or a combination of the monetary cost and the aging cost.
  • the server generates a delivery instruction according to the target delivery route and the user order information.
  • the user node and material information in the user order information are obtained, at least one target source node is determined according to the material information, the target conveying path between each target source node and the user node is obtained, and the final conveying path is selected from multiple target conveying paths.
  • the conveying path is generated, and the material conveying instruction is generated according to the final conveying path.
  • source A there are 2 source nodes, which are marked as source node A (hereinafter referred to as: source A) and source node B (hereinafter referred to as source B), and there are 3 user nodes, which are marked as user node A ( Hereinafter referred to as: node A), user node B (hereinafter referred to as node B), user node C (hereinafter referred to as node C), 6 target conveying paths can be obtained in S201, which are source A through at least one alternative warehouse in sequence
  • source A passes through at least one alternative warehouse to node C
  • source A passes through at least one alternative warehouse to node B
  • source B passes through at least one alternative warehouse to node A
  • source B passes through at least one alternative warehouse.
  • the warehouse is selected to node B, and the source B passes through at least one alternative warehouse to node C.
  • Source A has goods I and II
  • source B has goods III
  • node A needs cargo I
  • only source A can supply to node A
  • a delivery instruction is generated according to the target transmission path from source A to node A.
  • the server sends a conveying instruction to the conveying device.
  • the conveying device conveys the material from the source node to the user node through the target conveying path according to the conveying instruction.
  • the conveying equipment After the conveying equipment receives the conveying instruction, it parses the conveying instruction to obtain the material conveying path, and the conveying equipment conveys the material from the source node to the user node according to the target conveying path.
  • the server determines a target conveying route from multiple alternative conveying routes according to a route planning model, and when processing a user order, at least one source node can be determined according to the material information required by the user,
  • the final conveying route is determined from the target conveying route between each source node and the user node, so as to generate conveying instructions according to the final conveying route, so as to convey materials at the lowest cost.
  • Another embodiment of the present application provides a material conveying method, the method applies the above conveying system, and the method includes the following steps:
  • the server determines a target conveying route from multiple alternative conveying routes according to a route planning model.
  • the path planning model is an integer linear programming model, and the path planning model includes an objective function and a constraint set.
  • the objective function includes delivery cost and delivery time.
  • Conveying cost refers to the monetary cost of conveying materials using alternative conveying paths
  • conveying timeliness refers to the aging cost of using alternative conveying paths to convey materials.
  • the transportation cost is obtained according to the path variable set and the transportation cost parameters of each candidate warehouse, and the transportation aging is obtained according to the path variable set and the transportation aging parameters of each candidate warehouse.
  • the path variable set includes first to fifth path variables.
  • the first path variable indicates whether a certain alternative warehouse is selected to transfer materials to another alternative warehouse
  • the second path variable indicates whether a certain source node provides materials to a certain alternative warehouse
  • the third The path variable indicates whether a certain alternative warehouse provides materials to a certain user node
  • the fourth path variable indicates whether a certain source node provides materials to a certain user node through at least one alternative warehouse
  • the fifth The path variable indicates whether to provide materials to the user node via multiple alternative bins.
  • the value combination of all the route variables in the route variable set can get all the optional alternative transportation routes when any source node conveys materials to any user node. That is to say, the objective function is to take the transportation cost and delivery time of the alternative transportation route as the target, and take the alternative transportation route between a certain source node and a certain user node obtained when the objective function is the smallest as the target transportation route.
  • the transportation cost includes the inventory cost of the alternative transportation route, the distribution cost of the alternative transportation route, and the allocation cost of the alternative transportation route.
  • the inventory cost refers to the inventory cost when the material is transported from the source node through the alternative transport path. Inventory costs are further divided into out-of-warehousing costs and in-warehousing costs.
  • In-warehousing costs refer to the in-warehousing costs from the source node to the last-level alternative warehouse in the alternative conveying path
  • out-warehousing costs include the The first delivery cost from the source node to the last-level alternative warehouse in the selected transportation path and the second delivery cost from the last-level alternative warehouse to the user node in the alternative transportation path outbound cost.
  • the order of magnitude of the materials transported between the alternative warehouses is much larger than the order of magnitude of the materials transported each time from the last-level alternative warehouse to the user node.
  • the outbound cost between user nodes is calculated separately, which can improve the calculation accuracy.
  • the warehousing cost from the source node in the alternative conveying path to the last-level alternative warehouse is the total number of pieces of materials provided to the user node by the last-level alternative warehouse, and the single-piece entry of the source node.
  • the warehouse cost, the single item storage cost of the alternative warehouse, the first path variable, the second path variable, the third path variable and the fourth path variable are determined.
  • the first delivery cost from the source node to the last-level alternative warehouse in the alternative conveying path is based on the total volume of materials provided to the user node by the last-level alternative warehouse and the output per unit volume of the source node.
  • the warehouse cost, the unit volume delivery cost of the alternative warehouse, the first path variable, the second path variable, the third path variable and the fifth path variable are determined.
  • the second delivery cost from the last-level alternative warehouse in the alternative conveying path to the user node includes the basic delivery cost and the additional delivery cost.
  • the basic delivery cost is based on the delivery cost of the first order from the last-level alternative warehouse, the continued part delivery cost of the last-level alternative warehouse, the total number of pieces of materials provided to the user node by the last-level alternative warehouse, and the user's order. number, the third path variable, and the fifth path variable.
  • the additional delivery cost is based on the single-piece delivery cost of the last and alternate warehouses, the unit volume delivery cost of the last-level alternative warehouse, the total number of pieces of materials provided to the user node by the last-level alternative warehouse, and the last-level spare warehouse.
  • the bin selection provides the user node with the total volume of the material, the third path variable and the fifth path variable.
  • the delivery cost is the delivery cost from the last-level alternative warehouse to the user node, and the delivery cost is based on the number of user orders, the total weight of the materials required by the user, the delivery cost of the first order from the last-level alternative warehouse to the user node, and the final delivery cost. It is determined by the re-delivery cost of the secondary alternative warehouse to the user node, the third path variable and the fifth path variable.
  • the transfer cost refers to the cost of providing materials to the user node from other sources of supply.
  • the allocation cost can be calculated only based on the total mass of the allocated materials, that is, the allocation cost of each alternative transportation path is based on the total quality of the materials provided to the user node by the last-level alternative warehouse and the source of the goods.
  • the single-piece allocation cost of the node, the single-piece allocation cost of the alternative warehouse, the first path variable, the second path variable, the third path variable, and the fourth path variable are determined.
  • the allocation cost of each alternative conveying route is the total volume of materials provided to the user node from the last-level alternative warehouse, the allocation cost of a single piece of the source node, the allocation cost of a single piece of the alternative warehouse, and the first path variable , the second path variable, the third path variable and the fourth path variable.
  • the transfer cost can be calculated only based on the total volume and total mass of the transferred material.
  • the allocation cost of each alternative conveying route is based on the total volume of materials provided to the user node by the last-level alternative warehouse, the total mass of materials provided by the last-level alternative warehouse to the user node, and the order of the source node. It is determined by the item allocation cost, the single item allocation cost of the alternative warehouse, the first path variable, the second path variable, the third path variable and the fourth path variable.
  • the constraint set includes a first constraint for constraining the source node to supply materials to at least one alternative warehouse, a second constraint for constraining only one user node to receive materials from only one alternative warehouse, and a second constraint for constraining one source node and
  • the third constraint is that there is only one delivery route between a customer node, the fourth constraint is used to constrain the total number of alternative bins selected to transport materials, and the fifth constraint is used to constrain the aging of the alternative conveying route.
  • the transportation aging is determined according to the fifth path variable and the transportation aging parameters of the last-level alternative bin.
  • the above-mentioned model can be solved according to the existing solution method to obtain the value of each route variable, and then the target transportation route between a certain source node and a certain user node can be determined.
  • S302 The server generates a delivery instruction according to the target delivery route and the user order information.
  • the server sends a conveying instruction to the conveying device.
  • the conveying device conveys the material from the source node to the user node through the target conveying path according to the conveying instruction.
  • the conveying equipment After the conveying equipment receives the conveying instruction, it parses the conveying instruction to obtain the material conveying path, and the conveying equipment conveys the material from the source node to the user node according to the conveying path.
  • a target conveying path can be determined from a plurality of alternative conveying paths according to the model, and then a target conveying path can be selected for transferring materials from one of the The transportation path from the source of goods to the node of a user, and can ensure the fastest actual effect of material transportation and the lowest transportation cost.
  • Another embodiment of the present application provides a material conveying method, the method applies the above conveying system, and the method includes the following steps:
  • the server determines a target conveying route from multiple alternative conveying routes according to a route planning model.
  • f represents the objective function
  • min( ) represents the calculated minimum value
  • w 1 represents the cost weight
  • C * represents the transportation cost
  • C b represents the cost reference value
  • w 2 represents the aging weight
  • T * represents the transportation aging
  • T b represents the Aging benchmark value.
  • w 1 , C b , w 2 , T b can be obtained through a heuristic algorithm, that is, assign values to w 1 , C b , w 2 , and T b based on experience, and then obtain the optimal value through continuous optimization.
  • the transportation cost is calculated according to the following formula:
  • CW represents the inventory cost
  • CD represents the distribution cost
  • CT represents the allocation cost
  • Inventory cost is calculated according to the following formula:
  • C W1 represents the storage cost from the source node to the last-level alternative warehouse in the alternative transportation path
  • C W2 represents the first outbound cost from the source node to the last-level alternative warehouse in the alternative transportation path Cost
  • C W3 represents the second outbound cost from the last-level alternative warehouse in the alternative conveying path to the user node.
  • d Indicates the identification of the user node, 1 ⁇ d ⁇ m, m indicates the total number of user nodes, o indicates the identification of the source node, 1 ⁇ o ⁇ p, p indicates the total number of source nodes, Represents the single-piece storage cost of the o-th source node, is the second path variable, indicating whether the o-th source node provides materials for the i - th alternative warehouse, Represents the single-piece storage cost of the i- 1st alternative warehouse, represents the single-piece storage cost of the j 1st alternative warehouse, is the first path variable, indicating
  • the j lth alternative warehouse provides the total number of pieces of materials to the dth user node, i 1 , i 2 , ..., i l-1 and i l respectively represent the l values of i, 1 ⁇ i 1 , i 2 , . _ _ _ _ _ _ _ _ -1 , j l ⁇ l.
  • ⁇ represents the foaming coefficient
  • the distribution cost is calculated according to the following formula:
  • the transfer cost can be obtained in the following three ways:
  • ⁇ is a preset threshold, and ⁇ is obtained according to actual needs.
  • the allocation cost can be calculated only based on the total mass of the allocated materials, and the specific calculation is based on the following formula:
  • the transfer cost can be calculated only based on the total volume of the transferred materials. Specifically, it is calculated according to the following formula:
  • the allocation cost can also be calculated only based on the total volume and total mass of the allocated materials, which can be calculated according to the following formula:
  • B represents the adjustment coefficient between mass and volume, and B is obtained according to actual needs.
  • Equation (14) The third constraint is expressed by Equation (14) to Equation (19):
  • N min the candidate bin
  • N max the maximum number of candidate bins
  • the values of the first path variable to the fifth path variable are all 0 or 1. If a path variable represents 0, it means that the path is not selected, and if a path variable is 1, it means that the path If the path is selected, it can be determined whether the alternative bin is selected according to all path variables. That is to say, there is a path passing through the alternative bin, and the bin is selected.
  • the above-mentioned model can be solved according to a solution method in the prior art, such as a conventional shaping linear solution method.
  • the server generates a delivery instruction according to the delivery path of the delivery bin and the user order information.
  • the server sends a conveying instruction to the conveying device.
  • the conveying device conveys the material from the source node to the user node through the multi-level conveying network according to the conveying instruction.
  • a target conveying path can be determined from a plurality of alternative conveying paths according to the model, and then a target conveying path can be determined according to the target conveying path for transferring materials from one of the The transportation path from the source of goods to the node of a user, and can ensure the fastest actual effect of material transportation and the lowest transportation cost.
  • a server 500 provided by another embodiment of the present application includes: a transmitter 501 , a receiver 502 , a memory 503 , and a processor 502 .
  • a transmitter 501 used for sending instructions and data
  • a receiver 502 for receiving instructions and data
  • a memory 503 for storing computer-executed instructions
  • the processor 504 is configured to execute the computer-executed instructions stored in the memory, so as to implement each step performed by the material conveying method in the above-mentioned embodiment.
  • the processor 504 is configured to execute the computer-executed instructions stored in the memory, so as to implement each step performed by the material conveying method in the above-mentioned embodiment.
  • the above-mentioned memory 503 may be independent or integrated with the processor 504 .
  • the processing device further includes a bus for connecting the memory 503 and the processor 504 .
  • Embodiments of the present application further provide a computer-readable storage medium, where computer-executable instructions are stored in the computer-readable storage medium, and when the processor executes the computer-executable instructions, the material conveying method performed by the above processing device is implemented.
  • Embodiments of the present application further provide a computer program product, including computer programs/instructions, when the computer program/instructions are executed by a processor, the material conveying methods described in the foregoing embodiments are implemented.

Landscapes

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

Abstract

一种物料输送方法、设备、系统以及存储介质，具体包括：先根据路径规划模型从多个备选输送路径，再根据目标输送路径以及用户订单信息生成输送指令，最后向输送设备发送输送指令，以使输送设备将物料从货源地节点经过目标输送路径输送至用户节点，其中，备选输送路径是指货源地节点经由至少一个备选仓至用户节点的路径，本方法可以实现仓储路径规划以及物料运输控制。

Description

物料输送方法、设备、系统以及存储介质
本申请要求于2021年01月21日提交中国专利局、申请号为202110083056.8、申请名称为“物料输送方法、设备、系统以及存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及物流技术领域，尤其涉及一种物料输送方法、设备、系统以及存储介质。
背景技术
传统电商供应商的商品要送达客户手中，一般需要如下流程：从供应商采购后入中央库房，从中央库房补货商品到区域库房，再从区域库房将商品调拨到前置仓，再从前置仓调拨至门店，客户下单后选择距离客户最近的门店，从门店将商品发出。
在新零售模式下，为了更快的响应客户需求，缩短供应链，通过撤销中央库房，直接将门店设置为前置仓模式实现快速响应。新零售模式下的供应链路为：货源地节点→区域仓→门店→用户节点。客户下单后，可选择最近的门店向用户节点提供物料，也可以选择最近的区域仓直接向用户节点提供物料。这种区域仓和门店结合构成新零售的供应体系。
针对存在区域仓直接向用户节点提供物料和门店向用户节点提供物料的供应体系，亟待提供一种优化供应体系内物料传输路径的方案。
发明内容
本申请实施例提供一种物料输送方法、设备、系统以及存储介质，旨在准确提供仓储路径规划方案，以根据仓储路径规划生成用于运输用户订单中物料的输送指令，减少输送成本并提高输送实效。
第一方面，本申请实施例提供一种物料输送方法，应用于服务器，方法包括：
根据路径规划模型从多个备选输送路径中确定目标输送路径；其中，所述备选输送路径是指货源地节点经由至少一个备选仓至用户节点的路径；
根据所述目标输送路径以及用户订单信息生成输送指令；
向输送设备发送所述输送指令，以使所述输送设备将物料从所述货源地节点经由目标输送路径输送至所述用户节点。
第二方面，本申请提供一种服务器，包括：存储器，处理器；
存储器；用于存储处理器可执行指令的存储器；
其中，处理器被配置为实现第一方面及可选方案所涉及的物料输送方法。
第三方面，本申请提供一种物料输送系统，包括输送设备和第二方面所涉及的服务器。
第四方面，本申请提供一种计算机可读存储介质，计算机可读存储介质中存储有计算机执行指令，计算机执行指令被处理器执行时用于实现第一方面及可选方案所涉及的物料输送方法。
第五方面，本申请提供一种计算机程序产品，包括计算机程序/指令，该计算机程序/指令被处理器执行时实现第一方面及可选方案所涉及的物料输送方法。
本申请实施例提供一种物料输送方法、设备、系统以及存储介质，根据路径规划模型从多个备选输送路径确定目标输送路径，再根据目标输送路径以及用户订单信息生成输送指令，以使控制输送设备可以将物料从货源地节点经过目标输送路径输送至用户节点，以实现物料路径规划以及物料运输控制。由于在确定目标输送路径时，是以输送成本和输送时效为优化目标，所获得的目标输送路径能够保证输送成本最低，且输送时效最快，进而使得在根据所获得的目标输送路径控制输送设备运输料时，能够保证以最低成本以及最快时效运输将货物运输至用户节点。且本方案可以适应任意级数的输送网络构建，适用对传统电商销售模式下的输送网络构建，也适用于新零售模式下的输送网络构建。
附图说明
图1为本申请一实施例提供的物料输送方法的适用场景的示意图；
图2为本申请一实施例提供的物料输送方法的适用场景的示意图；
图3为本申请一实施例提供的物料输送系统的结构示意图；
图4为本申请另一实施例提供的物料输送方法的流程示意图；
图5为本申请另一实施例提供的服务器的结构示意图。
具体实施方式
为使本申请的目的、技术方案和优点更加清楚，下面将结合本申请中的附图，对本申请中的技术方案进行清楚、完整地描述，显然，所描述的实施例是本申请一部分实施例，而不是全部的实施例。基于本申请中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的其他实施例，都属于本申请保护的范围。
如图1所示，传统电商销售模式下，输送网络包括中央库房、区域库房以及前置仓。输送过程具体为：采购供应商的物料，并将物料送入中央库房，在从中央库房将物料运输至到区域库房，再从区域库房将物料调拨到前置仓，再从前置仓调拨到门店，用户下单后将选择距离客户最近的门店将物料发出。
如图2所示，在新零售模式下，为了更快的响应客户需求，缩短供应链，通过撤销中央库房，直接将门店设置为前置仓，以实现快速响应。新零售下输送网络包括区域库房和门店。输送过程具体为：采购供应商的物料，并将物料送入区域库房，在从区域库房将物料运输至到门店。客户下单后，可在最近的门店就近出货，若门店库存无法输送，可由区域库房直接安排发货，作为补充。区域库房和门店模式构成新零售的供应体系。
对输送网络的规划至关重要。在确定输送网络布局后，可根据输送网络生成用于配送用户订单中物料的输送指令，合理的输送网络布局可以提高运输时效并节省成本。
其中一种现有技术是采用加权评分法实现输送仓选址。首先以满足安全要求、便捷原则和合法限制三个主要要求为原则选出备选仓。
针对安全要求，需要满足如下条件：1)无易燃易爆建筑；2)三防设施健全；3)地势等自然资源限制；4)给排水、消防、避雷等安全要求。针对便捷原则，需要满足如下条件：1)避开拥堵地区，2)附近出入便捷有主干道，尤其货车24小时自由出入等。针对合法限制，需要满足如下条件：1)合法的房屋产权证、土地证、企业营业执照、税务登记证等合法有效证件；2)与国家的用地性质相符等。
再列出备选仓库需要关注的多个指标，例如：租金、交通等，并为每个 指标打分，同时每指标设置对应权重，对指标进行加权分数求和获得每个备选仓的评估值，再选择评估值最大或者靠前的备选仓作为输送仓。本方案由于仅考虑仓库自身属性，并未考虑供应链上下游因素，无法保证仓库网络的输送成本最小。
另一种现有技术是重心法。具体是以总运输成本为目标，寻找到达上下游节点中总运输成本最低的地址作为新仓地址，可以采用各类距离模式。本方案缺点是多仓之间重心选址，通常可能出现选址位置落入湖泊、河流中。
为解决现有技术中的问题，本申请实施例提供一种物料输送方法、设备、系统以及存储介质。本申请旨在提供确定输送成本最小且输送效率最高的多级输送网络的方案，进而可以根据多级输送网络和用户的订单信息确定用于控制输送设备输送物料的输送指令。且本方案可以适应任意级数的输送网络的规划，适用对传统电商销售模式下的输送网络构建，也适用于新零售模式下的输送网络构建，范围更广。
如图3所示，本申请一实施例提供的输送系统包括服务器101和输送设备102。其中，服务器101用于根据路径规划模型从多个备选输送路径中确定目标输送路径，并根据所述目标输送路径以及用户订单信息生成输送指令确定输送指令。输送设备102用于接收并解析输送指令，并根据解析结果将物料从货源地节点经过至少一个备选仓输送至用户节点。
如图4所示，本申请另一实施例提供物料输送方法，该方法应用上述输送系统，该方法包括如下步骤：
S201、服务器根据路径规划模型从多个备选输送路径中确定目标输送路径。
其中，备选输送路径是指某一货源地节点经由至少一个备选仓至某一用户节点的路径。路径规划模型用于计算每个备选输送路径的输送成本。对路径规划模型进行求解获得从某一货源地节点到某一用户节点之间输送成本最低的备选输送路径，并将获得的输送成本最低的备选输送路径作为从某一货源地节点到某一用户节点之间的目标输送路径。
优选地，输送成本可以是金钱成本，还可以是时效成本，也可以是金钱成本和时效成本的结合。
S202、服务器根据目标输送路径以及用户订单信息生成输送指令。
其中，获取用户订单信息中用户节点以及物料信息，根据物料信息确定至少一个目标货源地节点，获取每个目标货源地节点到用户节点之间的目标输送路径，从多个目标输送路径中选择最终输送路径，并根据最终输送路径生成生成物料输送指令。
例如：货源地节点有2个，依次标记为货源地节点A(以下简称：货源地A)和货源地节点B(以下简称：货源地B)，用户节点有3，依次标记为用户节点甲(以下简称：节点甲)、用户节点乙(以下简称：节点乙)、用户节点丙(以下简称：节点丙)，S201中可以获得6条目标输送路径，依次为货源地A经过至少一个备选仓到节点甲，货源地A经过至少一个备选仓到节点丙，货源地A经过至少一个备选仓到节点乙，货源地B经过至少一个备选仓到节点甲，货源地B经过至少一个备选仓到节点乙，货源地B经过至少一个备选仓到节点丙。
货源地A有货物Ⅰ和Ⅱ，货源地B有货物Ⅲ，节点甲需要货物Ⅰ，则只有货源地A可以向节点甲供货，则根据货源地A到节点甲的目标传输路径生成输送指令。
S203、服务器向输送设备发送输送指令。
S204、输送设备根据输送指令将物料从货源地节点经过目标输送路径输送至用户节点。
其中，输送设备接收到输送指令后，解析输送指令得到物料输送路径，输送设备按照目标输送路径将物料从货源地节点输送至用户节点。
在本申请实施例提供的物料输送方法中，服务器根据路径规划模型从多个备选输送路径中确定目标输送路径，在处理用户订单时，可以根据用户所需物料信息确定至少一个货源地节点，从各个货源地节点到用户节点之间目标输送路径中确定最终输送路径，以根据最终输送路径生成输送指令，实现以最低成本输送物料。
本申请另一实施例提供一种物料输送方法，该方法应用上述输送系统，该方法包括如下步骤：
S301、服务器根据路径规划模型从多个备选输送路径中确定目标输送路径。
其中，路径规划模型是一个整型线性规划模型，路径规划模型包括目标函数和约束集。
目标函数包括输送成本和输送时效。输送成本是指利用备选输送路径输送物料时的金钱成本，输送时效是指利用备选输送路径输送物料时的时效成本。所述输送成本是根据路径变量集和各个备选仓的输送成本参数获得的，所述输送时效是根据所述路径变量集和各个备选仓的输送时效参数获得的。
路径变量集包括第一路径变量至第五路径变量。所述第一路径变量表示是否选中某个备选仓向另一备选仓传输物料，所述第二路径变量表示是否由某个货源地节点向某个备选仓提供物料，所述第三路径变量表示是否由某个备选仓向某个用户节点提供物料，所述第四路径变量表示是否由某个货源地节点经由至少一个备选仓向某个用户节点提供物料，所述第五路径变量表示是否经由多个备选仓向所述用户节点提供物料。
路径变量集中所有路径变量的取值组合可以得到任意一个货源地节点向任意一个用户节点输送物料时所有可选的备选输送路径。也就是目标函数是以备选输送路径的输送成本和输送时效为目标，将在目标函数最小时得到的某一货源地节点到某一用户节点之间的备选输送路径作为目标输送路径。
输送成本包括备选输送路径的库存成本、备选输送路径的配送成本以备选输送路径的及调拨成本。
库存成本是指在物料从货源地节点经由备选输送路径输送时的库存成本。库存成本又分为出库成本和入库成本，入库成本是指所述备选输送路径中从所述货源地节点至最后一级备选仓的入库成本，出库成本包括所述备选输送路径中从所述货源地节点至所述最后一级备选仓的第一出库成本以及所述备选输送路径中从所述最后一级备选仓至所述用户节点的第二出库成本。备选仓之间每次输送物料的数量级远大于最后一级备选仓至用户节点每次输送物料的数量级，将备选仓之间进行物料输送的出库成本和最后一级备选仓到用户节点之间的出库成本分开计算，可以提高计算准确度。
其中，从备选输送路径中货源地节点至最后一级备选仓之间的入库成本是根据最后一级备选仓向所述用户节点提供物料的总件数、货源地节点的单件入库成本、备选仓的单件入库成本、第一路径变量、第二路径变量、第三路径变量以及第四路径变量确定的。
备选输送路径中从货源地节点到最后一级备选仓之间的第一出库成本是根据最后一级备选仓向所述用户节点提供物料的总体积、货源地节点的单位体积出库成本、备选仓的单位体积出库成本、第一路径变量、第二路径变量、第三路径变量以及第五路径变量确定的。
备选输送路径中最后一级备选仓至用户节点的第二出库成本包括基本出库成本和额外出库成本。基本出库成本是根据最后一级备选仓的首单出库成本、最后一级备选仓的续件出库成本、最后一级备选仓向用户节点提供物料的总件数、用户的订单数量、第三路径变量以及第五路径变量确定的。额外出库成本是根据最后以及备选仓的单件出库成本、最后一级备选仓的单位体积出库成本、最后一级备选仓向用户节点提供物料的总件数、最后一级备选仓向用户节点提供物料的总体积、第三路径变量以及第五路径变量确定的。
其中，配送成本为最后一级备选仓至用户节点的配送成本，配送成本是根据用户订单数量、用户需求物料的总重量、最后一级备选仓至用户节点的首单配送成本、最后一级备选仓至用户节点的续重配送成本、第三路径变量以及第五路径变量确定的。
其中，调拨成本是指从其他货源地向用户节点提供物料时的成本。在计算调拨成本时，可以仅根据调拨物料的总质量计算调拨成本，也就是每个备选输送路径的调拨成本是根据所述最后一级备选仓向用户节点提供物料的总质量、货源地节点的单件调拨成本、备选仓的单件调拨成本、第一路径变量、第二路径变量、第三路径变量以及第四路径变量确定的。
在计算调拨成本时，可以仅根据调拨物料的总体积计算调拨成本。每个备选输送路径的调拨成本是根据所述最后一级备选仓向用户节点提供物料的总体积、货源地节点的单件调拨成本、备选仓的单件调拨成本以及第一路径变量、第二路径变量、第三路径变量以及第四路径变量确定的。
在计算调拨成本时，可以仅根据调拨物料的总体积和总质量共同计算调拨成本。每个备选输送路径的调拨成本是根据所述最后一级备选仓向用户节点提供物料的总体积、所述最后一级备选仓向用户节点提供物料的总质量、货源地节点的单件调拨成本、备选仓的单件调拨成本、第一路径变量、第二路径变量、第三路径变量以及第四路径变量确定的。
约束集包括用于约束货源地节点至少向一个备选仓提供物料的第一约束， 用于约束仅一个用户节点仅接收一个备选仓提供物料的第二约束，用于约束一个货源地节点和一个客户节点之间仅有一条配送路径的第三约束，用于约束被选中传输物料的备选仓的总数的第四约束，以及，用于约束备选输送路径的时效的第五约束。
输送时效是根据第五路径变量和最后一级备选仓的输送时效参数确定的。
在构建上述路径规划模型后，可以根据已有求解方法对上述模型进行求解，获得各个路径变量的取值，进而可以确定某个货源地节点到某个用户节点之间的目标输送路径。
S302、服务器根据目标输送路径以及用户订单信息生成输送指令。
其中，该步骤已经在上述实施例中详细说明，此处不再赘述。
S303、服务器向输送设备发送输送指令。
S304、输送设备根据输送指令将物料从货源地节点经过目标输送路径输送至用户节点。
其中，输送设备接收到输送指令后，解析输送指令得到物料输送路径，输送设备按照输送路径将物料从货源地节点输送至用户节点。
在本申请实施例提供的物料输送方法中，通过构建上述路径规划模型，可以根据该模型从多个备选输送路径中确定目标输送路径，进而可以从目标输送路径选择用于将物料从其中一货源地接节点运输至一用户节点的输送路径，且能够保证物料输送的实效最快，输送成本最小。
本申请另一实施例提供一种物料输送方法，该方法应用上述输送系统，该方法包括如下步骤：
S401、服务器根据路径规划模型从多个备选输送路径确定目标输送路径。
其中，构建如下公式所示的目标函数：
Figure PCTCN2021135852-appb-000001
其中，f表示目标函数，min(·)表示计算最小值，w 1表示成本权重，C *表示输送成本，C b表示成本基准值，w 2表示时效权重，T *表示输送时效，T b表示时效基准值。w 1，C b，w 2，T b可以通过启发式算法得到，也就是依据经验对w 1，C b，w 2，T b赋值，然后通过不断优化方式得到最优值。
输送成本根据如下公式计算获得：
C *＝C W+C D+C T     (2)
其中，C W表示库存成本，C D表示配送成本，C T表示调拨成本。
下面描述获得库存成本的过程。
库存成本根据如下公式计算获得：
C W＝C W1+C W2+C W3     (3)
其中，C W1表示备选输送路径中从货源地节点到最后一级备选仓的入库成本，C W2表示备选输送路径中从货源地节点到最后一级备选仓的第一出库成本，C W3表示备选输送路径中最后一级备选仓至用户节点的第二出库成本。
Figure PCTCN2021135852-appb-000002
其中，
Figure PCTCN2021135852-appb-000003
表示对j 1、j 2、……、j l-1和j l均求和，
Figure PCTCN2021135852-appb-000004
表示对i 1、i 2、……、i l-1和i l均求和，i和j均表示备选仓的标识，1≤i,j≤l，l表示备选仓的总数，d表示用户节点的标识，1≤d≤m，m表示用户节点的总数，o表示货源地节点的标识，1≤o≤p，p表示货源地节点的总数，
Figure PCTCN2021135852-appb-000005
表示第o个货源地节点的单件入库成本，
Figure PCTCN2021135852-appb-000006
为第二路径变量，表示第o个货源地节点是否给第i 1个备选仓提供物料，
Figure PCTCN2021135852-appb-000007
表示第i 1个备选仓的单件入库成本，
Figure PCTCN2021135852-appb-000008
表示第j 1个备选仓的单件入库成本，
Figure PCTCN2021135852-appb-000009
为第一路径变量，表示第i 1个备选仓是否向第j 1个备选仓提供物料，
Figure PCTCN2021135852-appb-000010
为第一路径变量，表示第j 1个备选仓是否向第i 2个备选仓提供物料，
Figure PCTCN2021135852-appb-000011
为第三路径变量，表示第j l个备选仓是否向第d用户节点提供物料，y do为第四路径变量，表示第o个货源地节点是否通过备选仓向第d个用户节点提供物料，
Figure PCTCN2021135852-appb-000012
表示第j l备选仓向第d个用户节点提供物料总件数，i 1、i 2、……、i l-1和i l分别表示i的l个取值，1≤i 1，i 2，…，i l-1，i l≤l，j 1、j 2、……、j l-1和j l分别表示j的l个取值，1≤j 1，j 2，…，j l-1，j l≤l。
Figure PCTCN2021135852-appb-000013
其中，
Figure PCTCN2021135852-appb-000014
表示第o个货源地节点的单位体积出库成本，
Figure PCTCN2021135852-appb-000015
表示第i 1个备选仓的单位体积出库成本，
Figure PCTCN2021135852-appb-000016
表示第j 1个备选仓的单位体积出库成本，
Figure PCTCN2021135852-appb-000017
为第三路径变量，表示第i l个备选仓是否向第d用户节点提供物料，
Figure PCTCN2021135852-appb-000018
为第五路径变量，表示第i l-1个备选仓是否经过其他备选仓向第d个用户节点提供物料，
Figure PCTCN2021135852-appb-000019
表示第i l-1个备选仓向第d个用户节点所提供物料的总体积，对于体积为0的物料的体积，根据公式
Figure PCTCN2021135852-appb-000020
计算物料总体积，γ表示发泡系数，
Figure PCTCN2021135852-appb-000021
表示第j l个备选仓向第d个用户节点提供物料的质量。
Figure PCTCN2021135852-appb-000022
其中，
Figure PCTCN2021135852-appb-000023
表示第j l个备选仓向第d个用户节点提供物料时首单出库成本，
Figure PCTCN2021135852-appb-000024
为第五路径变量，表示第j l-1个备选仓是否经过其他备选仓向第d个用户节点提供物料，
Figure PCTCN2021135852-appb-000025
为第三路径变量，表示第j l个备选仓是否向第d个用户节点提供物料，
Figure PCTCN2021135852-appb-000026
表示第j l个备选仓向第d个用户节点的提供物料的订单数量，
Figure PCTCN2021135852-appb-000027
第j l个备选仓向第d个用户节点提物料时的续件出库成本，
Figure PCTCN2021135852-appb-000028
表示第j l个备选仓向第d个用户节点提供物料的总件数，ρ d表示调节系数，
Figure PCTCN2021135852-appb-000029
表示第j l个备选仓向第d个用户节点提供物料时的单位体积出库成本，
Figure PCTCN2021135852-appb-000030
表示第j l个备选仓向第d个用户节点提供物料时的单件出库成本。
下面描述获得配送成本的过程，配送成本根据如下公式计算获得：
Figure PCTCN2021135852-appb-000031
其中，
Figure PCTCN2021135852-appb-000032
表示第j l个备选仓向第d个用户节点提供物料时首单配送成本，
Figure PCTCN2021135852-appb-000033
表示第j l个备选仓向第d个用户节点提供物料时续重配送成本，
Figure PCTCN2021135852-appb-000034
表示第j l个备选仓向第d个用户节点提供物料的总重量；对于重量为0的物料的重量，根据公式
Figure PCTCN2021135852-appb-000035
计算重量。
下面描述获得调拨成本的过程，可根据如下三种方式获得调拨成本：
(1)在计算调拨成本时，若满足如下条件：
Figure PCTCN2021135852-appb-000036
其中，α为预设阈值，α根据实际需要获得。
也就是当调拨高密度物料时，可以仅根据调拨物料的总质量计算调拨成本，具体根据如下公式计算：
Figure PCTCN2021135852-appb-000037
其中，
Figure PCTCN2021135852-appb-000038
表示第o个货源地节点向第i 1个备选仓调货的单件调拨成本，
Figure PCTCN2021135852-appb-000039
表示第i 1个备选仓向第j 1个备选仓调货的单件调拨成本，
Figure PCTCN2021135852-appb-000040
表示第j 1个备选仓向第i 2个备选仓调货的单件调拨成本,
Figure PCTCN2021135852-appb-000041
表示第j l个备选仓向第d个用户节点调货的单件调拨成本。
(2)在计算调拨成本时，若满足如下条件：
Figure PCTCN2021135852-appb-000042
也就是当调拨低密度物料时，可以仅根据调拨物料的总体积计算调拨成本。具体根据如下公式计算获得：
Figure PCTCN2021135852-appb-000043
(3)在计算调拨成本时，还可以仅根据调拨物料的总体积和总质量共同计算调拨成本，具体根据如下公式计算获得：
Figure PCTCN2021135852-appb-000044
其中，B表示质量和体积之间的调整系数，B根据实际需要获得。
根据如下公式计算配送时效：
Figure PCTCN2021135852-appb-000045
Figure PCTCN2021135852-appb-000046
表示第j l个备选仓向第d个用户节点提供物料时的实效参数。
下面描述约束集，约束集有公式(12)至(21)组成。
第一约束用公式(12)表示：
Figure PCTCN2021135852-appb-000047
第二约束用公式(13)表示：
Figure PCTCN2021135852-appb-000048
第三约束用公式(14)至公式(19)表示：
Figure PCTCN2021135852-appb-000049
Figure PCTCN2021135852-appb-000050
Figure PCTCN2021135852-appb-000051
Figure PCTCN2021135852-appb-000052
Figure PCTCN2021135852-appb-000053
Figure PCTCN2021135852-appb-000054
第四约束用公式(20)表示：
Figure PCTCN2021135852-appb-000055
第五约束用公式(21)表示：
Figure PCTCN2021135852-appb-000056
其中，D＝{1，2，…m}，I＝{1，2，…l}；i u表示i的u个取值，j u表示j的u个取值，N min表示备选仓的最小数量，N max表示备选仓的最大数量，
Figure PCTCN2021135852-appb-000057
为第j l个备选仓向第d个用户节点提供物料的配送时效，β表示最小实效概率。
需要说明的是，第一路径变量至第五路径变量的取值均为0或者1，若 某个路径变量表示0，表示该条路径未被选中，若某个路径变量为1，则表示该路径被选中，则可以根据所有路径变量确定备选仓是否被选中。也就是有一条路径经过该备选仓，该备仓则被选中。
在构建上述模型后，可以根据现有技术的求解方式对上述模型求解，例如常规的整形线性求解方法求解。
S402、服务器根据输送仓的输送路径以及用户订单信息生成输送指令。
S403、服务器向输送设备发送输送指令。
S404、输送设备根据输送指令将物料从货源地节点经过多级输送网络输送至用户节点。
其中，在上述实施例中已经详细说明S302至S304，此处不再赘述。
在本申请实施例提供的物料输送方法中，通过构建上述路径规划模型，可以根据该模型从多个备选输送路径中确定目标输送路径，进而可以根据目标输送路径确定用于将物料从其中一货源地接节点运输至一用户节点的输送路径，且能够保证物料输送的实效最快，输送成本最小。
如图5所示，本申请另一实施例提供的服务器500包括：发送器501、接收器502、存储器503、及处理器502。
发送器501，用于发送指令和数据；
接收器502，用于接收指令和数据；
存储器503，用于存储计算机执行指令；
处理器504，用于执行存储器存储的计算机执行指令，以实现上述实施例中物料输送方法所执行的各个步骤。具体可以参见前述物料输送方法实施例中的相关描述。
可选地，上述存储器503既可以是独立的，也可以跟处理器504集成在一起。当存储器503独立设置时，该处理设备还包括总线，用于连接存储器503和处理器504。
本申请实施例还提供一种计算机可读存储介质，计算机可读存储介质中存储有计算机执行指令，当处理器执行计算机执行指令时，实现如上处理设备所执行的物料输送方法。
本申请实施例还提供一种计算机程序产品，包括计算机程序/指令，该计算机程序/指令被处理器执行时实现上述实施例描述的物料输送方法。
最后应说明的是：以上各实施例仅用以说明本申请的技术方案，而非对其限制；尽管参照前述各实施例对本申请进行了详细的说明，本领域的普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分或者全部技术特征进行等同替换；而这些修改或者替换，并不使相应技术方案的本质脱离本申请各实施例技术方案的范围。

Claims (16)

  1. 一种物料输送方法，其特征在于，应用于服务器，所述方法包括：
    根据路径规划模型从多个备选输送路径中确定目标输送路径；其中，所述备选输送路径是指货源地节点经由至少一个备选仓至用户节点的路径；
    根据所述目标输送路径以及用户订单信息生成输送指令；
    向输送设备发送所述输送指令，以使所述输送设备将物料从所述货源地节点经由目标输送路径输送至所述用户节点。
  2. 根据权利要求1所述的方法，其特征在于，所述路径规划模型包括目标函数，所述目标函数包括输送成本和输送时效；
    其中，所述输送成本是根据路径变量集和各个备选仓的输送成本参数获得的，所述输送时效是根据所述路径变量集和各个备选仓的输送时效参数获得的。
  3. 根据权利要求2所述的方法，其特征在于，所述输送成本包括备选输送路径的库存成本、所述备选输送路径的配送成本以及所述备选输送路径的调拨成本。
  4. 根据权利要求3所述的方法，其特征在于，所述备选输送路径的库存成本具体包括：
    所述备选输送路径中从所述货源地节点至最后一级备选仓的入库成本、所述备选输送路径中从所述货源地节点至所述最后一级备选仓的第一出库成本以及所述备选输送路径中从所述最后一级备选仓至所述用户节点的第二出库成本；
    其中，所述入库成本是根据最后一级备选仓向所述用户节点提供物料的总件数、所述货源地节点的单件入库成本、所述备选仓的单件入库成本、第一路径变量、第二路径变量、第三路径变量以及第四路径变量确定的；
    所述第一出库成本是根据所最后一级备选仓向所述用户节点提供物料的总体积、所述货源地节点的单位体积出库成本、所述备选仓的单位体积出库成本、所述第一路径变量、所述第二路径变量、所述第三路径变量以及第五路径变量确定的；
    其中，所述路径变量集包括所述第一路径变量至所述第五路径变量，所述第一路径变量表示是否选中某个备选仓向另一备选仓传输物料，所述第二 路径变量表示是否由某个货源地节点向某个备选仓提供物料，所述第三路径变量表示是否由某个备选仓向某个用户节点提供物料，所述第四路径变量表示是否由某个货源地节点经由至少一个备选仓向某个用户节点提供物料，所述第五路径变量表示是否经由多个备选仓向所述用户节点提供物料。
  5. 根据权利要求4所述的方法，其特征在于，所述第二出库成本包括基本出库成本和额外出库成本；
    其中，所述基本出库成本是根据所述最后一级备选仓的首单出库成本、所述最后一级备选仓的续件出库成本、所述最后一级备选仓向用户节点提供物料的总件数、用户的订单数量、所述第三路径变量以及所述第五路径变量确定的；
    所述额外出库成本是根据所述最后一级备选仓的单件出库成本、所述最后一级备选仓的单位体积出库成本、所述最后一级备选仓向用户节点提供物料的总件数、所述最后一级备选仓向用户节点提供物料的总体积、所述第三路径变量以及第五路径变量确定的。
  6. 根据权利要求3至5中任意一项所述的方法，其特征在于，所述配送成本是根据用户订单数量、用户需求物料的总重量、所述最后一级备选仓至所述用户节点的首单配送成本、所述最后一级备选仓至所述用户节点的续重配送成本、所述第三路径变量以及第五路径变量确定的。
  7. 根据权利要求3至5中任意一项所述的方法，其特征在于：
    所述调拨成本是根据所述最后一级备选仓向用户节点提供物料的总质量、所述货源地节点的单件调拨成本、所述备选仓的单件调拨成本、所述第一路径变量、所述第二路径变量、所述第三路径变量以及所述第四路径变量确定的；或者
    所述调拨成本是根据所述最后一级备选仓向用户节点提供物料的总体积、所述货源地节点的单件调拨成本、所述备选仓的单件调拨成本、所述第一路径变量、所述第二路径变量、所述第三路径变量以及所述第四路径变量确定的；或者
    所述调拨成本是根据所述最后一级备选仓向用户节点提供物料的总体积、所述最后一级备选仓向用户节点提供物料的总质量、所述货源地节点的单件调拨成本、所述备选仓的单件调拨成本、所述第一路径变量、所述第二路径 变量、所述第三路径变量以及所述第四路径变量确定的。
  8. 根据权利要求2至5中任意一项所述的方法，其特征在于，所述输送时效是根据第五路径变量和最后一级备选仓的输送时效参数确定的。
  9. 根据权利要求2至5中任意一项所述的方法，其特征在于，所述路径规划模型包括约束集；
    其中，所述约束集包括用于约束货源地节点至少向一个备选仓提供物料的第一约束，用于约束一个用户节点仅接收一个备选仓提供的物料的第二约束，用于约束一个货源地节点和一个客户节点之间仅有一条配送路径的第三约束，用于约束被选中传输物料的备选仓的总数的第四约束，以及，用于约束备选输送路径的时效的第五约束。
  10. 根据权利要求2至5中任意一项所述的方法，其特征在于，所述目标函数具体包括：
    Figure PCTCN2021135852-appb-100001
    其中，f表示目标函数，min(·)表示计算最小值，w 1表示成本权重，C *表示输送成本，C b表示成本基准值，w 2表示时效权重，T *表示输送时效，T b表示时效基准值；
    其中，根据第一公式计算输送所述输送成本，所述第一公式具体包括：
    C *＝C W+C D+C T
    C W表示所述库存成本，C D表示所述配送成本，C T表示调拨成本；
    其中，根据第二公式计算所述库存成本，所述第二公式具体包括：
    C W＝C W1+C W2+C W3
    C W1表示入库成本，C W2表示第一出库成本，C W3表示第二出库成本；
    其中，根据第三公式计算所述入库成本，所述第三公式具体包括：
    Figure PCTCN2021135852-appb-100002
    i和j均表示备选仓的标识，1≤i,j≤l，l表示备选仓的总数，d表示用户节点的标识，1≤d≤m，m表示用户节点的总数，o表示货源地节点的标识，1≤o≤p，p表示货源地节点的总数，
    Figure PCTCN2021135852-appb-100003
    表示第o个货源地节 点的单件入库成本，
    Figure PCTCN2021135852-appb-100004
    为所述第二路径变量，表示第o个货源地节点是否给第i 1个备选仓提供物料，
    Figure PCTCN2021135852-appb-100005
    表示第i 1个备选仓的单件入库成本，
    Figure PCTCN2021135852-appb-100006
    表示第j 1个备选仓的单件入库成本，
    Figure PCTCN2021135852-appb-100007
    为所述第一路径变量，表示第i 1个备选仓是否向第j 1个备选仓提供物料，
    Figure PCTCN2021135852-appb-100008
    表示第j 1个备选仓是否向第i 2个备选仓提供物料，
    Figure PCTCN2021135852-appb-100009
    为所述第三路径变量，表示第j l个备选仓是否向第d用户节点提供物料，y do为第四路径变量，表示第o个货源地节点是否通过备选仓向第d个用户节点提供物料，
    Figure PCTCN2021135852-appb-100010
    表示第j l备选仓向第d个用户节点提供物料总件数，i 1、i 2、……、i l-1和i l分别表示i的l个取值，j 1、j 2、……、j l-1和j l分别表示j的l个取值；
    其中，根据第四公式计算第一出库成本，所述第四公式具体包括：
    Figure PCTCN2021135852-appb-100011
    Figure PCTCN2021135852-appb-100012
    表示第o个货源地节点的单位体积出库成本，
    Figure PCTCN2021135852-appb-100013
    表示第i 1个备选仓的单位体积出库成本，
    Figure PCTCN2021135852-appb-100014
    表示第j 1个备选仓的单位体积出库成本，
    Figure PCTCN2021135852-appb-100015
    为所述第三路径变量，表示第j 1个备选仓是向第d用户节点提供物料，
    Figure PCTCN2021135852-appb-100016
    为第五路径变量，表示第i l-1个备选仓是否经由其他备选仓向第d个用户节点提供物料，
    Figure PCTCN2021135852-appb-100017
    表示第i l-1个备选仓向第d个用户节点所提供物料的总体积；
    其中，根据第五公式计算第二出库成本，所述第五公式具体包括：
    Figure PCTCN2021135852-appb-100018
    Figure PCTCN2021135852-appb-100019
    表示第j l个备选仓向第d个用户节点提供物料时首单出库成本，
    Figure PCTCN2021135852-appb-100020
    为所述第五路径变量，表示第j l-1个备选仓是否经过其他备选仓向第d个用户节点提供物料，
    Figure PCTCN2021135852-appb-100021
    为所述第三路径变量，表示第j l个备选仓是否向第d个用户节点提供物料，
    Figure PCTCN2021135852-appb-100022
    表示第j l个备选仓向第d个用户节点的提供物料的订单数量，
    Figure PCTCN2021135852-appb-100023
    第j l个备选仓向第d个用户节点提物料时的续件 出库成本，
    Figure PCTCN2021135852-appb-100024
    表示第j l个备选仓向第d个用户节点提供物料的总件数，ρ d表示调节系数，
    Figure PCTCN2021135852-appb-100025
    表示第j l个备选仓向第d个用户节点提供物料时的单位体积出库成本，
    Figure PCTCN2021135852-appb-100026
    表示第j l个备选仓向第d个用户节点提供物料时的单件出库成本；
    其中，根据第六公式计算配送成本，所述第六公式具体包括：
    Figure PCTCN2021135852-appb-100027
    Figure PCTCN2021135852-appb-100028
    表示第j l个备选仓向第d个用户节点提供物料时首单配送成本，
    Figure PCTCN2021135852-appb-100029
    表示第j l个备选仓向第d个用户节点提供物料时续重配送成本，
    Figure PCTCN2021135852-appb-100030
    表示第j l个备选仓向第d个用户节点提供物料的总重量；
    其中，根据第七公式计算配送时效，所述第七公式具体包括：
    Figure PCTCN2021135852-appb-100031
    Figure PCTCN2021135852-appb-100032
    表示第j l个备选仓向第d个用户节点提供物料时的输送实效参数。
  11. 根据权利要求10所述的方法，其特征在于：
    根据第八公式计算调拨成本，所述第八公式具体包括：
    Figure PCTCN2021135852-appb-100033
    其中，
    Figure PCTCN2021135852-appb-100034
    表示第o个货源地节点向第i 1个备选仓调货的单件调拨成本，
    Figure PCTCN2021135852-appb-100035
    表示第i 1个备选仓向第j 1个备选仓调货的单件调拨成本，
    Figure PCTCN2021135852-appb-100036
    表示第j 1个备选仓向第i 2个备选仓调货的单件调拨成本,
    Figure PCTCN2021135852-appb-100037
    表示第j l个备选仓向第d个用户节点调货的单件调拨成本；
    或者
    根据第九公式计算调拨成本，所述第九公式具体包括：
    Figure PCTCN2021135852-appb-100038
    或者
    根据第十公式计算调拨成本，所述第十公式具体包括：
    Figure PCTCN2021135852-appb-100039
    其中，B表示质量和体积之间的调整系数。
  12. 根据权利要求2至5中任意一项所述的方法，其特征在于：所述第一约束具体包括：
    Figure PCTCN2021135852-appb-100040
    所述第二约束具体包括：
    Figure PCTCN2021135852-appb-100041
    其中，D＝{1，2，…m}；
    所述第三约束具体包括：
    Figure PCTCN2021135852-appb-100042
    Figure PCTCN2021135852-appb-100043
    Figure PCTCN2021135852-appb-100044
    Figure PCTCN2021135852-appb-100045
    Figure PCTCN2021135852-appb-100046
    Figure PCTCN2021135852-appb-100047
    其中，I＝{1，2，…l}，i u表示i的u个取值，j u表示j的u个取值，1≤u≤l；
    所述第四约束具体包括：
    Figure PCTCN2021135852-appb-100048
    N min表示备选仓的最小数量，N max表示备选仓的最大数量；
    所述第五约束具体包括：
    Figure PCTCN2021135852-appb-100049
    Figure PCTCN2021135852-appb-100050
    为第j l个备选仓向第d个用户节点提供物料的配送时效，β表示最小实效概率。
  13. 一种服务器，其特征在于，包括：存储器，处理器；
    存储器；用于存储所述处理器可执行指令的存储器；
    其中，所述处理器被配置为实现如权利要求1至12中任一项所述的物料输送方法。
  14. 一种物料输送系统，其特征在于，包括输送设备和如权利要求13所示的服务器。
  15. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质中存储有计算机执行指令，所述计算机执行指令被处理器执行时用于实现如 权利要求1至12中任一项所述的物料输送方法。
  16. 一种计算机程序产品，包括指令，其特征在于，该指令被处理器执行时实现权利要求1至12中任一项所述的物料输送方法。
PCT/CN2021/135852 2021-01-21 2021-12-06 物料输送方法、设备、系统以及存储介质 WO2022156392A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP21920766.9A EP4156051A4 (en) 2021-01-21 2021-12-06 MATERIAL CONVEYING METHOD, DEVICE AND SYSTEM AND STORAGE MEDIUM
JP2022579961A JP7512447B2 (ja) 2021-01-21 2021-12-06 物品輸送方法、機器、システム及び記憶媒体
US18/044,557 US20230351321A1 (en) 2021-01-21 2021-12-06 Material conveying method, device, system and storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110083056.8A CN113762697B (zh) 2021-01-21 2021-01-21 物料输送方法、设备、系统以及存储介质
CN202110083056.8 2021-01-21

Publications (1)

Publication Number Publication Date
WO2022156392A1 true WO2022156392A1 (zh) 2022-07-28

Family

ID=78786435

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/135852 WO2022156392A1 (zh) 2021-01-21 2021-12-06 物料输送方法、设备、系统以及存储介质

Country Status (5)

Country Link
US (1) US20230351321A1 (zh)
EP (1) EP4156051A4 (zh)
JP (1) JP7512447B2 (zh)
CN (1) CN113762697B (zh)
WO (1) WO2022156392A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116307332A (zh) * 2023-05-16 2023-06-23 武汉大学人民医院（湖北省人民医院） 一种药品实时配送方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106296100A (zh) * 2016-08-19 2017-01-04 河南易之信网络科技有限公司 一种跨境物流业务的管理方法、装置及系统
US20180349850A1 (en) * 2017-05-30 2018-12-06 Hitachi, Ltd. Transport Plan Generating Method and Transport Plan Generating System
CN110288167A (zh) * 2019-07-02 2019-09-27 湖南艾瓦特网络科技有限公司 货品配送规划方法、装置、电子设备及可读存储介质
CN110390501A (zh) * 2018-04-18 2019-10-29 北京京东尚科信息技术有限公司 数据处理方法及其系统、计算机系统及计算机可读介质

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000172745A (ja) 1998-12-08 2000-06-23 Taiheiyo Cement Corp 物流計画作成装置
JP2002356232A (ja) 2001-05-31 2002-12-10 Mitsubishi Chemicals Corp 中継点を介する物流の最適化方法
JP3875672B2 (ja) 2003-09-03 2007-01-31 日本通運株式会社 共同配送情報管理システム
KR101015290B1 (ko) * 2004-01-02 2011-02-15 주식회사 케이티 광파장 분할 다중화 기반의 동기식 전송망 설계 방법
JP4954588B2 (ja) 2006-04-05 2012-06-20 良明 水谷 物流費用演算装置及びプログラム
JP5338305B2 (ja) 2008-12-26 2013-11-13 Ｊｆｅスチール株式会社 車両運行計画作成方法及び装置
JP2010269867A (ja) 2009-05-19 2010-12-02 Hitachi Ltd 輸送計画立案支援システム及び輸送計画立案支援方法
US10007889B2 (en) * 2012-12-20 2018-06-26 Oracle International Corporation Finding minimum cost transportation routes for orders through a transportation network
US9786187B1 (en) * 2015-06-09 2017-10-10 Amazon Technologies, Inc. Transportation network utilizing autonomous vehicles for transporting items
WO2020074567A1 (en) * 2018-10-09 2020-04-16 Starship Technologies Oü Method and system for planning item deliveries
JP2020067677A (ja) 2018-10-22 2020-04-30 株式会社オプティマインド 配送管理システム
CN109816147B (zh) * 2018-12-26 2023-01-03 深圳市北斗智能科技有限公司 一种航空货运路由规划方法、装置、设备和存储介质
CN111950950A (zh) * 2019-05-17 2020-11-17 北京京东尚科信息技术有限公司 订单配送路径的规划方法、装置、计算机介质及电子设备
CN111553626A (zh) * 2020-04-09 2020-08-18 北京顺达同行科技有限公司 一种路径规划方法、装置、电子设备及其存储介质

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106296100A (zh) * 2016-08-19 2017-01-04 河南易之信网络科技有限公司 一种跨境物流业务的管理方法、装置及系统
US20180349850A1 (en) * 2017-05-30 2018-12-06 Hitachi, Ltd. Transport Plan Generating Method and Transport Plan Generating System
CN110390501A (zh) * 2018-04-18 2019-10-29 北京京东尚科信息技术有限公司 数据处理方法及其系统、计算机系统及计算机可读介质
CN110288167A (zh) * 2019-07-02 2019-09-27 湖南艾瓦特网络科技有限公司 货品配送规划方法、装置、电子设备及可读存储介质

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4156051A4

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116307332A (zh) * 2023-05-16 2023-06-23 武汉大学人民医院（湖北省人民医院） 一种药品实时配送方法及装置

Also Published As

Publication number Publication date
EP4156051A4 (en) 2024-05-22
EP4156051A1 (en) 2023-03-29
CN113762697B (zh) 2024-01-16
CN113762697A (zh) 2021-12-07
JP2023533683A (ja) 2023-08-04
JP7512447B2 (ja) 2024-07-08
US20230351321A1 (en) 2023-11-02

Similar Documents

Publication Publication Date Title
CN112183852B (zh) 物流配送路线筛选及运费核算方法、系统、终端及介质
CN109978470B (zh) 一种物流信息确定方法、装置、设备及介质
Gao et al. Multi-modal transportation planning for multi-commodity rebalancing under uncertainty in humanitarian logistics
US7904352B2 (en) Method and system for managing material movement and inventory
WO2023005653A1 (zh) 物品分配方法和装置
WO2022156392A1 (zh) 物料输送方法、设备、系统以及存储介质
US20160171440A1 (en) Method and system for freight management
CN113420928A (zh) 订单调度方法、装置、设备及存储介质
Bernal et al. A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows
Belieres et al. A time-expanded network reduction matheuristic for the logistics service network design problem
CN110648096A (zh) 一种配送线路的生成方法和装置
Anderluh et al. Sustainable logistics with cargo bikes—Methods and applications
Jiang et al. Order fulfilment problem with time windows and synchronisation arising in the online retailing
Azadian et al. Service location grouping and pricing in transportation: Application in air cargo
Achamrah et al. A matheuristic for solving inventory sharing problems
Colajanni et al. Centralized supply chain network optimization with UAV-based last mile deliveries
Zheng Solving vehicle routing problem: A big data analytic approach
Tolooie et al. Heuristic approach for optimising reliable supply chain network using drones in last-mile delivery under uncertainty
Razmi et al. Design of distribution network using hub location model with regard to capacity constraint and service level
CN116307320A (zh) 一种物流优化系统及方法
Shuanjun et al. Order fulfillment decision under multiwarehouse collaborative delivery
Hosoda et al. Location, transshipment and routing: An adaptive transportation network integrating long-haul and local vehicle routing
CN109711773B (zh) 一种基于聚类算法的集装箱货物流向流量统计方法
Pakarti et al. Minimizing urban logistics cost using crowd-shipping
Ghorpade et al. A simheuristic algorithm for the stochastic one-commodity pickup and delivery travelling salesman problem

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: 21920766

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2022579961

Country of ref document: JP

Kind code of ref document: A

Ref document number: 2021920766

Country of ref document: EP

Effective date: 20221220

NENP Non-entry into the national phase

Ref country code: DE