Locating depots for capacitated vehicle routing

DOI10.1007/978-3-642-22935-0_20MaRDI QIDQ3088097zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Inge Li Gørtz, Viswanath Nagarajan

Publication date 17 August 2011

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027.42/133597

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Recommendations

• Locating depots for capacitated vehicle routing
• Primal-dual schema and Lagrangian relaxation for the \(k\)-location-routing problem
• Minimizing latency of capacitated \(k\)-tours
• Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
• Algorithms and Data Structures

Cites work

• A constant-factor approximation algorithm for the \(k\)-median problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Bounds and Heuristics for Capacitated Routing Problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combined location-routing problems: A synthesis and future research directions
• Facility Location with Matroid or Knapsack Constraints
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Local Search Heuristics for k-Median and Facility Location Problems
• Locating depots for capacitated vehicle routing
• Location-routing: issues, models and methods
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• The vehicle routing problem
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems

Cited in

(10)

• Airports and railways: facility location meets network design
• Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles
• Locating depots for capacitated vehicle routing
• scientific article; zbMATH DE number 970559 (Why is no real title available?)
• Approximation results for a min-max location-routing problem
• Allocation of Resources to Depots
• Locating depots for capacitated vehicle routing
• The effect of ignoring routes when locating depots
• Primal-dual schema and Lagrangian relaxation for the \(k\)-location-routing problem
• scientific article; zbMATH DE number 1264480 (Why is no real title available?)

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Locating depots for capacitated vehicle routing

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