A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem

DOI10.1155/2015/165476zbMath1394.90104OpenAlexW2030558180WikidataQ59117447 ScholiaQ59117447MaRDI QIDQ1664832

Xia Li, Wanfeng Liu

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/165476

Mathematics Subject Classification ID

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

Related Items (2)

Large-scale vehicle routing problems: quantum annealing, tunings and results ⋮ Limited memory rank-1 cuts for vehicle routing problems

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid algorithm for a class of vehicle routing problems
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Very large-scale vehicle routing: new test problems, algorithms, and results
• The Truck Dispatching Problem
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems

This page was built for publication: A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem