Dividing a Territory Among Several Vehicles
From MaRDI portal
Publication:2815468
DOI10.1287/ijoc.1110.0479zbMath1460.90028OpenAlexW1985617197MaRDI QIDQ2815468
Publication date: 29 June 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1cf9d8cea98ef22f76af50ab84811ea5d3df6225
Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Shadow prices in territory division ⋮ Geometric partitioning and robust ad-hoc network design ⋮ A continuous approximation model for the fleet composition problem on the rectangular grid ⋮ Towards a stochastic programming modeling framework for districting ⋮ A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility ⋮ The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization ⋮ Dynamic design of sales territories ⋮ Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm ⋮ Technical note: the expected length of an orderly path ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ A sample approximation solution procedure for chance-constrained districting problems ⋮ Dynamic community partitioning for e-commerce last mile delivery with time window constraints ⋮ Continuous approximation models in freight distribution management ⋮ Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery ⋮ Approximation schemes for districting problems with probabilistic constraints ⋮ Territorial design for customers with demand frequency ⋮ Wasserstein Distance and the Distributionally Robust TSP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum-cost load-balancing partitions
- Designing delivery districts for the vehicle routing problem with stochastic demands
- Geodesic ham-sandwich cuts
- Optimal location with equitable loads
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- Triangulating a simple polygon in linear time
- Semi on-line algorithms for the partition problem
- Generalizing ham sandwich cuts to equitable subdivisions
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- The equitable location problem on the plane
- Equitable subdivisions within polygonal regions
- Finding equitable convex partitions of points in a polygon efficiently
- Covering continuous demand in the plane
- A statistical approach to the tsp
- Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
