Heuristic and exact algorithms for a min-max selective vehicle routing problem

DOI10.1016/j.cor.2010.10.010zbMath1205.90059MaRDI QIDQ622161

Alexandre Salles da Cunha, Geraldo Robson Mateus, Leonardo Conegundes Martinez, Cristiano Arbex Valle

Publication date: 31 January 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.010

zbMATH Keywords

heuristics; vehicle routing problem; branch-and-cut; local branching

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Uses Software

• CPLEX
• VRP