Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem

DOI10.1007/s11590-012-0568-3zbMath1274.90238OpenAlexW1991582041MaRDI QIDQ375997

Geraldo Robson Mateus, Fernando Afonso Santos, Alexandre Salles da Cunha

Publication date: 1 November 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0568-3

zbMATH Keywords

branch-and-pricetwo-echelon systemsVehicle Routing Problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (9)

An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization ⋮ A large neighbourhood based heuristic for two-echelon routing problems ⋮ Fractional Fourier, Hartley, cosine and sine number-theoretic transforms based on matrix functions ⋮ Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery ⋮ An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization ⋮ The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology ⋮ A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach ⋮ Two-echelon vehicle routing problem with satellite bi-synchronization ⋮ Two-echelon vehicle routing problems: a literature review

Uses Software

• EVE-OPT
• OR-Library
• VRP
• Scatter Search

Cites Work

• A Brunn-Minkowski inequality for the Monge-Ampère eigenvalue
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
• Variable neighborhood search
• On the capacitated vehicle routing problem
• Greedy randomized adaptive search procedures
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
• A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

This page was built for publication: Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem