Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
From MaRDI portal
Recommendations
- Path relinking for the vehicle routing problem
- Distance measures and fitness-distance analysis for the capacitated vehicle routing problem
- GRASP with path-relinking for the TSP
- Heuristic procedures for the capacitated vehicle routing problem
- A hybrid bat algorithm with path relinking for capacitated vehicle routing problem
Cites work
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A path relinking approach for the team orienteering problem
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Exact algorithms for routing problems under vehicle capacity constraints
- Fundamentals of scatter search and path relinking
- Probabilistic diversification and intensification in local search for vehicle routing
- The String-to-String Correction Problem
- Variable neighborhood search
Cited in
(3)
This page was built for publication: Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336737)