scientific article; zbMATH DE number 4066603

MaRDI QIDQ3799801zbMATH OpenFDO

Authors M. Haimovich, Alexander H. G. Rinnooy Kan, L. Stougie

Publication date 1988

zbMATH Keywords

capacitated vehicle routingcommon depotheuristicOptimal Tour Partitioningprobabilistic analysistraveling salesmanvehicles of limited capacityworst-case

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
• On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
• Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
• Bounds and Heuristics for Capacitated Routing Problems

Cited in

(36)

• Heuristics for unequal weight delivery problems with a fixed error guarantee
• A genetic algorithm for service level based vehicle scheduling
• Probabilistic analysis of a capacitated vehicle routing problem. II
• Expected part delays as a secondary layout criterion in automated manufacturing systems
• Heuristic procedures for the capacitated vehicle routing problem
• Approximation algorithms for some vehicle routing problems
• On the complexity of the \(k\)-customer vehicle routing problem
• On properties of geometric random problems in the plane
• Routing problems: A bibliography
• Approximation algorithms for the load-balanced capacitated vehicle routing problem
• Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
• On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
• A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
• Differential approximation algorithm of FSMVRP
• Dividing a territory among several vehicles
• Robust partitioning for stochastic multivehicle routing
• scientific article; zbMATH DE number 6686756 (Why is no real title available?)
• Heuristics for vehicle routing on tree-like networks
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Real-time optimal time-critical target assignment for UAVs
• On the Distance Constrained Vehicle Routing Problem
• Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
• A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
• Probabilistic Analysis of a Combined Aggregation and Math Programming Heuristic for a General Class of Vehicle Routing and Scheduling Problems
• scientific article; zbMATH DE number 1082107 (Why is no real title available?)
• Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
• Development and implementation of algorithms for vehicle routing during a no-notice evacuation
• Probabilistic analysis of a routing problem
• Bounds for the general capacitated routing problem
• Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
• A Class of Euclidean Routing Problems with General Route Cost Functions
• Iterated tour partitioning for Euclidean capacitated vehicle routing
• Min-max tree covers of graphs.
• Improved bounds for vehicle routing solutions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799801)