Achieving better solutions for vehicle routing problem involving split deliveries and pickups using a competitive decision algorithm

zbMATH Open1325.90013MaRDI QIDQ2948889FDOQ2948889

Authors: Wang Kefeng, Ye Chunming, Ning Aibing 

Publication date: 6 October 2015

Recommendations

• A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
• scientific article; zbMATH DE number 591242
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• Vehicle routing problems with split deliveries

zbMATH Keywords

vehicle routingreverse logisticsbackhaulscompetitive decision algorithmsplit delivery and pickup

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Transportation, logistics and supply chain management (90B06)

Cited In (6)

• New exact solution approaches for the split delivery vehicle routing problem
• Optimization of vehicle routes with delivery and pickup for a rental business: a case study
• A hybrid VND method for the split delivery vehicle routing problem
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
• A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups

This page was built for publication: Achieving better solutions for vehicle routing problem involving split deliveries and pickups using a competitive decision algorithm

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