Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
type: Item
instance of: scholarly article
title: Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
zbMATH Open document ID: 1390.90074
author: Rahma Lahyani
author: Leandro C. Coelho
author: Jacques Renaud
published in: OR Spectrum
publication date: 2018-03-02T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6846213
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: multi-depot
zbMATH Keywords: heterogeneous fleet
zbMATH Keywords: formulation
zbMATH Keywords: mathematical model
zbMATH Keywords: exact solution
describes a project that uses: Concorde
describes a project that uses: CVRPSP
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s00291-017-0494-y
OpenAlex ID: W2767827514
Wikidata QID: Q91635834
cites work: Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
cites work: Industrial aspects and literature survey: Combined inventory management and routing
cites work: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
cites work: A unified exact method for solving different classes of vehicle routing problems
cites work: Routing a Heterogeneous Fleet of Vehicles
cites work: Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
cites work: Polyhedral results for a vehicle routing problem
cites work: A branch and bound algorithm for the multiple depot vehicle scheduling problem
cites work: A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
cites work: The exact solution of several classes of inventory-routing problems
cites work: Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
cites work: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
cites work: An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
cites work: Polyhedral study of the capacitated vehicle routing problem
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Vehicle routing with compartments: applications, modelling and heuristics
cites work: Applications of linear programming in the oil industry
cites work: The Covering Tour Problem
cites work: A comparison of techniques for solving the fleet size and mix vehicle routing problem
cites work: Combined route capacity and route length models for unit demand vehicle routing problems
cites work: Implementing vehicle routing algorithms
cites work: The fleet size and mix vehicle routing problem
cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
cites work: A result on projection for the vehicle routing problem
cites work: Polynomial-time separation of enhanced reverse multistar inequalities
cites work: Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
cites work: Modeling and solving a logging camp location problem
cites work: A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
cites work: The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
cites work: Thirty years of heterogeneous vehicle routing
cites work: Rich vehicle routing problems: from a taxonomy to a definition
cites work: An improved formulation for the multi-depot open vehicle routing problem
cites work: Generalized Subtour Elimination Constraints and Connectivity Constraints
cites work: Q5184698
cites work: Q3751354
cites work: Projection results for vehicle routing
cites work: Multistars, partial multistars and the capacitated vehicle routing problem
cites work: A hybrid genetic algorithm for the multi-depot open vehicle routing problem
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Q4532225
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
cites work: A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: A general heuristic for vehicle routing problems
cites work: A survey of recent research on location-routing problems
cites work: Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm
cites work: Using cost change estimates in a local search heuristic for the pollution routing problem
cites work: Incorporating vehicle into the vehicle routing fleet composition problem
cites work: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
cites work: The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
cites work: Improving Discrete Model Representations via Symmetry Considerations
cites work: The vehicle routing problem
cites work: Vehicle Routing

Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (cites work)
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems

Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (cites work)
cites work: Implicit depot assignments and rotations in vehicle routing heuristics

Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (cites work)
cites work: Formulations and valid inequalities for the heterogeneous vehicle routing problem

Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (DOI)
DOI: 10.1007/S00291-017-0494-Y