Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery

DOI10.1016/J.EJOR.2022.08.029MaRDI QIDQ6106970zbMATH OpenFDO

Authors Zhiyuan Ouyang, Eric K. H. Leung, George Q. Huang

Publication date 3 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2022.08.029

zbMATH Keywords

business to customer e-commercecommunity logisticsdynamic community partitioning problemlast mile deliverylogistics

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Provably Good Region Partitioning for On-Time Last-Mile Delivery
• Vehicle routing with private and shared delivery locations
• Designing a multi-modal and variable-echelon delivery system for last-mile logistics
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
• Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels

Cites work

• 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 fast two-level variable neighborhood search for the clustered vehicle routing problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A review of dynamic vehicle routing problems
• A survey on two-echelon routing problems
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Dividing a territory among several vehicles
• Efficiently solving very large-scale routing problems
• Exact algorithms for the clustered vehicle routing problem
• Exact solution of the soft-clustered vehicle-routing problem
• Heuristic methods for the sectoring arc routing problem
• Large multiple neighborhood search for the clustered vehicle-routing problem
• Model-based capacitated clustering with posterior regularization
• Operational estimators for the length of a traveling salesman tour
• Optimization of non-linear multiple traveling salesman problem using \(k\)-means clustering, shrink wrap algorithm and meta-heuristics
• Real-life vehicle routing with time windows for visual attractiveness and operational robustness
• Robust partitioning for stochastic multivehicle routing
• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
• The traveling salesman problem: An overview of exact and approximate algorithms
• Visual attractiveness in routing problems: a review
• Waste collection vehicle routing problem with time windows

Cited in

(6)

• Dynamic community partitioning for e-commerce last mile delivery with time window constraints
• Provably Good Region Partitioning for On-Time Last-Mile Delivery
• An exact method for a last-mile delivery routing problem with multiple deliverymen
• The first mile is the hardest: a deep learning-assisted matheuristic for container assignment in first-mile logistics
• Optimizing delivery systems within the e-retail context: a weighted self-organizing map for delivery region partitioning
• Collaborative delivery problem of trucks and multiple drones: an en-route operation with flexible launch positions

This page was built for publication: Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106970)