A simulated annealing heuristic for the capacitated green vehicle routing problem
From MaRDI portal
Publication:2298198
Recommendations
- A meta-heuristic for capacitated green vehicle routing problem
- A Green Vehicle Routing Problem with Multi-Depot, Multi-Tour, Heterogeneous Fleet and Split Deliveries: a mathematical model and heuristic approach
- A way to optimally solve a green time-dependent vehicle routing problem with time windows
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges
- A genetic algorithm for a green vehicle routing problem
Cites work
- A guide to vehicle routing heuristics
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- Energy Minimizing Vehicle Routing Problem
- Equation of state calculations by fast computing machines
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Optimization by simulated annealing
- The vehicle routing problem
Cited in
(6)- Improvement heuristics for the vehicle routing problem based on simulated annealing
- A meta-heuristic for capacitated green vehicle routing problem
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges
- A way to optimally solve a green time-dependent vehicle routing problem with time windows
- Distance-based adaptive large neighborhood search algorithm for green-PDPTW
- A theoretical and computational study of green vehicle routing problems
This page was built for publication: A simulated annealing heuristic for the capacitated green vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298198)