Loading [MathJax]/extensions/MathMenu.js
Two-Echelon Dispatching Problem With Mobile Satellites in City Logistics | IEEE Journals & Magazine | IEEE Xplore

Two-Echelon Dispatching Problem With Mobile Satellites in City Logistics


Abstract:

At present, city logistics mostly adopts a two-echelon dispatching model which combines distribution centers located in suburbs and fixed satellites located in urban area...Show More

Abstract:

At present, city logistics mostly adopts a two-echelon dispatching model which combines distribution centers located in suburbs and fixed satellites located in urban areas for distribution. However, both expensive rental fees and daily changes of customer demand in metropolitan areas make dispatching route generated by fixed satellites inefficient. Moreover, the existing mobile depot model needs a large investment for facilities. In this paper, we propose a two-echelon city dispatching model with mobile satellites (2ECD-MS) which locations of mobile satellites change according to demands of customers to ensure the efficiency of delivery routes in every day. A cluster-based variable neighborhood search scheduling algorithm is proposed to determine locations of mobile satellites and dispatching routes of trucks and tricycles. Then, the 2ECD-MS is extended to 2ECD-MS-TDD to allow trucks dispatching directly (TDD) for further cost reduction. Experimental results show that the 2ECD-MS significantly reduces the total cost against the model using fixed satellites mode by 3.5% while the 2ECD-MS-TDD further reduces the total cost against the 2ECD-MS significantly by 3.25% in 54 cases with different customer scales, geographical scopes, and distribution types. These show the superiority of the proposed methods in cost reduction for city logistics in comparison to the traditional fixed model.
Published in: IEEE Transactions on Intelligent Transportation Systems ( Volume: 23, Issue: 1, January 2022)
Page(s): 84 - 96
Date of Publication: 30 June 2020

ISSN Information:

Funding Agency:

References is not available for this document.

I. Introduction

The primary purpose of city logistics [1] is to transport goods in urban areas in an efficient way, taking into account traffic congestion, safety, and environments. With the rapid development of e-commerce and the increasing demand of consumers for the speed of delivery, city logistics faces enormous challenges. Major logistics companies have changed their urban warehousing and distribution strategies to meet the growing demand for distribution better. At present, a two-echelon distribution system is the most commonly used system for urban distribution by logistics enterprises such as JD.com and SF-express. The two-echelon distribution system [2] uses different types of vehicles on various echelons and satellites to consolidate and transship parcels. In the two-echelon dispatching, parcels 1) are loaded on the truck of the first-echelon transportation; 2) arrive the satellite located in the urban area; 3) are delivered to customers by the second-echelon distribution vehicles.

