A min-max vehicle routing problem with split delivery and heterogeneous demand
From MaRDI portal
(Redirected from Publication:376008)
Recommendations
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
- Vehicle routing problems with split deliveries
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- Split delivery routing
- Routing a heterogeneous fleet of vehicles
Cites work
- scientific article; zbMATH DE number 192876 (Why is no real title available?)
- scientific article; zbMATH DE number 1324130 (Why is no real title available?)
- scientific article; zbMATH DE number 1175954 (Why is no real title available?)
- scientific article; zbMATH DE number 1749220 (Why is no real title available?)
- scientific article; zbMATH DE number 1749226 (Why is no real title available?)
- scientific article; zbMATH DE number 1795725 (Why is no real title available?)
- A column generation approach to the heterogeneous fleet vehicle routing problem
- A heuristic column generation method for the heterogeneous fleet VRP
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A time-based pheromone approach for the ant system
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Approximation results for min-max path cover problems in vehicle routing
- Approximations for minimum and min-max vehicle routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- New heuristics for the vehicle routing problem
- Routing problems: A bibliography
- Separating capacity constraints in the CVRP using tabu search
- Solution of a min-max vehicle routing problem
- Solving min-max multi-depot vehicle routing problem
- The m-Traveling Salesman Problem with Minmax Objective
- The truck dispatching problem
- The vehicle routing problem
- The vehicle routing problem. Latest advances and new challenges.
Cited in
(10)- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- A hybrid algorithm for the drilling rig routing problem
- A hybrid VND method for the split delivery vehicle routing problem
- Incomplete service and split deliveries in a routing problem with profits
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
- Minisum and maximin aerial surveillance over disjoint rectangles
This page was built for publication: A min-max vehicle routing problem with split delivery and heterogeneous demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q376008)
