A new hybrid genetic algorithm for the capacitated vehicle routing problem

DOI10.1057/palgrave.jors.2601635zbMath1181.90032OpenAlexW2048583876MaRDI QIDQ4661236

Jean Berger, Mohamed Barkaoui

Publication date: 4 April 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601635

zbMATH Keywords

heuristicsvehicle routing problems

Mathematics Subject Classification ID

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

Related Items (9)

Applying the attribute based hill climber heuristic to the vehicle routing problem ⋮ Optimization strategy of credit line management for credit card business ⋮ A general heuristic for vehicle routing problems ⋮ DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic ⋮ Endogenous stochastic optimisation for relief distribution assisted with unmanned aerial vehicles ⋮ Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics ⋮ An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems ⋮ EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem ⋮ Path relinking for the vehicle routing problem

This page was built for publication: A new hybrid genetic algorithm for the capacitated vehicle routing problem