Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
From MaRDI portal
Publication:1694814
DOI10.1016/j.ejor.2017.05.039zbMath1380.90050OpenAlexW2617983775MaRDI QIDQ1694814
Valeria Leggieri, Mohamed Haouari
Publication date: 6 February 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.05.039
transportationreformulation-linearization techniquecapacitated vehicle routing problemcompact formulationsheterogeneous VRP
Related Items
Tight lower bounds for the traveling salesman problem with draft limits ⋮ The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time ⋮ Instance generation framework for green vehicle routing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Thirty years of heterogeneous vehicle routing
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- A survey of dual-feasible and superadditive functions
- Polyhedral study of the capacitated vehicle routing problem
- A column generation approach to the heterogeneous fleet vehicle routing problem
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- The vehicle routing problem. Latest advances and new challenges.
- Combined route capacity and route length models for unit demand vehicle routing problems
- The fleet size and mix vehicle routing problem
- A result on projection for the vehicle routing problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- On the capacitated vehicle routing problem
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A unified exact method for solving different classes of vehicle routing problems
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Projection results for vehicle routing
- The Truck Dispatching Problem
- Vehicle Routing
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Integer Programming Formulation of Traveling Salesman Problems
- Routing a Heterogeneous Fleet of Vehicles
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Optimal Routing under Capacity and Distance Restrictions
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
