An algorithm for the capacitated vehicle routing problem with route balancing
DOI10.1007/s10100-008-0062-2zbMath1179.90030OpenAlexW2005605234MaRDI QIDQ1022391
Publication date: 22 June 2009
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-008-0062-2
multi-objective optimizationcombinatorial optimizationevolutionary algorithmCVRPexplicit collective memory
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- The vehicle routing problem: An overview of exact and approximate algorithms
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- A multi-objective evolutionary algorithm with a separate archive
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- Parallel Processing and Applied Mathematics
- Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization
- Advances in Neural Networks – ISNN 2005
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
This page was built for publication: An algorithm for the capacitated vehicle routing problem with route balancing