The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results

DOI10.1002/NET.20181MaRDI QIDQ5295488zbMATH OpenOpenAlexFDO

Authors Si Chen, Bruce Golden, Edward Wasil

Publication date 30 July 2007

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20181

zbMATH Keywords

heuristicsinteger programmingvehicle routing problem

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• The split delivery vehicle routing problem: A survey
• An overview on the split delivery vehicle routing problem
• A novel approach to solve the split delivery vehicle routing problem
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• New exact solution approaches for the split delivery vehicle routing problem
• Improved lower bounds for the split delivery vehicle routing problem
• A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
• A hybrid VND method for the split delivery vehicle routing problem
• The split delivery vehicle scheduling problem with time windows and grid network distances
• A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts

Cites work

• Mixed binary integer programming formulations for the reentrant job shop scheduling problem
• Split delivery routing

Cited in

(45)

• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• Robust optimisation approach for vehicle routing problems with uncertainty
• scientific article; zbMATH DE number 591242 (Why is no real title available?)
• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
• The vehicle routing problem with transfers
• An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows
• Tour splitting algorithms for vehicle routing problems
• New exact solution approaches for the split delivery vehicle routing problem
• Vehicle routing problems with split deliveries
• A branch-and-cut embedded matheuristic for the inventory routing problem
• Split-delivery routeing heuristics in livestock feed distribution
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• A hierarchical solution approach for a multicommodity distribution problem under a special cost structure
• A new vehicle routing problem and its two stage algorithm
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• The split delivery vehicle routing problem: A survey
• A ring-based diversification scheme for routing problems
• A hybrid VND method for the split delivery vehicle routing problem
• A column generation approach for the split delivery vehicle routing problem
• Incomplete service and split deliveries in a routing problem with profits
• An adaptive memory algorithm for the split delivery vehicle routing problem
• Improved lower bounds for the split delivery vehicle routing problem
• A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• An iterated local search heuristic for the split delivery vehicle routing problem
• Testing local search move operators on the vehicle routing problem with split deliveries and time windows
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows
• The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
• Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
• Particle swarm optimization for split delivery vehicle routing problem
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• Exact methods for the split delivery vehicle routing problem with two-dimensional loading constraints
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
• Model and algorithm for split delivery vehicle routing problem with stochastic customers
• Tabu search algorithm for the discrete split delivery vehicle routing problem
• A novel approach to solve the split delivery vehicle routing problem
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• Integer linear programming models for a cement delivery problem
• Large scale stochastic inventory routing problems with~split delivery and service level constraints
• A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes
• A survey on matheuristics for routing problems

This page was built for publication: The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results

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