Performances improvement of the column generation algorithm: application to vehicle routing problems

DOI10.1007/s10288-010-0117-9zbMath1198.90340OpenAlexW2026346750MaRDI QIDQ989834

Nora Touati Moungla

Publication date: 23 August 2010

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-010-0117-9

zbMATH Keywords

dynamic programmingcolumn generationDantzig-Wolfe decompositionLagrangian decompositiondiversificationvehicle routing problem with time windowsreoptimization

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Combinatorial optimization (90C27) Dynamic programming (90C39) Decomposition methods (49M27)

Related Items (1)

Hybrid column generation for large-size covering integer programs: application to transportation planning

Cites Work

• A unified heuristic for a large class of vehicle routing problems with backhauls
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• A reoptimization algorithm for the shortest path problem with time windows
• Nodal aggregation of resource constraints in a shortest path problem
• Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• Column Generation

This page was built for publication: Performances improvement of the column generation algorithm: application to vehicle routing problems