Distance approximation to support customer selection in vehicle routing problems
From MaRDI portal
Cites work
- A decomposition approach to the inventory routing problem with satellite facilities
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- Heuristics for the multi-period orienteering problem with multiple time windows
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- Inventory routing problems: a logistical overview
- Medical waste collection considering transportation and storage risk
- Models to estimate average route lengths in different geographical environments
- Operational estimators for the length of a traveling salesman tour
- Regularization and Variable Selection Via the Elastic Net
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem
- Scikit-learn: machine learning in Python
- The Elements of Statistical Learning
- The flexible periodic vehicle routing problem
- Total distance approximations for routing solutions
- Vehicle routing with split deliveries
- What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
This page was built for publication: Distance approximation to support customer selection in vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949440)
