A hub site selection and distribution optimization method for a multi-distribution express hub network
A distribution optimization and hub technology, applied in data processing applications, forecasting, logistics, etc., can solve problems such as low efficiency, slow sorting speed, and high cost
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0038] The present invention provides such Figure 1-2 A hub location and distribution optimization method for multi-distribution express hub-and-spoke network is shown, including the express network G= , node set N=H M, there is at least 1 hub on the express delivery path between any two points, and no more than 2 hubs, the nodes on the path can only be 2, 3, 4, any two nodes i, j The express business between N is transported along the path in the network G, and the entire express delivery path can be determined by the matrix to represent, where p ij Indicates the second node on the path from node i to node j, represented by The path L from node i to node j can be derived ij, , and then repeatedly call the recursive formula L ij = / / Lp ij j can;
[0039] Express volume q between nodes ij , i, j=1, 2, ..., n, the node has n k The unit sorting fee for each sorting direction is s k , , section has a fixed fee of f uv , the unit variable cost is c uv , th...
Embodiment 2
[0056] The present invention provides such Figure 1-2 A hub location and distribution optimization method for multi-distribution express hub-and-spoke network is shown, including the express network G= , characterized in that: node set N=H M, there is at least 1 hub on the express delivery path between any two points, and no more than 2 hubs, the nodes on the path can only be 2, 3, 4, any two nodes i, j The express business between N is transported along the path in the network G, and the entire express delivery path can be determined by the matrix to represent, where p ij Indicates the second node on the path from node i to node j, represented by The path L from node i to node j can be derived ij, , and then repeatedly call the recursive formula L ij = / / Lp ij j can;
[0057] Express volume q between nodes ij , i, j=1, 2, ..., n, the node has n k The unit sorting fee for each sorting direction is s k , , section has a fixed fee of f uv , the unit vari...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com