Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:5493629
DOI10.1007/0-387-25486-2_4zbMath1246.90036OpenAlexW203988105MaRDI QIDQ5493629
Publication date: 16 October 2006
Published in: Column Generation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-387-25486-2_4
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items
An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework ⋮ Multi-period traffic routing in satellite networks ⋮ Heuristic and exact algorithms for a min-max selective vehicle routing problem ⋮ Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing ⋮ Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach ⋮ A column generation algorithm for the vehicle routing problem with soft time windows ⋮ A survey on matheuristics for routing problems ⋮ The vehicle routing problem with time windows and temporal dependencies
