Validating vehicle routing zone construction using Monte Carlo simulation
DOI10.1016/J.EJOR.2010.01.045zbMATH Open1188.90025OpenAlexW2001053912MaRDI QIDQ976400FDOQ976400
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
Recommendations
Monte Carlo simulationclustering analysistraveling salesman problempickup and delivery operationsvehicle routing zones
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cites Work
- The traveling salesman problem. A computational study.
- Algorithm AS 136: A K-Means Clustering Algorithm
- A column generation approach to capacitated \(p\)-median problems
- A variable neighborhood search heuristic for periodic routing problems
- Algorithms for a stochastic selective travelling salesperson problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- Fast Approximation Methods for Sales Force Deployment
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A new heuristic for the period traveling salesman problem
- The capacitated centred clustering problem
- Title not available (Why is that?)
- Genetic clustering algorithms.
- A hybrid scatter search for the probabilistic traveling salesman problem
Cited In (3)
Uses Software
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)