A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem

DOI10.1016/j.ejor.2019.07.015zbMath1487.90083OpenAlexW2960360341WikidataQ127527991 ScholiaQ127527991MaRDI QIDQ2029263

Marco Casazza, Alberto Ceselli, Roberto Wolfler Calvo

Publication date: 3 June 2021

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.07.015

zbMATH Keywords

branch-and-priceroutingbike sharingroute decompositionsplit pickup split delivery

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items

Adapting the \textit{ng}-path relaxation for bike balancing problems, Heterogeneous instant delivery orders scheduling and routing problem, Freshness-driven vehicle routing problem: modeling and application to the fresh agricultural product pick-storage-transportation, Scheduling heterogeneous delivery tasks on a mixed logistics platform

Uses Software

• SCIP
• CPLEX
• VRPSolver

Cites Work

• Mathematical programming algorithms for bin packing problems with item fragmentation
• SCIP: solving constraint integer programs
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
• Shared mobility systems
• The static bike relocation problem with multiple vehicles and visits
• Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
• A generic exact solver for Vehicle Routing and related problems
• Bike sharing systems: solving the static rebalancing problem
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Split delivery routing
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows