Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm

DOI10.1057/PALGRAVE.JORS.2602502MaRDI QIDQ3612220zbMATH OpenOpenAlexFDO

Authors Javier Faulin, Alejandro García del Valle

Publication date 3 March 2009

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

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

zbMATH Keywords

distributionheuristicslogisticstransportvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A variable neighborhood search algorithm for the capacitated vehicle routing problem
• A new hybrid genetic algorithm for the capacitated vehicle routing problem
• Optimised crossover genetic algorithm for capacitated vehicle routing problem
• A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm
• scientific article; zbMATH DE number 2013520

Cited in

(5)

• An algorithm for the capacitated vehicle routing problem with route balancing
• A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm
• The transiently chaotic neutral network optimization algorithm for capacity vehicle routing problem
• The ALGACEA‐1 method for the capacitated vehicle routing problem
• Advances in Neural Networks – ISNN 2005

This page was built for publication: Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm

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