Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
From MaRDI portal
Publication:3211137
DOI10.1287/trsc.24.4.294zbMath0722.90079OpenAlexW2063838679MaRDI QIDQ3211137
Bezalel Gavish, Kemal Altinkemer
Publication date: 1990
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.24.4.294
Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Vehicle routing with split deliveries, Heuristics for unequal weight delivery problems with a fixed error guarantee, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Routing problems: A bibliography, Improved bounds for vehicle routing solutions, Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem, Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing 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, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, A fuzzy-based customer classification method for demand-responsive logistical distribution operations., Routing vehicles to minimize fuel consumption, Topological design of telecommunication networks --- local access design methods, A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations, Capacitated Vehicle Routing with Non-uniform Speeds, On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem, Online Vehicle Routing Problems: A Survey, Analysis of heuristics for the design of tree networks, Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems, Approximation results for min-max path cover problems in vehicle routing, Capacitated Vehicle Routing with Nonuniform Speeds, Approximation algorithms for the load-balanced capacitated vehicle routing problem, Locating Depots for Capacitated Vehicle Routing, A genetic algorithm for service level based vehicle scheduling, Optimization of printed circuit board manufacturing: Integrated modeling and algorithms, Capacitated vehicle routing problem on line with unsplittable demands, A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands, A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line, A heuristic for cumulative vehicle routing using column generation
