Testing local search move operators on the vehicle routing problem with split deliveries and time windows
From MaRDI portal
Publication:337460
DOI10.1016/j.cor.2014.11.007zbMath1348.90627OpenAlexW2072128752MaRDI QIDQ337460
Marcus E. McNabb, Jeffery D. Weir, Raymond R. Hill, Shane N. Hall
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.11.007
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Extreme-point and pivoting methods (90C49)
Related Items
A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ What makes a VRP solution good? The generation of problem-specific knowledge for heuristics ⋮ Particle Swarm Optimization for Split Delivery Vehicle Routing Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- An adaptive memory algorithm for the split delivery vehicle routing problem
- An empirical study on the benefit of split loads with the pickup and delivery problem
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- The split delivery vehicle scheduling problem with time windows and grid network distances
- An improved ant colony optimization for vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A Multiple Comparison Procedure for Comparing Several Treatments with a Control
- What you should know about the vehicle routing problem
- Savings by Split Delivery Routing
- Vehicle routing problems with split deliveries