Select All
1.
M. Savelsbergh and T. V. Woensel, "City logistics: Challenges and opportunities", Transp. Sci., vol. 50, pp. 579-590, May 2016.
2.
R. Cuda, G. Guastaroba and M. G. Speranza, "A survey on two-echelon routing problems", Comput. Oper. Res., vol. 55, pp. 185-199, Mar. 2015.
3.
Z. He and H.-D. Haasis, "Integration of urban freight innovations: Sustainable inner-urban intermodal transportation in the retail/postal industry", Sustainability, vol. 11, no. 6, pp. 1749, Mar. 2019.
4.
D. Z. Yu, S. Y. Tang and J. Niederhoff, "On the benefits of operational flexibility in a distribution network with transshipment", Omega, vol. 39, no. 3, pp. 350-361, Jun. 2011.
5.
C. Prodhon and C. Prins, "A survey of recent research on location-routing problems", Eur. J. Oper. Res., vol. 238, no. 1, pp. 1-17, 2014.
6.
M. Schiffer, M. Schneider, G. Walther and G. Laporte, "Vehicle routing and location routing with intermediate stops: A review", Transp. Sci., vol. 53, no. 2, pp. 319-343, Mar. 2019.
7.
M. Drexl and M. Schneider, "A survey of variants and extensions of the location-routing problem", Eur. J. Oper. Res., vol. 241, no. 2, pp. 283-308, Mar. 2015.
8.
L. Zhou, Y. Lin, X. Wang and F. Zhou, "Model and algorithm for bilevel multisized terminal location-routing problem for the last mile delivery", Int. Trans. Oper. Res., vol. 26, no. 1, pp. 131-156, Jan. 2019.
9.
Z. Dai, F. Aqlan, K. Gao and Y. Zhou, "A two-phase method for multi-echelon location-routing problems in supply chains", Expert Syst. Appl., vol. 115, pp. 618-634, Jan. 2019.
10.
Y. Wang et al., "Two-echelon logistics delivery and pickup network optimization based on integrated cooperation and transportation fleet sharing", Expert Syst. Appl., vol. 113, pp. 44-65, Dec. 2018.
11.
Y. Wang, K. Assogba, Y. Liu, X. Ma, M. Xu and Y. Wang, "Two-echelon location-routing optimization with time windows based on customer clustering", Expert Syst. Appl., vol. 104, pp. 244-260, Aug. 2018.
12.
T. Liu, Z. Luo, H. Qin and A. Lim, "A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints", Eur. J. Oper. Res., vol. 266, no. 2, pp. 487-497, Apr. 2018.
13.
H. Li, Y. Liu, X. Jian and Y. Lu, "The two-echelon distribution system considering the real-time transshipment capacity varying", Transp. Res. B Methodol., vol. 110, pp. 239-260, Apr. 2018.
14.
H. Li, Y. Liu, K. Chen and Q. Lin, "The two-echelon city logistics system with on-street satellites", Comput. Ind. Eng., vol. 139, Jan. 2020.
15.
K. Pichka, A. H. Bajgiran, M. E. H. Petering, J. Jang and X. Yue, "The two echelon open location routing problem: Mathematical model and hybrid heuristic", Comput. Ind. Eng., vol. 121, pp. 97-112, Jul. 2018.
16.
N. Boysen, S. Schwerdfeger and F. Weidinger, "Scheduling last-mile deliveries with truck-based autonomous robots", Eur. J. Oper. Res., vol. 271, no. 3, pp. 1085-1099, Dec. 2018.
17.
Q. Zhao, W. Wang and R. De Souza, "A heterogeneous fleet two-echelon capacitated location-routing model for joint delivery arising in city logistics", Int. J. Prod. Res., vol. 56, no. 15, pp. 5062-5080, Aug. 2018.
18.
K. Govindan, A. Jafarian, R. Khodaverdi and K. Devika, "Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food", Int. J. Prod. Econ., vol. 152, pp. 9-28, Jun. 2014.
19.
K. Wang, Y. Shao and W. Zhou, "Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service", Transp. Res. D Transp. Environ., vol. 57, pp. 262-276, Dec. 2017.
20.
P. Grangier, M. Gendreau, F. Lehuédé and L.-M. Rousseau, "An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization", Eur. J. Oper. Res., vol. 254, no. 1, pp. 80-91, Oct. 2016.
21.
O. Guemri, P. Nduwayo, R. Todosijević, S. Hanafi and F. Glover, "Probabilistic tabu search for the cross-docking assignment problem", Eur. J. Oper. Res., vol. 277, no. 3, pp. 875-885, Sep. 2019.
22.
I. Küçükoǧlu, R. Dewil and D. Cattrysse, "Hybrid simulated annealing and tabu search method for the electric travelling salesman problem with time windows and mixed charging rates", Expert Syst. Appl., vol. 134, pp. 279-303, Nov. 2019.
23.
S. Chen, R. Chen, G.-G. Wang, J. Gao and A. K. Sangaiah, "An adaptive large neighborhood search heuristic for dynamic vehicle routing problems", Comput. Electr. Eng., vol. 67, pp. 596-607, Apr. 2018.
24.
E. Pekel and S. Soner Kara, "Solving fuzzy capacitated location routing problem using hybrid variable neighborhood search and evolutionary local search", Appl. Soft Comput., vol. 83, Oct. 2019.
25.
S.-C. Huang, J.-J. Lin and M.-K. Jiau, "Global and local Pareto optimality in coevolution for solving carpool service problem with time windows", IEEE Trans. Intell. Transp. Syst., vol. 21, no. 3, pp. 934-946, Mar. 2020.
26.
Y.-H. Zhang, Y.-J. Gong, W.-N. Chen, T.-L. Gu, H.-Q. Yuan and J. Zhang, "A dual-colony ant algorithm for the receiving and shipping door assignments in cross-docks", IEEE Trans. Intell. Transp. Syst., vol. 20, no. 7, pp. 2523-2539, Jul. 2019.
27.
J. Chen and J. Shi, "A multi-compartment vehicle routing problem with time windows for urban distribution—A comparison study on particle swarm optimization algorithms", Comput. Ind. Eng., vol. 133, pp. 95-106, Jul. 2019.
28.
V. P. Nguyen, C. Prins and C. Prodhon, "A multi-start evolutionary local search for the two-echelon location routing problem", Proc. 7th Int. Workshop Hybrid Metaheuristics (HM), pp. 88-102, 2010.
29.
V.-P. Nguyen, C. Prins and C. Prodhon, "Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking", Eur. J. Oper. Res., vol. 216, no. 1, pp. 113-126, Jan. 2012.
30.
V. M. Dalfard, M. Kaveh and N. E. Nosratian, "Two meta-heuristic algorithms for two-echelon location-routing problem with vehicle fleet capacity and maximum route length constraints", Neural Comput. Appl., vol. 23, no. 7, pp. 2341-2349, Dec. 2013.

Contact IEEE to Subscribe

References

References is not available for this document.