Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem

DOI10.1016/j.cor.2013.02.005zbMath1348.90130OpenAlexW2037635921MaRDI QIDQ336737

Patrick Schittekat, Kenneth 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

zbMATH Keywords

GRASPstatistical analysispath relinkingedit distancecapacitated vehicle routing problemrelocate distance

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Research trends in combinatorial optimization, The Vehicle Routing Problem with Release and Due Dates

Uses Software

• VRP
• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• Exact algorithms for routing problems under vehicle capacity constraints
• A path relinking approach for the team orienteering problem
• Variable neighborhood search
• Probabilistic diversification and intensification in local search for vehicle routing
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• The String-to-String Correction Problem