Dividing a territory among several vehicles
From MaRDI portal
Publication:2815468
DOI10.1287/IJOC.1110.0479zbMATH Open1460.90028OpenAlexW1985617197MaRDI QIDQ2815468FDOQ2815468
Authors: John Gunnar Carlsson 
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
Recommendations
Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Optimal location with equitable loads
- Equitable subdivisions within polygonal regions
- Solving min-max multi-depot vehicle routing problem
- Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
- Minimum-cost load-balancing partitions
- Designing delivery districts for the vehicle routing problem with stochastic demands
- Triangulating a simple polygon in linear time
- The equitable location problem on the plane
- Title not available (Why is that?)
- 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
- Covering continuous demand in the plane
- Semi on-line algorithms for the partition problem
- Geodesic ham-sandwich cuts
- Generalizing ham sandwich cuts to equitable subdivisions
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- Finding equitable convex partitions of points in a polygon efficiently
- A statistical approach to the tsp
Cited In (21)
- Towards a stochastic programming modeling framework for districting
- Geometric partitioning and robust ad-hoc network design
- Robust partitioning for stochastic multivehicle routing
- A continuous approximation model for the fleet composition problem on the rectangular grid
- A new approach for vehicle routing with stochastic demand: combining route assignment with process flexibility
- Minimum-cost load-balancing partitions
- Continuous approximation models in freight distribution management
- Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning
- Wasserstein distance and the distributionally robust TSP
- 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
- On the expected length of an orderly path
- Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery
- Technical note: the expected length of an orderly path
- Dynamic design of sales territories
- Territorial design for customers with demand frequency
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- Approximation schemes for districting problems with probabilistic constraints
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
- Shadow prices in territory division
Uses Software
This page was built for publication: Dividing a territory among several vehicles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815468)
