Electric cargo bicycle’s last-mile simultaneous pickup and delivery routing problem with load-dependent travel time
LUO Hongyuan1,2, LI Yanhui1,2, LU Xinyuan1,2, MEI Shufan1,2
1.School of Information Management， Central China Normal University， Wuhan 430079， China；2.E-commerce Research Center of Hubei Province， Central China Normal University， Wuhan 430079， China
Abstract：Electric cargo bicycles play a crucial role in the last mile delivery activity. However， few studies have discussed the relationship between the speed of electric cargo bicycles and their load when studying issues related to last-mile delivery. This paper investigates the electric cargo bicycles last-mile simultaneous pickup and delivery problem of with load-dependent travel time （PDPLDTT）， where the travel speed depends on the road slope and the load of the electric cargo bicycle. In order to solve the PDPLDTT， this study first developed a mixed-integer linear programming （MILP） model is proposed， and small-scale instances of the MILP model are solved by the commercial solver CPLEX； Then， an improved hybrid ant colony optimization （HACO） algorithm was proposed to solve large-scale instances of this problem； Finally， the solution results of HACO algorithm and other benchmark algorithms were compared and analyzed. The results show that the proposed MILP model and HACO algorithm in this paper can effectively solve the electric cargo bicycles last-mile simultaneous pickup and delivery problem with load-dependent travel time， and can provide reasonable decision-making suggestions for relevant enterprises to solve the last-mile pick and delivery problem.
2025, Vol. 59 
