An exact method for a last-mile delivery routing problem with multiple deliverymen

Cites Work

A new branch-and-cut algorithm for the capacitated vehicle routing problem
Introduction to algorithms.
Partitioning procedures for solving mixed-variables programming problems
Solution of a Large-Scale Traveling-Salesman Problem
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
Logic-based Benders decomposition
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
Designing a multi-modal and variable-echelon delivery system for last-mile logistics
Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review
A tailored Benders decomposition approach for last-mile delivery with autonomous robots
The multi-vehicle truck-and-robot routing problem for last-mile delivery
Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery
Small and large neighborhood search for the park-and-loop routing problem with parking selection

This page was built for publication: An exact method for a last-mile delivery routing problem with multiple deliverymen

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