Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
DOI10.1016/J.COR.2013.02.005zbMATH Open1348.90130OpenAlexW2037635921MaRDI QIDQ336737FDOQ336737
Authors: Patrick Schittekat, K. Sörensen 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.005
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
edit distancepath relinkingGRASPcapacitated vehicle routing problemrelocate distancestatistical analysis
Approximation methods and heuristics in mathematical programming (90C59) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Variable neighborhood search
- Fundamentals of scatter search and path relinking
- The String-to-String Correction Problem
- Exact algorithms for routing problems under vehicle capacity constraints
- Probabilistic diversification and intensification in local search for vehicle routing
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A path relinking approach for the team orienteering problem
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Cited In (3)
Uses Software
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)
