Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm
From MaRDI portal
Publication:337247
DOI10.1016/j.cor.2014.07.004zbMath1348.90118OpenAlexW2028470441MaRDI QIDQ337247
Walter Rei, Michel Gendreau, Alireza Rahimi-Vahed, Teodor Gabriel Crainic
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.2014.07.004
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
The flexible periodic vehicle routing problem, Scatter search for minimizing weighted tardiness in a single machine scheduling with setups, An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems, Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, Payload-based fleet optimization for rail cars in the chemical industry, Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system, Forty years of periodic vehicle routing
Uses Software
Cites Work
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
- A modular algorithm for an extended vehicle scheduling problem
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A tabu search heuristic for the multi-depot vehicle routing problem
- A variable neighborhood search heuristic for periodic routing problems
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- A multi-depot period vehicle routing problem arising in the utilities sector
- The period routing problem
- A multiphase approach to the period routing problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- 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
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem
- Using experimental design to find effective parameter settings for heuristics
