Bounds and Heuristics for Capacitated Routing Problems
From MaRDI portal
Publication:3705193
DOI10.1287/moor.10.4.527zbMath0582.90030OpenAlexW2155735286MaRDI QIDQ3705193
M. Haimovich, Alexander H. G. Rinnooy Kan
Publication date: 1985
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.10.4.527
Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Related Items
Differential approximation algorithm of FSMVRP, A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Planning and approximation models for delivery route based services with price-sensitive demands, On the complexity of the \(k\)-customer vehicle routing problem, The general multi-retailer EOQ problem with vehicle routing costs, The split delivery vehicle scheduling problem with time windows and grid network distances, Heuristics for unequal weight delivery problems with a fixed error guarantee, A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Incorporating inventory and routing costs in strategic location models, Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem, On properties of geometric random problems in the plane, Routing problems: A bibliography, Approximation schemes for Euclidean vehicle routing problems with time windows, Improved bounds for vehicle routing solutions, Improved approximations for capacitated vehicle routing with unsplittable client demands, A note on asymptotic formulae for one-dimensional network flow problems, 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, Submodularity and the traveling salesman problem, The school bus problem on trees, Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces, A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW, Improved approximation algorithms for cumulative VRP with stochastic demands, The bin packing problem with item fragmentation: a worst-case analysis, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, Probabilistic combinatorial optimization problems on graphs: A new domain in operational research, Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows, A PTAS for Capacitated Vehicle Routing on Trees, Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension, Iterated tour partitioning for Euclidean capacitated vehicle routing, Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem, Household-Level Economies of Scale in Transportation, Minimizing the maximum flow time in the online food delivery problem, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, Approximation algorithms with constant factors for a series of asymmetric routing problems, Unnamed Item, Wasserstein Distance and the Distributionally Robust TSP, Routing vehicles to minimize fuel consumption, Topological design of telecommunication networks --- local access design methods, The dynamic-demand joint replenishment problem with approximated transportation costs, A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing, Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension, Minimizing customers' waiting time in a vehicle routing problem with unit demands, Capacitated Vehicle Routing with Non-uniform Speeds, On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem, Approximation Schemes for Capacitated Geometric Network Design, Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension, Online Vehicle Routing Problems: A Survey, Approximation algorithms for a vehicle routing problem, Worst-case demand distributions in vehicle routing, Probabilistic analysis of a capactiated vehicle routing problem—I, An approximation algorithm for the traveling tournament problem, Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Approximation algorithms for some vehicle routing problems, The directed orienteering problem, Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route, Unnamed Item, Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s), New differential approximation algorithm for \(k\)-customer vehicle routing problem, The EMS vehicle patient transportation problem during a demand surge, Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems, Hybrid metaheuristics for the vehicle routing problem with stochastic demands, Minimizing latency of capacitated \(k\)-tours, Approximating \(k\)-forest with resource augmentation: a primal-dual approach, Approximation Algorithms for Cumulative VRP with Stochastic Demands, Approximation results for min-max path cover problems in vehicle routing, Capacitated Vehicle Routing with Nonuniform Speeds, PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k, Improving the approximation ratio for capacitated vehicle routing, Approximation algorithms for the load-balanced capacitated vehicle routing problem, Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters, Efficient approximation of the metric CVRP in spaces of fixed doubling dimension, Improving the approximation ratio for capacitated vehicle routing, Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension, Locating Depots for Capacitated Vehicle Routing, Last-Mile Shared Delivery: A Discrete Sequential Packing Approach, A genetic algorithm for service level based vehicle scheduling, Direct shipping and the dynamic single-depot/multi-retailer inventory system, Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand, A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs, 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, Approximation Schemes for Capacitated Geometric Network Design, Topological design of ring networks, A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering, A heuristic for cumulative vehicle routing using column generation
