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

DOI10.1007/S10878-016-0028-6MaRDI QIDQ2012880zbMATHOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1452992 (Why is no real title available?)
• 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
• An approximation algorithm for the capacitated arc routing problem
• An exact algorithm for the two-echelon capacitated vehicle routing problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
• Multi-depot vehicle routing problem with time windows under shared depot resources
• New route relaxation and pricing strategies for the vehicle routing problem
• State-space relaxation procedures for the computation of bounds to routing problems
• The truck dispatching problem

Cited in

(3)

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

Describes a project that uses

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)