Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
From MaRDI portal
Publication:1703462
DOI10.1007/s00291-017-0494-yzbMath1390.90074OpenAlexW2767827514WikidataQ91635834 ScholiaQ91635834MaRDI QIDQ1703462
Jacques Renaud, Leandro C. Coelho, Rahma Lahyani
Publication date: 2 March 2018
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-017-0494-y
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (5)
A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem ⋮ Decision support for the technician routing and scheduling problem ⋮ Flexible two-echelon location routing problem ⋮ The two-echelon production-routing problem ⋮ Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of recent research on location-routing problems
- Rich vehicle routing problems: from a taxonomy to a definition
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
- Thirty years of heterogeneous vehicle routing
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
- Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm
- The exact solution of several classes of inventory-routing problems
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
- Vehicle routing with compartments: applications, modelling and heuristics
- Polyhedral study of the capacitated vehicle routing problem
- Modeling and solving a logging camp location problem
- A comparison of techniques for solving the fleet size and mix vehicle routing problem
- A general heuristic for vehicle routing problems
- 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
- Polyhedral results for a vehicle routing problem
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- Multistars, partial multistars and the capacitated vehicle routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Industrial aspects and literature survey: Combined inventory management and routing
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Using cost change estimates in a local search heuristic for the pollution routing problem
- Incorporating vehicle into the vehicle routing fleet composition problem
- A unified exact method for solving different classes of vehicle routing problems
- Polynomial-time separation of enhanced reverse multistar inequalities
- A hybrid genetic algorithm for the multi-depot open vehicle routing problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- Implicit depot assignments and rotations in vehicle routing heuristics
- Projection results for vehicle routing
- The Vehicle Routing Problem
- Applications of Linear Programming in the Oil Industry
- Vehicle Routing
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- Improving Discrete Model Representations via Symmetry Considerations
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Routing a Heterogeneous Fleet of Vehicles
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Generalized Subtour Elimination Constraints and Connectivity Constraints
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Implementing vehicle routing algorithms
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
- The Covering Tour Problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
- Solution of a Large-Scale Traveling-Salesman Problem
- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
- An improved formulation for the multi-depot open vehicle routing problem
This page was built for publication: Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
