A min-max vehicle routing problem with split delivery and heterogeneous demand
From MaRDI portal
Publication:376008
DOI10.1007/S11590-012-0571-8zbMATH Open1280.90017OpenAlexW2021604865MaRDI QIDQ376008FDOQ376008
Authors: Ertan Yakıcı, Orhan Karasakal 
Publication date: 1 November 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0571-8
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
Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- The truck dispatching problem
- The vehicle routing problem
- Title not available (Why is that?)
- The vehicle routing problem. Latest advances and new challenges.
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- Solving min-max multi-depot vehicle routing problem
- Title not available (Why is that?)
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Routing problems: A bibliography
- Separating capacity constraints in the CVRP using tabu search
- Title not available (Why is that?)
- A column generation approach to the heterogeneous fleet vehicle routing problem
- Solution of a min-max vehicle routing problem
- A heuristic column generation method for the heterogeneous fleet VRP
- New heuristics for the vehicle routing problem
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
- A time-based pheromone approach for the ant system
- Approximation results for min-max path cover problems in vehicle routing
- Approximations for minimum and min-max vehicle routing problems
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Title not available (Why is that?)
- Title not available (Why is that?)
- The m-Traveling Salesman Problem with Minmax Objective
Cited In (10)
- 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
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
Uses Software
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)
