Validating vehicle routing zone construction using Monte Carlo simulation
From MaRDI portal
Publication:976400
DOI10.1016/j.ejor.2010.01.045zbMath1188.90025OpenAlexW2001053912MaRDI QIDQ976400
Jonathan F. Bard, Ahmad I. Jarrah, Jing Zan
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.045
Monte Carlo simulationtraveling salesman problempickup and delivery operationsclustering analysisvehicle routing zones
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (2)
Large-scale pickup and delivery work area design ⋮ Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A hybrid scatter search for the probabilistic traveling salesman problem
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A column generation approach to capacitated \(p\)-median problems
- A new heuristic for the period traveling salesman problem
- A variable neighborhood search heuristic for periodic routing problems
- The capacitated centred clustering problem
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- Fast Approximation Methods for Sales Force Deployment
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Algorithms for a stochastic selective travelling salesperson problem
- Genetic clustering algorithms.
This page was built for publication: Validating vehicle routing zone construction using Monte Carlo simulation
