A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem

DOI10.1007/978-3-540-72845-0_12zbMath1203.90136OpenAlexW1636301013MaRDI 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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (10)

A continuous approximation model for the fleet composition problem on the rectangular grid ⋮ Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems ⋮ Vehicle routing with probabilistic capacity constraints ⋮ A unified exact method for solving different classes of vehicle routing problems ⋮ 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 ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ An exact solution framework for a broad class of vehicle routing problems ⋮ Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types

This page was built for publication: A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem