Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
From MaRDI portal
Recommendations
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- scientific article; zbMATH DE number 4066603
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
- The traveling salesman problem with delivery and backhauls
- scientific article; zbMATH DE number 3918121
Cited in
(37)- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Topological design of telecommunication networks --- local access design methods
- Analysis of heuristics for the design of tree networks
- A genetic algorithm for service level based vehicle scheduling
- Vehicle routing with split deliveries
- A fuzzy-based customer classification method for demand-responsive logistical distribution operations.
- Optimization of printed circuit board manufacturing: Integrated modeling and algorithms
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- Routing problems: A bibliography
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Capacitated vehicle routing problem on line with unsplittable demands
- A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line
- A heuristic for cumulative vehicle routing using column generation
- Routing vehicles to minimize fuel consumption
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
- Capacitated vehicle routing with nonuniform speeds
- Capacitated vehicle routing with non-uniform speeds
- Approximation results for min-max path cover problems in vehicle routing
- Locating depots for capacitated vehicle routing
- Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
- Online Vehicle Routing Problems: A Survey
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
- A PTAS for Capacitated Vehicle Routing on Trees
- Iterated tour partitioning for Euclidean capacitated vehicle routing
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
- Minimizing the maximum flow time in the online food delivery problem
- Improved approximation algorithms for multidepot capacitated vehicle routing
- Improved approximations for the capacitated vehicle routing problem with fixed capacity
- Multidepot capacitated vehicle routing with improved approximation guarantees
- Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- Improved bounds for vehicle routing solutions
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations
This page was built for publication: Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211137)
