The Meal Delivery Routing Problem in E-commerce Platforms under the Shared Logistics Mode

The meal delivery routing problem faced by the e-commerce platform is challenging. In order to reduce the logistics cost and meet the needs of customers, a multi-objective meal delivery routing problem is studied under the shared logistics services mode (SLSM). In the meal delivery problem, the third-party logistics providers need to arrange vehicles in the multi-depot to pick up meals from multiple food providers and deliver them to customers, so as to realize the sharing of logistics services between food providers and compare them with the traditional logistics service mode (TLSM). While realizing sharing, it is also necessary to meet customer time requirements as much as possible. In this case, a multi-objective mathematical model to minimize customer dissatisfaction and delivery cost is established, and the linear weighting method is employed to transform the model. An improved Ant Lion Optimizer (IALO) is proposed to solve the problem, and compared with other algorithms. The experiments verified the effectiveness of the proposed algorithm and show that SLSM can save logistics costs and meet customer needs more than TLSM, and provide certain reference opinions for the e-commerce platform.

[1]  Weidong Chen,et al.  4PL routing problem using hybrid beetle swarm optimization , 2023, Soft Computing - A Fusion of Foundations, Methodologies and Applications.

[2]  Dorota Książkiewicz,et al.  Shared Logistics—Literature Review , 2023, Applied Sciences.

[3]  Joseph Y. J. Chow,et al.  Dial-a-ride problem with modular platooning and en-route transfers , 2022, Transportation Research Part C: Emerging Technologies.

[4]  Mingyao Qi,et al.  Optimality-guaranteed algorithms on the dynamic shared-taxi problem , 2022, Transportation Research Part E: Logistics and Transportation Review.

[5]  Yun Wang,et al.  The One E-Ticket Customized Bus Service Mode for Passengers with Multiple Trips and the Routing Problem , 2022, Sustainability.

[6]  M. Forbes,et al.  A column generation and Combinatorial Benders Decomposition algorithm for the Selective Dial-A-Ride-Problem , 2021, Comput. Oper. Res..

[7]  Heng Wen,et al.  Colony search optimization algorithm using global optimization , 2021, The Journal of Supercomputing.

[8]  Hualing Bi,et al.  A bilevel whale optimization algorithm for risk management scheduling of information technology projects considering outsourcing , 2021, Knowl. Based Syst..

[9]  Joseph Y. J. Chow,et al.  The pickup and delivery problem with synchronized en-route transfers for microtransit planning , 2021, Transportation Research Part E: Logistics and Transportation Review.

[10]  Hualing Bi,et al.  The Fourth-Party Logistics Routing Problem Using Ant Colony System-Improved Grey Wolf Optimization , 2020, Journal of Advanced Transportation.

[11]  José Brandão,et al.  A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem , 2020, Eur. J. Oper. Res..

[12]  Panos M. Pardalos,et al.  Discrete firefly algorithm with compound neighborhoods for asymmetric multi-depot vehicle routing problem in the maintenance of farm machinery , 2019, Appl. Soft Comput..

[13]  Zheng Wang,et al.  Delivering meals for multiple suppliers: Exclusive or sharing logistics service , 2018, Transportation Research Part E: Logistics and Transportation Review.

[14]  Harish Kumar,et al.  Modeling of solar cell under different conditions by Ant Lion Optimizer with LambertW function , 2018, Appl. Soft Comput..

[15]  T. Revathi,et al.  Improved Cluster Based Data Gathering Using Ant Lion Optimization in Wireless Sensor Networks , 2018, Wirel. Pers. Commun..

[16]  Jitendriya Kumar Satapathy,et al.  Development of an Enhanced Ant Lion Optimization Algorithm and its Application in Antenna Array Synthesis , 2017, Appl. Soft Comput..

[17]  Yong Wang,et al.  Profit distribution in collaborative multiple centers vehicle routing problem , 2017 .

[18]  Xuesong Zhou,et al.  Finding Optimal Solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A Dynamic Programming Approach Based on State-space-time Network Representations , 2015, ArXiv.

[19]  Seyed Mohammad Mirjalili,et al.  The Ant Lion Optimizer , 2015, Adv. Eng. Softw..

[20]  Xiao Liu,et al.  Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration , 2010, Comput. Oper. Res..

[21]  Jiuh-Biing Sheu,et al.  An emergency logistics distribution approach for quick response to urgent relief demand in disasters , 2007 .

[22]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[23]  A. Nickkar,et al.  Developing an optimal algorithm for demand responsive feeder transit service accommodating temporary stops , 2022, Journal of Public Transportation.

[24]  Fuqiang Lu,et al.  A hybrid metaheuristic algorithm for the multi-objective location-routing problem in the early post-disaster stage , 2022, Journal of Industrial and Management Optimization.

[25]  Philipp Hungerländer,et al.  Improving Sharing Rates of a Dial-a-Ride Problem implemented for an Austrian Mobility Provider , 2021 .

[26]  Yin Zh,et al.  Study on the Hierarchical Model for Multi-depot Logistic Vehicle Scheduling Problem , 2014 .