Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm

DOI10.1016/J.COR.2014.07.004MaRDI QIDQ337247zbMATH OpenOpenAlexFDO

Authors Alireza Rahimi-Vahed, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei

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

zbMATH Keywords

fleet-sizingmodular heuristic algorithmmulti-depot periodic vehicle routing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Recommendations

• The fleet size and mix vehicle routing problem
• A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
• Simple heuristics for the multi-period fleet size and mix vehicle routing problem
• A new heuristic for determining fleet size and composition
• A heuristic algorithm for the multi-depot periodic vehicle routing problem

Cites work

• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
• A modular algorithm for an extended vehicle scheduling problem
• A multi-depot period vehicle routing problem arising in the utilities sector
• A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
• A multiphase approach to the period routing problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A tabu search heuristic for the multi-depot vehicle routing problem
• A unified tabu search heuristic for vehicle routing problems with time windows
• A variable neighborhood search heuristic for periodic routing problems
• An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem
• An asynchronous parallel metaheuristic for the period vehicle routing problem
• Implementing vehicle routing algorithms
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
• The period routing problem
• The truck dispatching problem
• The vehicle routing problem
• Using experimental design to find effective parameter settings for heuristics

Cited in

(9)

• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
• Forty years of periodic vehicle routing
• Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
• The flexible periodic vehicle routing problem
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19
• 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
• A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337247)