Distance-based adaptive large neighborhood search algorithm for green-PDPTW
From MaRDI portal
Publication:2039686
Recommendations
- A simulated annealing heuristic for the capacitated green vehicle routing problem
- A way to optimally solve a green time-dependent vehicle routing problem with time windows
- An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
- The location routing problem using electric vehicles with constrained distance
- A Green Vehicle Routing Problem with Multi-Depot, Multi-Tour, Heterogeneous Fleet and Split Deliveries: a mathematical model and heuristic approach
Cites work
- A genetic algorithm for a green vehicle routing problem
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Optimization by simulated annealing
- The truck dispatching problem
- The vehicle routing problem
This page was built for publication: Distance-based adaptive large neighborhood search algorithm for green-PDPTW
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039686)