Validating vehicle routing zone construction using Monte Carlo simulation
From MaRDI portal
Recommendations
Cites work
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- A column generation approach to capacitated p-median problems
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A hybrid scatter search for the probabilistic traveling salesman problem
- A new heuristic for the period traveling salesman problem
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A variable neighborhood search heuristic for periodic routing problems
- Algorithm AS 136: A K-Means Clustering Algorithm
- Algorithms for a stochastic selective travelling salesperson problem
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- Fast Approximation Methods for Sales Force Deployment
- Genetic clustering algorithms.
- scientific article; zbMATH DE number 1488153 (Why is no real title available?)
- The capacitated centred clustering problem
- The traveling salesman problem. A computational study.
Cited in
(4)- A real delivery problem dealt with Monte Carlo techniques
- Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system
- Large-scale pickup and delivery work area design
- Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning
This page was built for publication: Validating vehicle routing zone construction using Monte Carlo simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976400)