Tour splitting algorithms for vehicle routing problems
From MaRDI portal
Recommendations
- Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem
- Bounds for the general capacitated routing problem
- A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- Split delivery routing
Cites work
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A cutting plane algorithm for the capacitated arc routing problem
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- A scatter search for the periodic capacitated arc routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Capacitated arc routing problems
- Competitive memetic algorithms for arc routing problems
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Solving capacitated arc routing problems using a transformation to the CVRP
- The fleet size and mix problem for capacitated arc routing
- The fleet size and mix vehicle routing problem
- The vehicle routing problem
Cited in
(25)- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- Implicit depot assignments and rotations in vehicle routing heuristics
- Divide-and-conquer initialization and mutation operators for the large-scale mixed capacitated arc routing problem
- Industrial and tramp ship routing problems: closing the gap for real-scale instances
- Vehicle routing with subtours
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
- The multi‐purpose K‐drones general routing problem
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
- Solving the multi-vehicle multi-covering tour problem
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- The commodity-split multi-compartment capacitated arc routing problem
- A memetic algorithm for the multi trip vehicle routing problem
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
- Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem
- Recent results on arc routing problems: an annotated bibliography
- An effective PSO-inspired algorithm for the team orienteering problem
- Shipper collaboration in forward and reverse logistics
- A TSSP+1 decomposition strategy for the vehicle routing problem
- Splitting a giant tour using integer linear programming
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
This page was built for publication: Tour splitting algorithms for vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114307)
