Formulations and valid inequalities for the heterogeneous vehicle routing problem
From MaRDI portal
Publication:2490341
DOI10.1007/s10107-005-0611-6zbMath1134.90527OpenAlexW2061119272MaRDI QIDQ2490341
Publication date: 2 May 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/23786
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem ⋮ Thirty years of heterogeneous vehicle routing ⋮ The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems ⋮ The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches ⋮ A unified exact method for solving different classes of vehicle routing problems ⋮ Vehicle routing for milk collection with gradual blending: a case arising in Chile ⋮ The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach ⋮ A hybrid algorithm for the heterogeneous fleet vehicle routing problem ⋮ Lifting for the integer knapsack cover polyhedron ⋮ Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems ⋮ The capacitated family traveling salesperson problem ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem ⋮ Routing a Heterogeneous Fleet of Vehicles ⋮ Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems ⋮ Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem ⋮ Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? ⋮ Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments ⋮ A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty
Uses Software
Cites Work
- Unnamed Item
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Classification of travelling salesman problem formulations
- The fleet size and mix vehicle routing problem
- A result on projection for the vehicle routing problem
- An analytical comparison of different formulations of the travelling salesman problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- Multistars, partial multistars and the capacitated vehicle routing problem
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Routing problems: A bibliography
- A new heuristic for the fleet size and mix vehicle routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Incorporating vehicle into the vehicle routing fleet composition problem
- Projection results for vehicle routing
- Integer Programming Formulation of Traveling Salesman Problems
- The Integer Knapsack Cover Polyhedron
- A new heuristic for determining fleet size and composition
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- A heuristic column generation method for the heterogeneous fleet VRP
- Tabu search variants for the mix fleet vehicle routing problem
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
