A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
From MaRDI portal
Publication:5432315
DOI10.1007/978-3-540-72845-0_12zbMath1203.90136MaRDI QIDQ5432315
Eduardo Uchoa, Marcus Poggi de Aragão, Artur Alves Pessoa
Publication date: 2 January 2008
Published in: Experimental Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72845-0_12
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
Related Items
Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types, Industrial aspects and literature survey: fleet composition and routing, An exact solution framework for a broad class of vehicle routing problems, Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems, Vehicle routing with probabilistic capacity constraints, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, An efficient computational method for large scale surgery scheduling problems with chance constraints, A continuous approximation model for the fleet composition problem on the rectangular grid, A unified exact method for solving different classes of vehicle routing problems
