A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
From MaRDI portal
Publication:3394022
DOI10.1057/palgrave.jors.2602500zbMath1168.90659OpenAlexW2054357709MaRDI QIDQ3394022
Publication date: 28 August 2009
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602500
Related Items (7)
A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands ⋮ Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization ⋮ Vehicle routing problems with split deliveries ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads ⋮ Shipper collaboration in forward and reverse logistics
This page was built for publication: A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
