The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
DOI10.1016/j.cor.2013.05.011zbMath1348.90123OpenAlexW2048088042MaRDI QIDQ337237
Arif Imran, Niaz A. Wassan, Said Salhi
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.05.011
variable neighborhood searchdistribution networkheterogeneous vehiclesILP formulationmulti-depot vehicle routing
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (25)
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- A general heuristic for vehicle routing problems
- Variable neighbourhood search: methods and applications
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- Variable neighborhood search
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- A tabu search heuristic for the multi-depot vehicle routing problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST
- Solving school bus routing problems through integer programming
- The Multi-Depot Routing Allocation Problem
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Implementing vehicle routing algorithms
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Tabu search variants for the mix fleet vehicle routing problem
- New assignment algorithms for the multi-depot vehicle routing problem
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A heuristic for vehicle fleet mix problem using tabu search and set partitioning
- Computer Solutions of the Traveling Salesman Problem
- An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem
This page was built for publication: The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation