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

DOI10.1007/S10878-016-0028-6zbMATH Open1376.90053OpenAlexW2392146085MaRDI QIDQ2012880FDOQ2012880

Authors: Liang Song, Hao Gu, H.-J. Huang 

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

Recommendations

• Lower and upper bounds for the two-echelon capacitated location-routing problem
• An exact algorithm for the two-echelon capacitated vehicle routing problem
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• New valid inequalities for the two-echelon capacitated vehicle routing problem

zbMATH Keywords

Lagrangian relaxationmodern logisticsadaptive two-echelon capacitated vehicle routing problem

Mathematics Subject Classification ID

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

Cites Work

• The truck dispatching problem
• New route relaxation and pricing strategies for the vehicle routing problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• A unified exact method for solving different classes of vehicle routing problems
• An approximation algorithm for the capacitated arc routing problem
• Title not available (Why is that?)
• State-space relaxation procedures for the computation of bounds to routing problems
• An exact algorithm for the two-echelon capacitated vehicle routing problem
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
• Multi-depot vehicle routing problem with time windows under shared depot resources

Cited In (3)

• A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles
• Lower and upper bounds for the two-echelon capacitated location-routing problem
• Two-echelon vehicle routing problems: a literature review

Uses Software

• CPLEX
• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012880)