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

DOI10.1016/J.EJOR.2024.04.007MaRDI QIDQ6572895zbMATH OpenFDO

Authors Fernando Senna, Leandro C. Coelho, Reinaldo Morabito, Pedro Munari

Publication date 16 July 2024

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

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

zbMATH Keywords

benders decompositionbranch-and-cutlast-mile deliverymultiple deliverymenrouting

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

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

Cited in

(1)

• Stochastic autonomous vehicle-assisted two-echelon location-routing problem: a logic-based Benders decomposition approach

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)