A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
From MaRDI portal
Publication:1754109
DOI10.1016/j.ejor.2017.10.017zbMath1403.90641OpenAlexW2766487300MaRDI QIDQ1754109
Tian Liu, Hu Qin, Andrew E. B. Lim, Zhi-Xing Luo
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.10.017
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items (6)
A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ Two-echelon vehicle routing problem with satellite bi-synchronization ⋮ Van-based robot hybrid pickup and delivery routing problem ⋮ Two-echelon vehicle routing problems: a literature review ⋮ An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints ⋮ A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout
Uses Software
Cites Work
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- A survey on two-echelon routing problems
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- A branch and bound algorithm for the capacitated vehicle routing problem
- Model and algorithm for inventory/routing decision in a three-echelon logistics system
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Multistars, partial multistars and the capacitated vehicle routing problem
- On the capacitated vehicle routing problem
- Separating capacity constraints in the CVRP using tabu search
- The electric location routing problem with time windows and partial recharging
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Separation algorithms for 0-1 knapsack polytopes
- The Truck Dispatching Problem
- An Exact Method for the Capacitated Location-Routing Problem
- Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
- Vehicle Routing
- Integer Programming
- Integer Programming Formulation of Traveling Salesman Problems
- Facets of the knapsack polytope
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
This page was built for publication: A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
