Dynamic community partitioning for e-commerce last mile delivery with time window constraints
From MaRDI portal
Publication:6068725
DOI10.1016/J.COR.2023.106394MaRDI QIDQ6068725
Eric K. H. Leung, Yiji Cai, Zhiyuan Ouyang, George Q. Huang
Publication date: 13 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
logisticstime window constraintslast mile deliverybusiness to customer e-commercedynamic community partitioning problem
Cites Work
- Unnamed Item
- Perspectives of approximate dynamic programming
- A survey on two-echelon routing problems
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- Model-based capacitated clustering with posterior regularization
- Heuristic methods for the sectoring arc routing problem
- Operational estimators for the length of a traveling salesman tour
- Visual attractiveness in routing problems: a review
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
- A dynamic vehicle routing problem with multiple delivery routes
- A concise guide to existing and emerging vehicle routing problem variants
- A review of dynamic vehicle routing problems
- Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance
- Dividing a Territory Among Several Vehicles
- Robust Partitioning for Stochastic Multivehicle Routing
- REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- Exact Algorithms for the Clustered Vehicle Routing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery
This page was built for publication: Dynamic community partitioning for e-commerce last mile delivery with time window constraints
