scientific article; zbMATH DE number 6686756

MaRDI QIDQ2960840zbMATH OpenFDO

Authors Eva Volna, Martin Kotyrba

Publication date 17 February 2017

Full work available at URL http://jnaiam.org/exit.php?url_id=192&entry_id=123

zbMATH Keywords

Clarke and Wright heuristiccombinatoricsgenetic algorithmsweep algorithmTaillard's algorithmVRP-vehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Heuristics for large constrained vehicle routing problems
• New heuristics for the vehicle routing problem
• A general heuristic for vehicle routing problems
• Heuristic approaches for the robust vehicle routing problem
• A practical heuristic for a large scale vehicle routing problem
• scientific article; zbMATH DE number 4066603
• scientific article; zbMATH DE number 2209651
• Vehicle routing problem with uncertain travelling time and a heuristic algorithm
• scientific article; zbMATH DE number 1795725
• Heuristic procedures for the capacitated vehicle routing problem

Cited in

(6)

• A study on the effect of the asymmetry on real capacitated vehicle routing problems
• Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers
• Guidelines for the computational testing of machine learning approaches to vehicle routing problems
• Selection of Vehicle Routing Heuristic Using Neural Networks
• Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits
• A library of local search heuristics for the vehicle routing problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2960840)