The fresh food e-commerce cold chain logistics site selection problem is vital for optimizing distribution by identifying ideal warehouse locations and redeployment strategies to enhance efficiency and product freshness. This paper categorizes fresh fruit into domestic and imported types, aiming to minimize logistics costs while meeting timeliness constraints through integer programming. The solution involves improved K-Medoids to determine warehouse locations and Simulated Annealing to allocate city shops, fruit types, and quantities to each warehouse, creating an effective logistics transfer program.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Optimization of Fresh E-Commerce Warehouse Layout Based on 0-1 Integer Programming 1

  • Zichen Yang,
  • Min Wang,
  • Junchang Li

摘要

The fresh food e-commerce cold chain logistics site selection problem is vital for optimizing distribution by identifying ideal warehouse locations and redeployment strategies to enhance efficiency and product freshness. This paper categorizes fresh fruit into domestic and imported types, aiming to minimize logistics costs while meeting timeliness constraints through integer programming. The solution involves improved K-Medoids to determine warehouse locations and Simulated Annealing to allocate city shops, fruit types, and quantities to each warehouse, creating an effective logistics transfer program.