Establishing a Network Planning Model of Urban-Rural Logistics Based on Hub-and-Spoke Network
The demand of urban-rural logistics (URL) has scattered characteristics, which result in difficulty in applying the existing network planning model of URL. A network planning model of URL was established to create a planning scheme that can meet scattered logistics demands. This model is combined wi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Mechanical Engineering in Slavonski Brod, Faculty of Electrical Engineering in Osijek, Faculty of Civil Engineering in Osijek
2019-01-01
|
| Series: | Tehnički Vjesnik |
| Subjects: | |
| Online Access: | https://hrcak.srce.hr/file/329377 |
| Summary: | The demand of urban-rural logistics (URL) has scattered characteristics, which result in difficulty in applying the existing network planning model of URL. A network planning model of URL was established to create a planning scheme that can meet scattered logistics demands. This model is combined with the hub-and-spoke network modeling method, including the hybrid hub-and-spoke network, single-assignment, and hub node quantity constraints. For this model, the minimum total cost was taken as the objective function, whereas the hub node location, assignment relationship, and direct path planning were taken as decision variables. Moreover, the model was solved using the tabu search algorithm. Finally, the model was applied to the network planning example of URL in Nanjing-Zhenjiang-Yangzhou, China. Results indicate that the optimal hub location and quantity, the optimal distribution path, and the most reasonable straight-through route can be determined by the hub-and-spoke network planning model of URL. In addition, the URL network shows the form of two-level hybrid hub-and-spoke with multi hubs and single distribution, in which the scattered demands can be concentrated on a few hub nodes and axes. Findings indicate that the network planning problem of URL under scattered demands can be effectively solved by the new model. |
|---|---|
| ISSN: | 1330-3651 1848-6339 |