A lower bound for the adaptive two-echelon capacitated vehicle routing problem

DOI10.1007/s10878-016-0028-6zbMath1376.90053OpenAlexW2392146085MaRDI QIDQ2012880

Hejiao Huang, Liang Song, Hao Gu

Publication date: 3 August 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0028-6

zbMATH Keywords

Lagrangian relaxationmodern logisticsadaptive two-echelon capacitated vehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (1)

Two-echelon vehicle routing problems: a literature review

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
• A unified exact method for solving different classes of vehicle routing problems
• The Truck Dispatching Problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• An Approximation Algorithm for the Capacitated Arc Routing Problem
• State-space relaxation procedures for the computation of bounds to routing problems
• An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
• Multi-depot vehicle routing problem with time windows under shared depot resources

This page was built for publication: A lower bound for the adaptive two-echelon capacitated vehicle routing problem